| Publication | Date of Publication | Type |
|---|
Random input helps searching predecessors
| 2024-10-31 | Paper |
Dynamic interpolation search revisited
Information and Computation | 2020-01-17 | Paper |
Resolving Braess's paradox in random networks
Algorithmica | 2017-10-09 | Paper |
Resolving Braess's paradox in random networks
Web and Internet Economics | 2015-01-12 | Paper |
Selfish splittable flows and NP-completeness
Computer Science Review | 2014-10-24 | Paper |
Dynamic 3-sided planar range queries with expected doubly-logarithmic time
Theoretical Computer Science | 2014-03-13 | Paper |
On the hardness of network design for bottleneck routing games
Theoretical Computer Science | 2014-01-22 | Paper |
Improved bounds for finger search on a RAM
Algorithmica | 2013-05-13 | Paper |
On the hardness of network design for bottleneck routing games
Algorithmic Game Theory | 2013-03-13 | Paper |
The impact of social ignorance on weighted congestion games
Theory of Computing Systems | 2012-12-06 | Paper |
Efficient methods for selfish network design
Theoretical Computer Science | 2012-08-09 | Paper |
ISB-tree: A new indexing scheme with efficient expected behaviour
Journal of Discrete Algorithms | 2011-01-20 | Paper |
Atomic congestion games: fast, myopic and concurrent
Theory of Computing Systems | 2010-08-13 | Paper |
Improved bounds for finger search on a RAM
Lecture Notes in Computer Science | 2010-03-03 | Paper |
On the chromatic number of a random 5-regular graph
Journal of Graph Theory | 2009-12-18 | Paper |
Dynamic 3-sided planar range queries with expected doubly logarithmic time
Algorithms and Computation | 2009-12-17 | Paper |
Efficient Methods for Selfish Network Design
Automata, Languages and Programming | 2009-07-14 | Paper |
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
Theoretical Computer Science | 2009-03-17 | Paper |
Dynamic Interpolation Search Revisited
Automata, Languages and Programming | 2009-03-12 | Paper |
scientific article; zbMATH DE number 5504156 (Why is no real title available?)
| 2009-02-09 | Paper |
Atomic Congestion Games: Fast, Myopic and Concurrent
Algorithmic Game Theory | 2008-05-02 | Paper |
Approximating Almost All Instances of Max-Cut Within a Ratio Above the Håstad Threshold
Lecture Notes in Computer Science | 2008-03-11 | Paper |
The unsatisfiability threshold revisited
Discrete Applied Mathematics | 2007-08-23 | Paper |
Selecting Complementary Pairs of Literals
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
The probabilistic analysis of a greedy satisfiability algorithm
Random Structures & Algorithms | 2006-09-06 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
scientific article; zbMATH DE number 2044510 (Why is no real title available?)
| 2004-02-18 | Paper |
scientific article; zbMATH DE number 1947423 (Why is no real title available?)
| 2003-07-08 | Paper |
Locating information with uncertainty in fully interconnected networks with applications to world wide web information retrieval
The Computer Journal. Section A Section B | 2002-01-23 | Paper |
The unsatisfiability threshold revisited
| 2001-09-24 | Paper |
A note on the non-colorability threshold of a random graph
The Electronic Journal of Combinatorics | 2000-06-07 | Paper |
