Author of the publication

Fault Tolerant Graphs, Perfect Hash Functions and Disjoint Paths

, , , , , , and . FOCS, page 693-702. IEEE Computer Society, (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Ajtai, Miklós
add a person with the name Ajtai, Miklós
 

Other publications of authors with the same name

The influence of large coalitions., and . Combinatorica, 13 (2): 129-145 (1993)On Turáns theorem for sparse graphs., , , and . Combinatorica, 1 (4): 313-317 (1981)Fairness in Scheduling., , , , , and . SODA, page 477-485. ACM/SIAM, (1995)Reachability Is Harder for Directed than for Undirected Finite Graphs (Preliminary Version), and . FOCS, page 358-367. IEEE Computer Society, (1988)Hash Functions for Priority Queues, , and . FOCS, page 299-303. IEEE Computer Society, (1983)Improved Algorithms and Analysis for Secretary Problems and Generalizations., , and . FOCS, page 473-482. IEEE Computer Society, (1995)Generating Hard Instances of Lattice Problems. Electronic Colloquium on Computational Complexity (ECCC), (1996)Monotone versus positive., and . J. ACM, 34 (4): 1004-1015 (1987)Compactly encoding unstructured inputs with differential compression., , , , and . J. ACM, 49 (3): 318-367 (2002)A Theorem on Probabilistic Constant Depth Computations, and . STOC, page 471-474. ACM, (1984)