Artur Czumaj
ACM-SIAM Symposium on Discrete Algorithms · 1997–2002
A researcher in the Science corpus: 2 papers; trusts 3 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Artur Czumaj trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Devdatt P. Dubhashi
- Tim Roughgarden
- Robert M Corless
- Christos H. Papadimitriou
- W. Hoeffding
- Gaston H. Gonnet
- Rajeev Motwani
Who trusts Artur Czumaj overall
- Tim Roughgarden
- Daniel Fernholz
- É. Tardos
- V. Ramachandran
- George Christodoulou
- Elliot Anshelevich
- Yossi Azar
Papers from Artur Czumaj's perspective
Ordered by how strongly the researchers Artur Czumaj trusts endorse each paper. Same corpus, a different order for every researcher.
- On the evolution of random graphs
- Algorithms, games, and the internet (Symposium on the Theory of Computing)
- How bad is selfish routing? (Proceedings 41st Annual Symposium on Foundations of Computer Science)
- Lectures on the Coupling Method
- The price of anarchy is independent of the network topology (Symposium on the Theory of Computing)
- On the LambertW function
- A personal communication
- Balls and Bins: A Study in Negative Dependence
- The complexity of pure Nash equilibria (Symposium on the Theory of Computing)
- Charging and rate control for elastic traffic
Their papers
- Tight bounds for worst-case equilibria (2002) — 355 citations
- Randomized allocation processes (1997)