Ashok K. Chandra

Jim Gemmell, Benjamin I. P. Rubinstein, Ashok K. Chandra: Improving Entity Resolution with Global Constraints. CoRR abs/1108.6016 (2011)

Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari: The Electrical Resistance of a Graph Captures its Commute and Cover Times. Computational Complexity 6(4): 312-340 (1997)

Surajit Chaudhuri, Ashok K. Chandra, Umeshwar Dayal, Jim Gray, Michael Stonebraker, Gio Wiederhold, Moshe Y. Vardi: Database Research: Lead, Follow, or Get Out of the Way? - Panel Abstract. ICDE 1996: 190

Ashok K. Chandra, Vijay S. Iyengar, D. Jameson, R. V. Jawalekar, Indira Nair, Barry K. Rosen, Michael P. Mullen, J. Yoon, R. Armoni, Daniel Geist, Yaron Wolfsthal: AVPGEN-A test generator for architecture verification. IEEE Trans. VLSI Syst. 3(2): 188-200 (1995)

Ashok K. Chandra: Supply and Demand for Computer Science PHDs (Abstract). ACM Conference on Computer Science 1994: 429

Ashok K. Chandra, Vijay S. Iyengar, R. V. Jawalekar, Michael P. Mullen, Indira Nair, Barry K. Rosen: Architectural Verification of Processors Using Symbolic Instruction Graphs. ICCD 1994: 454-459

Ashok K. Chandra: Editor's Foreword: Selected Papers of PODS 1989. J. Comput. Syst. Sci. 47(1): 1 (1993)

Ashok K. Chandra, Vijay S. Iyengar: Constraint Slving for Test Case Generation. ICCD 1992: 245-248

Ashok K. Chandra, Martin Tompa: The complexity of short two-person games. Discrete Applied Mathematics 29(1): 21-33 (1990)

Alok Aggarwal, Ashok K. Chandra, Marc Snir: Communication Complexity of PRAMs. Theor. Comput. Sci. 71(1): 3-28 (1990)

Alok Aggarwal, Ashok K. Chandra, Marc Snir: On Communication Latency in PRAM Computations. SPAA 1989: 11-21

Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari: The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract). STOC 1989: 574-586

Alok Aggarwal, Ashok K. Chandra: Communication Complexity of PRAMs (Preliminary Version). ICALP 1988: 1-17

Ashok K. Chandra: Theory of Database Queries. PODS 1988: 1-9

Alok Aggarwal, Ashok K. Chandra: Virtual Memory Algorithms (Preliminary Version). STOC 1988: 173-185

Alok Aggarwal, Ashok K. Chandra, Prabhakar Raghavan: Energy Consumption in VLSI Circuits (Preliminary Version). STOC 1988: 205-216

Alok Aggarwal, Ashok K. Chandra, Marc Snir: Hierarchical Memory with Block Transfer. FOCS 1987: 204-216

Alok Aggarwal, Bowen Alpern, Ashok K. Chandra, Marc Snir: A Model for Hierarchical Memory. STOC 1987: 305-314

Ashok K. Chandra, Steven Fortune, Richard J. Lipton: Unbounded Fan-In Circuits and Associative Functions. J. Comput. Syst. Sci. 30(2): 222-234 (1985)

Ashok K. Chandra, David Harel: Horn Clauses Queries and Generalizations. J. Log. Program. 2(1): 1-15 (1985)

Ashok K. Chandra, Moshe Y. Vardi: The Implication Problem for Functional and Inclusion Dependencies is Undecidable. SIAM J. Comput. 14(3): 671-677 (1985)

Rohit Parikh, Ashok K. Chandra, Joseph Y. Halpern, Albert R. Meyer: Equations Between Regular Terms and an Application to Process Logic. SIAM J. Comput. 14(4): 935-942 (1985)

Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin: Constant Depth Reducibility. SIAM J. Comput. 13(2): 423-439 (1984)

Ashok K. Chandra, Lawrence T. Kou, George Markowsky, Shmuel Zaks: On Sets of Boolean n -Projections Surjective. Acta Inf. 20: 103-111 (1983)

Ashok K. Chandra, Steven Fortune, Richard J. Lipton: Lower Bounds for Constant Depth Circuits for Prefix Problems. ICALP 1983: 109-117

Ashok K. Chandra, Steven Fortune, Richard J. Lipton: Unbounded Fan-in Circuits and Associative Functions. STOC 1983: 52-60

Ashok K. Chandra, Merrick L. Furst, Richard J. Lipton: Multi-Party Protocols. STOC 1983: 94-99

Ashok K. Chandra, David Harel: Structure and Complexity of Relational Queries. J. Comput. Syst. Sci. 25(1): 99-128 (1982)

Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin: A Complexity Theory for Unbounded Fan-In Parallelism. FOCS 1982: 1-13

Ashok K. Chandra, David Harel: Horn Clauses and the Fixpoint Query Hierarchy. PODS 1982: 158-163

Gregory J. Chaitin, Marc A. Auslander, Ashok K. Chandra, John Cocke, Martin E. Hopkins, Peter W. Markstein: Register Allocation Via Coloring. Comput. Lang. 6(1): 47-57 (1981)

Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer: Alternation. J. ACM 28(1): 114-133 (1981)

Ashok K. Chandra: Programming Primitives for Database Languages. POPL 1981: 50-62

Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky: Embedded Implicational Dependencies and their Inference Problem. STOC 1981: 342-354

Ashok K. Chandra, Joseph Y. Halpern, Albert R. Meyer, Rohit Parikh: Equations between Regular Terms and an Application to Process Logic. STOC 1981: 384-390

Manuel Blum, Ashok K. Chandra, Mark N. Wegman: Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time. Inf. Process. Lett. 10(2): 80-82 (1980)

Ashok K. Chandra, David Harel: Computable Queries for Relational Data Bases. J. Comput. Syst. Sci. 21(2): 156-178 (1980)

Ashok K. Chandra, David Harel: Structure and Complexity of Relational Queries. FOCS 1980: 333-347

Ashok K. Chandra, David Harel: Structure and Complexity of Relational Queries. XP1 Workshop on Database Theory 1980

Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky: Embedded Implicational Dependencies and their Inference Problem. XP1 Workshop on Database Theory 1980

Daniel S. Hirschberg, Ashok K. Chandra, Dilip V. Sarwate: Computing Connected Components on Parallel Computers. Commun. ACM 22(8): 461-464 (1979)

H. Raymond Strong, George Markowsky, Ashok K. Chandra: Search within a Page. J. ACM 26(3): 457-482 (1979)

Larry J. Stockmeyer, Ashok K. Chandra: Provably Difficult Combinatorial Games. SIAM J. Comput. 8(2): 151-174 (1979)

Ashok K. Chandra, C. K. Wong: The Movement and Permutation of Columns in Magnetic Bubble Lattice Files. IEEE Trans. Computers 28(1): 8-15 (1979)

Ashok K. Chandra, David Harel: Computable Queries for Relational Data Bases (Preliminary Report). STOC 1979: 309-318

Ashok K. Chandra: Computable Nondeterministic Functions. FOCS 1978: 127-131

Ashok K. Chandra, Philip M. Merlin: Optimal Implementation of Conjunctive Queries in Relational Data Bases. STOC 1977: 77-90

Ronald V. Book, Ashok K. Chandra: Inherently Nonplanar Automata. Acta Inf. 6: 89-94 (1976)

Ashok K. Chandra, Zohar Manna: On the Power of Programming Features. Comput. Lang. 1(3): 219-232 (1976)

C. K. Wong, Ashok K. Chandra: Bounds for the String Editing Problem. J. ACM 23(1): 13-16 (1976)

Ashok K. Chandra: Generalized Program Schemas. SIAM J. Comput. 5(3): 402-413 (1976)

Ashok K. Chandra, Daniel S. Hirschberg, C. K. Wong: Approximate Algorithms for Some Generalized Knapsack Problems. Theor. Comput. Sci. 3(3): 293-304 (1976)

Ashok K. Chandra, Larry J. Stockmeyer: Alternation. FOCS 1976: 98-108

Ashok K. Chandra, Detlef Wotschke, Emily P. Friedman, Michael A. Harrison (Eds.): Proceedings of the 8th Annual ACM Symposium on Theory of Computing, May 3-5, 1976, Hershey, Pennsylvania, USA. ACM 1976

Ashok K. Chandra, C. K. Wong: Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation. SIAM J. Comput. 4(3): 249-263 (1975)

Ashok K. Chandra: Independent Permutations, as Related to a Problem of Moser and a Theorem of Pólya. J. Comb. Theory, Ser. A 16(1): 111-120 (1974)

Ashok K. Chandra: Generalized Program Schemas. ICALP 1974: 562-576

Ashok K. Chandra: The Power of Parallelism and Nondeterminism in Programming. IFIP Congress 1974: 461-465

Ashok K. Chandra: Degrees of Translatability and Canonical Forms in Program Schemas: Part I. STOC 1974: 1-12

Ashok K. Chandra: Efficient Compilation of Linear Recursive Programs. SWAT (FOCS) 1973: 16-25

Ashok K. Chandra: On the Decision Problems of Program Schemas with Commutative and Invertable Functions. POPL 1973: 235-242

Ashok K. Chandra, Zohar Manna: Program Schemas with Equality. STOC 1972: 52-64