Ashok K. Chandra
#28,989
Most Influential Person Now
American computer scientist
Ashok K. Chandra's AcademicInfluence.com Rankings
Ashok K. Chandracomputer-science Degrees
Computer Science
#1726
World Rank
#1789
Historical Rank
Database
#1816
World Rank
#1904
Historical Rank
Download Badge
Computer Science
Ashok K. Chandra's Degrees
- PhD Computer Science Stanford University
- Masters Computer Science Stanford University
Similar Degrees You Can Earn
Why Is Ashok K. Chandra Influential?
(Suggest an Edit or Addition)According to Wikipedia, Ashok K. Chandra was a computer scientist at Microsoft Research in Mountain View, California, United States, where he was a general manager at the Internet Services Research Center. Chandra received his PhD in Computer Science from Stanford University, an MS from University of California, Berkeley, and a BTech from IIT Kanpur. He was previously Director of Database and Distributed Systems at IBM Almaden Research Center.
Ashok K. Chandra's Published Works
Published Works
- Optimal implementation of conjunctive queries in relational data bases (1977) (1360)
- Alternation (1976) (810)
- The electrical resistance of a graph captures its commute and cover times (1989) (660)
- Register Allocation Via Coloring (1981) (619)
- A methodology for the real world (1981) (591)
- Structure and complexity of relational queries (1980) (584)
- Computable Queries for Relational Data Bases (1980) (481)
- Horn Clauses Queries and Generalizations (1985) (342)
- Constant Depth Reducibility (1984) (308)
- Multi-party protocols (1983) (271)
- A model for hierarchical memory (1987) (265)
- Communication Complexity of PRAMs (1990) (262)
- Computing connected components on parallel computers (1979) (256)
- Hierarchical memory with block transfer (1987) (200)
- Register allocation via graph coloring (1981) (180)
- On communication latency in PRAM computations (1989) (176)
- The Implication Problem for Functional and Inclusion Dependencies is Undecidable (1985) (167)
- Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time (1980) (141)
- Bounds for the String Editing Problem (1976) (128)
- Provably Difficult Combinatorial Games (1979) (125)
- Embedded implicational dependencies and their inference problem (1981) (124)
- Unbounded fan-in circuits and associative functions (1983) (115)
- Theory of database queries (1988) (113)
- Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation (1975) (112)
- On the number of prime implicants (1978) (102)
- Programming primitives for database languages (1981) (90)
- Approximate Algorithms for Some Generalized Knapsack Problems (1976) (89)
- AVPGEN-A test generator for architecture verification (1995) (76)
- Intrinsically Difficult Problems (1979) (70)
- Efficient Compilation of Linear Recursive Programs (1973) (53)
- Horn clauses and the fixpoint query hierarchy (1982) (50)
- Lower Bounds for Constant Depth Circuits for Prefix Problems (1983) (46)
- Constraint solving for test case generation: a technique for high-level design verification (1992) (43)
- Equations between regular terms and an application to process logic (1981) (40)
- A complexity theory for unbounded fan-in parallelism (1982) (40)
- Computable nondeterministic functions (1978) (29)
- Virtual memory algorithms (1988) (28)
- Energy consumption in VLSI circuits (1988) (24)
- On the Power of Programming Features (1976) (22)
- Computable queries for relational data bases (Preliminary Report) (1979) (22)
- On the properties and applications of program schemas (1973) (20)
- On sets of Boolean n-vectors with all k-projections surjective (1983) (18)
- Program schemas with equality (1972) (18)
- Independent Permutations, as Related to a Problem of Moser and a Theorem of Pólya (1974) (18)
- Architectural verification of processors using symbolic instruction graphs (1994) (17)
- Bin Packing with Geometric Constraints in Computer Network Design (1978) (15)
- Improving Entity Resolution with Global Constraints (2011) (15)
- Constraint Slving for Test Case Generation (1992) (12)
- The complexity of short two-person games (1990) (10)
- The Power of Parallelism and Nondeterminism in Programming (1974) (10)
- Search within a Page (1979) (10)
- Inherently nonplanar automata (1976) (9)
- Contextual insights (2014) (8)
- Degrees of translatability and canonical forms in program schemas: Part I (1974) (8)
- On the Solution of Moser's Problem in Four Dimensions (1973) (8)
- The Movement and Permutation of Columns in Magnetic Bubble Lattice Files (1979) (7)
- Generalized Program Schemas (1974) (5)
- On the decision problems of program schemas with commutative and invertible functions (1973) (4)
- Communication Complexity of PRAMs (Preliminary Version) (1988) (4)
- Energy Consumption in VLSI Circuits (Preliminary Version) (1988) (2)
- Virtual Memory Algorithms (Preliminary Version) (1988) (2)
- Database Research: Lead, Follow, or Get Out of the Way? - Panel Abstract (1996) (2)
- 5. Conclusion and Open Problems Step 4.3 for Each Internal Node Build Tablem , 1 for Array M in M , Level of the Tree Number of Children per Node (0)
- Evaluation of IR Applications with Constrained Real Estate (2014) (0)
- Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1993) (0)
- Supply and demand for computer science PHDs (abstract) (1994) (0)
- Who needs to verify programs if you can test them (1985) (0)
- Editor's Foreword: Selected Papers of PODS 1989 (1993) (0)
- On Sets of Boolean n -Projections Surjective (1983) (0)
- The Movement and PermutationofColumns in Magnetic Bubble LatticeFiles (1979) (0)
- Selected papers of the 23rd annual ACM symposium on Theory of computing (1995) (0)
- TheBestNurturers in Computer Science Research (2005) (0)
- Multiparty Communication Complexity of Regular Languages (2007) (0)
- COMMUNICAI ’ ION COMPLEXITY OF PRAMS (2002) (0)
This paper list is powered by the following services:
Other Resources About Ashok K. Chandra
What Schools Are Affiliated With Ashok K. Chandra?
Ashok K. Chandra is affiliated with the following schools: