| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | János Pach, Gábor Tardos |
Piercing quasi-rectangles - On a problem of Danzer and Rogers.  |
J. Comb. Theory, Ser. A  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Péter L. Erdös, Claude Tardif, Gábor Tardos |
On infinite-finite duality pairs of directed graphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Péter L. Erdös, Claude Tardif, Gábor Tardos |
Caterpillar dualities and regular languages |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | László Csirmaz, Gábor Tardos |
On-line secret sharing. |
Des. Codes Cryptography |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | László Csirmaz, Gábor Tardos |
On-line secret sharing. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Gábor Simonyi, Gábor Tardos |
On directed local chromatic number, shift graphs, and Borsuk-like graphs. |
Journal of Graph Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Heidi Gebauer, Tibor Szabó, Gábor Tardos |
The Local Lemma is Tight for SAT. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | János Pach, Gábor Tardos |
Tight lower bounds for the size of epsilon-nets. |
Symposium on Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | János Pach, Gábor Tardos |
Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hossein Jowhari, Mert Saglam, Gábor Tardos |
Tight bounds for Lp samplers, finding duplicates in streams, and related problems. |
PODS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | János Pach, Gábor Tardos |
Coloring axis-parallel rectangles. |
J. Comb. Theory, Ser. A |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin A. Moser, Gábor Tardos |
A constructive proof of the general lovász local lemma. |
J. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | János Pach, Gábor Tardos |
Tight lower bounds for the size of epsilon-nets |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Heidi Gebauer, Tibor Szabó, Gábor Tardos |
The Local Lemma Is Tight for SAT |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Hossein Jowhari, Mert Saglam, Gábor Tardos |
Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | János Pach, József Solymosi, Gábor Tardos |
Crossing numbers of imbalanced graphs. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Tardos |
Capacity of Collusion Secure Fingerprinting - A Tradeoff between Rate and Efficiency - (Extended Abstract of Invited Talk). |
Information Hiding |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | László Csirmaz, Gábor Tardos |
Secret sharing on trees: problem solved. |
IACR Cryptology ePrint Archive |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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 |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | János Pach, Gábor Tardos |
Conflict-Free Colourings of Graphs and Hypergraphs. |
Combinatorics, Probability & Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin A. Moser, Gábor Tardos |
A constructive proof of the general Lovasz Local Lemma |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ehsan Amiri, Gábor Tardos |
High rate fingerprinting codes and the fingerprinting capacity. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos |
Graph Colouring with No Large Monochromatic Components. |
Combinatorics, Probability & Computing |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Tardos |
Optimal probabilistic fingerprint codes. |
J. ACM |
2008 |
DBLP DOI BibTeX RDF |
collusion attack, Fingerprint codes |
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Eyal Ackerman, Gábor Tardos |
On the maximum number of edges in quasi-planar graphs. |
J. Comb. Theory, Ser. A |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos |
Graph coloring with no large monochromatic components. |
Electronic Notes in Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Simonyi, Gábor Tardos |
Colorful subgraphs in Kneser-like graphs. |
Eur. J. Comb. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer, Gábor Tardos |
Deterministic random walks on the integers. |
Eur. J. Comb. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Tardos, Géza Tóth |
Multiple Coverings of the Plane with Triangles. |
Discrete & Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Tardos, Géza Tóth |
Crossing Stars in Topological Graphs. |
SIAM J. Discrete Math. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | József Solymosi, Gábor Tardos |
On the number of k-rich transformations. |
Symposium on Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
Möbius transformation, point-line incidences |
| 1 | János Pach, Gábor Tardos |
Coloring Axis-Parallel Rectangles. |
KyotoCGGT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Marcus, Gábor Tardos |
Intersection reverse sequences and geometric applications. |
J. Comb. Theory, Ser. A |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Simonyi, Gábor Tardos |
Local Chromatic Number, KY Fan's Theorem, And Circular Colorings. |
Combinatorica |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C15, 55U10 |
| 1 | Tibor Szabó, Gábor Tardos |
Extremal Problems For Transversals In Graphs With Bounded Degree. |
Combinatorica |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05D15, 05C69, 05C15 |
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Tardos |
On 0-1 matrices and small excluded submatrices. |
J. Comb. Theory, Ser. A |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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) |
2005 |
DBLP BibTeX RDF |
|
| 1 | János Pach, Gábor Tardos, Géza Tóth |
Indecomposable Coverings. |
CJCDGCGT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | János Pach, Gábor Tardos |
Forbidden patterns and unit distances. |
Symposium on Computational Geometry |
2005 |
DBLP DOI BibTeX RDF |
0-1 matrix, extremal combinatorics, forbidden patterns, interval chromatic number, unit-distance graph |
| 1 | Adam Marcus, Gábor Tardos |
Excluded permutation matrices and the Stanley-Wilf conjecture. |
J. Comb. Theory, Ser. A |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, János Pach, Micha Sharir, Gábor Tardos |
Distinct Distances in Three and Higher Dimensions. |
Combinatorics, Probability & Computing |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Marcus, Gábor Tardos |
Intersection Reverse Sequences and Geometric Applications. |
Graph Drawing |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Tardos, Géza Tóth |
Crossing Stars in Topological Graphs. |
JCDCG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Penny E. Haxell, Tibor Szabó, Gábor Tardos |
Bounded size components--partitions and transversals. |
J. Comb. Theory, Ser. B |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Vince Grolmusz, Gábor Tardos |
A Note on Non-Deterministic Communication Complexity with Few Witnesses. |
Theory Comput. Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Aronov, János Pach, Micha Sharir, Gábor Tardos |
Distinct distances in three and higher dimensions. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
distinct distances, incidences, point configurations |
| 1 | Gábor Tardos |
Optimal probabilistic fingerprint codes. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
collusion-secure codes, cryptography, fingerprint |
| 1 | János Pach, Gábor Tardos |
Isosceles Triangles Determined by a Planar Point Set. |
Graphs and Combinatorics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Erez Petrank, Gábor Tardos |
On the Knowledge Complexity of NP. |
Combinatorica |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 68Q15, 68Q17 |
| 1 | József Solymosi, Gábor Tardos, Csaba D. Tóth |
The k Most Frequent Distances in the Plane. |
Discrete & Computational Geometry |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | János Pach, Gábor Tardos |
Untangling a Polygon. |
Discrete & Computational Geometry |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | János Pach, Gábor Tardos |
On the Boundary Complexity of the Union of Fat Triangles. |
SIAM J. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | János Pach, Gábor Tardos |
Separating convex sets by straight lines. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Tibor Szabó, Gábor Tardos |
A Multidimensional Generalization Of The Erdös-Szekeres Lemma On Monotone Subsequences. |
Combinatorics, Probability & Computing |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Micha Sharir, Shakhar Smorodinsky, Gábor Tardos |
An Improved Bound for k-Sets in Three Dimensions. |
Discrete & Computational Geometry |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | János Pach, Gábor Tardos |
Untangling a Polygon. |
Graph Drawing |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Joel Spencer, Gábor Tardos |
Ups and Downs of First Order Sentences on Random Graphs. |
Combinatorica |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C80, 60F20 |
| 1 | János Pach, Gábor Tardos |
Cutting Glass. |
Discrete & Computational Geometry |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Vince Grolmusz, Gábor Tardos |
Lower Bounds for (MODp-MODm) Circuits. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Micha Sharir, Shakhar Smorodinsky, Gábor Tardos |
An improved bound for k-sets in three dimensions. |
Symposium on Computational Geometry |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | János Pach, Gábor Tardos |
Cutting glass. |
Symposium on Computational Geometry |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Micha Sharir, Shakhar Smorodinsky, Gábor Tardos |
An Improved Bound for k-Sets in Three Dimensions. |
EuroCG |
2000 |
DBLP BibTeX RDF |
|
| 1 | János Pach, Gábor Tardos |
On the boundary complexity of the union of fat triangles. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
boundary complexity, fat triangle union, separator line, computational complexity, computational geometry, computational geometry, upper bounds, motion planning, holes |
| 1 | Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos |
Linear Hash Functions. |
J. ACM |
1999 |
DBLP DOI BibTeX RDF |
hashing via linear maps, universal hashing |
| 1 | Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin |
Arthur-Merlin Games in Boolean Decision Trees. |
J. Comput. Syst. Sci. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Vince Grolmusz, Gábor Tardos |
Lower Bounds for (MOD p -- MOD m) Circuits |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Gábor Tardos, David A. Mix Barrington |
A Lower Bound on the Mod 6 Degree of the Or Function. |
Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Vince Grolmusz, Gábor Tardos |
Lower Bounds for (MOD p - MOD m) Circuits. |
FOCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin |
Arthur-Merlin Games in Boolean Decision Trees. (PDF / PS) |
IEEE Conference on Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin |
Arthur-Merlin Games in Boolean Decision Trees |
Electronic Colloquium on Computational Complexity (ECCC) |
1997 |
DBLP BibTeX RDF |
|
| 1 | Gábor Tardos, Uri Zwick |
The Communication Complexity of the Universal Relation. (PDF / PS) |
IEEE Conference on Computational Complexity |
1997 |
DBLP DOI BibTeX RDF |
protocols, communication complexity |
| 1 | Joe Kilian, Erez Petrank, Gábor Tardos |
Probabilistically Checkable Proofs with Zero Knowledge. |
STOC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos |
Is Linear Hashing Good? |
STOC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Gyula Károlyi, Gábor Tardos |
On Point Covers of Multiple Intervals and Axis-Parallel Rectangles. |
Combinatorica |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Tardos |
Multi-prover Encoding Schemes and Three-prover Proof Systems. |
J. Comput. Syst. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Erez Petrank, Gábor Tardos |
On the Knowledge Complexity of NP. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
logarithmic statistical knowledge complexity, NP-complete languages, samplable distribution entropy, computational complexity, language, interactive proof, error probability, polynomial time hierarchy |
| 1 | Gábor Tardos |
Transversals of 2-Intervals, a Topological Approach. |
Combinatorica |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Tardos, David A. Mix Barrington |
A Lower Bound on the Mod 6 Degree of the OR Function. |
ISTCS |
1995 |
DBLP BibTeX RDF |
|
| 1 | Shai Ben-David, Allan Borodin, Richard M. Karp, Gábor Tardos, Avi Wigderson |
On the Power of Randomization in On-Line Algorithms. |
Algorithmica |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Tardos |
Multi-Prover Encoding Schemes and Three-Prover Proof Systems. |
Structure in Complexity Theory Conference |
1994 |
DBLP BibTeX RDF |
|
| 1 | Piotr Berman, Howard J. Karloff, Gábor Tardos |
A Competitive 3-Server Algorithm. |
SODA |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Gábor Tardos |
Query complexity, or why is it difficult to seperate NP A cap co NPA from PA by random oracles A?. |
Combinatorica |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Russell Impagliazzo, Gábor Tardos |
Decision Versus Search Problems in Super-Polynomial Time |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
X-search problem, super-polynomial time, decidable, search problems, decision problems, parallel complexity |
| 1 | Amos Fiat, Shahar Moses, Adi Shamir, Ilan Shimshoni, Gábor Tardos |
Planning and Learning in Permutation Groups |
FOCS |
1989 |
DBLP DOI BibTeX RDF |
invertible operations, finite-state environments, test ping-pong protocols, learning, artificial intelligence, planning, permutation groups, permutation groups |
| 1 | Gábor Tardos |
Polynomial Bound for a Chip Firing Game on Graphs. |
SIAM J. Discrete Math. |
1988 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")