The following pages link to Christos H. Papadimitriou (Q222484):
Displaying 50 items.
- (Q458477) (redirect page) (← links)
- (Q1223123) (redirect page) (← links)
- Worst-case equilibria (Q458478) (← links)
- Sparse covers for sums of indicators (Q495555) (← links)
- Algorithmic aspects of multiversion concurrency control (Q579971) (← links)
- On the complexity of reconfiguration problems (Q631762) (← links)
- Reversible simulation of space-bounded computations (Q673645) (← links)
- Tie-breaking semantics and structural totality (Q676419) (← links)
- An optimality theory of concurrency control for databases (Q786557) (← links)
- On total functions, existence theorems and computational complexity (Q808245) (← links)
- Shortest paths without a map (Q809612) (← links)
- Congestion games with malicious players (Q834852) (← links)
- Approximately dominating representatives (Q870264) (← links)
- Exponential lower bounds for finding Brouwer fixed points (Q911230) (← links)
- The optimum execution order of queries in linear storage (Q917278) (← links)
- On the convergence of query evaluation (Q919818) (← links)
- The myth of the folk theorem (Q993783) (← links)
- A note on approximate Nash equilibria (Q1014628) (← links)
- Interval graphs and searching (Q1059088) (← links)
- The complexity of facets (and some facets of complexity) (Q1061485) (← links)
- Is distributed locking harder? (Q1061510) (← links)
- Games against nature (Q1069296) (← links)
- Communication complexity (Q1069701) (← links)
- On negative cycles in mixed graphs (Q1071027) (← links)
- Inclusion dependencies and their interaction with functional dependencies (Q1071523) (← links)
- An algorithm for shortest-path motion in three dimensions (Q1082820) (← links)
- The synthesis of communication protocols (Q1098296) (← links)
- Optimal piecewise linear motion of an object among obstacles (Q1098643) (← links)
- A note on strategy elimination in bimatrix games (Q1102210) (← links)
- Probabilistic satisfiability (Q1104751) (← links)
- On generating all maximal independent sets (Q1108809) (← links)
- The complexity of facets resolved (Q1109565) (← links)
- How easy is local search? (Q1109573) (← links)
- The complexity of recognizing polyhedral scenes (Q1109582) (← links)
- Complexity characterizations of attribute grammar languages (Q1120290) (← links)
- On minimal Eulerian graphs (Q1162523) (← links)
- The complexity of testing whether a graph is a superconcentrator (Q1162529) (← links)
- Symmetric space-bounded computation (Q1167537) (← links)
- Algebraic dependencies (Q1168760) (← links)
- Why not negation by fixpoint? (Q1176286) (← links)
- Optimization, approximation, and complexity classes (Q1186548) (← links)
- On players with a bounded number of states (Q1187868) (← links)
- On the greedy algorithm for satisfiability (Q1198012) (← links)
- The NP-completeness of the bandwidth minimization problem (Q1223124) (← links)
- The Euclidean traveling salesman problem is NP-complete (Q1250163) (← links)
- Bounds for sorting by prefix reversal (Q1253928) (← links)
- Efficient search for rationals (Q1259410) (← links)
- Reflective relational machines (Q1271557) (← links)
- Topological queries in spatial databases (Q1305920) (← links)
- On the complexity of database queries (Q1307689) (← links)
- Designing secure communication protocols from trust specifications (Q1322565) (← links)
