• Publications
  • Influence
Finite Automata and Unary Languages
  • M. Chrobak
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 2 November 1986
TLDR
We prove that O(e √ n log n ) states are sufficient to simulate an n -state 1nfa recognizing a unary language by a 1dfa. Expand
  • 274
  • 30
  • PDF
Fast broadcasting and gossiping in radio networks
TLDR
We establish an O(nlog2n) upper bound on the time for deterministic distributed broadcasting in multi-hop radio networks with unknown topology. Expand
  • 145
  • 18
New results on server problems
TLDR
In the k-server problem, one must choose how k mobile servers will serve each of a sequence of requests, making decisions in an online manner. Expand
  • 258
  • 15
Convex Grid Drawings of 3-Connected Planar Graphs
  • M. Chrobak, G. Kant
  • Mathematics, Computer Science
  • Int. J. Comput. Geom. Appl.
  • 1 June 1997
TLDR
We consider the problem of embedding the vertices of a plane graph into a small (polynomial size) grid in the plane in such a way that the edges are straight, nonintersecting line segments and faces are convex polygons. Expand
  • 133
  • 15
  • PDF
The Server Problem and On-Line Games
TLDR
Convex Hulls are 2-Competitive for 2 Servers and the Work Function Algorithm for k Servers. Expand
  • 94
  • 13
  • PDF
LRU Is Better than FIFO
TLDR
We use competitive analysis to study the relative performance of the two best known algorithms for paging, LRU and FIFO. Expand
  • 89
  • 13
Competitive analysis of randomized paging algorithms
TLDR
We use competitive analysis to study the performance of randomized on-line paging algorithms, and provide a new, Hk-competitive algorithm for paging. Expand
  • 139
  • 12
Fast broadcasting and gossiping in radio networks
TLDR
We establish an O(n log/sup 2/n) upper bound on the time for deterministic distributed broadcasting in multi-hop radio networks with unknown topology. Expand
  • 144
  • 11
  • PDF
On Some Packing Problem Related to Dynamic Storage Allocation
TLDR
Etude du probleme de l'empilage de rectangles de hauteur 1 lorsque les abcisses des cotes gauches et droits sont specifies. Expand
  • 73
  • 11
  • PDF
Probe selection algorithms with applications in the analysis of microbial communities
TLDR
We propose 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. Expand
  • 94
  • 11
  • PDF