| Contextual insights | 2 | 0.40 | 2014 |
| Deployment of Cognitive Radio in India | 0 | 0.34 | 2014 |
| Evaluation of IR Applications with Constrained Real Estate. | 0 | 0.34 | 2014 |
| Improving Entity Resolution with Global Constraints | 4 | 0.45 | 2011 |
| Spectrum Challenges and Solutions by Cognitive Radio: An Overview | 13 | 0.75 | 2008 |
| Propagation of 2000 MHz radio signal into a multistoreyed building through outdoor-indoor interface. | 0 | 0.34 | 2003 |
| Database Research: Lead, Follow, or Get Out of the Way? - Panel Abstract | 1 | 0.59 | 1996 |
| AVPGEN—a test generator for architecture verification | 44 | 5.27 | 1995 |
| Supply and demand for computer science PHDs (abstract) | 0 | 0.34 | 1994 |
| Editor's Foreword: Selected Papers of PODS 1989 | 0 | 0.34 | 1993 |
| Constraint Slving for Test Case Generation | 13 | 7.00 | 1992 |
| Communication complexity of PRAMs | 129 | 15.30 | 1990 |
| On communication latency in PRAM computations | 76 | 9.72 | 1989 |
| The Electrical Resistance of a Graph Captures its Commute and Cover Times (Detailed Abstract) | 2 | 0.53 | 1989 |
| Communication Complexity of PRAMs (Preliminary Version) | 15 | 8.90 | 1988 |
| Theory of database queries | 94 | 82.25 | 1988 |
| Energy Consumption in VLSI Circuits (Preliminary Version) | 1 | 0.40 | 1988 |
| Virtual Memory Algorithms (Preliminary Version) | 2 | 0.55 | 1988 |
| Hierarchical memory with block transfer | 92 | 11.89 | 1987 |
| Unbounded fan-in circuits and associative functions | 57 | 5.44 | 1985 |
| The Implication Problem For Functional And Inclusion Dependencies Is Undecidable | 94 | 22.07 | 1985 |
| Equations Between Regular Terms And An Application To Process Logic | 5 | 0.52 | 1985 |
| Horn clause queries and generalizations | 182 | 107.78 | 1985 |
| Constant Depth Reducibility | 123 | 33.51 | 1984 |
| Lower Bounds for Constant Depth Circuits for Prefix Problems | 29 | 1.79 | 1983 |
| Multi-party protocols | 112 | 18.97 | 1983 |
| On Sets of Boolean n -Projections Surjective | 0 | 0.34 | 1983 |
| Structure and complexity of relational queries | 351 | 141.72 | 1982 |
| Horn clauses and the fixpoint query hierarchy | 33 | 73.25 | 1982 |
| A complexity theory for unbounded fan-in parallelism | 26 | 14.61 | 1982 |
| Alternation | 424 | 128.34 | 1981 |
| Equations between regular terms and an application to process logic | 15 | 4.72 | 1981 |
| Register allocation via coloring | 214 | 91.50 | 1981 |
| Embedded Implicational Dependencies and their Inference Problem | 49 | 16.23 | 1981 |
| Programming primitives for database languages | 76 | 63.20 | 1981 |
| Computable queries for relational data bases | 284 | 122.41 | 1980 |
| Equivalence of free boolean graphs can be decided probabilistically in polynomial time | 65 | 9.47 | 1980 |
| Provably Difficult Combinatorial Games | 63 | 18.60 | 1979 |
| Computable queries for relational data bases (Preliminary Report) | 13 | 8.30 | 1979 |
| Number Of Prime Implicants | 45 | 4.45 | 1978 |
| Computable nondeterministic functions | 15 | 20.15 | 1978 |
| Bounds for the String Editing Problem | 65 | 47.48 | 1976 |
| On the power of programming features. | 11 | 4.24 | 1976 |
| Alternation | 134 | 42.23 | 1976 |
| Inherently nonplanar automata | 0 | 0.34 | 1976 |
| Approximate algorithms for some generalized knapsack problems | 41 | 4.19 | 1976 |
| Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation | 48 | 31.97 | 1975 |
| Generalized Program Schemas | 1 | 0.42 | 1974 |
| Degrees of translatability and canonical forms in program schemas: Part I | 4 | 7.43 | 1974 |
| Independent permutations, as related to a problem of Moser and a theorem of Pólya | 11 | 8.02 | 1974 |
