| Publication | Date of Publication | Type |
|---|
| On some open problems concerning the complexity of cellular arrays | 2024-01-29 | Paper |
| On the complexity of commutativity analysis | 2024-01-29 | Paper |
| Unboundedness problems for machines with reversal-bounded counters | 2023-11-24 | Paper |
| On the complexity of decision problems for some classes of machines and applications | 2023-09-27 | Paper |
| Generalizations of Checking Stack Automata: Characterizations and Hierarchies | 2023-08-15 | Paper |
| Space Complexity of Stack Automata Models | 2023-08-15 | Paper |
| New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines | 2023-05-19 | Paper |
| Space Complexity of Stack Automata Models | 2022-10-13 | Paper |
| On the complexity of decision problems for counter machines with applications to coding theory | 2022-08-11 | Paper |
| On finite-index indexed grammars and their restrictions | 2021-07-21 | Paper |
| Semilinearity of Families of Languages | 2021-04-19 | Paper |
| Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity | 2021-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5146521 | 2021-01-26 | Paper |
| State grammars with stores | 2020-06-30 | Paper |
| Input-Position-Restricted Models of Language Acceptors | 2020-05-28 | Paper |
| New results concerning synchronized finite automata | 2019-12-04 | Paper |
| On families of full trios containing counter machine languages | 2019-11-13 | Paper |
| State grammars with stores | 2019-11-07 | Paper |
| On decidability and closure properties of language classes with respect to bio-operations | 2019-07-10 | Paper |
| On the overlap assembly of strings and languages | 2019-07-10 | Paper |
| Insertion operations on deterministic reversal-bounded counter machines | 2019-06-25 | Paper |
| On counting functions and slenderness of languages | 2019-06-18 | Paper |
| On store languages and applications | 2019-05-29 | Paper |
| New decidability results concerning two-way counter machines and applications | 2019-03-29 | Paper |
| Generalizations of checking stack automata: characterizations and hierarchies | 2018-11-22 | Paper |
| On counting functions of languages | 2018-11-22 | Paper |
| Semilinearity of families of languages | 2018-11-07 | Paper |
| Grammatical characterizations of NPDAs and VPDAs with counters | 2018-09-27 | Paper |
| On store languages of language acceptors | 2018-09-24 | Paper |
| [https://portal.mardi4nfdi.de/wiki/Publication:5376337 On the Density of Languages Accepted by Turing Machines and Other
Machine Models] | 2018-09-17 | Paper |
| Parallel recognition and parsing on the hypercube | 2018-09-14 | Paper |
| Variations of checking stack automata: obtaining unexpected decidability properties | 2018-06-18 | Paper |
| Accepting runs in a two-way finite automaton | 2018-05-30 | Paper |
| On the Density of Context-Free and Counter Languages | 2018-05-15 | Paper |
| On the complexity and decidability of some problems involving shuffle | 2018-03-21 | Paper |
| Visibly Pushdown Automata and Transducers with Counters | 2017-11-09 | Paper |
| Variations of checking stack automata: obtaining unexpected decidability properties | 2017-10-13 | Paper |
| Information rate of some classes of non-regular languages: an automata-theoretic approach | 2017-09-28 | Paper |
| Deletion operations on deterministic families of automata | 2017-09-28 | Paper |
| Lossiness of communication channels modeled by transducers1 | 2017-07-21 | Paper |
| On finite-index indexed grammars and their restrictions | 2017-06-01 | Paper |
| Further remarks on DNA overlap assembly | 2017-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5507064 | 2016-12-16 | Paper |
| Quantifying communication in synchronized languages | 2016-11-24 | Paper |
| On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L | 2016-11-09 | Paper |
| On Families of Full Trios Containing Counter Machine Languages | 2016-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5740422 | 2016-07-26 | Paper |
| Semilinear Sets and Counter Machines: a Brief Survey | 2016-05-11 | Paper |
| Insertion operations on deterministic reversal-bounded counter machines | 2016-04-08 | Paper |
| The effect of end-markers on counter machines and commutativity | 2016-04-01 | Paper |
| On the Ambiguity and Finite-Valuedness Problems in Acceptors and Transducers | 2016-02-17 | Paper |
| Execution information rate for some classes of automata | 2015-12-28 | Paper |
| On bounded languages and reversal-bounded automata | 2015-12-28 | Paper |
| On the Density of Context-Free and Counter Languages | 2015-11-10 | Paper |
| Quantifying Communication in Synchronized Languages | 2015-10-29 | Paper |
| Deletion operations on deterministic families of automata | 2015-09-30 | Paper |
| On the complexity and decidability of some problems involving shuffle | 2015-08-07 | Paper |
| ON REACHABILITY AND SAFETY IN INFINITE-STATE SYSTEMS | 2015-04-30 | Paper |
| SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS | 2015-04-23 | Paper |
| Sampling a Two-Way Finite Automaton | 2015-04-14 | Paper |
| Lossiness of Communication Channels Modeled by Transducers | 2015-02-25 | Paper |
| Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach | 2014-10-14 | Paper |
| On Decidability and Closure Properties of Language Classes with Respect to Bio-operations | 2014-10-08 | Paper |
| On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and Transducers | 2014-09-26 | Paper |
| Automata with Reversal-Bounded Counters: A Survey | 2014-08-07 | Paper |
| Automata-based symbolic string analysis for vulnerability detection | 2014-06-30 | Paper |
| On the Parikh Membership Problem for FAs, PDAs, and CMs | 2014-03-31 | Paper |
| An NP-complete number-theoretic problem | 2014-03-14 | Paper |
| HOW TO SYNCHRONIZE THE HEADS OF A MULTITAPE AUTOMATON | 2014-03-10 | Paper |
| Similarity in languages and programs | 2014-01-10 | Paper |
| On the open problem of Ginsburg concerning semilinear sets and related problems | 2014-01-10 | Paper |
| Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages | 2013-08-07 | Paper |
| Some Decision Questions Concerning the Time Complexity of Language Acceptors | 2013-06-28 | Paper |
| CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES | 2013-06-06 | Paper |
| On the Boundedness Property of Semilinear Sets | 2013-05-28 | Paper |
| Execution Information Rate for Some Classes of Automata | 2013-03-18 | Paper |
| On Bounded Languages and Reversal-Bounded Automata | 2013-03-18 | Paper |
| One-reversal counter machines and multihead automata: revisited | 2012-10-11 | Paper |
| How to Synchronize the Heads of a Multitape Automaton | 2012-09-20 | Paper |
| On synchronized multi-tape and multi-head automata | 2012-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2893305 | 2012-06-20 | Paper |
| Multitape NFA: Weak Synchronization of the Input Heads | 2012-06-15 | Paper |
| Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines | 2012-06-08 | Paper |
| On the containment and equivalence problems for two-way transducers | 2012-05-30 | Paper |
| On sets of numbers accepted by P/T systems composed by join | 2012-04-03 | Paper |
| RELATIONAL STRING VERIFICATION USING MULTI-TRACK AUTOMATA | 2012-03-13 | Paper |
| On Two-Way Transducers | 2011-07-29 | Paper |
| On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs | 2011-07-29 | Paper |
| On Synchronized Multitape and Multihead Automata | 2011-07-29 | Paper |
| ON STRONG REVERSIBILITY IN P SYSTEMS AND RELATED PROBLEMS | 2011-02-23 | Paper |
| One-Reversal Counter Machines and Multihead Automata: Revisited | 2011-02-15 | Paper |
| Relational String Verification Using Multi-track Automata | 2011-02-11 | Paper |
| On the universe, disjointness, and containment problems for simple machines | 2010-10-22 | Paper |
| Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing | 2010-09-16 | Paper |
| On spiking neural P systems | 2010-09-16 | Paper |
| On Stateless Multicounter Machines | 2010-07-28 | Paper |
| Computer Aided Verification | 2010-04-20 | Paper |
| On decision problems for parameterized machines | 2010-03-09 | Paper |
| On stateless multihead automata: hierarchies and the emptiness problem | 2010-02-05 | Paper |
| CHARACTERIZING REGULAR LANGUAGES BY SPIKING NEURAL P SYSTEMS | 2010-01-29 | Paper |
| A Look Back at Some Early Results in Membrane Computing | 2010-01-26 | Paper |
| Sequentiality Induced by Spike Number in SNP Systems | 2009-11-10 | Paper |
| Characterizations of some classes of spiking neural P systems | 2009-11-04 | Paper |
| Sequential SNP systems based on min/max spike number | 2009-08-07 | Paper |
| Hierarchies and Characterizations of Stateless Multicounter Machines | 2009-07-23 | Paper |
| On Stateless Multihead Finite Automata and Multihead Pushdown Automata | 2009-07-07 | Paper |
| Asynchronous spiking neural P systems | 2009-06-04 | Paper |
| Membrane Computing | 2009-05-15 | Paper |
| Counting Time in Computing with Cells | 2009-04-02 | Paper |
| On Bounded Symport/Antiport P Systems | 2009-04-02 | Paper |
| Symbolic String Verification: Combining String Analysis and Size Analysis | 2009-03-31 | Paper |
| Bond Computing Systems: A Biologically Inspired and High-Level Dynamics Model for Pervasive Computing | 2009-02-17 | Paper |
| Minimum-cost delegation in service composition | 2009-01-08 | Paper |
| DISCRETE NONDETERMINISTIC MODELING OF THE FAS PATHWAY | 2008-12-01 | Paper |
| ON STATELESS AUTOMATA AND P SYSTEMS | 2008-12-01 | Paper |
| Simulating FAS-induced apoptosis by using P systems | 2008-11-10 | Paper |
| Computing with cells: membrane systems – some complexity issues | 2008-10-28 | Paper |
| ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS | 2008-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3505122 | 2008-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3505127 | 2008-06-18 | Paper |
| On spiking neural P systems and partially blind counter machines | 2008-05-20 | Paper |
| On Stateless Multihead Automata: Hierarchies and the Emptiness Problem | 2008-04-15 | Paper |
| Asynchronous Spiking Neural P Systems: Decidability and Undecidability | 2008-04-04 | Paper |
| Spiking Neural P Systems: Some Characterizations | 2008-02-26 | Paper |
| Mathematical Foundations of Computer Science 2003 | 2007-12-07 | Paper |
| On Spiking Neural P Systems and Partially Blind Counter Machines | 2007-11-29 | Paper |
| Characterizations of Some Restricted Spiking Neural P Systems | 2007-09-03 | Paper |
| On the computational complexity of P automata | 2007-04-19 | Paper |
| Normal forms for spiking neural P systems | 2007-03-27 | Paper |
| On symport/antiport P systems with a small number of objects | 2007-03-23 | Paper |
| Deterministic catalytic systems are not universal | 2007-01-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3409984 | 2006-11-21 | Paper |
| Implementation and Application of Automata | 2006-11-13 | Paper |
| Membrane Computing | 2006-11-13 | Paper |
| Membrane Computing | 2006-11-13 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| DNA Computing | 2006-10-19 | Paper |
| Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems | 2006-09-14 | Paper |
| Unconventional Computation | 2006-07-07 | Paper |
| On partially blind multihead finite automata. | 2006-05-18 | Paper |
| On the solvability of a class of Diophantine equations and applications | 2006-03-24 | Paper |
| Computing and Combinatorics | 2006-01-11 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| On determinism versus nondeterminism in P systems | 2005-12-05 | Paper |
| ON ONE-MEMBRANE P SYSTEMS OPERATING IN SEQUENTIAL MODE | 2005-11-14 | Paper |
| On composition and lookahead delegation of \(e\)-services modeled by automata | 2005-09-22 | Paper |
| Implementation and Application of Automata | 2005-08-17 | Paper |
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science | 2005-08-12 | Paper |
| ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS | 2005-08-03 | Paper |
| VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES | 2005-06-22 | Paper |
| THE EXISTENCE OF ω-CHAINS FOR TRANSITIVE MIXED LINEAR RELATIONS AND ITS APPLICATIONS | 2005-06-22 | Paper |
| INSTANCE-SPECIFIC SOLUTIONS FOR ACCELERATING THE CKY PARSING OF LARGE CONTEXT-FREE GRAMMARS | 2005-06-22 | Paper |
| On membrane hierarchy in P systems | 2005-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4673399 | 2005-04-29 | Paper |
| On two-way nondeterministic finite automata with one reversal-bounded counter | 2005-02-22 | Paper |
| On two-way FA with monotonic counters and quadratic Diophantine equations | 2004-10-27 | Paper |
| Catalytic P systems, semilinear sets, and vector addition systems | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4819884 | 2004-10-05 | Paper |
| On the computational complexity of membrane systems | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474093 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474213 | 2004-08-04 | Paper |
| Past pushdown timed automata and safety verification. | 2004-03-14 | Paper |
| Closure and decidability properties of some language classes with respect to ciliate bio-operations. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4449211 | 2004-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4425946 | 2003-09-14 | Paper |
| Verification in loosely synchronous queue-connected discrete timed automata. | 2003-08-17 | Paper |
| Generalized discrete timed automata: Decidable approximations for safety verification. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412570 | 2003-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412126 | 2003-07-13 | Paper |
| Eliminating the storage tape in reachability constructions. | 2003-05-25 | Paper |
| Some decision problems concerning semilinearity and commutation. | 2003-05-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4782101 | 2003-05-12 | Paper |
| Counter machines and verification problems. | 2003-01-21 | Paper |
| Augmenting the discrete timed automaton with other data structures. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536602 | 2002-11-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778759 | 2002-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778769 | 2002-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4553242 | 2002-11-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4540964 | 2002-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4540965 | 2002-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536378 | 2002-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535049 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4331307 | 2002-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754074 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525737 | 2001-01-24 | Paper |
| Image compression for fast wavelet-based subregion retrieval | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941150 | 2000-02-29 | Paper |
| A technique for proving decidability of containment and equivalence of linear constraint queries | 1999-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4266537 | 1999-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4260377 | 1999-09-19 | Paper |
| Adaptive partitioning and scheduling for enhancing WWW application performance | 1998-11-05 | Paper |
| On the parallel complexity of loops | 1998-07-22 | Paper |
| On the Complexity of Commutativity Analysis | 1997-09-15 | Paper |
| New Decidability Results Concerning Two-Way Counter Machines | 1996-01-02 | Paper |
| On communication-bounded synchronized alternating finite automata | 1995-08-17 | Paper |
| Fast parallel algorithms for solving triangular systems of linear equations on the hypercube | 1995-01-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281537 | 1994-11-13 | Paper |
| Synchronized finite automata and 2DFA reductions | 1994-10-19 | Paper |
| Some Efficient Algorithms for Permutation Graphs | 1994-05-05 | Paper |
| ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES | 1994-04-27 | Paper |
| Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata | 1994-04-05 | Paper |
| Quadtree building algorithms on an \(SIMD\) hypercube | 1994-01-09 | Paper |
| A note on simple programs with two variables | 1993-05-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035243 | 1993-05-18 | Paper |
| On Efficient Parallel Algorithms for Solving Set Recurrence Equations | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028904 | 1993-03-28 | Paper |
| A hierarchy result for 2-dimensional TM's operating in small space | 1992-09-27 | Paper |
| On space-bounded synchronized alternating Turing machines | 1992-09-27 | Paper |
| A characterization of exponential-time languages by alternating context- free grammars | 1992-09-27 | Paper |
| Parallel parsing on a one-way linear array of finite-state machines | 1992-06-28 | Paper |
| Iterative algorithms for the planar convex hull problem on mesh-connected arrays | 1992-06-28 | Paper |
| Learning regular languages from counterexamples | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4713370 | 1992-06-25 | Paper |
| Some classes of languages in \(NC^ 1\) | 1991-01-01 | Paper |
| The Power of Alternating One-Reversal Counters and Stacks | 1991-01-01 | Paper |
| An efficient all-parses systolic algorithm for general context-free parsing | 1990-01-01 | Paper |
| Systolic algorithms for some scheduling and graph problems | 1990-01-01 | Paper |
| Optimal simulation of tree arrays by linear arrays | 1989-01-01 | Paper |
| Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs | 1989-01-01 | Paper |
| On iterative and cellular tree arrays | 1989-01-01 | Paper |
| Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355242 | 1989-01-01 | Paper |
| Erratum to: Some observations concerning alternating Turing machines using small space | 1988-01-01 | Paper |
| Two-dimensional iterative arrays: Characterizations and applications | 1988-01-01 | Paper |
| Relating the power of cellular arrays to their closure properties | 1988-01-01 | Paper |
| Some subclasses of context-free languages in \(NC^ 1\) | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3795230 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3811706 | 1988-01-01 | Paper |
| Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties | 1988-01-01 | Paper |
| Some observations concerning alternating Turing machines using small space | 1987-01-01 | Paper |
| On Efficient Simulations of Systolic Arrays by Random-Access Machines | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3769969 | 1987-01-01 | Paper |
| Parallel Parsing on a One-Way Array of Finite-State Machines | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3786002 | 1987-01-01 | Paper |
| On One-Way Cellular Arrays | 1987-01-01 | Paper |
| On pebble automata | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3026350 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3742754 | 1986-01-01 | Paper |
| Iterative tree arrays with logarithmic depth† | 1986-01-01 | Paper |
| On efficient recognition of transductions and relations | 1985-01-01 | Paper |
| Fast parallel language recognition by cellular automata | 1985-01-01 | Paper |
| Sequential Machine Characterizations of Trellis and Cellular Automata and Applications | 1985-01-01 | Paper |
| The equivalence problem and correctness formulas for a simple class of programs | 1985-01-01 | Paper |
| On simple programs with primitive conditional statements | 1985-01-01 | Paper |
| Some characterizations of multihead finite automata | 1985-01-01 | Paper |
| On space and time efficient TM simulations of some restricted classes of PDA's | 1985-01-01 | Paper |
| Some independence results in complexity theory† | 1985-01-01 | Paper |
| Characterizations and computational complexity of systolic trellis automata | 1984-01-01 | Paper |
| A characterization of systolic binary tree automata and applications | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217582 | 1984-01-01 | Paper |
| A note on the complexity of program evaluation | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3685230 | 1984-01-01 | Paper |
| On some decision questions concerning pushdown machines | 1983-01-01 | Paper |
| Simple programming languages and restricted classes of Turing machines | 1983-01-01 | Paper |
| On the zero-inequivalence problem for loop programs | 1983-01-01 | Paper |
| On the finite-valuedness problem for sequential machines | 1983-01-01 | Paper |
| On the control power of integer division | 1983-01-01 | Paper |
| On the Space and Time Complexity of Functions Computable by Simple Programs | 1983-01-01 | Paper |
| Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM’<scp>s</scp> | 1983-01-01 | Paper |
| On the Simplification and Equivalence Problems for Straight-Line Programs | 1983-01-01 | Paper |
| Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs | 1983-01-01 | Paper |
| A note on finite-valued and finitely ambiguous transducers | 1983-01-01 | Paper |
| Some simplified undecidable and NP-hard problems for simple programs | 1982-01-01 | Paper |
| On some decision problems for RAM programs | 1982-01-01 | Paper |
| On the complexity of simple arithmetic expressions | 1982-01-01 | Paper |
| 2DST mappings of languages and related problems | 1982-01-01 | Paper |
| The Complexity of the Equivalence Problem for Simple Loop-Free Programs | 1982-01-01 | Paper |
| Straight-Line Programs with One Input Variable | 1982-01-01 | Paper |
| A generalization of the fast LUP matrix decomposition algorithm and applications | 1982-01-01 | Paper |
| (Semi)alternating stack automata | 1982-01-01 | Paper |
| Two-Way Counter Machines and Diophantine Equations | 1982-01-01 | Paper |
| The complexity of the equivalence problem for two characterizations of Presburger sets | 1981-01-01 | Paper |
| The complexity of decision problems for finite-turn multicounter machines | 1981-01-01 | Paper |
| Probabilistic algorithms and straight-line programs for some rank decision problems | 1981-01-01 | Paper |
| Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication | 1981-01-01 | Paper |
| On the decidability of equivalence for deterministic pushdown transducers | 1981-01-01 | Paper |
| The Complexity of the Equivalence Problem for Simple Programs | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912020 | 1981-01-01 | Paper |
| Characterizations of Presburger Functions | 1981-01-01 | Paper |
| On restricted one-counter machines | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3940845 | 1981-01-01 | Paper |
| Path Systems: Constructions, Solutions and Applications | 1980-01-01 | Paper |
| Simple counter machines and number-theoretic problems | 1979-01-01 | Paper |
| On the space complexity of recursive algorithms | 1979-01-01 | Paper |
| Some decision problems concerning sequential transducers and checking automata | 1979-01-01 | Paper |
| Restricted one-counter machines with undecidable universe problems | 1979-01-01 | Paper |
| An NP-Complete Number-Theoretic Problem | 1979-01-01 | Paper |
| On two-way sequential transductions of full semi-AFL's | 1978-01-01 | Paper |
| Reversal-Bounded Multicounter Machines and Their Decision Problems | 1978-01-01 | Paper |
| The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications | 1978-01-01 | Paper |
| Approximation Algorithms for Certain Scheduling Problems | 1978-01-01 | Paper |
| Bounds for LPT Schedules on Uniform Processors | 1977-01-01 | Paper |
| Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors | 1977-01-01 | Paper |
| A useful device for showing the solvability of some decision problems | 1976-01-01 | Paper |
| Finite automata with multiplication | 1976-01-01 | Paper |
| On Two—Processor Scheduling of One— or Two—Unit Time Tasks with Precedence Constraints | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4140394 | 1976-01-01 | Paper |
| On 3-head versus 2-head finite automata | 1975-01-01 | Paper |
| Hierarchies of Turing machines with restricted tape alphabet size | 1975-01-01 | Paper |
| Polynomially Complete Fault Detection Problems | 1975-01-01 | Paper |
| Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems | 1975-01-01 | Paper |
| A note on semilinear sets and bounded-reversal multihead pushdown automata | 1974-01-01 | Paper |
| A Hierarchy Theorem for Polynomial-Space Recognition | 1974-01-01 | Paper |
| Some results concerning automata on two-dimensional tapes | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5686024 | 1974-01-01 | Paper |
| Controlled pushdown automata | 1973-01-01 | Paper |
| On two-way multihead automata | 1973-01-01 | Paper |
| A Note Concerning Nondeterministic Tape Complexities | 1972-01-01 | Paper |
| Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata | 1971-01-01 | Paper |
| Characterizations of transductions defined by abstract families of transducers | 1971-01-01 | Paper |
| Tape-bounded Turing acceptors and principal AFLs | 1970-01-01 | Paper |
| Simple matrix languages | 1970-01-01 | Paper |
| Multi-tape and multi-head pushdown automata | 1968-01-01 | Paper |
| Ferromagnetic Wire Memory | 1967-01-01 | Paper |
| Two-way pushdown automata | 1967-01-01 | Paper |
