The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gábor Tardos: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  62. Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. [Citation Graph (, )][DBLP]


  63. High rate fingerprinting codes and the fingerprinting capacity. [Citation Graph (, )][DBLP]


  64. A constructive proof of the general Lovasz Local Lemma [Citation Graph (, )][DBLP]


  65. The Local Lemma Is Tight for SAT [Citation Graph (, )][DBLP]


  66. Waiting for a Bat to Fly By (in Polynomial Time). [Citation Graph (, )][DBLP]


  67. Graph Colouring with No Large Monochromatic Components. [Citation Graph (, )][DBLP]


  68. Conflict-Free Colourings of Graphs and Hypergraphs. [Citation Graph (, )][DBLP]


  69. Multiple Coverings of the Plane with Triangles. [Citation Graph (, )][DBLP]


  70. Deterministic random walks on the integers. [Citation Graph (, )][DBLP]


  71. Colorful subgraphs in Kneser-like graphs. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.012secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002