• Publications
  • Influence
Finite Automata and Unary Languages
  • M. Chrobak
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 2 November 1986
Abstract We prove that O(e √ n log n ) states are sufficient to simulate an n -state 1nfa recognizing a unary language by a 1dfa. The lower bound is the same. Similar tight bounds are shown for the
Fast broadcasting and gossiping in radio networks
TLDR
An O(nlog2n) upper bound on the time for deterministic distributed broadcasting in multi-hop radio networks with unknown topology is established and an O( n3/2log 2n) algorithm for gossiping in the same network model is developed.
New results on server problems
TLDR
A fast algorithm for oflline computing of an optimal schedule is given, and it is shown that finding an optimal offline schedule is at least as hard as the assignment problem.
Convex Grid Drawings of 3-Connected Planar Graphs
  • M. Chrobak, G. Kant
  • Mathematics, Computer Science
    Int. J. Comput. Geom. Appl.
  • 1 June 1997
TLDR
A linear-time algorithm is presented which, given an n-vertex 3-connected plane G (with n ≥ 3), finds such a straight-line convex embedding of G into a (n - 2) × (n- 2) grid.
Competitive analysis of randomized paging algorithms
TLDR
It is shown how the concept of work functions, used previously mostly for the analysis of deterministic algorithms, can be applied, in a systematic fashion, to the randomized case and a new, Hk-competitive algorithm for paging is provided.
The Server Problem and On-Line Games
TLDR
The Server Problem 5 and the Work Function Algorithm for k Servers: A Conjectured Outline of the Proof of Optimality are presented.
LRU Is Better than FIFO
TLDR
This paper uses competitive analysis to study the relative performance of the two best known algorithms for paging, LRU and FIFO, and conjectures that the competitive ratio of LRU on each access graph is less than or equal to the competitive ratios of FIFF.
On Some Packing Problem Related to Dynamic Storage Allocation
Etude du probleme de l'empilage de rectangles de hauteur 1 lorsque les abcisses des cotes gauches et droits sont specifies. Dans le cas off-line la solution optimale est en temps polynomial. Dans le
Fast broadcasting and gossiping in radio networks
TLDR
An O(n log/sup 2/n) upper bound on the time for deterministic distributed broadcasting in multi-hop radio networks with unknown topology is established and an O( n/sup 3/2/log/Sup 2/ n) algorithm for gossiping in the same network model is developed.
Probe selection algorithms with applications in the analysis of microbial communities
TLDR
Two efficient heuristics for minimizing the number of oligonucleotide probes needed for analyzing populations of ribosomal RNA gene (rDNA) clones by hybridization experiments on DNA microarrays are proposed, based on well-known optimization techniques simulated annealing and Lagrangian relaxation.
...
1
2
3
4
5
...