The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ashok K. Chandra: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ashok K. Chandra, David Harel
    Computable Queries for Relational Data Bases. [Citation Graph (99, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:21, n:2, pp:156-178 [Journal]
  2. Ashok K. Chandra, Philip M. Merlin
    Optimal Implementation of Conjunctive Queries in Relational Data Bases [Citation Graph (95, 0)][DBLP]
    STOC, 1977, pp:77-90 [Conf]
  3. Ashok K. Chandra, David Harel
    Structure and Complexity of Relational Queries. [Citation Graph (73, 0)][DBLP]
    J. Comput. Syst. Sci., 1982, v:25, n:1, pp:99-128 [Journal]
  4. Ashok K. Chandra, David Harel
    Horn Clauses Queries and Generalizations. [Citation Graph (65, 0)][DBLP]
    J. Log. Program., 1985, v:2, n:1, pp:1-15 [Journal]
  5. Ashok K. Chandra
    Programming Primitives for Database Languages. [Citation Graph (29, 17)][DBLP]
    POPL, 1981, pp:50-62 [Conf]
  6. Ashok K. Chandra
    Theory of Database Queries. [Citation Graph (23, 42)][DBLP]
    PODS, 1988, pp:1-9 [Conf]
  7. Ashok K. Chandra, David Harel
    Horn Clauses and the Fixpoint Query Hierarchy. [Citation Graph (23, 7)][DBLP]
    PODS, 1982, pp:158-163 [Conf]
  8. Ashok K. Chandra, Moshe Y. Vardi
    The Implication Problem for Functional and Inclusion Dependencies is Undecidable. [Citation Graph (15, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:3, pp:671-677 [Journal]
  9. Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer
    Alternation. [Citation Graph (14, 0)][DBLP]
    J. ACM, 1981, v:28, n:1, pp:114-133 [Journal]
  10. Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky
    Embedded Implicational Dependencies and their Inference Problem [Citation Graph (13, 0)][DBLP]
    STOC, 1981, pp:342-354 [Conf]
  11. Ashok K. Chandra, David Harel
    Structure and Complexity of Relational Queries [Citation Graph (9, 0)][DBLP]
    FOCS, 1980, pp:333-347 [Conf]
  12. Ashok K. Chandra, David Harel
    Computable Queries for Relational Data Bases (Preliminary Report) [Citation Graph (5, 0)][DBLP]
    STOC, 1979, pp:309-318 [Conf]
  13. Alok Aggarwal, Ashok K. Chandra, Marc Snir
    Hierarchical Memory with Block Transfer [Citation Graph (2, 0)][DBLP]
    FOCS, 1987, pp:204-216 [Conf]
  14. Ashok K. Chandra, Larry J. Stockmeyer
    Alternation [Citation Graph (1, 0)][DBLP]
    FOCS, 1976, pp:98-108 [Conf]
  15. Alok Aggarwal, Ashok K. Chandra
    Communication Complexity of PRAMs (Preliminary Version). [Citation Graph (1, 0)][DBLP]
    ICALP, 1988, pp:1-17 [Conf]
  16. 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. [Citation Graph (1, 0)][DBLP]
    ICDE, 1996, pp:190- [Conf]
  17. Alok Aggarwal, Bowen Alpern, Ashok K. Chandra, Marc Snir
    A Model for Hierarchical Memory [Citation Graph (1, 0)][DBLP]
    STOC, 1987, pp:305-314 [Conf]
  18. Ashok K. Chandra, Zohar Manna
    On the Power of Programming Features. [Citation Graph (1, 0)][DBLP]
    Comput. Lang., 1976, v:1, n:3, pp:219-232 [Journal]
  19. H. Raymond Strong, George Markowsky, Ashok K. Chandra
    Search within a Page. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1979, v:26, n:3, pp:457-482 [Journal]
  20. C. K. Wong, Ashok K. Chandra
    Bounds for the String Editing Problem. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1976, v:23, n:1, pp:13-16 [Journal]
  21. Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin
    Constant Depth Reducibility. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:2, pp:423-439 [Journal]
  22. Ashok K. Chandra, C. K. Wong
    Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1975, v:4, n:3, pp:249-263 [Journal]
  23. Ashok K. Chandra
    Supply and Demand for Computer Science PHDs (Abstract). [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1994, pp:429- [Conf]
  24. Ashok K. Chandra
    Efficient Compilation of Linear Recursive Programs [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:16-25 [Conf]
  25. Ashok K. Chandra
    Computable Nondeterministic Functions [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:127-131 [Conf]
  26. Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin
    A Complexity Theory for Unbounded Fan-In Parallelism [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:1-13 [Conf]
  27. Ashok K. Chandra
    Generalized Program Schemas. [Citation Graph (0, 0)][DBLP]
    ICALP, 1974, pp:562-576 [Conf]
  28. Ashok K. Chandra, Steven Fortune, Richard J. Lipton
    Lower Bounds for Constant Depth Circuits for Prefix Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:109-117 [Conf]
  29. Ashok K. Chandra, Vijay S. Iyengar
    Constraint Slving for Test Case Generation. [Citation Graph (0, 0)][DBLP]
    ICCD, 1992, pp:245-248 [Conf]
  30. 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. [Citation Graph (0, 0)][DBLP]
    ICCD, 1994, pp:454-459 [Conf]
  31. Ashok K. Chandra
    The Power of Parallelism and Nondeterminism in Programming. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1974, pp:461-465 [Conf]
  32. Ashok K. Chandra
    On the Decision Problems of Program Schemas with Commutative and Invertable Functions. [Citation Graph (0, 0)][DBLP]
    POPL, 1973, pp:235-242 [Conf]
  33. Alok Aggarwal, Ashok K. Chandra, Marc Snir
    On Communication Latency in PRAM Computations. [Citation Graph (0, 0)][DBLP]
    SPAA, 1989, pp:11-21 [Conf]
  34. Alok Aggarwal, Ashok K. Chandra
    Virtual Memory Algorithms (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:173-185 [Conf]
  35. Alok Aggarwal, Ashok K. Chandra, Prabhakar Raghavan
    Energy Consumption in VLSI Circuits (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:205-216 [Conf]
  36. Ashok K. Chandra
    Degrees of Translatability and Canonical Forms in Program Schemas: Part I [Citation Graph (0, 0)][DBLP]
    STOC, 1974, pp:1-12 [Conf]
  37. Ashok K. Chandra, Steven Fortune, Richard J. Lipton
    Unbounded Fan-in Circuits and Associative Functions [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:52-60 [Conf]
  38. Ashok K. Chandra, Merrick L. Furst, Richard J. Lipton
    Multi-Party Protocols [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:94-99 [Conf]
  39. Ashok K. Chandra, Joseph Y. Halpern, Albert R. Meyer, Rohit Parikh
    Equations between Regular Terms and an Application to Process Logic [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:384-390 [Conf]
  40. Ashok K. Chandra, Zohar Manna
    Program Schemas with Equality [Citation Graph (0, 0)][DBLP]
    STOC, 1972, pp:52-64 [Conf]
  41. 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) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:574-586 [Conf]
  42. Ashok K. Chandra, David Harel
    Structure and Complexity of Relational Queries. [Citation Graph (0, 0)][DBLP]
    XP1 Workshop on Database Theory, 1980, pp:- [Conf]
  43. Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky
    Embedded Implicational Dependencies and their Inference Problem. [Citation Graph (0, 0)][DBLP]
    XP1 Workshop on Database Theory, 1980, pp:- [Conf]
  44. Ashok K. Chandra, Lawrence T. Kou, George Markowsky, Shmuel Zaks
    On Sets of Boolean n -Projections Surjective. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1983, v:20, n:, pp:103-111 [Journal]
  45. Ronald V. Book, Ashok K. Chandra
    Inherently Nonplanar Automata. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1976, v:6, n:, pp:89-94 [Journal]
  46. Daniel S. Hirschberg, Ashok K. Chandra, Dilip V. Sarwate
    Computing Connected Components on Parallel Computers. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1979, v:22, n:8, pp:461-464 [Journal]
  47. Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari
    The Electrical Resistance of a Graph Captures its Commute and Cover Times. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1997, v:6, n:4, pp:312-340 [Journal]
  48. Gregory J. Chaitin, Marc A. Auslander, Ashok K. Chandra, John Cocke, Martin E. Hopkins, Peter W. Markstein
    Register Allocation Via Coloring. [Citation Graph (0, 0)][DBLP]
    Comput. Lang., 1981, v:6, n:1, pp:47-57 [Journal]
  49. Manuel Blum, Ashok K. Chandra, Mark N. Wegman
    Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:2, pp:80-82 [Journal]
  50. Ashok K. Chandra
    Editor's Foreword: Selected Papers of PODS 1989. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1993, v:47, n:1, pp:1- [Journal]
  51. Ashok K. Chandra, Steven Fortune, Richard J. Lipton
    Unbounded Fan-In Circuits and Associative Functions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:30, n:2, pp:222-234 [Journal]
  52. Ashok K. Chandra
    Independent Permutations, as Related to a Problem of Moser and a Theorem of Pólya. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1974, v:16, n:1, pp:111-120 [Journal]
  53. Ashok K. Chandra
    Generalized Program Schemas. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1976, v:5, n:3, pp:402-413 [Journal]
  54. Rohit Parikh, Ashok K. Chandra, Joseph Y. Halpern, Albert R. Meyer
    Equations Between Regular Terms and an Application to Process Logic. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:935-942 [Journal]
  55. Larry J. Stockmeyer, Ashok K. Chandra
    Provably Difficult Combinatorial Games. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:2, pp:151-174 [Journal]
  56. Ashok K. Chandra, C. K. Wong
    The Movement and Permutation of Columns in Magnetic Bubble Lattice Files. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1979, v:28, n:1, pp:8-15 [Journal]
  57. Alok Aggarwal, Ashok K. Chandra, Marc Snir
    Communication Complexity of PRAMs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:71, n:1, pp:3-28 [Journal]
  58. Ashok K. Chandra, Daniel S. Hirschberg, C. K. Wong
    Approximate Algorithms for Some Generalized Knapsack Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1976, v:3, n:3, pp:293-304 [Journal]
  59. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. VLSI Syst., 1995, v:3, n:2, pp:188-200 [Journal]

  60. The complexity of short two-person games. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002