AdvOL Student Seminars and Defences
Adrian Burlacu,September 19, 2017, 15:30-16:00, ITB 201
Speaker:   Adrian Burlacu

Title:  Minimized asynchronous scalable domain transactions
 
AdvOL Optimization Seminars
Reza Samavi, September 19, 2017, 16:30-17:30, ITB 201
Speaker:   Reza Samavi
Department of Computing and Software
McMaster University

Title:  Optimizing data utility with privacy constraints
Read more...
 
Fields Institute Industrial Optimization Seminar, June 6, 2017
Speakers:   Yuriy Zinchenko (University of Calgarys)
Pooyan Shirvani (TD Bank)

On the first Tuesday of each month, the Industrial Optimization Seminar is held at the Fields Institute. See the seminar series website for further information.
 
Home arrow Seminars arrow Invited seminars arrow Frantisek Franek, October 22, 2013, 16:30-17:30, ITB 201
Friday, 22 September 2017
 
 
Main Menu
Home
People
Publications
Software
Events
Awards
Photogallery
Internal pages
Latest Theses
File Icon Computational Determination of the Largest Lattice Polytope Diameter
File Icon Computational Framework for the Generalized Berge Sorting Conjecture
File Icon Structural Factorization of Squares in Strings
Latest Reports
Visitors by region
Totals Top 20
 61 % Unknown
 14 % Commercial
 8 % networks
 6 % Canada
 3 % Germany
 2 % China
 2 % Russia
 < 1.0 % Educational
 < 1.0 % Brazil
 < 1.0 % United Kingdom
 < 1.0 % Ukraine
 < 1.0 % Poland
 < 1.0 % 
 < 1.0 % Italy
 < 1.0 % France
 < 1.0 % Netherlands
 < 1.0 % Japan
 < 1.0 % India
 < 1.0 % Australia
 < 1.0 % Organization

Visitors: 5138643
Frantisek Franek, October 22, 2013, 16:30-17:30, ITB 201
Speaker:   Frantisek Franek
Department of Computing and Software
Faculty of Engineering
McMaster University

Title:  How many double squares can a string contain?

Counting the types of squares rather than their occurrences, we consider the problem of bounding the number of distinct squares in a string. Fraenkel and Simpson showed in 1998 that a string of length n contains at most 2n distinct squares. Ilie presented in 2007 an asymptotic upper bound of 2n - Θ(log n). We show that a string of length n contains at most 5n/3 distinct squares. This new upper bound is obtained by investigating the combinatorial structure of double squares and showing that a string of length n contains at most 2n/3 double squares. In addition, the established structural properties provide a novel proof of Fraenkel and Simpson's result.

A joint work with A. Deza and A. Thierry.

 
< Prev   Next >
McMaster University
McMaster University
Faculty of Engineering
Faculty of Engineering
Faculty of Science
Faculty of Science
Computing & Software
Computing & Software
Comput. Eng. & Sci.

School Website >>>


Latest Publications
Publication Downloads
Error cannot find GD extension
 
Top!
Top!