Optimal implementation of conjunctive queries in relational data bases
- A. K. Chandra, P. Merlin
- Computer ScienceSymposium on the Theory of Computing
- 4 May 1977
It is shown that while answering conjunctive queries is NP complete (general queries are PSPACE complete), one can find an implementation that is within a constant of optimal.
Alternation
- A. K. Chandra, L. Stockmeyer
- Computer Science17th Annual Symposium on Foundations of Computer…
- 1976
This work defines alternating Turing Machines which are like nondeterministic Turing Machines, except that existential and universal quantifiers alternate, and shows that while n-state alternating finite automata accept only regular sets that can be accepted by 22n-O(logn) state deterministic automata, alternating pushdown automata acceptance all languages accepted by Turing machines in deterministic exponential time.
Register Allocation Via Coloring
- G. Chaitin, M. Auslander, A. K. Chandra, J. Cocke, Martin E. Hopkins, Peter W. Markstein
- Computer ScienceComputer languages
- 1981
The electrical resistance of a graph captures its commute and cover times
- A. K. Chandra, P. Raghavan, W. L. Ruzzo, R. Smolensky, Prasoon Tiwari
- MathematicsSymposium on the Theory of Computing
- 1 February 1989
Known relations between random walks and electrical networks are extended by showing that resistance in this network is intimately connected with the lengths of random walks on the graph, and bounds on cover time obtained are better than those obtained from previous techniques such as the eigenvalues of the adjacency matrix.
Structure and complexity of relational queries
- A. K. Chandra, D. Harel
- Computer Science21st Annual Symposium on Foundations of Computer…
- 13 October 1980
A methodology for the real world
- G. Chaitin, M. Auslander, A. K. Chandra, J. Cocke, Martin E. Hopkins, Peter W. Markstein
- Computer Science
- 1981
Computable Queries for Relational Data Bases
- A. K. Chandra, D. Harel
- Computer ScienceJournal of computer and system sciences (Print)
- 1 October 1980
A model for hierarchical memory
- A. Aggarwal, B. Alpern, A. K. Chandra, M. Snir
- Computer ScienceSymposium on the Theory of Computing
- 1 January 1987
An algorithm that uses LRU policy at the successive “levels” of the memory hierarchy is shown to be optimal for arbitrary memory access time.
Communication Complexity of PRAMs
- A. Aggarwal, A. K. Chandra, M. Snir
- Computer ScienceTheoretical Computer Science
- 13 March 1990
Multi-party protocols
- A. K. Chandra, M. Furst, R. Lipton
- Computer ScienceSymposium on the Theory of Computing
- 1 December 1983
A new model is studied, in which a collection of processes P0, ..., Pk−1 that share information about a set of integers {a0, …,ak−1}, communicate to determine a 0-1 predicate of the numbers.
...
...