| Publication | Date of Publication | Type |
|---|
Efficient Dynamic-Resharing “Verifiable Secret Sharing” against mobile adversary
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Optimal parallel algorithms for periods, palindromes and squares (extended abstract)
Automata, Languages and Programming | 2019-12-04 | Paper |
Lower bounds on algebraic random access machines
Automata, Languages and Programming | 2019-01-10 | Paper |
Sensing versus nonsensing automata
Automata, Languages and Programming | 2019-01-10 | Paper |
Real-time streaming string-matching
ACM Transactions on Algorithms | 2018-10-30 | Paper |
| scientific article; zbMATH DE number 6791305 (Why is no real title available?) | 2017-10-13 | Paper |
Separator based sparsification for dynamic planar graph algorithms
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Real-time streaming string-matching
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Eavesdropping games
Journal of the ACM | 2008-05-05 | Paper |
Three-Dimensional Periodicity and Its Application to Pattern Matching
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
Fully dynamic planarity testing with applications
Journal of the ACM | 2005-01-25 | Paper |
Lower bounds for dynamic data structures on algebraic RAMs
Algorithmica | 2002-05-21 | Paper |
Topological lower bounds on algebraic random access machines
SIAM Journal on Computing | 2002-04-23 | Paper |
| scientific article; zbMATH DE number 1263226 (Why is no real title available?) | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1263250 (Why is no real title available?) | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1256679 (Why is no real title available?) | 2002-01-20 | Paper |
| scientific article; zbMATH DE number 1256641 (Why is no real title available?) | 2002-01-17 | Paper |
A generalization of a lower bound technique due to Fredman and Saks
Algorithmica | 2001-09-19 | Paper |
| scientific article; zbMATH DE number 1306905 (Why is no real title available?) | 2000-04-26 | Paper |
| scientific article; zbMATH DE number 1414294 (Why is no real title available?) | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1256660 (Why is no real title available?) | 1999-04-22 | Paper |
Separator-Based Sparsification II: Edge and Vertex Connectivity
SIAM Journal on Computing | 1998-09-21 | Paper |
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM | 1998-02-17 | Paper |
Constant-Time Randomized Parallel String Matching
SIAM Journal on Computing | 1998-02-10 | Paper |
A constant-time optimal parallel string-matching algorithm
Journal of the ACM | 1998-01-28 | Paper |
All pairs shortest distances for graphs with small integer length edges
Information and Computation | 1998-01-12 | Paper |
All pairs shortest paths for graphs with small integer length edges
Journal of Computer and System Sciences | 1997-12-08 | Paper |
On the exponent of all pairs shortest path problem
Journal of Computer and System Sciences | 1997-12-08 | Paper |
When can we sort in o(n n) time?
Journal of Computer and System Sciences | 1997-08-03 | Paper |
Parallel detection of all palindromes in a string
Theoretical Computer Science | 1997-02-28 | Paper |
Alphabet-Independent Two-Dimensional Witness Computation
SIAM Journal on Computing | 1996-11-07 | Paper |
Separator based sparsification. I: Planarity testing and minimum spanning trees
Journal of Computer and System Sciences | 1996-07-16 | Paper |
Finding all periods and initial palindromes of a string in parallel
Algorithmica | 1996-03-11 | Paper |
Dynamic dictionary matching
Journal of Computer and System Sciences | 1996-02-26 | Paper |
| scientific article; zbMATH DE number 826050 (Why is no real title available?) | 1995-12-13 | Paper |
| scientific article; zbMATH DE number 826057 (Why is no real title available?) | 1995-12-13 | Paper |
Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency
Journal of Parallel and Distributed Computing | 1995-09-14 | Paper |
Sparse dynamic programming II
Journal of the ACM | 1995-07-13 | Paper |
On the power of the shift instruction
Information and Computation | 1995-05-28 | Paper |
Faster tree pattern matching
Journal of the ACM | 1995-02-13 | Paper |
Sparse dynamic programming I
Journal of the ACM | 1994-08-21 | Paper |
On pointers versus addresses
Journal of the ACM | 1994-08-21 | Paper |
Efficient comparison based string matching
Journal of Complexity | 1994-01-23 | Paper |
| scientific article; zbMATH DE number 432798 (Why is no real title available?) | 1993-12-15 | Paper |
| scientific article; zbMATH DE number 403944 (Why is no real title available?) | 1993-09-05 | Paper |
On the power of multiple reads in a chip
Information and Computation | 1993-08-30 | Paper |
Witnesses for Boolean matrix multiplication and for transitive closure
Journal of Complexity | 1993-08-24 | Paper |
| scientific article; zbMATH DE number 176746 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 176775 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 176777 (Why is no real title available?) | 1993-05-18 | Paper |
Maintaining the 3-Edge-Connected Components of a Graph On-Line
SIAM Journal on Computing | 1993-05-16 | Paper |
Fully Dynamic Algorithms for 2-Edge Connectivity
SIAM Journal on Computing | 1993-03-09 | Paper |
On the Exact Complexity of String Matching: Upper Bounds
SIAM Journal on Computing | 1993-01-16 | Paper |
A Lower Bound for Parallel String Matching
SIAM Journal on Computing | 1992-12-06 | Paper |
Dynamic programming with convexity, concavity and sparsity
Theoretical Computer Science | 1992-09-26 | Paper |
On the space complexity of some algorithms for sequence comparison
Theoretical Computer Science | 1992-06-28 | Paper |
On the Exact Complexity of String Matching: Lower Bounds
SIAM Journal on Computing | 1992-06-27 | Paper |
An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem
SIAM Journal on Computing | 1992-06-27 | Paper |
Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. II: The algebra \(G[u]/\langle{} u^ n \rangle\)
Theoretical Computer Science | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 4187095 (Why is no real title available?) | 1991-01-01 | Paper |
A note on set union with arbitrary deunions
Information Processing Letters | 1991-01-01 | Paper |
Two lower bounds in asynchronous distributed computation
Journal of Computer and System Sciences | 1991-01-01 | Paper |
An Improved Algorithm For Approximate String Matching
SIAM Journal on Computing | 1990-01-01 | Paper |
An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm
SIAM Journal on Computing | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4126696 (Why is no real title available?) | 1990-01-01 | Paper |
A linear-time algorithm for concave one-dimensional dynamic programming
Information Processing Letters | 1990-01-01 | Paper |
Parallel evaluation of the determinant and of the inverse of a matrix
Information Processing Letters | 1989-01-01 | Paper |
Speeding up dynamic programming with applications to molecular biology
Theoretical Computer Science | 1989-01-01 | Paper |
On nontrivial separators for k-page graphs and simulations by nondeterministic one-tape Turing machines
Journal of Computer and System Sciences | 1989-01-01 | Paper |
Solving dense subset-sum problems by using analytical number theory
Journal of Complexity | 1989-01-01 | Paper |
On 3-pushdown graphs with large separators
Combinatorica | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4131653 (Why is no real title available?) | 1989-01-01 | Paper |
Minimum-Knowledge Interactive Proofs for Decision Problems
SIAM Journal on Computing | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4119620 (Why is no real title available?) | 1989-01-01 | Paper |
On finding most uniform spanning trees
Discrete Applied Mathematics | 1988-01-01 | Paper |
Data structures and algorithms for approximate string matching
Journal of Complexity | 1988-01-01 | Paper |
Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. I: The algebra \(G[u]/<Q(u)^{\ell}>\), \(\ell >1\)
Theoretical Computer Science | 1988-01-01 | Paper |
Improved processor bounds for combinatorial problems in RNC
Combinatorica | 1988-01-01 | Paper |
An <i>O</i> (n <sup>2</sup> (m + <i>N</i> log <i>n</i> )log <i>n</i> ) min-cost flow algorithm
Journal of the ACM | 1988-01-01 | Paper |
Distributed algorithms in synchronous broadcasting networks
Theoretical Computer Science | 1987-01-01 | Paper |
Lower bounds on communication complexity
Information and Computation | 1987-01-01 | Paper |
Parallel string matching with k mismatches
Theoretical Computer Science | 1987-01-01 | Paper |
Partitioned encryption and achieving simultaneity by partitioning
Information Processing Letters | 1987-01-01 | Paper |
Better expanders and superconcentrators
Journal of Algorithms | 1987-01-01 | Paper |
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
Combinatorica | 1986-01-01 | Paper |
An O(EV\log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs
SIAM Journal on Computing | 1986-01-01 | Paper |
Efficient algorithms for finding maximum matching in graphs
ACM Computing Surveys | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4037188 (Why is no real title available?) | 1986-01-01 | Paper |
Optimal parallel algorithms for string matching
Information and Control | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3982538 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3984596 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3990833 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3894470 (Why is no real title available?) | 1985-01-01 | Paper |
A time-space tradeoff for language recognition
Mathematical Systems Theory | 1984-01-01 | Paper |
Two Tapes are Better than One for Nondeterministic Machines
SIAM Journal on Computing | 1984-01-01 | Paper |
Two nonlinear lower bounds for on-line computations
Information and Control | 1984-01-01 | Paper |
Time-space-optimal string matching
Journal of Computer and System Sciences | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3837387 (Why is no real title available?) | 1983-01-01 | Paper |
An Efficient General-Purpose Parallel Computer
Journal of the ACM | 1983-01-01 | Paper |
NP completeness of finding the chromatic index of regular graphs
Journal of Algorithms | 1983-01-01 | Paper |
