| Publication | Date of Publication | Type |
|---|
| Market equilibrium via a primal-dual-type algorithm | 2026-05-29 | Paper |
| On certain connectivity properties of the Internet topology | 2026-05-29 | Paper |
| Optimization problems in congestion control | 2026-05-08 | Paper |
| On the approximability of trade-offs and optimal access of web sources | 2026-05-08 | Paper |
| Game theory and mathematical economics: a theoretical computer scientist's introduction | 2026-05-08 | Paper |
| Algorithmic aspects of protein structure similarity | 2026-05-06 | Paper |
| Total functions in the polynomial hierarchy | 2026-04-15 | Paper |
| Memory bounds for continual learning | 2025-08-15 | Paper |
| Satisfiability and evolution | 2025-08-05 | Paper |
| Cook's NP-completeness paper and the dawn of the new theory | 2025-05-25 | Paper |
Computation with sequences of assemblies in a model of the brain
Neural Computation | 2025-05-21 | Paper |
| The complexity of non-stationary reinforcement learning | 2025-03-06 | Paper |
| Computation with sequences of assemblies in a model of the brain | 2025-03-06 | Paper |
An impossibility theorem in game dynamics
Proceedings of the National Academy of Sciences of the United States of America | 2025-03-06 | Paper |
| Swim till you sink: computing the limit of a game | 2025-01-31 | Paper |
Online stochastic max-weight bipartite matching: beyond prophet inequalities
Mathematics of Operations Research | 2024-11-07 | Paper |
Integral means of solutions of the one-dimensional Poisson equation with Robin boundary conditions
Journal of Mathematical Analysis and Applications | 2024-10-08 | Paper |
| Extremal combinatorics, iterated pigeonhole arguments and generalizations of PPP | 2024-09-25 | Paper |
On the difficulty of designing good classifiers
Lecture Notes in Computer Science | 2024-01-29 | Paper |
| Optimal information delivery | 2023-03-21 | Paper |
scientific article; zbMATH DE number 7650366 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| Extremal combinatorics, iterated pigeonhole arguments, and generalizations of PPP | 2022-09-15 | Paper |
| scientific article; zbMATH DE number 7559100 (Why is no real title available?) | 2022-07-18 | Paper |
Wealth Inequality and the Price of Anarchy
(available as arXiv preprint) | 2022-07-18 | Paper |
On the complexity of dynamic mechanism design
Games and Economic Behavior | 2022-07-15 | Paper |
The platform design problem
(available as arXiv preprint) | 2022-07-06 | Paper |
Bridging the gap between neurons and cognition through assemblies of neurons
Neural Computation | 2022-02-25 | Paper |
| Towards a Unified Complexity Theory of Total Functions | 2021-06-15 | Paper |
| Long term memory and the densest K-subgraph problem | 2021-06-15 | Paper |
Sex: the power of randomization
Theoretical Population Biology | 2019-10-17 | Paper |
An analytical contrast between fitness maximization and selection for mixability
Journal of Theoretical Biology | 2018-09-06 | Paper |
Locally Adaptive Optimization: Adaptive Seeding for Monotone Submodular Functions
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
On the complexity of dynamic mechanism design
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
NP-completeness: a retrospective
Automata, Languages and Programming | 2018-07-04 | Paper |
Towards a unified complexity theory of total functions
Journal of Computer and System Sciences | 2018-04-18 | Paper |
On satisfiability problems with a linear structure
(available as arXiv preprint) | 2018-04-10 | Paper |
| Cycles in adversarial regularized learning | 2018-03-15 | Paper |
Cycles in adversarial regularized learning
(available as arXiv preprint) | 2018-03-15 | Paper |
| From battlefields to elections: winning strategies of Blotto and auditing games | 2018-03-15 | Paper |
| scientific article; zbMATH DE number 6783433 (Why is no real title available?) | 2017-09-29 | Paper |
TFNP: an update
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Stathis Zachos at 70!
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Algorithms, games, and evolution
Proceedings of the National Academy of Sciences | 2017-02-16 | Paper |
Power-law distributions in a two-sided market and net neutrality
Web and Internet Economics | 2017-02-10 | Paper |
On the k-server conjecture
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
On complexity as bounded rationality (extended abstract)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Zero-sum polymatrix games: a generalization of minmax
Mathematics of Operations Research | 2016-05-19 | Paper |
From Nash equilibria to chain recurrent sets: solution concepts and topology
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Can almost everybody be almost happy?
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Strategic classification
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
On the computational complexity of limit cycles in dynamical systems
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Market equilibrium via a primal-dual algorithm for a convex program
Journal of the ACM | 2015-11-11 | Paper |
The web graph as an equilibrium
Algorithmic Game Theory | 2015-11-04 | Paper |
Map graphs
Journal of the ACM | 2015-10-30 | Paper |
On a model of indexability and its bounds for range queries
Journal of the ACM | 2015-10-30 | Paper |
Sparse covers for sums of indicators
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2015-09-14 | Paper |
On a network creation game
Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
Optimal deterministic auctions with correlated priors
Games and Economic Behavior | 2015-08-12 | Paper |
Selfish caching in distributed systems, a game-theoretic analysis
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Segmentation problems
Journal of the ACM | 2015-08-01 | Paper |
On the value of information in distributed decision-making (extended abstract)
Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 | 2015-06-19 | Paper |
Optimal coteries
Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 | 2015-06-19 | Paper |
Linear programming without the matrix
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Algorithms, games, and the internet
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Approximate Nash equilibria in anonymous games
Journal of Economic Theory | 2015-02-13 | Paper |
On oblivious PTAS's for nash equilibrium
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
The complexity of computing a Nash equilibrium
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Reducibility among equilibrium problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
| The complexity of low-distortion embeddings between point sets | 2014-10-13 | Paper |
| Computing equilibria in multi-player games | 2014-10-13 | Paper |
Worst-case equilibria
Computer Science Review | 2014-10-07 | Paper |
On the approximability of the traveling salesman problem (extended abstract)
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
Sharing the cost of muliticast transmissions (preliminary version)
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
The complexity of the homotopy method, equilibrium selection and Lemke-Howson solutions
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
A BGP-based mechanism for lowest-cost routing
Proceedings of the twenty-first annual symposium on Principles of distributed computing | 2014-07-25 | Paper |
On optimal single-item auctions
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
On Simplex Pivoting Rules and Complexity Theory
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
| Inapproximability for VCG-based combinatorial auctions | 2014-05-22 | Paper |
| Computation and intractability: echoes of Kurt Gödel | 2013-10-29 | Paper |
A BGP-based mechanism for lowest-cost routing
Distributed Computing | 2013-06-07 | Paper |
The new faces of combinatorial optimization
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Efficiency-revenue trade-offs in auctions
Automata, Languages, and Programming | 2012-11-01 | Paper |
| Logicomix. An epic search for truth. Character design and drawings by Alecos Papadatos, color by Annie Di Donna | 2012-05-11 | Paper |
| Logicomix. An epic search for truth | 2011-05-03 | Paper |
On the complexity of reconfiguration problems
Theoretical Computer Science | 2011-03-14 | Paper |
An impossibility theorem for price-adjustment mechanisms
Proceedings of the National Academy of Sciences | 2011-02-12 | Paper |
When the players are not expectation maximizers
Algorithmic Game Theory | 2010-10-19 | Paper |
On learning algorithms for Nash equilibria
Algorithmic Game Theory | 2010-10-19 | Paper |
The myth of the folk theorem
Games and Economic Behavior | 2010-09-20 | Paper |
Computing correlated equilibria in multi-player games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
The complexity of pure Nash equilibria
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
| scientific article; zbMATH DE number 5764823 (Why is no real title available?) | 2010-08-06 | Paper |
| scientific article; zbMATH DE number 5764863 (Why is no real title available?) | 2010-08-06 | Paper |
On the complexity of equilibria
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
The Joy of Theory
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Incentive-compatible interdomain routing with linear utilities
Internet Mathematics | 2010-07-09 | Paper |
The complexity of computing a Nash equilibrium
SIAM Journal on Computing | 2010-03-17 | Paper |
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
SIAM Journal on Computing | 2010-01-06 | Paper |
A Note on Strictly Competitive Games
Lecture Notes in Computer Science | 2009-12-09 | Paper |
Congestion games with malicious players
Games and Economic Behavior | 2009-08-27 | Paper |
On a Network Generalization of the Minmax Theorem
Automata, Languages and Programming | 2009-07-14 | Paper |
Algorithmic Game Theory: A Snapshot
Automata, Languages and Programming | 2009-07-14 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
A note on approximate Nash equilibria
Theoretical Computer Science | 2009-04-29 | Paper |
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Automata, Languages and Programming | 2009-03-12 | Paper |
The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games
Automata, Languages and Programming | 2009-03-12 | Paper |
On the Complexity of Reconfiguration Problems
Algorithms and Computation | 2009-01-29 | Paper |
| scientific article; zbMATH DE number 5485548 (Why is no real title available?) | 2009-01-05 | Paper |
Computing correlated equilibria in multi-player games
Journal of the ACM | 2008-12-21 | Paper |
Nash Equilibria: Where We Stand
Algorithms – ESA 2007 | 2008-09-25 | Paper |
| The complexity of finding Nash equilibria | 2008-09-12 | Paper |
Interval scheduling: A survey
Naval Research Logistics | 2008-09-12 | Paper |
The Search for Equilibrium Concepts
Algorithmic Game Theory | 2008-05-02 | Paper |
Approximately dominating representatives
Theoretical Computer Science | 2007-03-12 | Paper |
On the approximability of the traveling salesman problem
Combinatorica | 2007-01-02 | Paper |
| Worst-case equilibria | 2006-11-21 | Paper |
Recognizing hole-free 4-map graphs in cubic time
Algorithmica | 2006-08-11 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
On certain connectivity properties of the internet topology
Journal of Computer and System Sciences | 2006-04-28 | Paper |
On a conjecture related to geometric routing
Theoretical Computer Science | 2005-12-05 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Database Theory - ICDT 2005
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Algorithmic Aspects of Wireless Sensor Networks
Lecture Notes in Computer Science | 2005-08-25 | Paper |
An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents
Internet Mathematics | 2005-04-11 | Paper |
On the complexity of price equilibria
Journal of Computer and System Sciences | 2004-11-18 | Paper |
| scientific article; zbMATH DE number 2102754 (Why is no real title available?) | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2089376 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2086615 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086210 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2087242 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2079341 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2019639 (Why is no real title available?) | 2003-12-17 | Paper |
| scientific article; zbMATH DE number 2012925 (Why is no real title available?) | 2003-12-04 | Paper |
On the complexity of single-rule datalog queries.
Information and Computation | 2003-08-19 | Paper |
Auditing Boolean attributes
Journal of Computer and System Sciences | 2003-06-25 | Paper |
A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1775449 (Why is no real title available?) | 2002-09-17 | Paper |
| scientific article; zbMATH DE number 1775433 (Why is no real title available?) | 2002-09-17 | Paper |
| scientific article; zbMATH DE number 1775439 (Why is no real title available?) | 2002-08-01 | Paper |
| scientific article; zbMATH DE number 1696617 (Why is no real title available?) | 2002-07-01 | Paper |
| scientific article; zbMATH DE number 1754580 (Why is no real title available?) | 2002-06-12 | Paper |
Sharing the cost of multicast transmissions
Journal of Computer and System Sciences | 2002-02-27 | Paper |
The complexity of optimal queuing network control
Mathematics of Operations Research | 2001-11-26 | Paper |
Deciding stability and mortality of piecewise affine dynamical systems
Theoretical Computer Science | 2001-08-20 | Paper |
| scientific article; zbMATH DE number 1560337 (Why is no real title available?) | 2001-04-26 | Paper |
On approximating a scheduling problem
Journal of Combinatorial Optimization | 2001-01-01 | Paper |
Latent semantic indexing: A probabilistic analysis
Journal of Computer and System Sciences | 2000-12-19 | Paper |
Beyond Competitive Analysis
SIAM Journal on Computing | 2000-10-18 | Paper |
On the Difficulty of Designing Good Classifiers
SIAM Journal on Computing | 2000-10-18 | Paper |
| scientific article; zbMATH DE number 1405452 (Why is no real title available?) | 2000-09-26 | Paper |
Topological queries in spatial databases
Journal of Computer and System Sciences | 2000-09-05 | Paper |
Decision-making by hierarchies of discordant agents
Mathematical Programming. Series A. Series B | 2000-07-10 | Paper |
| scientific article; zbMATH DE number 1306896 (Why is no real title available?) | 2000-04-26 | Paper |
On the Floyd–Warshall algorithm for logic programs
The Journal of Logic Programming | 2000-01-04 | Paper |
| Exploring an unknown graph | 2000-01-03 | Paper |
| scientific article; zbMATH DE number 1379134 (Why is no real title available?) | 1999-12-15 | Paper |
On the complexity of database queries
Journal of Computer and System Sciences | 1999-11-09 | Paper |
| scientific article; zbMATH DE number 1354130 (Why is no real title available?) | 1999-10-31 | Paper |
Reflective relational machines
Information and Computation | 1999-08-23 | Paper |
| scientific article; zbMATH DE number 1222812 (Why is no real title available?) | 1999-02-14 | Paper |
How to learn an unknown environment. I
Journal of the ACM | 1999-01-11 | Paper |
| scientific article; zbMATH DE number 1219584 (Why is no real title available?) | 1998-11-04 | Paper |
| scientific article; zbMATH DE number 1149451 (Why is no real title available?) | 1998-05-13 | Paper |
On the <i>k</i> -server conjecture
Journal of the ACM | 1998-01-28 | Paper |
A linear programming approach to reasoning about probabilities
Annals of Mathematics and Artificial Intelligence | 1997-12-14 | Paper |
On kernels, defaults and even graphs
Annals of Mathematics and Artificial Intelligence | 1997-10-26 | Paper |
On limited nondeterminism and the complexity of the V-C dimension
Journal of Computer and System Sciences | 1997-03-31 | Paper |
Tie-breaking semantics and structural totality
Journal of Computer and System Sciences | 1997-03-18 | Paper |
Reversible simulation of space-bounded computations
Theoretical Computer Science | 1997-02-28 | Paper |
The 2-evader problem
Information Processing Letters | 1997-02-27 | Paper |
Competitive distributed decision-making
Algorithmica | 1996-11-17 | Paper |
The bisection width of grid graphs
Mathematical Systems Theory | 1996-03-18 | Paper |
Default theories that always have extensions
Artificial Intelligence | 1996-02-26 | Paper |
On the complexity of the parity argument and other inefficient proofs of existence
Journal of Computer and System Sciences | 1995-02-13 | Paper |
The weighted region problem
Journal of the ACM | 1994-11-13 | Paper |
Modularity of cycles and paths in graphs
Journal of the ACM | 1994-11-13 | Paper |
The Complexity of Multiterminal Cuts
SIAM Journal on Computing | 1994-10-17 | Paper |
| scientific article; zbMATH DE number 432787 (Why is no real title available?) | 1994-09-20 | Paper |
| scientific article; zbMATH DE number 619545 (Why is no real title available?) | 1994-09-13 | Paper |
On the Complexity of Cooperative Solution Concepts
Mathematics of Operations Research | 1994-08-21 | Paper |
| scientific article; zbMATH DE number 610968 (Why is no real title available?) | 1994-07-26 | Paper |
Designing secure communication protocols from trust specifications
Algorithmica | 1994-06-16 | Paper |
The Traveling Salesman Problem with Distances One and Two
Mathematics of Operations Research | 1993-06-29 | Paper |
Computing the throughput of a network with dedicated lines
Discrete Applied Mathematics | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 149060 (Why is no real title available?) | 1993-04-01 | Paper |
On the Optimal Bisection of a Polygon
ORSA Journal on Computing | 1993-02-25 | Paper |
| scientific article; zbMATH DE number 125484 (Why is no real title available?) | 1993-02-21 | Paper |
| scientific article; zbMATH DE number 125485 (Why is no real title available?) | 1993-02-21 | Paper |
The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
SIAM Journal on Computing | 1993-01-16 | Paper |
On the greedy algorithm for satisfiability
Information Processing Letters | 1993-01-16 | Paper |
The parallel complexity of simple logic programs
Journal of the ACM | 1993-01-01 | Paper |
On players with a bounded number of states
Games and Economic Behavior | 1992-08-03 | Paper |
Optimization, approximation, and complexity classes
Journal of Computer and System Sciences | 1992-06-28 | Paper |
Why not negation by fixpoint?
Journal of Computer and System Sciences | 1992-06-25 | Paper |
On path lengths modulo three
Journal of Graph Theory | 1992-06-25 | Paper |
Shortest paths without a map
Theoretical Computer Science | 1991-01-01 | Paper |
On total functions, existence theorems and computational complexity
Theoretical Computer Science | 1991-01-01 | Paper |
Towards an Architecture-Independent Analysis of Parallel Algorithms
SIAM Journal on Computing | 1990-01-01 | Paper |
The optimum execution order of queries in linear storage
Information Processing Letters | 1990-01-01 | Paper |
Some computational aspects of circumscription
Journal of the ACM | 1990-01-01 | Paper |
On recognizing integer polyhedra
Combinatorica | 1990-01-01 | Paper |
On the convergence of query evaluation
Journal of Computer and System Sciences | 1989-01-01 | Paper |
Corrigendum to ``The complexity of cubical graphs''
Information and Computation | 1989-01-01 | Paper |
Exponential lower bounds for finding Brouwer fixed points
Journal of Complexity | 1989-01-01 | Paper |
Finding feasible paths for a two-point body
Journal of Algorithms | 1989-01-01 | Paper |
The complexity of facets resolved
Journal of Computer and System Sciences | 1988-01-01 | Paper |
How easy is local search?
Journal of Computer and System Sciences | 1988-01-01 | Paper |
The complexity of searching a graph
Journal of the ACM | 1988-01-01 | Paper |
On generating all maximal independent sets
Information Processing Letters | 1988-01-01 | Paper |
A note on strategy elimination in bimatrix games
Operations Research Letters | 1988-01-01 | Paper |
The complexity of recognizing polyhedral scenes
Journal of Computer and System Sciences | 1988-01-01 | Paper |
The synthesis of communication protocols
Algorithmica | 1988-01-01 | Paper |
Probabilistic satisfiability
Journal of Complexity | 1988-01-01 | Paper |
Complexity characterizations of attribute grammar languages
Information and Computation | 1988-01-01 | Paper |
The Complexity of Markov Decision Processes
Mathematics of Operations Research | 1987-01-01 | Paper |
The Discrete Geodesic Problem
SIAM Journal on Computing | 1987-01-01 | Paper |
The Complexity of Reliable Concurrency Control
SIAM Journal on Computing | 1987-01-01 | Paper |
A Communication-Time Tradeoff
SIAM Journal on Computing | 1987-01-01 | Paper |
Optimal piecewise linear motion of an object among obstacles
Algorithmica | 1987-01-01 | Paper |
On Stochastic Scheduling with In-Tree Precedence Constraints
SIAM Journal on Computing | 1987-01-01 | Paper |
The 1-steiner tree problem
Journal of Algorithms | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3986679 (Why is no real title available?) | 1986-01-01 | Paper |
Algorithmic aspects of multiversion concurrency control
Journal of Computer and System Sciences | 1986-01-01 | Paper |
Searching and pebbling
Theoretical Computer Science | 1986-01-01 | Paper |
A note on succinct representations of graphs
Information and Control | 1986-01-01 | Paper |
The complexity of the travelling repairman problem
RAIRO - Theoretical Informatics and Applications | 1986-01-01 | Paper |
Intractable Problems in Control Theory
SIAM Journal on Control and Optimization | 1986-01-01 | Paper |
On the complexity of circulations
Journal of Algorithms | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3888913 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3965820 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3926663 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3918121 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 4028947 (Why is no real title available?) | 1985-01-01 | Paper |
Games against nature
Journal of Computer and System Sciences | 1985-01-01 | Paper |
An algorithm for shortest-path motion in three dimensions
Information Processing Letters | 1985-01-01 | Paper |
On negative cycles in mixed graphs
Operations Research Letters | 1985-01-01 | Paper |
The Complexity of Distributed Concurrency Control
SIAM Journal on Computing | 1985-01-01 | Paper |
Interval graphs and searching
Discrete Mathematics | 1985-01-01 | Paper |
Topological Bandwidth
SIAM Journal on Algebraic Discrete Methods | 1985-01-01 | Paper |
The complexity of cubical graphs
Information and Control | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3876926 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3950731 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3936535 (Why is no real title available?) | 1984-01-01 | Paper |
Inclusion dependencies and their interaction with functional dependencies
Journal of Computer and System Sciences | 1984-01-01 | Paper |
The complexity of facets (and some facets of complexity)
Journal of Computer and System Sciences | 1984-01-01 | Paper |
Communication complexity
Journal of Computer and System Sciences | 1984-01-01 | Paper |
The Traveling Salesman Problem with Many Visits to Few Cities
SIAM Journal on Computing | 1984-01-01 | Paper |
Is distributed locking harder?
Journal of Computer and System Sciences | 1984-01-01 | Paper |
Updates of Relational Views
Journal of the ACM | 1984-01-01 | Paper |
On two geometric problems related to the travelling salesman problem
Journal of Algorithms | 1984-01-01 | Paper |
The even-path problem for graphs and digraphs
Networks | 1984-01-01 | Paper |
On Concurrency Control by Multiple Versions
ACM Transactions on Database Systems | 1984-01-01 | Paper |
A simple criterion for structurally fixed modes
Systems & Control Letters | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3876616 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3858434 (Why is no real title available?) | 1983-01-01 | Paper |
Concurrency Control by Locking
SIAM Journal on Computing | 1983-01-01 | Paper |
An optimality theory of concurrency control for databases
Acta Informatica | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3793772 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3799016 (Why is no real title available?) | 1982-01-01 | Paper |
Hamilton Paths in Grid Graphs
SIAM Journal on Computing | 1982-01-01 | Paper |
The complexity of restricted spanning tree problems
Journal of the ACM | 1982-01-01 | Paper |
Algebraic dependencies
Journal of Computer and System Sciences | 1982-01-01 | Paper |
On Linear Characterizations of Combinatorial Optimization Problems
SIAM Journal on Computing | 1982-01-01 | Paper |
A theorem in database concurrency control
Journal of the ACM | 1982-01-01 | Paper |
Symmetric space-bounded computation
Theoretical Computer Science | 1982-01-01 | Paper |
On the complexity of designing distributed protocols
Information and Control | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3727583 (Why is no real title available?) | 1981-01-01 | Paper |
On minimal Eulerian graphs
Information Processing Letters | 1981-01-01 | Paper |
On the complexity of integer programming
Journal of the ACM | 1981-01-01 | Paper |
Worst-Case and Probabilistic Analysis of a Geometric Location Problem
SIAM Journal on Computing | 1981-01-01 | Paper |
Covering Graphs by Simple Circuits
SIAM Journal on Computing | 1981-01-01 | Paper |
The complexity of testing whether a graph is a superconcentrator
Information Processing Letters | 1981-01-01 | Paper |
A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems
Journal of Algorithms | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3692659 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3692649 (Why is no real title available?) | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3782383 (Why is no real title available?) | 1980-01-01 | Paper |
Local Search for the Asymmetric Traveling Salesman Problem
Operations Research | 1980-01-01 | Paper |
Flowshop scheduling with limited temporary storage
Journal of the ACM | 1980-01-01 | Paper |
The Complexity of Coloring Circular Arcs and Chords
SIAM Journal on Algebraic Discrete Methods | 1980-01-01 | Paper |
On the performance of balanced hashing functions when the keys are not equiprobable
ACM Transactions on Programming Languages and Systems | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3628389 (Why is no real title available?) | 1979-01-01 | Paper |
The serializability of concurrent database updates
Journal of the ACM | 1979-01-01 | Paper |
Scheduling Interval-Ordered Tasks
SIAM Journal on Computing | 1979-01-01 | Paper |
Efficient search for rationals
Information Processing Letters | 1979-01-01 | Paper |
Optimality of the Fast Fourier transform
Journal of the ACM | 1979-01-01 | Paper |
Bounds for sorting by prefix reversal
Discrete Mathematics | 1979-01-01 | Paper |
Some Examples of Difficult Traveling Salesman Problems
Operations Research | 1978-01-01 | Paper |
The adjacency relation on the traveling salesman polytope is NP-Complete
Mathematical Programming | 1978-01-01 | Paper |
The complexity of the capacitated tree problem
Networks | 1978-01-01 | Paper |
The complexity of the capacitated tree problem
Networks | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3714911 (Why is no real title available?) | 1977-01-01 | Paper |
On the Complexity of Local Search for the Traveling Salesman Problem
SIAM Journal on Computing | 1977-01-01 | Paper |
The Euclidean traveling salesman problem is NP-complete
Theoretical Computer Science | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3576997 (Why is no real title available?) | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3591383 (Why is no real title available?) | 1976-01-01 | Paper |
On the complexity of edge traversing
Journal of the ACM | 1976-01-01 | Paper |
The NP-completeness of the bandwidth minimization problem
Computing | 1976-01-01 | Paper |
