| Publication | Date of Publication | Type |
|---|
Near-perfect token distribution
Automata, Languages and Programming | 2019-12-04 | Paper |
Two-Sided, Unbiased Version of Hall’s Marriage Theorem
The American Mathematical Monthly | 2018-07-13 | Paper |
| Reshaping the context-free model: linguistic and algorithmic aspects | 2018-06-26 | Paper |
| Almost optimal Boolean matrix multiplication [BMM]-by multi-encoding of rows and columns | 2018-06-23 | Paper |
| Completing Partial Latin Squares - Alternative Proof | 2016-05-19 | Paper |
Branching-depth hierarchies
Electronic Notes in Theoretical Computer Science | 2013-04-26 | Paper |
Pumping, Shrinking and Pronouns: From Context Free to Indexed Grammars
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Satisfiability Decay along Conjunctions of Pseudo-Random Clauses
Logic Journal of the IGPL | 2007-02-15 | Paper |
10.1162/jmlr.2003.3.4-5.747
CrossRef Listing of Deleted DOIs | 2005-03-08 | Paper |
Sample-efficient strategies for learning in the presence of noise
Journal of the ACM | 2005-01-25 | Paper |
Query by committee, linear separation and random walks.
Theoretical Computer Science | 2002-07-15 | Paper |
Learning with queries corrupted by classification noise
Discrete Applied Mathematics | 1999-09-22 | Paper |
Selective sampling using the query by committee algorithm
Machine Learning | 1997-10-07 | Paper |
| scientific article; zbMATH DE number 747044 (Why is no real title available?) | 1995-07-20 | Paper |
Finding hidden hamiltonian cycles
Random Structures & Algorithms | 1995-03-20 | Paper |
Near‐perfect token distribution
Random Structures & Algorithms | 1994-11-08 | Paper |
| scientific article; zbMATH DE number 426338 (Why is no real title available?) | 1994-06-06 | Paper |
Connectivity and dynamics for random subgraphs of the directed cube
Israel Journal of Mathematics | 1993-12-07 | Paper |
A note on a counting problem arising in percolation theory
Discrete Mathematics | 1993-10-24 | Paper |
Communication aspects of networks based on geometric incidence relations
Theoretical Computer Science | 1989-01-01 | Paper |
Component structure in the evolution of random hypergraphs
Combinatorica | 1985-01-01 | Paper |
Random hypergraph coloring algorithms and the weak chromatic number
Journal of Graph Theory | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3883622 (Why is no real title available?) | 1985-01-01 | Paper |
Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces
Journal of Algorithms | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3864514 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3825200 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3817041 (Why is no real title available?) | 1983-01-01 | Paper |
A threshold for perfect matchings in random d-pure hypergraphs
Discrete Mathematics | 1983-01-01 | Paper |
How many random edges make a graph Hamiltonian?
Combinatorica | 1983-01-01 | Paper |
On the depth complexity of formulas
Mathematical Systems Theory | 1980-01-01 | Paper |
