Gábor Tardos
JACM · 2004–2009
A researcher in the Science corpus: 5 papers; trusts 1 researcher and is trusted by 25 researchers here, as inferred from the citation graph.
Whom Gábor Tardos trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Gábor Tardos overall
- Mark Bun
- Thomas Steinke
- Jonathan Ullman
- Salil P. Vadhan
- Cynthia Dwork
- Matthew Christopher Stamm
- Einar Steingrímsson
- Damian Osajda
- Kunal Talwar
- Min Wu
Papers from Gábor Tardos's perspective
Ordered by how strongly the researchers Gábor Tardos trusts endorse each paper. Same corpus, a different order for every researcher.
- The Füredi-Hajnal Conjecture Implies the Stanley-Wilf Conjecture
- Forbidden paths and cycles in ordered graphs and matrices
- Combinatorial Enumeration
- The On-Line Encyclopedia of Integer Sequences (Electronic Journal of Combinatorics)
- Short Signatures from the Weil Pairing
- Towards a theory of software protection and simulation by oblivious RAMs
- Replication is not needed: single database, computationally-private information retrieval
- Identity-Based Encryption from the Weil Pairing
- Provable data possession at untrusted stores (Conference on Computer and Communications Security)
- Fully homomorphic encryption using ideal lattices
Their papers
- A constructive proof of the general lovász local lemma (2009) — 590 citations
- Excluded permutation matrices and the Stanley-Wilf conjecture (2004) — 512 citations
- Forbidden paths and cycles in ordered graphs and matrices (2006) — 102 citations
- Optimal probabilistic fingerprint codes (2008) — 336 citations
- A new entropy inequality for the Erd os distance problem (2004) — 93 citations