E-LIB Suche - Ergebnisse für: Chandra, Ashok K.

1

The electrical resistance of a graph captures its commute a..:

Chandra, Ashok K. ; Raghavan, Prabhakar ; Ruzzo, Walter L...
Computational Complexity. 6 (1996) 4 - p. 312-340 , 1996

Link: https://doi.org/10.1007/..

2

Editor's foreword:

Chandra, Ashok K.
Journal of Computer and System Sciences. 47 (1993) 1 - p. 1 , 1993

Link: https://doi.org/10.1016/..

3

The complexity of short two-person games:

Chandra, Ashok K. ; Tompa, Martin
Discrete Applied Mathematics. 29 (1990) 1 - p. 21-33 , 1990

Link: https://doi.org/10.1016/..

4

Communication complexity of PRAMs:

Aggarwal, Alok ; Chandra, Ashok K. ; Snir, Marc
Theoretical Computer Science. 71 (1990) 1 - p. 3-28 , 1990

Link: https://doi.org/10.1016/..

5

Theory of database queries:

, In: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems,

Chandra, Ashok K. - p. 1-9 , 1988

Link: https://dl.acm.org/doi/1..

6

Unbounded fan-in circuits and associative functions:

Chandra, Ashok K. ; Fortune, Steven ; Lipton, Richard
Journal of Computer and System Sciences. 30 (1985) 2 - p. 222-234 , 1985

Link: https://doi.org/10.1016/..

7

The Implication Problem for Functional and Inclusion Depend..:

Chandra, Ashok K. ; Vardi, Moshe Y.
SIAM Journal on Computing. 14 (1985) 3 - p. 671-677 , 1985

Link: https://doi.org/10.1137/..

8

Horn clause queries and generalizations:

Chandra, Ashok K. ; Harel, David
The Journal of Logic Programming. 2 (1985) 1 - p. 1-15 , 1985

Link: https://doi.org/10.1016/..

9

Constant Depth Reducibility:

Chandra, Ashok K. ; Stockmeyer, Larry ; Vishkin, Uzi
SIAM Journal on Computing. 13 (1984) 2 - p. 423-439 , 1984

Link: https://doi.org/10.1137/..

10

Unbounded fan-in circuits and associative functions:

, In: Proceedings of the fifteenth annual ACM symposium on Theory of computing,

Chandra, Ashok K. ; Fortune, Steven ; Lipton, Richard - p. 52-60 , 1983

Link: https://dl.acm.org/doi/1..

11

Multi-party protocols:

, In: Proceedings of the fifteenth annual ACM symposium on Theory of computing,

Chandra, Ashok K. ; Furst, Merrick L. ; Lipton, Richard J. - p. 94-99 , 1983

Link: https://dl.acm.org/doi/1..

12

A complexity theory for unbounded fan-in parallelism:

, In: 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982),

Chandra, Ashok K. ; Stockmeyer, Larry J. ; Vishkin, Uzi - p. None , 1982

Link: https://doi.org/10.1109/..

13

Horn clauses and the fixpoint query hierarchy:

, In: Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems,

Chandra, Ashok K. ; Harel, David - p. 158-163 , 1982

Link: https://dl.acm.org/doi/1..

14

Programming primitives for database languages:

, In: Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages,

Chandra, Ashok K. - p. 50-62 , 1981

Link: https://dl.acm.org/doi/1..

15

Register allocation via coloring:

Chaitin, Gregory J. ; Auslander, Marc A. ; Chandra, Ashok K....
Computer Languages. 6 (1981) 1 - p. 47-57 , 1981

Link: https://doi.org/10.1016/..