A. K. Chandra

Publications79
h-index36
Citations8,581
Highly Influential Citations550
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • J. Ullman
  • 429 Publications • 80,932 Citations
  • D. Harel
  • 459 Publications • 30,396 Citations
  • A. Aho
  • 176 Publications • 37,749 Citations
  • E. Codd
  • 69 Publications • 15,005 Citations
  • Publications
  • Influence
Optimal implementation of conjunctive queries in relational data bases
TLDR
We define the class of conjunctive queries in relational data bases, and the generalized join operator on relations. Expand
  • 1,310
  • 142
  • PDF
A methodology for the real world
TLDR
Register allocation may be viewed as a graph coloring problem. Expand
  • 595
  • 35
Register Allocation Via Coloring
TLDR
This paper describes the Register Allocation Phase of an experimental PL/I compiler for the IBM System/370. Expand
  • 573
  • 34
  • PDF
The electrical resistance of a graph captures its commute and cover times
TLDR
We extend known relations between random walks and electrical networks by showing that resistance in this network is intimately connected with thelengths of random walks on the graph. Expand
  • 466
  • 29
A model for hierarchical memory
In this paper we introduce the Hierarchical Memory Model (HMM) of computation. It is intended to model computers with multiple levels in the memory hierarchy. Access to memory location x is assumed… Expand
  • 266
  • 28
  • PDF
Multi-party protocols
TLDR
We study a new model, in which a collection of processes that share information about a set of integers communicate to determine a 0-1 predicate of the numbers. Expand
  • 264
  • 25
  • PDF
Computable Queries for Relational Data Bases
TLDR
We provide an abstract characterization of the class of queries which are computable, and define the completeness of a query language as the property of being precisely powerful enough to express the queries in this class. Expand
  • 497
  • 23
  • PDF
Constant Depth Reducibility
TLDR
The purpose of this paper is to study reducibilities that can be computed by combinational logic networks of polynomial size and constant depth containing AND’s, OR's and NOT's, with no bound placed on the fan-in of AND-gates and OR-Gates. Expand
  • 326
  • 23
Communication Complexity of PRAMs
TLDR
We propose a model for the concurrent read exclusive write PRAM that captures its communication and computational requirements. Expand
  • 259
  • 23
Structure and Complexity of Relational Queries
TLDR
This paper is an attempt at laying the foundations for the classification of queries on relational data bases according to their structure and their computational complexity. Expand
  • 170
  • 23
...
1
2
3
4
5
...