| Publication | Date of Publication | Type |
|---|
| Efficient Dynamic-Resharing “Verifiable Secret Sharing” against mobile adversary | 2023-05-08 | Paper |
| Optimal parallel algorithms for periods, palindromes and squares | 2019-12-04 | Paper |
| Lower bounds on algebraic random access machines | 2019-01-10 | Paper |
| Sensing versus nonsensing automata | 2019-01-10 | Paper |
| Real-Time Streaming String-Matching | 2018-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369135 | 2017-10-13 | Paper |
| Separator based sparsification for dynamic planar graph algorithms | 2015-05-07 | Paper |
| Real-Time Streaming String-Matching | 2011-06-29 | Paper |
| Eavesdropping games | 2008-05-05 | Paper |
| Three-Dimensional Periodicity and Its Application to Pattern Matching | 2005-02-28 | Paper |
| Fully dynamic planarity testing with applications | 2005-01-25 | Paper |
| Lower bounds for dynamic data structures on algebraic RAMs | 2002-05-21 | Paper |
| Topological lower bounds on algebraic random access machines | 2002-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234098 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234122 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230366 | 2002-01-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230327 | 2002-01-17 | Paper |
| A generalization of a lower bound technique due to Fredman and Saks | 2001-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252758 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942631 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230346 | 1999-04-22 | Paper |
| Separator-Based Sparsification II: Edge and Vertex Connectivity | 1998-09-21 | Paper |
| Sparsification—a technique for speeding up dynamic graph algorithms | 1998-02-17 | Paper |
| Constant-Time Randomized Parallel String Matching | 1998-02-10 | Paper |
| A constant-time optimal parallel string-matching algorithm | 1998-01-28 | Paper |
| All pairs shortest distances for graphs with small integer length edges | 1998-01-12 | Paper |
| On the exponent of all pairs shortest path problem | 1997-12-08 | Paper |
| All pairs shortest paths for graphs with small integer length edges | 1997-12-08 | Paper |
| When can we sort in \(o(n\log n)\) time? | 1997-08-03 | Paper |
| Parallel detection of all palindromes in a string | 1997-02-28 | Paper |
| Alphabet-Independent Two-Dimensional Witness Computation | 1996-11-07 | Paper |
| Separator based sparsification. I: Planarity testing and minimum spanning trees | 1996-07-16 | Paper |
| Finding all periods and initial palindromes of a string in parallel | 1996-03-11 | Paper |
| Dynamic dictionary matching | 1996-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858443 | 1995-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858435 | 1995-12-13 | Paper |
| Parallel algorithms for dynamic programming recurrences with more than \(O(1)\) dependency | 1995-09-14 | Paper |
| Sparse dynamic programming II | 1995-07-13 | Paper |
| On the power of the shift instruction | 1995-05-28 | Paper |
| Faster tree pattern matching | 1995-02-13 | Paper |
| Sparse dynamic programming I | 1994-08-21 | Paper |
| On pointers versus addresses | 1994-08-21 | Paper |
| Efficient comparison based string matching | 1994-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138931 | 1993-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4201928 | 1993-09-05 | Paper |
| On the power of multiple reads in a chip | 1993-08-30 | Paper |
| Witnesses for Boolean matrix multiplication and for transitive closure | 1993-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036576 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036607 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036605 | 1993-05-18 | Paper |
| Maintaining the 3-Edge-Connected Components of a Graph On-Line | 1993-05-16 | Paper |
| Fully Dynamic Algorithms for 2-Edge Connectivity | 1993-03-09 | Paper |
| On the Exact Complexity of String Matching: Upper Bounds | 1993-01-16 | Paper |
| A Lower Bound for Parallel String Matching | 1992-12-06 | Paper |
| Dynamic programming with convexity, concavity and sparsity | 1992-09-26 | Paper |
| On the space complexity of some algorithms for sequence comparison | 1992-06-28 | Paper |
| On the Exact Complexity of String Matching: Lower Bounds | 1992-06-27 | Paper |
| An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem | 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\) | 1992-06-26 | Paper |
| A note on set union with arbitrary deunions | 1991-01-01 | Paper |
| Two lower bounds in asynchronous distributed computation | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5751936 | 1991-01-01 | Paper |
| An Improved Algorithm For Approximate String Matching | 1990-01-01 | Paper |
| A linear-time algorithm for concave one-dimensional dynamic programming | 1990-01-01 | Paper |
| An Optimal $O(\log\log n)$ Time Parallel String Matching Algorithm | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4206397 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4733401 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3033316 | 1989-01-01 | Paper |
| On nontrivial separators for \(k\)-page graphs and simulations by nondeterministic one-tape Turing machines | 1989-01-01 | Paper |
| On 3-pushdown graphs with large separators | 1989-01-01 | Paper |
| Solving dense subset-sum problems by using analytical number theory | 1989-01-01 | Paper |
| Minimum-Knowledge Interactive Proofs for Decision Problems | 1989-01-01 | Paper |
| Speeding up dynamic programming with applications to molecular biology | 1989-01-01 | Paper |
| Parallel evaluation of the determinant and of the inverse of a matrix | 1989-01-01 | Paper |
| Improved processor bounds for combinatorial problems in RNC | 1988-01-01 | Paper |
| An O (n 2 (m + N log n )log n ) min-cost flow algorithm | 1988-01-01 | Paper |
| On finding most uniform spanning trees | 1988-01-01 | Paper |
| Data structures and algorithms for approximate string matching | 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\) | 1988-01-01 | Paper |
| Lower bounds on communication complexity | 1987-01-01 | Paper |
| Better expanders and superconcentrators | 1987-01-01 | Paper |
| Partitioned encryption and achieving simultaneity by partitioning | 1987-01-01 | Paper |
| Distributed algorithms in synchronous broadcasting networks | 1987-01-01 | Paper |
| Parallel string matching with k mismatches | 1987-01-01 | Paper |
| An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs | 1986-01-01 | Paper |
| Efficient algorithms for finding minimum spanning trees in undirected and directed graphs | 1986-01-01 | Paper |
| Efficient algorithms for finding maximum matching in graphs | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3776615 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3747742 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3746902 | 1985-01-01 | Paper |
| Optimal parallel algorithms for string matching | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5186730 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3753460 | 1985-01-01 | Paper |
| Two nonlinear lower bounds for on-line computations | 1984-01-01 | Paper |
| A time-space tradeoff for language recognition | 1984-01-01 | Paper |
| Two Tapes are Better than One for Nondeterministic Machines | 1984-01-01 | Paper |
| Time-space-optimal string matching | 1983-01-01 | Paper |
| NP completeness of finding the chromatic index of regular graphs | 1983-01-01 | Paper |
| Comparison of designs equivalent under one or two criteria | 1983-01-01 | Paper |
| An Efficient General-Purpose Parallel Computer | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3042418 | 1983-01-01 | Paper |
| An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database | 1982-01-01 | Paper |
| Efficient parallel algorithms for linear recurrence computation | 1982-01-01 | Paper |
| Construction methods for D-optimum weighing designs when n=3(mod 4) | 1982-01-01 | Paper |
| On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3732782 | 1982-01-01 | Paper |
| Fooling a two way automaton or one pushdown store is better than one counter for two way machines | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3945613 | 1982-01-01 | Paper |
| Explicit constructions of linear-sized superconcentrators | 1981-01-01 | Paper |
| Linear-time string-matching using only a fixed number of local storage locations | 1981-01-01 | Paper |
| String Matching in Real Time | 1981-01-01 | Paper |
| On the theoretical efficiency of various network flow algorithms | 1981-01-01 | Paper |
| Time- and Space-Saving Computer Methods, Related to Mitchell's DETMAX, for Finding D-Optimum Designs | 1980-01-01 | Paper |
| Finding the Vertex Connectivity of Graphs | 1980-01-01 | Paper |
| D-optimum weighing designs | 1980-01-01 | Paper |
| Saving Space in Fast String-Matching | 1980-01-01 | Paper |
| Applications of efficient mergeable heaps for optimization problems on trees | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3911894 | 1980-01-01 | Paper |
| An \(O(EV\log^2V)\) algorithm for the maximal flow problem | 1980-01-01 | Paper |
| An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3886922 | 1980-01-01 | Paper |
| On improving the worst case running time of the Boyer-Moore string matching algorithm | 1979-01-01 | Paper |
| A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort | 1979-01-01 | Paper |
| Extrapolation designs and Phi//p-optimum designs for cubic regression on the q-ball | 1979-01-01 | Paper |
| Storage representations for tree-like data structures | 1979-01-01 | Paper |
| On Fulkerson's Conjecture About Consistent Labeling Processes | 1979-01-01 | Paper |
| Palindrome recognition in real time by a multitape Turing machine | 1978-01-01 | Paper |
| A Linear-Time On-Line Recognition Algorithm for ``Palstar | 1978-01-01 | Paper |
| Cyclic ordering is NP-complete | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4181952 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4156810 | 1978-01-01 | Paper |
| Comparison of design for quadratic regression of cubes | 1977-01-01 | Paper |
| Comparison of rotatable designs for regression on balls. I. (quadratic) | 1977-01-01 | Paper |
| Comparison of Simplex Designs for Quadratic Mixture Models | 1977-01-01 | Paper |
| Real-time recognition of substring repetition and reversal | 1977-01-01 | Paper |
| Some open problems in the theory of computation as questions about two-way deterministic pushdown automaton languages | 1977-01-01 | Paper |
| On the complexity of regular resolution and the Davis-Putnam procedure | 1977-01-01 | Paper |
| Comparison of Box-Draper and D-Optimum Designs for Experiments with Mixtures | 1977-01-01 | Paper |
| On Resolution with Clauses of Bounded Size | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4195965 | 1977-01-01 | Paper |
| Monotone switching circuits and Boolean matrix product | 1976-01-01 | Paper |
| Hierarchies of complete problems | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4140367 | 1976-01-01 | Paper |
| A note on multiple-entry finite automata | 1976-01-01 | Paper |
| Two fast simulations which imply some fast string matching and palindrome-recognition algorithms | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4131061 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4142714 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4079518 | 1975-01-01 | Paper |
| Functional schemas with nested predicates | 1975-01-01 | Paper |
| The nucleolus in games with major and minor players | 1974-01-01 | Paper |
