Ashok K. Chandra

According to our database1, Ashok K. Chandra
  • authored at least 65 papers between 1972 and 2014.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2014
Contextual insights.
Proceedings of the 23rd International World Wide Web Conference, 2014

Evaluation of IR Applications with Constrained Real Estate.
Proceedings of the Advances in Information Retrieval, 2014

2011
Improving Entity Resolution with Global Constraints
CoRR, 2011

2003
Propagation of 2000 MHz radio signal into a multistoreyed building through outdoor-indoor interface.
Proceedings of the IEEE 14th International Symposium on Personal, 2003

1997
The Electrical Resistance of a Graph Captures its Commute and Cover Times.
Computational Complexity, 1997

1996
Database Research: Lead, Follow, or Get Out of the Way? - Panel Abstract.
Proceedings of the Twelfth International Conference on Data Engineering, February 26, 1996

1995
AVPGEN-A test generator for architecture verification.
IEEE Trans. VLSI Syst., 1995

1994
Architectural Verification of Processors Using Symbolic Instruction Graphs.
Proceedings of the Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computer & Processors, 1994

Supply and Demand for Computer Science PHDs (Abstract).
Proceedings of the ACM 22rd Annual Computer Science Conference on Scaling up: Meeting the Challenge of Complexity in Real-World Computing Applications, 1994

1993
Editor's Foreword: Selected Papers of PODS 1989.
J. Comput. Syst. Sci., 1993

1992
Constraint Slving for Test Case Generation.
Proceedings of the Proceedings 1991 IEEE International Conference on Computer Design: VLSI in Computer & Processors, 1992

1990
Communication Complexity of PRAMs.
Theor. Comput. Sci., 1990

The complexity of short two-person games.
Discrete Applied Mathematics, 1990

1989
The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract)
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

On Communication Latency in PRAM Computations.
SPAA, 1989

1988
Energy Consumption in VLSI Circuits (Preliminary Version)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Virtual Memory Algorithms (Preliminary Version)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Theory of Database Queries.
Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1988

Communication Complexity of PRAMs (Preliminary Version).
Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

1987
A Model for Hierarchical Memory
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

Hierarchical Memory with Block Transfer
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1985
Equations Between Regular Terms and an Application to Process Logic.
SIAM J. Comput., 1985

The Implication Problem for Functional and Inclusion Dependencies is Undecidable.
SIAM J. Comput., 1985

Horn Clauses Queries and Generalizations.
J. Log. Program., 1985

Unbounded Fan-In Circuits and Associative Functions.
J. Comput. Syst. Sci., 1985

1984
Constant Depth Reducibility.
SIAM J. Comput., 1984

1983
On Sets of Boolean n -Projections Surjective.
Acta Inf., 1983

Multi-Party Protocols
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Unbounded Fan-in Circuits and Associative Functions
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Lower Bounds for Constant Depth Circuits for Prefix Problems.
Proceedings of the Automata, 1983

1982
Structure and Complexity of Relational Queries.
J. Comput. Syst. Sci., 1982

Horn Clauses and the Fixpoint Query Hierarchy.
Proceedings of the ACM Symposium on Principles of Database Systems, 1982

A Complexity Theory for Unbounded Fan-In Parallelism
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1981
Alternation.
J. ACM, 1981

Register Allocation Via Coloring.
Comput. Lang., 1981

Embedded Implicational Dependencies and their Inference Problem
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

Equations between Regular Terms and an Application to Process Logic
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

Programming Primitives for Database Languages.
Proceedings of the Conference Record of the Eighth Annual ACM Symposium on Principles of Programming Languages, 1981

1980
Computable Queries for Relational Data Bases.
J. Comput. Syst. Sci., 1980

Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time.
Inf. Process. Lett., 1980

Embedded Implicational Dependencies and their Inference Problem.
Proceedings of the XP1 Workshop on Relational Database Theory, 30 June, 1980

Structure and Complexity of Relational Queries.
Proceedings of the XP1 Workshop on Relational Database Theory, 30 June, 1980

Structure and Complexity of Relational Queries
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979
The Movement and Permutation of Columns in Magnetic Bubble Lattice Files.
IEEE Trans. Computers, 1979

Provably Difficult Combinatorial Games.
SIAM J. Comput., 1979

Search within a Page.
J. ACM, 1979

Computing Connected Components on Parallel Computers.
Commun. ACM, 1979

Computable Queries for Relational Data Bases (Preliminary Report)
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

1978
On the number of prime implicants.
Discrete Mathematics, 1978

Computable Nondeterministic Functions
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

1977
Optimal Implementation of Conjunctive Queries in Relational Data Bases
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

1976
Approximate Algorithms for Some Generalized Knapsack Problems.
Theor. Comput. Sci., 1976

Generalized Program Schemas.
SIAM J. Comput., 1976

Bounds for the String Editing Problem.
J. ACM, 1976

On the Power of Programming Features.
Comput. Lang., 1976

Inherently Nonplanar Automata.
Acta Inf., 1976

Alternation
Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1975
Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation.
SIAM J. Comput., 1975

1974
Independent Permutations, as Related to a Problem of Moser and a Theorem of Pólya.
J. Comb. Theory, Ser. A, 1974

Degrees of Translatability and Canonical Forms in Program Schemas: Part I
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

The Power of Parallelism and Nondeterminism in Programming.
IFIP Congress, 1974

Generalized Program Schemas.
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, July 29, 1974

1973
On the Decision Problems of Program Schemas with Commutative and Invertable Functions.
Proceedings of the Conference Record of the ACM Symposium on Principles of Programming Languages, 1973

Efficient Compilation of Linear Recursive Programs
Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973

1972
Program Schemas with Equality
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972


  Loading...