| Publication | Date of Publication | Type |
|---|
Online bipartite matching in the probe-commit model
Mathematical Programming. Series A. Series B | 2025-12-11 | Paper |
Natural interviewing equilibria in matching settings
Social Choice and Welfare | 2025-07-14 | Paper |
| A time-space tradeoff for sorting on a general sequential model of computation | 2025-05-25 | Paper |
| Prophet matching in the probe-commit model | 2024-08-22 | Paper |
| Any-order online interval selection | 2024-07-19 | Paper |
Primarily about primaries
Artificial Intelligence | 2024-04-30 | Paper |
| Secretary Matching Meets Probing with Commitment. | 2023-11-20 | Paper |
An Experimental Study of Algorithms for Online Bipartite Matching
ACM Journal of Experimental Algorithmics | 2023-05-23 | Paper |
| Online Bipartite Matching in the Probe-Commit Model | 2023-03-15 | Paper |
Towards a better understanding of pure packet routing
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Greedy bipartite matching in random type Poisson arrival model
(available as arXiv preprint) | 2021-08-04 | Paper |
| Prophet Matching Meets Probing with Commitment | 2021-02-08 | Paper |
| Greedy Approaches to Online Stochastic Matching | 2020-08-20 | Paper |
Advice complexity of priority algorithms
Theory of Computing Systems | 2020-06-02 | Paper |
On conceptually simple algorithms for variants of online bipartite matching
Theory of Computing Systems | 2019-12-19 | Paper |
A simple PTAS for the dual bin packing problem and advice complexity of its online version
(available as arXiv preprint) | 2019-10-25 | Paper |
Advice complexity of priority algorithms
Lecture Notes in Computer Science | 2019-01-15 | Paper |
Max-sum diversification, monotone submodular functions, and dynamic updates
ACM Transactions on Algorithms | 2018-11-12 | Paper |
On conceptually simple algorithms for variants of online bipartite matching
Lecture Notes in Computer Science | 2018-06-22 | Paper |
Strategyproof mechanisms for competitive influence in networks
Algorithmica | 2017-07-07 | Paper |
Equilibria of greedy combinatorial auctions
SIAM Journal on Computing | 2017-05-30 | Paper |
Lower bounds for high dimensional nearest neighbor search and related problems
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Subquadratic approximation algorithms for clustering problems in high dimensional spaces
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Sequential posted price mechanisms with correlated valuations
Web and Internet Economics | 2016-01-08 | Paper |
Adversarial queuing theory
Journal of the ACM | 2015-09-20 | Paper |
Bounds on double-sided myopic algorithms for unconstrained non-monotone submodular maximization
Algorithms and Computation | 2015-09-11 | Paper |
How much can hardware help routing?
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Elimination graphs
ACM Transactions on Algorithms | 2014-09-09 | Paper |
How well can primal-dual and local-ratio algorithms perform?
ACM Transactions on Algorithms | 2014-09-09 | Paper |
| Price of anarchy for greedy auctions | 2014-05-22 | Paper |
| Weakly Submodular Functions | 2014-01-26 | Paper |
Computing (and Life) Is All about Tradeoffs
Lecture Notes in Computer Science | 2013-09-13 | Paper |
Toward a model for backtracking and dynamic programming
Computational Complexity | 2012-06-26 | Paper |
Special issue in memory of Misha Alekhnovich. Foreword
Computational Complexity | 2012-06-26 | Paper |
Criteria for cluster-based personalized search
Internet Mathematics | 2012-04-18 | Paper |
On sum coloring and sum multi-coloring for restricted families of graphs
Theoretical Computer Science | 2012-03-13 | Paper |
Perturbation of the hyper-linked environment
Lecture Notes in Computer Science | 2011-03-18 | Paper |
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Theory and Applications of Satisfiability Testing – SAT 2010 | 2010-09-29 | Paper |
On the limitations of greedy mechanism design for truthful combinatorial auctions
Automata, Languages and Programming | 2010-09-07 | Paper |
Randomized priority algorithms
Theoretical Computer Science | 2010-06-07 | Paper |
Priority algorithms for graph optimization problems
Theoretical Computer Science | 2009-12-01 | Paper |
Elimination Graphs
Automata, Languages and Programming | 2009-07-14 | Paper |
Priority algorithms for the subset-sum problem
Journal of Combinatorial Optimization | 2009-07-13 | Paper |
Priority Algorithms for the Subset-Sum Problem
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Cluster Based Personalized Search
Algorithms and Models for the Web-Graph | 2009-02-10 | Paper |
Further Reflections on a Theory for Basic Algorithms
Algorithmic Aspects in Information and Management | 2008-01-04 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
scientific article; zbMATH DE number 2243362 (Why is no real title available?)
(available as arXiv preprint) | 2006-01-04 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
| scientific article; zbMATH DE number 2209718 (Why is no real title available?) | 2005-09-28 | Paper |
(Incremental) priority algorithms
Algorithmica | 2005-02-11 | Paper |
Subquadratic approximation algorithms for clustering problems in high dimensional spaces
Machine Learning | 2005-01-19 | Paper |
| scientific article; zbMATH DE number 2119736 (Why is no real title available?) | 2004-11-29 | Paper |
The power of priority algorithms for facility location and set cover
Algorithmica | 2004-11-05 | Paper |
| Stability preserving transformations: Packet routing networks with edge capacities and speeds | 2004-01-14 | Paper |
| scientific article; zbMATH DE number 1947045 (Why is no real title available?) | 2003-07-07 | Paper |
On randomization in on-line computation.
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1512687 (Why is no real title available?) | 2000-10-03 | Paper |
| scientific article; zbMATH DE number 1256755 (Why is no real title available?) | 2000-04-04 | Paper |
A Time-Space Tradeoff for Undirected Graph Traversal by Walking Automata
SIAM Journal on Computing | 1999-02-22 | Paper |
| scientific article; zbMATH DE number 1232130 (Why is no real title available?) | 1998-12-09 | Paper |
Tribute to Roman Smolensky (1960--1995)
Computational Complexity | 1998-05-14 | Paper |
How much can hardware help routing?
Journal of the ACM | 1998-02-17 | Paper |
Time-space tradeoffs for undirected graph traversal by graph automata
Information and Computation | 1997-10-13 | Paper |
Competitive paging with locality of reference
Journal of Computer and System Sciences | 1995-06-08 | Paper |
An optimal on-line algorithm for metrical task system
Journal of the ACM | 1994-08-21 | Paper |
On the decidability of sparse univariate polynomial interpolation
Computational Complexity | 1993-10-10 | Paper |
On lower bounds for read-\(k\)-times branching programs
Computational Complexity | 1993-08-30 | Paper |
Lower bounds on the length of universal traversal sequences
Journal of Computer and System Sciences | 1993-01-17 | Paper |
| scientific article; zbMATH DE number 65707 (Why is no real title available?) | 1992-09-27 | Paper |
Bounds on Universal Sequences
SIAM Journal on Computing | 1989-01-01 | Paper |
Two Applications of Inductive Counting for Complementation Problems
SIAM Journal on Computing | 1989-01-01 | Paper |
A tradeoff between search and update time for the implicit dictionary problem
Theoretical Computer Science | 1988-01-01 | Paper |
A Time-Space Tradeoff for Element Distinctness
SIAM Journal on Computing | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3980480 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3956454 (Why is no real title available?) | 1986-01-01 | Paper |
Bounds for Width Two Branching Programs
SIAM Journal on Computing | 1986-01-01 | Paper |
Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences | 1985-01-01 | Paper |
Decreasing the nesting depth of expressions involving square roots
Journal of Symbolic Computation | 1985-01-01 | Paper |
Parallel computation for well-endowed rings and space-bounded probabilistic machines
Information and Control | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3784267 (Why is no real title available?) | 1982-01-01 | Paper |
Fast parallel matrix and GCD computations
Information and Control | 1982-01-01 | Paper |
A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
SIAM Journal on Computing | 1982-01-01 | Paper |
Structured vs. general models in computational complexity
L'Enseignement Mathématique. 2e Série | 1982-01-01 | Paper |
A time-space tradeoff for sorting on non-oblivious machines
Journal of Computer and System Sciences | 1981-01-01 | Paper |
Efficient searching using partial ordering
Information Processing Letters | 1981-01-01 | Paper |
On Relating Time and Space to Size and Depth
SIAM Journal on Computing | 1977-01-01 | Paper |
On the Number of Additions to Compute Specific Polynomials
SIAM Journal on Computing | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3628385 (Why is no real title available?) | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3596151 (Why is no real title available?) | 1974-01-01 | Paper |
Fast modular transforms
Journal of Computer and System Sciences | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3433440 (Why is no real title available?) | 1973-01-01 | Paper |
Computational Complexity and the Existence of Complexity Gaps
Journal of the ACM | 1972-01-01 | Paper |
Subrecursive Programming Languages, Part I
Journal of the ACM | 1972-01-01 | Paper |
Evaluating polynomials at many points
Information Processing Letters | 1971-01-01 | Paper |
