| 2009 |
|---|
| 73 | EE | Ehsan Amiri,
Gábor Tardos:
High rate fingerprinting codes and the fingerprinting capacity.
SODA 2009: 336-345 |
| 72 | EE | Robin A. Moser,
Gábor Tardos:
A constructive proof of the general Lovasz Local Lemma
CoRR abs/0903.0544: (2009) |
| 71 | EE | Xiaomin Chen,
János Pach,
Mario Szegedy,
Gábor Tardos:
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles.
Random Struct. Algorithms 34(1): 11-23 (2009) |
| 2008 |
|---|
| 70 | EE | Xiaomin Chen,
János Pach,
Mario Szegedy,
Gábor Tardos:
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles.
SODA 2008: 94-101 |
| 69 | EE | Nathan Linial,
Jirí Matousek,
Or Sheffet,
Gábor Tardos:
Graph Colouring with No Large Monochromatic Components.
Combinatorics, Probability & Computing 17(4): 577-589 (2008) |
| 68 | EE | Gábor Tardos:
Optimal probabilistic fingerprint codes.
J. ACM 55(2): (2008) |
| 2007 |
|---|
| 67 | EE | József Solymosi,
Gábor Tardos:
On the number of k-rich transformations.
Symposium on Computational Geometry 2007: 227-231 |
| 66 | EE | Gábor Tardos,
Géza Tóth:
Multiple Coverings of the Plane with Triangles.
Discrete & Computational Geometry 38(2): 443-450 (2007) |
| 65 | EE | Nathan Linial,
Jirí Matousek,
Or Sheffet,
Gábor Tardos:
Graph coloring with no large monochromatic components.
Electronic Notes in Discrete Mathematics 29: 115-122 (2007) |
| 64 | EE | Noga Alon,
Ilan Newman,
Alexander Shen,
Gábor Tardos,
Nikolai K. Vereshchagin:
Partitioning multi-dimensional sets in a small number of "uniform" parts.
Eur. J. Comb. 28(1): 134-144 (2007) |
| 63 | EE | Joshua N. Cooper,
Benjamin Doerr,
Joel H. Spencer,
Gábor Tardos:
Deterministic random walks on the integers.
Eur. J. Comb. 28(8): 2072-2090 (2007) |
| 62 | EE | Gábor Simonyi,
Gábor Tardos:
Colorful subgraphs in Kneser-like graphs.
Eur. J. Comb. 28(8): 2188-2200 (2007) |
| 61 | EE | Eyal Ackerman,
Gábor Tardos:
On the maximum number of edges in quasi-planar graphs.
J. Comb. Theory, Ser. A 114(3): 563-571 (2007) |
| 60 | EE | Gábor Tardos,
Géza Tóth:
Crossing Stars in Topological Graphs.
SIAM J. Discrete Math. 21(3): 737-749 (2007) |
| 2006 |
|---|
| 59 | EE | Tibor Szabó,
Gábor Tardos:
Extremal Problems For Transversals In Graphs With Bounded Degree.
Combinatorica 26(3): 333-351 (2006) |
| 58 | EE | Gábor Simonyi,
Gábor Tardos:
Local Chromatic Number, KY Fan's Theorem, And Circular Colorings.
Combinatorica 26(5): 587-626 (2006) |
| 57 | EE | Itai Benjamini,
Gady Kozma,
László Lovász,
D. A. N. Romik,
Gábor Tardos:
Waiting for a Bat to Fly By (in Polynomial Time).
Combinatorics, Probability & Computing 15(5): 673-683 (2006) |
| 56 | EE | János Pach,
Rados Radoicic,
Gábor Tardos,
Géza Tóth:
Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs.
Discrete & Computational Geometry 36(4): 527-552 (2006) |
| 55 | EE | Adam Marcus,
Gábor Tardos:
Intersection reverse sequences and geometric applications.
J. Comb. Theory, Ser. A 113(4): 675-691 (2006) |
| 2005 |
|---|
| 54 | EE | János Pach,
Gábor Tardos,
Géza Tóth:
Indecomposable Coverings.
CJCDGCGT 2005: 135-148 |
| 53 | EE | János Pach,
Gábor Tardos:
Forbidden patterns and unit distances.
Symposium on Computational Geometry 2005: 1-9 |
| 52 | EE | Noga Alon,
Ilan Newman,
Alexander Shen,
Gábor Tardos,
Nikolai K. Vereshchagin:
Partitioning multi-dimensional sets in a small number of ``uniform'' parts
Electronic Colloquium on Computational Complexity (ECCC)(095): (2005) |
| 51 | EE | Gábor Tardos:
On 0-1 matrices and small excluded submatrices.
J. Comb. Theory, Ser. A 111(2): 266-288 (2005) |
| 2004 |
|---|
| 50 | EE | Adam Marcus,
Gábor Tardos:
Intersection Reverse Sequences and Geometric Applications.
Graph Drawing 2004: 349-359 |
| 49 | EE | Gábor Tardos,
Géza Tóth:
Crossing Stars in Topological Graphs.
JCDCG 2004: 184-197 |
| 48 | EE | János Pach,
Rados Radoicic,
Gábor Tardos,
Géza Tóth:
Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract].
Symposium on Computational Geometry 2004: 68-75 |
| 47 | | Boris Aronov,
János Pach,
Micha Sharir,
Gábor Tardos:
Distinct Distances in Three and Higher Dimensions.
Combinatorics, Probability & Computing 13(3): 283-293 (2004) |
| 46 | EE | János Pach,
Rom Pinchasi,
Gábor Tardos,
Géza Tóth:
Geometric graphs with no self-intersecting path of length three.
Eur. J. Comb. 25(6): 793-811 (2004) |
| 45 | EE | Adam Marcus,
Gábor Tardos:
Excluded permutation matrices and the Stanley-Wilf conjecture.
J. Comb. Theory, Ser. A 107(1): 153-160 (2004) |
| 2003 |
|---|
| 44 | EE | Gábor Tardos:
Optimal probabilistic fingerprint codes.
STOC 2003: 116-125 |
| 43 | EE | Boris Aronov,
János Pach,
Micha Sharir,
Gábor Tardos:
Distinct distances in three and higher dimensions.
STOC 2003: 541-546 |
| 42 | EE | Penny E. Haxell,
Tibor Szabó,
Gábor Tardos:
Bounded size components--partitions and transversals.
J. Comb. Theory, Ser. B 88(2): 281-297 (2003) |
| 41 | EE | Vince Grolmusz,
Gábor Tardos:
A Note on Non-Deterministic Communication Complexity with Few Witnesses.
Theory Comput. Syst. 36(4): 387-391 (2003) |
| 2002 |
|---|
| 40 | EE | János Pach,
Rom Pinchasi,
Gábor Tardos,
Géza Tóth:
Geometric Graphs with No Self-intersecting Path of Length Three.
Graph Drawing 2002: 295-311 |
| 39 | EE | Erez Petrank,
Gábor Tardos:
On the Knowledge Complexity of NP.
Combinatorica 22(1): 83-121 (2002) |
| 38 | EE | János Pach,
Gábor Tardos:
Untangling a Polygon.
Discrete & Computational Geometry 28(4): 585-592 (2002) |
| 37 | EE | József Solymosi,
Gábor Tardos,
Csaba D. Tóth:
The k Most Frequent Distances in the Plane.
Discrete & Computational Geometry 28(4): 639-648 (2002) |
| 36 | EE | János Pach,
Gábor Tardos:
Isosceles Triangles Determined by a Planar Point Set.
Graphs and Combinatorics 18(4): 769-779 (2002) |
| 35 | EE | János Pach,
Gábor Tardos:
On the Boundary Complexity of the Union of Fat Triangles.
SIAM J. Comput. 31(6): 1745-1760 (2002) |
| 2001 |
|---|
| 34 | EE | János Pach,
Gábor Tardos:
Untangling a Polygon.
Graph Drawing 2001: 154-161 |
| 33 | | Tibor Szabó,
Gábor Tardos:
A Multidimensional Generalization Of The Erdös-Szekeres Lemma On Monotone Subsequences.
Combinatorics, Probability & Computing 10(6): (2001) |
| 32 | EE | Micha Sharir,
Shakhar Smorodinsky,
Gábor Tardos:
An Improved Bound for k-Sets in Three Dimensions.
Discrete & Computational Geometry 26(2): 195-204 (2001) |
| 31 | EE | János Pach,
Gábor Tardos:
Separating convex sets by straight lines.
Discrete Mathematics 241(1-3): 427-433 (2001) |
| 2000 |
|---|
| 30 | | Micha Sharir,
Shakhar Smorodinsky,
Gábor Tardos:
An Improved Bound for k-Sets in Three Dimensions.
EWCG 2000: 132-135 |
| 29 | | János Pach,
Gábor Tardos:
On the boundary complexity of the union of fat triangles.
FOCS 2000: 423-431 |
| 28 | EE | János Pach,
Gábor Tardos:
Cutting glass.
Symposium on Computational Geometry 2000: 360-369 |
| 27 | EE | Micha Sharir,
Shakhar Smorodinsky,
Gábor Tardos:
An improved bound for k-sets in three dimensions.
Symposium on Computational Geometry 2000: 43-49 |
| 26 | EE | Joel Spencer,
Gábor Tardos:
Ups and Downs of First Order Sentences on Random Graphs.
Combinatorica 20(2): 263-280 (2000) |
| 25 | EE | János Pach,
Gábor Tardos:
Cutting Glass.
Discrete & Computational Geometry 24(2-3): 481-496 (2000) |
| 24 | | Vince Grolmusz,
Gábor Tardos:
Lower Bounds for (MODp-MODm) Circuits.
SIAM J. Comput. 29(4): 1209-1222 (2000) |
| 1999 |
|---|
| 23 | EE | Noga Alon,
Martin Dietzfelbinger,
Peter Bro Miltersen,
Erez Petrank,
Gábor Tardos:
Linear Hash Functions.
J. ACM 46(5): 667-683 (1999) |
| 22 | | Ran Raz,
Gábor Tardos,
Oleg Verbitsky,
Nikolai K. Vereshchagin:
Arthur-Merlin Games in Boolean Decision Trees.
J. Comput. Syst. Sci. 59(2): 346-372 (1999) |
| 1998 |
|---|
| 21 | EE | Vince Grolmusz,
Gábor Tardos:
Lower Bounds for (MOD p - MOD m) Circuits.
FOCS 1998: 279-289 |
| 20 | EE | Ran Raz,
Gábor Tardos,
Oleg Verbitsky,
Nikolai K. Vereshchagin:
Arthur-Merlin Games in Boolean Decision Trees.
IEEE Conference on Computational Complexity 1998: 58-67 |
| 19 | | Gábor Tardos,
David A. Mix Barrington:
A Lower Bound on the Mod 6 Degree of the Or Function.
Computational Complexity 7(2): 99-108 (1998) |
| 18 | EE | Vince Grolmusz,
Gábor Tardos:
Lower Bounds for (MOD p -- MOD m) Circuits
Electronic Colloquium on Computational Complexity (ECCC) 5(36): (1998) |
| 1997 |
|---|
| 17 | EE | Gábor Tardos,
Uri Zwick:
The Communication Complexity of the Universal Relation.
IEEE Conference on Computational Complexity 1997: 247-259 |
| 16 | EE | Noga Alon,
Martin Dietzfelbinger,
Peter Bro Miltersen,
Erez Petrank,
Gábor Tardos:
Is Linear Hashing Good?
STOC 1997: 465-474 |
| 15 | EE | Joe Kilian,
Erez Petrank,
Gábor Tardos:
Probabilistically Checkable Proofs with Zero Knowledge.
STOC 1997: 496-505 |
| 14 | EE | Ran Raz,
Gábor Tardos,
Oleg Verbitsky,
Nikolai K. Vereshchagin:
Arthur-Merlin Games in Boolean Decision Trees
Electronic Colloquium on Computational Complexity (ECCC) 4(54): (1997) |
| 1996 |
|---|
| 13 | | Erez Petrank,
Gábor Tardos:
On the Knowledge Complexity of NP.
FOCS 1996: 494-503 |
| 12 | | Gyula Károlyi,
Gábor Tardos:
On Point Covers of Multiple Intervals and Axis-Parallel Rectangles.
Combinatorica 16(2): 213-222 (1996) |
| 11 | | Gábor Tardos:
Multi-prover Encoding Schemes and Three-prover Proof Systems.
J. Comput. Syst. Sci. 53(2): 251-260 (1996) |
| 1995 |
|---|
| 10 | | Gábor Tardos,
David A. Mix Barrington:
A Lower Bound on the Mod 6 Degree of the OR Function.
ISTCS 1995: 52-56 |
| 9 | | Gábor Tardos:
Transversals of 2-Intervals, a Topological Approach.
Combinatorica 15(1): 123-134 (1995) |
| 1994 |
|---|
| 8 | | Gábor Tardos:
Multi-Prover Encoding Schemes and Three-Prover Proof Systems.
Structure in Complexity Theory Conference 1994: 308-317 |
| 7 | | Shai Ben-David,
Allan Borodin,
Richard M. Karp,
Gábor Tardos,
Avi Wigderson:
On the Power of Randomization in On-Line Algorithms.
Algorithmica 11(1): 2-14 (1994) |
| 1990 |
|---|
| 6 | | Piotr Berman,
Howard J. Karloff,
Gábor Tardos:
A Competitive 3-Server Algorithm.
SODA 1990: 280-290 |
| 5 | | Shai Ben-David,
Allan Borodin,
Richard M. Karp,
Gábor Tardos,
Avi Wigderson:
On the Power of Randomization in Online Algorithms (Extended Abstract)
STOC 1990: 379-386 |
| 1989 |
|---|
| 4 | | Russell Impagliazzo,
Gábor Tardos:
Decision Versus Search Problems in Super-Polynomial Time
FOCS 1989: 222-227 |
| 3 | | Amos Fiat,
Shahar Moses,
Adi Shamir,
Ilan Shimshoni,
Gábor Tardos:
Planning and Learning in Permutation Groups
FOCS 1989: 274-279 |
| 2 | | Gábor Tardos:
Query complexity, or why is it difficult to seperate NP A cap co NPA from PA by random oracles A?.
Combinatorica 9(4): 385-392 (1989) |
| 1988 |
|---|
| 1 | | Gábor Tardos:
Polynomial Bound for a Chip Firing Game on Graphs.
SIAM J. Discrete Math. 1(3): 397-398 (1988) |
