| Reshaping the Context-Free Model: Linguistic and Algorithmic Aspects. | 0 | 0.34 | 2018 |
| Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars. | 1 | 0.40 | 2013 |
| Cross-partition clustering: revealing corresponding themes across related datasets | 0 | 0.34 | 2011 |
| Reader-based exploration of lexical cohesion. | 0 | 0.34 | 2007 |
| On Lexical Cohesive Behavior of Heads of Definite Descriptions: A Case Study | 0 | 0.34 | 2006 |
| Satisfiability Decay along Conjunctions of Pseudo-Random Clauses | 0 | 0.34 | 2006 |
| Reader-based exploration of lexical cohesion. | 2 | 0.42 | 2006 |
| Lexical Cohesion: Some Implications of an Empirical Study | 0 | 0.34 | 2005 |
| A generalized framework for revealing analogous themes across related topics | 0 | 0.34 | 2005 |
| Identifying Structure across Pre-partitioned Data | 3 | 0.41 | 2003 |
| Query by committee, linear separation and random walks | 18 | 1.24 | 2002 |
| Cross-dataset Clustering: Revealing Corresponding Themes across Multiple Corpora. | 6 | 0.69 | 2002 |
| Branching-Depth Hierarchies | 2 | 0.42 | 2000 |
| Query by Committee, Linear Separation and Random Walks | 3 | 0.71 | 1999 |
| Detecting Sub-Topic Correspondence through Bipartite Term Clustering | 2 | 0.58 | 1999 |
| Sample-efficient strategies for learning in the presence of noise | 15 | 1.27 | 1999 |
| Learning with queries corrupted by classification noise | 11 | 0.90 | 1997 |
| Randomized Hypotheses and Minimum Disagreement Hypotheses for Learning with Noise | 1 | 0.41 | 1997 |
| Selective Sampling Using the Query by Committee Algorithm | 532 | 43.05 | 1997 |
| Learning by extended statistical queries and its relation to PAC learning | 5 | 0.51 | 1995 |
| Automata, Languages and Programming, 21st International Colloquium, ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings | 52 | 6.78 | 1994 |
| Finding hidden Hamiltonian cycles | 12 | 2.52 | 1994 |
| A note on a counting problem arising in percolation theory | 0 | 0.34 | 1993 |
| Information, Prediction, and Query by Committee | 43 | 24.24 | 1992 |
| Finding Hidden Hamiltonian Cycles (Extended Abstract) | 0 | 0.34 | 1991 |
| Communication aspects of networks based on geometric incidence relations | 3 | 0.48 | 1989 |
| Chromatic numbers of random hypergraphs and associated graphs | 0 | 0.34 | 1989 |
| A probabilistic approach to the load-sharing problem in distributed systems | 12 | 1.59 | 1987 |
| On the Second Eigenvalue of Random Regular Graphs (Preliminary Version) | 6 | 1.07 | 1987 |
| Component structure in the evolution of random hypergraphs | 26 | 1.88 | 1985 |
| Random hypergraph coloring algorithms and the weak chromatic number | 12 | 1.81 | 1985 |
| From Expanders to Better Superconcentrators without Cascading | 2 | 9.90 | 1984 |
| Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces | 18 | 28.76 | 1984 |
| A threshold for perfect matchings in random d-pure hypergraphs | 11 | 3.68 | 1983 |
| How many random edges make a graph Hamiltonian? | 5 | 0.86 | 1983 |
| A Fast Construction oF Disjoint Paths in Communication Networks | 3 | 0.77 | 1983 |
| N-processors graphs distributively achieve perfect matchings in O(log2N) beats | 2 | 3.02 | 1982 |
| On the Depth Complexity of Formulas. | 19 | 14.26 | 1980 |
| An Improved Program for Constructing Open Hash Tables | 8 | 1.76 | 1980 |
