| Publication | Date of Publication | Type |
|---|
| Non-quasi-linear agents in quasi-linear mechanisms (extended abstract) | 2026-04-15 | Paper |
| A first order method for linear programming parameterized by circuit imbalance | 2025-02-07 | Paper |
| Stable matching: choosing which proposals to make | 2024-11-14 | Paper |
Fully asynchronous stochastic coordinate descent: a tight lower bound on the parallelism achieving linear speedup
Mathematical Programming. Series A. Series B | 2021-10-20 | Paper |
Amortized Analysis of Asynchronous Price Dynamics
(available as arXiv preprint) | 2021-08-04 | Paper |
On the existence of Pareto efficient and envy-free allocations
Journal of Economic Theory | 2021-05-11 | Paper |
A Truthful Cardinal Mechanism for One-Sided Matching
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Parallel stochastic asynchronous coordinate descent: tight bounds on the possible parallelism
SIAM Journal on Optimization | 2021-02-02 | Paper |
Tatonnement beyond gross substitutes? Gradient descent to the rescue
Games and Economic Behavior | 2020-10-26 | Paper |
Two-dimensional parameterized matching
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Approximating the Nash Social Welfare with Indivisible Items
SIAM Journal on Computing | 2018-07-04 | Paper |
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM | 2018-01-25 | Paper |
Applications of \(\alpha \)-strongly regular distributions to Bayesian auctions
Web and Internet Economics | 2016-01-08 | Paper |
Approximating the Nash social welfare with indivisible items
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Decentralized utilitarian mechanisms for scheduling games
Games and Economic Behavior | 2015-08-12 | Paper |
Suffix trays and suffix trists: structures for faster text indexing
Algorithmica | 2015-07-10 | Paper |
The sample complexity of revenue maximization
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Multi-scale self-simulation
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Searching dynamic point sets in spaces with bounded doubling dimension
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Faster suffix tree construction with missing suffix links
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Tatonnement beyond gross substitutes? Gradient descent to the rescue
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Fast algorithms for constructing maximum entropy summary trees
Automata, Languages, and Programming | 2014-07-01 | Paper |
Inner product spaces for minsum coordination mechanisms
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Inner product spaces for minsum coordination mechanisms
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Bottleneck links, variable demand, and the tragedy of the commons
Networks | 2013-08-06 | Paper |
Revisiting the Cache Miss Analysis of Multithreaded Algorithms
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Quantum logic of semantic space: an exploratory investigation of context effects in practical reasoning
(available as arXiv preprint) | 2011-06-21 | Paper |
Resource oblivious sorting on multicores
Automata, Languages and Programming | 2010-09-07 | Paper |
Pricing network edges for heterogeneous selfish users
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Bottleneck links, variable demand, and the tragedy of the commons
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
A fast algorithm for computing steiner edge connectivity
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Dictionary matching and indexing with errors and don't cares
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
Verifying candidate matches in sparse and wildcard matching
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
On special families of morphisms related to \(\delta \)-matching and don't care symbols
Information Processing Letters | 2009-03-23 | Paper |
Suffix trays and suffix trists: structures for faster text indexing
Lecture Notes in Computer Science | 2009-03-12 | Paper |
| scientific article; zbMATH DE number 5485543 (Why is no real title available?) | 2009-01-05 | Paper |
Prompt Mechanisms for Online Auctions
Algorithmic Game Theory | 2008-05-02 | Paper |
New linear-time algorithms for edge-coloring planar graphs
Algorithmica | 2008-04-03 | Paper |
A Generalization of Kotzig’s Theorem and Its Application
SIAM Journal on Discrete Mathematics | 2008-03-28 | Paper |
| The complexity of the minimum \(k\)-cover problem | 2008-03-06 | Paper |
A unified access bound on comparison-based dynamic dictionaries
Theoretical Computer Science | 2007-09-18 | Paper |
Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
Combinatorica | 2007-03-29 | Paper |
Formal Concept Analysis
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Towards Operational Abduction from a Cognitive Perspective
Logic Journal of the IGPL | 2006-11-30 | Paper |
How much can taxes help selfish routing?
Journal of Computer and System Sciences | 2006-06-30 | Paper |
Dynamic LCA Queries on Trees
SIAM Journal on Computing | 2005-09-16 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
| scientific article; zbMATH DE number 2089431 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2086622 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2079422 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2038765 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 1775423 (Why is no real title available?) | 2004-01-27 | Paper |
Faster Suffix Tree Construction with Missing Suffix Links
SIAM Journal on Computing | 2004-01-08 | Paper |
Tree Pattern Matching to Subset Matching in Linear Time
SIAM Journal on Computing | 2003-09-28 | Paper |
Overlap matching.
Information and Computation | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1947389 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1947388 (Why is no real title available?) | 2003-07-08 | Paper |
| A faster implementation of the Goemans-Williamson clustering algorithm | 2003-01-20 | Paper |
| scientific article; zbMATH DE number 1848393 (Why is no real title available?) | 2003-01-05 | Paper |
Approximate String Matching: A Simpler Faster Algorithm
SIAM Journal on Computing | 2002-09-29 | Paper |
| scientific article; zbMATH DE number 1808300 (Why is no real title available?) | 2002-09-26 | Paper |
| Overlap matching | 2002-06-18 | Paper |
| scientific article; zbMATH DE number 1256698 (Why is no real title available?) | 2002-01-21 | Paper |
| scientific article; zbMATH DE number 1670912 (Why is no real title available?) | 2001-12-09 | Paper |
On the benefit of supporting virtual channels in wormhole routers
Journal of Computer and System Sciences | 2001-09-09 | Paper |
An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees
SIAM Journal on Computing | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1559523 (Why is no real title available?) | 2001-02-28 | Paper |
On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log <i>n</i>-Block Sequences
SIAM Journal on Computing | 2000-10-18 | Paper |
On the Dynamic Finger Conjecture for Splay Trees. Part II: The Proof
SIAM Journal on Computing | 2000-10-18 | Paper |
| scientific article; zbMATH DE number 1305413 (Why is no real title available?) | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1306888 (Why is no real title available?) | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1305412 (Why is no real title available?) | 1999-06-17 | Paper |
| scientific article; zbMATH DE number 1303588 (Why is no real title available?) | 1999-06-17 | Paper |
Reconfiguring Arrays with Faults Part I: Worst-Case Faults
SIAM Journal on Computing | 1998-02-10 | Paper |
Tighter Upper Bounds on the Exact Complexity of String Matching
SIAM Journal on Computing | 1997-06-12 | Paper |
A nearly optimal deterministic parallel Voronoi diagram algorithm
Algorithmica | 1997-01-29 | Paper |
| scientific article; zbMATH DE number 871929 (Why is no real title available?) | 1996-10-31 | Paper |
The expected advantage of asynchrony
Journal of Computer and System Sciences | 1995-10-25 | Paper |
An Asynchronous Parallel Algorithm for Undirected Graph Connectivity
Journal of Algorithms | 1995-04-09 | Paper |
Tighter Lower Bounds on the Exact Complexity of String Matching
SIAM Journal on Computing | 1995-03-27 | Paper |
Correction: Parallel Merge Sort
SIAM Journal on Computing | 1994-02-24 | Paper |
| scientific article; zbMATH DE number 432823 (Why is no real title available?) | 1993-10-20 | Paper |
| scientific article; zbMATH DE number 177831 (Why is no real title available?) | 1993-05-18 | Paper |
ERRATUM: "RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS"
International Journal of Computational Geometry & Applications | 1993-04-01 | Paper |
RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS
International Journal of Computational Geometry & Applications | 1993-01-16 | Paper |
Optimal parallel algorithms for point-set and polygon problems
Algorithmica | 1992-06-28 | Paper |
Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
Information and Computation | 1991-01-01 | Paper |
Faster optimal parallel prefix sums and list ranking
Information and Computation | 1989-01-01 | Paper |
An Optimal-Time Algorithm for Slope Selection
SIAM Journal on Computing | 1989-01-01 | Paper |
Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
SIAM Journal on Computing | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4064467 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4060738 (Why is no real title available?) | 1988-01-01 | Paper |
Parallel Merge Sort
SIAM Journal on Computing | 1988-01-01 | Paper |
Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
SIAM Journal on Computing | 1988-01-01 | Paper |
An optimally efficient selection algorithm
Information Processing Letters | 1988-01-01 | Paper |
The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
Algorithmica | 1988-01-01 | Paper |
Optimal VLSI circuits for sorting
Journal of the ACM | 1988-01-01 | Paper |
Shape from probing
Journal of Algorithms | 1987-01-01 | Paper |
On <i>k</i>-Hulls and Related Problems
SIAM Journal on Computing | 1987-01-01 | Paper |
Partitioning point sets in arbitrary dimension
Theoretical Computer Science | 1987-01-01 | Paper |
Deterministic coin tossing with applications to optimal parallel list ranking
Information and Control | 1986-01-01 | Paper |
New upper bounds for neighbor searching
Information and Control | 1986-01-01 | Paper |
Searching and storing similar lists
Journal of Algorithms | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3911765 (Why is no real title available?) | 1985-01-01 | Paper |
A parallel median algorithm
Information Processing Letters | 1985-01-01 | Paper |
Geometric retrieval problems
Information and Control | 1984-01-01 | Paper |
On Edge Coloring Bipartite Graphs
SIAM Journal on Computing | 1982-01-01 | Paper |
Two series representations of the integral \(\int_ 0^\infty \exp[- s(\psi + y \cos\psi - z \sin\psi)] d\psi\)
Journal of Computational Physics | 1981-01-01 | Paper |
A method for predicting the stability characteristics of three-term homogeneous recurrence relations
Journal of Computational and Applied Mathematics | 1980-01-01 | Paper |
Complementary bivariational principles for linear problems involving non-self-adjoint operators
Proceedings of the Royal Society of Edinburgh: Section A Mathematics | 1980-01-01 | Paper |
Evaluation of the integral \(\int^\infty_0t^n \exp(-t^2-x/t)dt\)
Journal of Computational Physics | 1979-01-01 | Paper |
ON PROJECTION AND VARIATIONAL METHODS IN KINETIC THEORY
The Quarterly Journal of Mechanics and Applied Mathematics | 1979-01-01 | Paper |
Complementary variational principles for free molecular channel flow
Proceedings of the Royal Society of Edinburgh: Section A Mathematics | 1979-01-01 | Paper |
Possibility matrices
Theoria | 1979-01-01 | Paper |
Complementary variational principles and the Bubnov-Galerkin method
Rendiconti del Seminario Matematico e Fisico di Milano | 1978-01-01 | Paper |
Complementary Variational Principles for Knudsen Flow Rates
IMA Journal of Applied Mathematics | 1977-01-01 | Paper |
Some complementary bivariational principles for linear integral equations of Fredholm type
Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences | 1975-01-01 | Paper |
The leading edge signal on a flat plate in uniform shear
Indian Journal of Pure & Applied Mathematics | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3463914 (Why is no real title available?) | 1974-01-01 | Paper |
ALIGNED-FIELD MAGNETOHYDRODYNAMIC FLOW PAST A FLAT PLATE
The Quarterly Journal of Mechanics and Applied Mathematics | 1971-01-01 | Paper |
Definitional boolean calculi
Notre Dame Journal of Formal Logic | 1969-01-01 | Paper |
