- Home
- Best Scientists - Mathematics
- Gábor Tardos

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
33
Citations
5,590
118
World Ranking
6830
National Ranking
7

Mathematics
D-index
33
Citations
5,175
121
World Ranking
1676
National Ranking
7

2018 - Member of Academia Europaea

- Combinatorics
- Geometry
- Discrete mathematics

His main research concerns Combinatorics, Discrete mathematics, Upper and lower bounds, Graph and Algorithm. Gábor Tardos performs multidisciplinary study on Combinatorics and Formal power series in his works. As part of his studies on Discrete mathematics, he often connects relevant subjects like Block matrix.

His study explores the link between Graph and topics such as Absolute constant that cross with problems in Multiplicative constant, Vertex partition, Degree and Bounded function. His work on Standard model as part of general Algorithm study is frequently linked to High rate, Weak model and Fountain code, therefore connecting diverse disciplines of science. His study in the field of Luby transform code is also linked to topics like Fingerprint and Traitor tracing.

- A constructive proof of the general lovász local lemma (391 citations)
- Excluded permutation matrices and the Stanley-Wilf conjecture (379 citations)
- On the power of randomization in on-line algorithms (227 citations)

The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Upper and lower bounds, Conjecture and Graph. His Combinatorics study integrates concerns from other disciplines, such as Point, Plane and Bounded function. His Discrete mathematics research includes themes of Degree and Constant.

The study incorporates disciplines such as Algorithm and Communication complexity in addition to Upper and lower bounds. His Conjecture study combines topics from a wide range of disciplines, such as Intersection, Sequence and Regular polygon. His biological study spans a wide range of topics, including Chromatic scale and Topology.

- Combinatorics (90.00%)
- Discrete mathematics (43.50%)
- Upper and lower bounds (18.50%)

- Combinatorics (90.00%)
- Conjecture (15.50%)
- Plane (13.50%)

Combinatorics, Conjecture, Plane, Upper and lower bounds and Vertex are his primary areas of study. Borrowing concepts from Omega, he weaves in ideas under Combinatorics. His study looks at the relationship between Conjecture and topics such as Intersection, which overlap with Lemma, Clique, Transversal, Approximation algorithm and Time complexity.

He has researched Plane in several fields, including Point, Pairwise comparison, Perimeter and Constant. Gábor Tardos combines subjects such as Multigraph and Ordered graph with his study of Upper and lower bounds. Gábor Tardos focuses mostly in the field of Vertex, narrowing it down to topics relating to Disjoint sets and, in certain cases, Clique number and Arbitrarily large.

- On max-clique for intersection graphs of sets and the hadwiger-debrunner numbers (10 citations)
- On the Turán number of ordered forests (8 citations)
- Tilings with noncongruent triangles (6 citations)

- Combinatorics
- Geometry
- Algorithm

His scientific interests lie mostly in Combinatorics, Plane, Conjecture, Discrete mathematics and Perimeter. Gábor Tardos studies Vertex, a branch of Combinatorics. His studies deal with areas such as Quadratic equation, Approximation algorithm, Regular polygon, Transversal and Clique as well as Conjecture.

His Discrete mathematics study frequently draws connections to other fields, such as Duality. The concepts of his Perimeter study are interwoven with issues in Convex polygon and Pairwise comparison. The Upper and lower bounds study which covers Ordered graph that intersects with Bound graph.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

On the power of randomization in on-line algorithms

S. Ben-David;A. Borodin;R. Karp;G. Tardos.

Algorithmica **(1994)**

532 Citations

Optimal probabilistic fingerprint codes

Gábor Tardos.

Journal of the ACM **(2008)**

511 Citations

A constructive proof of the general lovász local lemma

Robin A. Moser;Gábor Tardos.

Journal of the ACM **(2010)**

492 Citations

Excluded permutation matrices and the Stanley-Wilf conjecture

Adam Marcus;Gábor Tardos.

Journal of Combinatorial Theory, Series A **(2004)**

440 Citations

On the power of randomization in online algorithms

S. Ben-David;A. Borodin;R. Karp;G. Tardos.

symposium on the theory of computing **(1990)**

265 Citations

Tight bounds for Lp samplers, finding duplicates in streams, and related problems

Hossein Jowhari;Mert Sağlam;Gábor Tardos.

symposium on principles of database systems **(2011)**

162 Citations

Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs

Janos Pach;Rados Radoicic;Gabor Tardos;Geza Toth.

Discrete and Computational Geometry **(2006)**

143 Citations

Conflict-free colourings of graphs and hypergraphs

JÁnos Pach;GÁbor Tardos.

Combinatorics, Probability & Computing **(2009)**

104 Citations

On the maximum number of edges in quasi-planar graphs

Eyal Ackerman;Gábor Tardos.

Journal of Combinatorial Theory, Series A **(2007)**

103 Citations

Polynomial bound for a chip firing game on graphs

Gábor Tardos.

SIAM Journal on Discrete Mathematics **(1988)**

100 Citations

Alfréd Rényi Institute of Mathematics

New York University

Max Planck Institute for Informatics

Tel Aviv University

Tel Aviv University

Technion – Israel Institute of Technology

University of Waterloo

Charles University

Princeton University

University of California, Berkeley

Profile was last updated on December 6th, 2021.

Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).

The ranking d-index is inferred from publications deemed to belong to the considered discipline.

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Something went wrong. Please try again later.