Gábor Tardos | Academic Influence

Gábor Tardos's AcademicInfluence.com Rankings

Gábor Tardos

Mathematics

#657

World Rank

#1210

Historical Rank

Graph Theory

#56

World Rank

#63

Historical Rank

Measure Theory

#2957

World Rank

#3512

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Gábor Tardos's Degrees

PhD Mathematics Eötvös Loránd University

Why Is Gábor Tardos Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Gábor Tardos is a Hungarian mathematician, currently a professor at Central European University and previously a Canada Research Chair at Simon Fraser University. He works mainly in combinatorics and computer science. He is the younger brother of Éva Tardos.

(See a Problem?)

Gábor Tardos's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A constructive proof of the general lovász local lemma (2009) (519)
Excluded permutation matrices and the Stanley-Wilf conjecture (2004) (435)
Optimal probabilistic fingerprint codes (2008) (291)
On the power of randomization in online algorithms (1990) (210)
On the power of randomization in on-line algorithms (2005) (196)
Tight bounds for Lp samplers, finding duplicates in streams, and related problems (2010) (177)
Optimal probabilistic fingerprint codes (2003) (169)
Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs (2006) (128)
Local Chromatic Number, KY Fan's Theorem, And Circular Colorings (2004) (101)
Conflict-Free Colourings of Graphs and Hypergraphs (2009) (97)
On the maximum number of edges in quasi-planar graphs (2007) (91)
High rate fingerprinting codes and the fingerprinting capacity (2009) (90)
A new entropy inequality for the Erd os distance problem (2004) (89)
Tight lower bounds for the size of epsilon-nets (2010) (87)
An Improved Bound for k-Sets in Three Dimensions (2000) (85)
Polynomial Bound for a Chip Firing Game on Graphs (1988) (82)
Forbidden paths and cycles in ordered graphs and matrices (2006) (74)
On 0-1 matrices and small excluded submatrices (2005) (67)
Query complexity, or why is it difficult to separateNPA∩coNPA fromPA by random oraclesA? (1989) (66)
Indecomposable Coverings (2005) (57)
Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles (2008) (56)
Intersection reverse sequences and geometric applications (2004) (55)
Bounded size components--partitions and transversals (2003) (54)
Extremal Problems For Transversals In Graphs With Bounded Degree (2006) (54)
Linear hash functions (1999) (48)
Deterministic random walks on the integers (2006) (46)
On the intersection of subgroups of a free group (1992) (45)
Transversals of 2-intervals, a topological approach (1995) (44)
A lower bound on the mod 6 degree of the OR function (1995) (44)
On distinct sums and distinct distances (2003) (43)
Multiple Coverings of the Plane with Triangles (2007) (41)
Graph Colouring with No Large Monochromatic Components (2007) (41)
Colorful subgraphs in Kneser-like graphs (2005) (40)
Probabilistically checkable proofs with zero knowledge (1997) (38)
The local lemma is tight for SAT (2010) (38)
Decision versus search problems in super-polynomial time (1989) (36)
A maximal clone of monotone operations which is not finitely generated (1986) (34)
On the boundary complexity of the union of fat triangles (2000) (34)
Coloring axis-parallel rectangles (2007) (33)
On-line secret sharing (2012) (33)
LOCAL CHROMATIC NUMBER AND DISTINGUISHING THE STRENGTH OF TOPOLOGICAL OBSTRUCTIONS (2005) (31)
On the Communication Complexity of Sparse Set Disjointness and Exists-Equal Problems (2013) (31)
On the number of k-rich transformations (2007) (30)
Untangling a Polygon (2001) (29)
Isosceles Triangles Determined by a Planar Point Set (2002) (29)
Conflict-Free Colouring of Graphs (2013) (27)
A competitive 3-server algorithm (1990) (26)
Improved bounds for the randomized decision tree Complexity of recursive majority (2011) (26)
The Local Lemma Is Asymptotically Tight for SAT (2010) (25)
Distinct distances in three and higher dimensions (2003) (24)
The k Most Frequent Distances in the Plane (2002) (24)
Geometric graphs with no self-intersecting path of length three (2002) (22)
Entropy, search, complexity (2007) (22)
Cutting Glass (2000) (21)
Optimal Information Rate of Secret Sharing Schemes on Trees (2013) (20)
On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers (2017) (19)
On point covers of multiple intervals and axis-parallel rectangles (1995) (19)
The communication complexity of the universal relation (1997) (19)
On the Knowledge Complexity of NP (1996) (18)
Crossing Stars in Topological Graphs (2004) (18)
A Multidimensional Generalization of the Erdős–Szekeres Lemma on Monotone Subsequences (2001) (18)
Improved bounds on the Hadwiger–Debrunner numbers (2015) (18)
Secret sharing on trees: problem solved (2009) (18)
Lower bounds for (MOD p-MOD m) circuits (1998) (17)
EXTREMAL THEORY OF ORDERED GRAPHS (2019) (17)
On the Turán number of ordered forests (2017) (16)
Conflict-free coloring of graphs (2011) (16)
Two extensions of the Erdős–Szekeres problem (2017) (16)
Lower Bounds for (MODp-MODm) Circuits (2000) (15)
Planning and learning in permutation groups (1989) (15)
Deterministic Random Walks (2006) (14)
Covering lattice points by subspaces (2001) (14)
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles (2009) (13)
Piercing quasi-rectangles - On a problem of Danzer and Rogers (2012) (13)
Forbidden patterns and unit distances (2005) (12)
Disjointness Graphs of Segments (2017) (12)
On List Coloring and List Homomorphism of Permutation and Interval Graphs (2012) (11)
Planar point sets determine many pairwise crossing segments (2019) (11)
On directed local chromatic number, shift graphs, and Borsuk‐like graphs (2009) (11)
Erdős–Pyber Theorem for Hypergraphs and Secret Sharing (2015) (11)
Multi-prover encoding schemes and three-prover proof systems (1994) (11)
On roughly transitive amenable graphs and harmonic Dirichlet functions (2000) (10)
Is linear hashing good? (1997) (10)
Beyond the Richter-Thomassen Conjecture (2015) (10)
Linear Hashing (1997) (10)
Remarks on a Ramsey theory for trees (2011) (10)
Tilings with noncongruent triangles (2017) (9)
On the Richter-Thomassen Conjecture about Pairwise Intersecting Closed Curves (2014) (9)
Caterpillar Dualities and Regular Languages (2012) (9)
On the Knowledge Complexity of (2002) (9)
The longest segment in the complement of a packing (2002) (9)
Local chromatic number of quadrangulations of surfaces (2010) (9)
Waiting for a Bat to Fly By (in Polynomial Time) (2003) (9)
Improving the crossing lemma by finding more crossings in sparse graphs: [extended abstract] (2004) (8)
Construction of Locally Plane Graphs with Many Edges (2011) (8)
Transversals of d -intervals — Comparing three Approaches (1998) (8)
Tilings of the plane with unit area triangles of bounded diameter (2017) (8)
Cross-Intersecting Families of Vectors (2013) (8)
Partitioning multi-dimensional sets in a small number of "uniform" parts (2005) (8)
A Note on Non-Deterministic Communication Complexity with Few Witnesses (2003) (8)
Extremal theory of vertex or edge ordered graphs (2019) (7)
On Infinite–finite Duality Pairs of Directed Graphs (2012) (6)
On infinite-finite tree-duality pairs of relational structures (2012) (6)
Unlabeled Compression Schemes Exceeding the VC-dimension (2018) (6)
Capacity of Collusion Secure Fingerprinting - A Tradeoff between Rate and Efficiency - (Extended Abstract of Invited Talk) (2010) (5)
An algorithm for finding many disjoint monochromatic edges in a complete 2-colored geometric graph (1996) (5)
Local chromatic number and topology (2005) (5)
Arthur-Merlin games in Boolean decision trees (1998) (5)
Regular families of forests, antichains and duality pairs of relational structures (2012) (5)
Separating convex sets by straight lines (2001) (5)
Tiling the plane with equilateral triangles (2018) (4)
Entropy, Search, Complexity (Bolyai Society Mathematical Studies) (2007) (4)
Forbidden submatrices in 0-1 matrices thesis (2005) (4)
A Crossing Lemma for Jordan Curves (2017) (3)
On the knowledge complexity of /spl Nscr//spl Pscr/ (1996) (3)
On 4-chromatic Schrijver graphs: their structure, non-3-colorability, and critical edges (2019) (3)
Crossings Between Non-homotopic Edges (2020) (3)
Convergence and Limits of Finite Trees (2020) (3)
Disjointness graphs of segments in the space (2020) (3)
Right angles in vector spaces (2017) (3)
Local chromatic number and the Borsuk-Ulam Theorem (2004) (3)
Edge ordered Turán problems (2019) (3)
Random necklaces require fewer cuts (2021) (2)
Relations between the Local Chromatic Number and Its Directed Version (2013) (2)
Turán problems for edge-ordered graphs (2020) (2)
Ups and Downs of First Order Sentences on Random Graphs (2000) (2)
On the Richter–Thomassen Conjecture about Pairwise Intersecting Closed Curves † (2016) (2)
The visible perimeter of an arrangement of disks (2012) (2)
Crossing numbers of imbalanced graphs (2010) (2)
Local chromatic number and topological properties of graphs (2005) (1)
Finitely generated pseudosimple algebras (1989) (1)
Erd\H{o}s-Pyber theorem for hypergraphs and secret sharing (2013) (1)
The Range of a Random Walk on a Comb (2013) (1)
Separation with restricted families of sets (2015) (1)
C O ] 2 2 A ug 2 01 5 SEPARATION WITH RESTRICTED FAMILIES OF SETS (2015) (0)
Gráfok és algoritmusok = Graphs and algorithms (2008) (0)
Partitioning Transitive Tournaments into Isomorphic Digraphs (2018) (0)
C O ] 3 J an 2 02 0 CONVERGENCE AND LIMITS OF FINITE TREES (2020) (0)
Successive vertex orderings of fully regular graphs (2022) (0)
Practical size enlargement : by C.E. Capes, Volume 1 of Handbook of Powder Technology, J.C. Williams and T. Allen (eds.) published by Elsevier Scientific Publishing Company, Amsterdam, 1980; xii + 192 pp., price $45.00 (1982) (0)
Tilings of the plane with unit area triangles of bounded diameter (2018) (0)
Improved bounds on the Hadwiger–Debrunner numbers (2018) (0)
Remarks on a Ramsey theory for trees (2012) (0)
Tiling the plane with noncongruent triangles (2018) (0)
A Lower Bound on the Mod (1995) (0)
C O ] 1 4 Fe b 20 06 Deterministic Random Walks on the Integers ∗ (2014) (0)
Two extensions of the Erd\H{o}s-Szekeres problem (2017) (0)
Beyond the Richter-Thomassen Conjecture János Pach (2015) (0)
Where have all the grasshoppers gone? (2022) (0)
Workshop: Discrete Geometry Table of Contents (2006) (0)
On quasi-transitive amenable graphs (1998) (0)
On a search problem in multidimensional grids (1997) (0)
Linear orderings of the edges of a graph (2022) (0)
Controlling Lipschitz functions (2017) (0)
Disjointness Graphs of Short Polygonal Chains (2021) (0)
A characterization of edge-ordered graphs with almost linear extremal functions (2022) (0)
N ov 2 01 7 On the Turán number of ordered forests (2018) (0)
Cross-Intersecting Sets of Vectors János Pach (2013) (0)
Cross-Intersecting Families of Vectors (2015) (0)
On Infinite–finite Duality Pairs of Directed Graphs (2012) (0)
Piercing Quasi-Rectangles: On a Problem of Danzer and Rogers (2011) (0)
Diszkrét matematika = Discrete mathematics (2009) (0)
Regular families of forests, antichains and duality pairs of relational structures (2016) (0)
Diszkrét matematika és alkalmazásai = Discrete mathematics and its applications (2007) (0)
On-line secret sharing (2011) (0)
Linear Hashing Noga Alon (1997) (0)
Local chromatic number of quadrangulations of surfaces (2013) (0)
Erdős–Pyber Theorem for Hypergraphs and Secret Sharing (2014) (0)

This paper list is powered by the following services:

Other Resources About Gábor Tardos

en.wikipedia.org

What Schools Are Affiliated With Gábor Tardos?

Gábor Tardos is affiliated with the following schools:

Image Attributions

Image Source for Gábor Tardos