default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAshok K. Chandra
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c36]Yuanhua Lv, Ariel Fuxman, Ashok K. Chandra:
Evaluation of IR Applications with Constrained Real Estate. ECIR 2014: 160-171- [c35]Ariel Fuxman, Patrick Pantel, Yuanhua Lv, Ashok K. Chandra, Pradeep Chilakamarri, Michael Gamon, David Hamilton, Bernhard Kohlmeier, Dhyanesh Narayanan, Evangelos E. Papalexakis
, Bo Zhao:
Contextual insights. WWW (Companion Volume) 2014: 265-266 - 2011
- [i1]Jim Gemmell, Benjamin I. P. Rubinstein, Ashok K. Chandra:
Improving Entity Resolution with Global Constraints. CoRR abs/1108.6016 (2011)
2000 – 2009
- 2003
- [c34]Ashok K. Chandra, Ambuj Kumar, Premala Chandra:
Propagation of 2000 MHz radio signal into a multistoreyed building through outdoor-indoor interface. PIMRC 2003: 2983-2987
1990 – 1999
- 1997
- [j28]Ashok K. Chandra, Prabhakar Raghavan, Walter L. Ruzzo, Roman Smolensky, Prasoon Tiwari:
The Electrical Resistance of a Graph Captures its Commute and Cover Times. Comput. Complex. 6(4): 312-340 (1997) - 1996
- [c33]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 - 1995
- [j27]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. Very Large Scale Integr. Syst. 3(2): 188-200 (1995) - 1994
- [c32]Ashok K. Chandra:
Supply and Demand for Computer Science PHDs (Abstract). ACM Conference on Computer Science 1994: 429 - [c31]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 - 1993
- [j26]Ashok K. Chandra:
Editor's Foreword: Selected Papers of PODS 1989. J. Comput. Syst. Sci. 47(1): 1 (1993) - 1992
- [c30]Ashok K. Chandra, Vijay S. Iyengar:
Constraint Slving for Test Case Generation. ICCD 1992: 245-248 - 1990
- [j25]Ashok K. Chandra, Martin Tompa:
The complexity of short two-person games. Discret. Appl. Math. 29(1): 21-33 (1990) - [j24]Alok Aggarwal, Ashok K. Chandra, Marc Snir:
Communication Complexity of PRAMs. Theor. Comput. Sci. 71(1): 3-28 (1990)
1980 – 1989
- 1989
- [c29]Alok Aggarwal, Ashok K. Chandra, Marc Snir:
On Communication Latency in PRAM Computations. SPAA 1989: 11-21 - [c28]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 - 1988
- [c27]Alok Aggarwal, Ashok K. Chandra:
Communication Complexity of PRAMs (Preliminary Version). ICALP 1988: 1-17 - [c26]Ashok K. Chandra:
Theory of Database Queries. PODS 1988: 1-9 - [c25]Alok Aggarwal, Ashok K. Chandra:
Virtual Memory Algorithms (Preliminary Version). STOC 1988: 173-185 - [c24]Alok Aggarwal, Ashok K. Chandra, Prabhakar Raghavan:
Energy Consumption in VLSI Circuits (Preliminary Version). STOC 1988: 205-216 - 1987
- [c23]Alok Aggarwal, Ashok K. Chandra, Marc Snir:
Hierarchical Memory with Block Transfer. FOCS 1987: 204-216 - [c22]Alok Aggarwal, Bowen Alpern, Ashok K. Chandra, Marc Snir:
A Model for Hierarchical Memory. STOC 1987: 305-314 - 1985
- [j23]Ashok K. Chandra, Steven Fortune, Richard J. Lipton:
Unbounded Fan-In Circuits and Associative Functions. J. Comput. Syst. Sci. 30(2): 222-234 (1985) - [j22]Ashok K. Chandra, David Harel:
Horn Clauses Queries and Generalizations. J. Log. Program. 2(1): 1-15 (1985) - [j21]Ashok K. Chandra, Moshe Y. Vardi:
The Implication Problem for Functional and Inclusion Dependencies is Undecidable. SIAM J. Comput. 14(3): 671-677 (1985) - [j20]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) - 1984
- [j19]Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin:
Constant Depth Reducibility. SIAM J. Comput. 13(2): 423-439 (1984) - 1983
- [j18]Ashok K. Chandra, Lawrence T. Kou, George Markowsky, Shmuel Zaks:
On Sets of Boolean n -Projections Surjective. Acta Informatica 20: 103-111 (1983) - [c21]Ashok K. Chandra, Steven Fortune, Richard J. Lipton:
Lower Bounds for Constant Depth Circuits for Prefix Problems. ICALP 1983: 109-117 - [c20]Ashok K. Chandra, Steven Fortune, Richard J. Lipton:
Unbounded Fan-in Circuits and Associative Functions. STOC 1983: 52-60 - [c19]Ashok K. Chandra, Merrick L. Furst, Richard J. Lipton:
Multi-Party Protocols. STOC 1983: 94-99 - 1982
- [j17]Ashok K. Chandra, David Harel:
Structure and Complexity of Relational Queries. J. Comput. Syst. Sci. 25(1): 99-128 (1982) - [c18]Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin:
A Complexity Theory for Unbounded Fan-In Parallelism. FOCS 1982: 1-13 - [c17]Ashok K. Chandra, David Harel:
Horn Clauses and the Fixpoint Query Hierarchy. PODS 1982: 158-163 - 1981
- [j16]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) - [j15]Ashok K. Chandra, Dexter Kozen, Larry J. Stockmeyer:
Alternation. J. ACM 28(1): 114-133 (1981) - [c16]Ashok K. Chandra:
Programming Primitives for Database Languages. POPL 1981: 50-62 - [c15]Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky:
Embedded Implicational Dependencies and their Inference Problem. STOC 1981: 342-354 - [c14]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 - 1980
- [j14]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) - [j13]Ashok K. Chandra, David Harel:
Computable Queries for Relational Data Bases. J. Comput. Syst. Sci. 21(2): 156-178 (1980) - [c13]Ashok K. Chandra, David Harel:
Structure and Complexity of Relational Queries. FOCS 1980: 333-347 - [c12]Ashok K. Chandra, David Harel:
Structure and Complexity of Relational Queries. XP1 Workshop on Database Theory 1980 - [c11]Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky:
Embedded Implicational Dependencies and their Inference Problem. XP1 Workshop on Database Theory 1980
1970 – 1979
- 1979
- [j12]Daniel S. Hirschberg, Ashok K. Chandra, Dilip V. Sarwate:
Computing Connected Components on Parallel Computers. Commun. ACM 22(8): 461-464 (1979) - [j11]H. Raymond Strong, George Markowsky, Ashok K. Chandra:
Search within a Page. J. ACM 26(3): 457-482 (1979) - [j10]Larry J. Stockmeyer, Ashok K. Chandra:
Provably Difficult Combinatorial Games. SIAM J. Comput. 8(2): 151-174 (1979) - [j9]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) - [c10]Ashok K. Chandra, David Harel:
Computable Queries for Relational Data Bases (Preliminary Report). STOC 1979: 309-318 - 1978
- [j8]Ashok K. Chandra, George Markowsky:
On the number of prime implicants. Discret. Math. 24(1): 7-11 (1978) - [c9]Ashok K. Chandra:
Computable Nondeterministic Functions. FOCS 1978: 127-131 - 1977
- [c8]Ashok K. Chandra, Philip M. Merlin:
Optimal Implementation of Conjunctive Queries in Relational Data Bases. STOC 1977: 77-90 - 1976
- [j7]Ronald V. Book, Ashok K. Chandra:
Inherently Nonplanar Automata. Acta Informatica 6: 89-94 (1976) - [j6]Ashok K. Chandra, Zohar Manna:
On the Power of Programming Features. Comput. Lang. 1(3): 219-232 (1976) - [j5]C. K. Wong, Ashok K. Chandra:
Bounds for the String Editing Problem. J. ACM 23(1): 13-16 (1976) - [j4]Ashok K. Chandra:
Generalized Program Schemas. SIAM J. Comput. 5(3): 402-413 (1976) - [j3]Ashok K. Chandra, Daniel S. Hirschberg, C. K. Wong:
Approximate Algorithms for Some Generalized Knapsack Problems. Theor. Comput. Sci. 3(3): 293-304 (1976) - [c7]Ashok K. Chandra, Larry J. Stockmeyer:
Alternation. FOCS 1976: 98-108 - [e1]Ashok K. Chandra, Detlef Wotschke, Emily P. Friedman, Michael A. Harrison:
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, May 3-5, 1976, Hershey, Pennsylvania, USA. ACM 1976 [contents] - 1975
- [j2]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) - 1974
- [j1]Ashok K. Chandra:
Independent Permutations, as Related to a Problem of Moser and a Theorem of Pólya. J. Comb. Theory A 16(1): 111-120 (1974) - [c6]Ashok K. Chandra:
Generalized Program Schemas. ICALP 1974: 562-576 - [c5]Ashok K. Chandra:
The Power of Parallelism and Nondeterminism in Programming. IFIP Congress 1974: 461-465 - [c4]Ashok K. Chandra:
Degrees of Translatability and Canonical Forms in Program Schemas: Part I. STOC 1974: 1-12 - 1973
- [b1]Ashok K. Chandra:
On the properties and applications of program schemas. Stanford University, USA, 1973 - [c3]Ashok K. Chandra:
Efficient Compilation of Linear Recursive Programs. SWAT 1973: 16-25 - [c2]Ashok K. Chandra:
On the Decision Problems of Program Schemas with Commutative and Invertable Functions. POPL 1973: 235-242 - 1972
- [c1]Ashok K. Chandra, Zohar Manna:
Program Schemas with Equality. STOC 1972: 52-64
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
