| Publication | Date of Publication | Type |
|---|
On decision problems concerning contextual insertions and deletions
Theoretical Computer Science | 2024-12-12 | Paper |
On some open problems concerning the complexity of cellular arrays
Lecture Notes in Computer Science | 2024-01-29 | Paper |
On the complexity of commutativity analysis
Lecture Notes in Computer Science | 2024-01-29 | Paper |
Unboundedness problems for machines with reversal-bounded counters
Lecture Notes in Computer Science | 2023-11-24 | Paper |
On the complexity of decision problems for some classes of machines and applications
Information and Computation | 2023-09-27 | Paper |
Space Complexity of Stack Automata Models
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
Generalizations of Checking Stack Automata: Characterizations and Hierarchies
International Journal of Foundations of Computer Science | 2023-08-15 | Paper |
New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines
Information and Computation | 2023-05-19 | Paper |
Space complexity of stack automata models
Developments in Language Theory | 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
Information and Computation | 2021-07-21 | Paper |
Semilinearity of families of languages
International Journal of Foundations of Computer Science | 2021-04-19 | Paper |
Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
Theoretical Computer Science | 2021-03-09 | Paper |
| scientific article; zbMATH DE number 7301303 (Why is no real title available?) | 2021-01-26 | Paper |
State grammars with stores
Descriptional Complexity of Formal Systems | 2020-06-30 | Paper |
Input-Position-Restricted Models of Language Acceptors
Reversibility and Universality | 2020-05-28 | Paper |
New results concerning synchronized finite automata
Automata, Languages and Programming | 2019-12-04 | Paper |
On families of full trios containing counter machine languages
Theoretical Computer Science | 2019-11-13 | Paper |
State grammars with stores
Theoretical Computer Science | 2019-11-07 | Paper |
On the overlap assembly of strings and languages
Natural Computing | 2019-07-10 | Paper |
On decidability and closure properties of language classes with respect to bio-operations
Natural Computing | 2019-07-10 | Paper |
Insertion operations on deterministic reversal-bounded counter machines
Journal of Computer and System Sciences | 2019-06-25 | Paper |
On counting functions and slenderness of languages
Theoretical Computer Science | 2019-06-18 | Paper |
On store languages and applications
Information and Computation | 2019-05-29 | Paper |
New decidability results concerning two-way counter machines and applications
Automata, Languages and Programming | 2019-03-29 | Paper |
| On counting functions of languages | 2018-11-22 | Paper |
| Generalizations of checking stack automata: characterizations and hierarchies | 2018-11-22 | Paper |
| Semilinearity of families of languages | 2018-11-07 | Paper |
Grammatical characterizations of NPDAs and VPDAs with counters
Theoretical Computer Science | 2018-09-27 | Paper |
On store languages of language acceptors
Theoretical Computer Science | 2018-09-24 | Paper |
On the density of languages accepted by Turing machines and other machine models
(available as arXiv preprint) | 2018-09-17 | Paper |
Parallel recognition and parsing on the hypercube
IEEE Transactions on Computers | 2018-09-14 | Paper |
Variations of checking stack automata: obtaining unexpected decidability properties
Theoretical Computer Science | 2018-06-18 | Paper |
Accepting runs in a two-way finite automaton
Information and Computation | 2018-05-30 | Paper |
On the density of context-free and counter languages
International Journal of Foundations of Computer Science | 2018-05-15 | Paper |
On the complexity and decidability of some problems involving shuffle
Information and Computation | 2018-03-21 | Paper |
Visibly pushdown automata and transducers with counters
Fundamenta Informaticae | 2017-11-09 | Paper |
Variations of checking stack automata: obtaining unexpected decidability properties
Lecture Notes in Computer Science | 2017-10-13 | Paper |
Deletion operations on deterministic families of automata
Information and Computation | 2017-09-28 | Paper |
Information rate of some classes of non-regular languages: an automata-theoretic approach
Information and Computation | 2017-09-28 | Paper |
Lossiness of communication channels modeled by transducers1
Computability | 2017-07-21 | Paper |
On finite-index indexed grammars and their restrictions
Lecture Notes in Computer Science | 2017-06-01 | Paper |
Further remarks on DNA overlap assembly
Information and Computation | 2017-03-16 | Paper |
| scientific article; zbMATH DE number 6665216 (Why is no real title available?) | 2016-12-16 | Paper |
Quantifying communication in synchronized languages
Theoretical Computer Science | 2016-11-24 | Paper |
On bounded semilinear languages, counter machines, and finite-index ET0L
Implementation and Application of Automata | 2016-11-09 | Paper |
On Families of Full Trios Containing Counter Machine Languages
Developments in Language Theory | 2016-08-30 | Paper |
| scientific article; zbMATH DE number 6606353 (Why is no real title available?) | 2016-07-26 | Paper |
Semilinear sets and counter machines: a brief survey
Fundamenta Informaticae | 2016-05-11 | Paper |
Insertion operations on deterministic reversal-bounded counter machines
Lecture Notes in Computer Science | 2016-04-08 | Paper |
The effect of end-markers on counter machines and commutativity
Theoretical Computer Science | 2016-04-01 | Paper |
On the ambiguity and finite-valuedness problems in acceptors and transducers
International Journal of Foundations of Computer Science | 2016-02-17 | Paper |
Execution information rate for some classes of automata
Information and Computation | 2015-12-28 | Paper |
On bounded languages and reversal-bounded automata
Information and Computation | 2015-12-28 | Paper |
On the density of context-free and counter languages
Developments in Language Theory | 2015-11-10 | Paper |
Quantifying communication in synchronized languages
Lecture Notes in Computer Science | 2015-10-29 | Paper |
Deletion operations on deterministic families of automata
Lecture Notes in Computer Science | 2015-09-30 | Paper |
On the complexity and decidability of some problems involving shuffle
Lecture Notes in Computer Science | 2015-08-07 | Paper |
On reachability and safety in infinite-state systems
International Journal of Foundations of Computer Science | 2015-04-30 | Paper |
SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS
International Journal of Foundations of Computer Science | 2015-04-23 | Paper |
Sampling a two-way finite automaton
Automata, Universality, Computation | 2015-04-14 | Paper |
Lossiness of Communication Channels Modeled by Transducers
Language, Life, Limits | 2015-02-25 | Paper |
Information rate of some classes of non-regular languages: an automata-theoretic approach (extended abstract)
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
On decidability and closure properties of language classes with respect to bio-operations
Lecture Notes in Computer Science | 2014-10-08 | Paper |
On the ambiguity, finite-valuedness, and lossiness problems in acceptors and transducers
Implementation and Application of Automata | 2014-09-26 | Paper |
Automata with Reversal-Bounded Counters: A Survey
Descriptional Complexity of Formal Systems | 2014-08-07 | Paper |
Automata-based symbolic string analysis for vulnerability detection
Formal Methods in System Design | 2014-06-30 | Paper |
On the Parikh membership problem for FAs, PDAs, and CMs
Language and Automata Theory and Applications | 2014-03-31 | Paper |
An NP-complete number-theoretic problem
Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 | 2014-03-14 | Paper |
How to synchronize the heads of a multitape automaton
International Journal of Foundations of Computer Science | 2014-03-10 | Paper |
Similarity in languages and programs
Theoretical Computer Science | 2014-01-10 | Paper |
On the open problem of Ginsburg concerning semilinear sets and related problems
Theoretical Computer Science | 2014-01-10 | Paper |
Some decision problems concerning NPDAs, palindromes, and Dyck languages
Implementation and Application of Automata | 2013-08-07 | Paper |
Some Decision Questions Concerning the Time Complexity of Language Acceptors
Developments in Language Theory | 2013-06-28 | Paper |
CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES
International Journal of Foundations of Computer Science | 2013-06-06 | Paper |
On the boundedness property of semilinear sets
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Execution information rate for some classes of automata
Language and Automata Theory and Applications | 2013-03-18 | Paper |
On bounded languages and reversal-bounded automata
Language and Automata Theory and Applications | 2013-03-18 | Paper |
One-reversal counter machines and multihead automata: revisited
Theoretical Computer Science | 2012-10-11 | Paper |
How to synchronize the heads of a multitape automaton
Implementation and Application of Automata | 2012-09-20 | Paper |
On synchronized multi-tape and multi-head automata
Theoretical Computer Science | 2012-08-13 | Paper |
A survey of results on stateless multicounter automata
Fundamenta Informaticae | 2012-06-20 | Paper |
Multitape NFA: Weak Synchronization of the Input Heads
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
Weak synchronization and synchronizability of multitape pushdown automata and Turing machines
Language and Automata Theory and Applications | 2012-06-08 | Paper |
On the containment and equivalence problems for two-way transducers
Theoretical Computer Science | 2012-05-30 | Paper |
On sets of numbers accepted by P/T systems composed by join
Theoretical Computer Science | 2012-04-03 | Paper |
Relational string verification using multi-track automata
International Journal of Foundations of Computer Science | 2012-03-13 | Paper |
On two-way transducers
Developments in Language Theory | 2011-07-29 | Paper |
On Synchronized Multitape and Multihead Automata
Descriptional Complexity of Formal Systems | 2011-07-29 | Paper |
On the containment and equivalence problems for GSMs, transducers, and linear CFGs
Implementation and Application of Automata | 2011-07-29 | Paper |
On strong reversibility in P systems and related problems
International Journal of Foundations of Computer Science | 2011-02-23 | Paper |
One-reversal counter machines and multihead automata: revisited
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
Relational string verification using multi-track automata
Implementation and Application of Automata | 2011-02-11 | Paper |
On the universe, disjointness, and containment problems for simple machines
Information and Computation | 2010-10-22 | Paper |
On spiking neural P systems
Natural Computing | 2010-09-16 | Paper |
Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing
Natural Computing | 2010-09-16 | Paper |
On stateless multicounter machines
Mathematical Theory and Computational Practice | 2010-07-28 | Paper |
Dense counter machines and verification problems.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
On decision problems for parameterized machines
Theoretical Computer Science | 2010-03-09 | Paper |
On stateless multihead automata: hierarchies and the emptiness problem
Theoretical Computer Science | 2010-02-05 | Paper |
Characterizing regular languages by spiking neural P systems
International Journal of Foundations of Computer Science | 2010-01-29 | Paper |
A look back at some early results in membrane computing
Membrane Computing | 2010-01-26 | Paper |
Sequentiality Induced by Spike Number in SNP Systems
DNA Computing | 2009-11-10 | Paper |
Characterizations of some classes of spiking neural P systems
Natural Computing | 2009-11-04 | Paper |
Sequential SNP systems based on min/max spike number
Theoretical Computer Science | 2009-08-07 | Paper |
Hierarchies and Characterizations of Stateless Multicounter Machines
Lecture Notes in Computer Science | 2009-07-23 | Paper |
On Stateless Multihead Finite Automata and Multihead Pushdown Automata
Developments in Language Theory | 2009-07-07 | Paper |
Asynchronous spiking neural P systems
Theoretical Computer Science | 2009-06-04 | Paper |
Membrane Computing
Lecture Notes in Computer Science | 2009-05-15 | Paper |
Counting Time in Computing with Cells
DNA Computing | 2009-04-02 | Paper |
On Bounded Symport/Antiport P Systems
DNA Computing | 2009-04-02 | Paper |
Symbolic String Verification: Combining String Analysis and Size Analysis
Tools and Algorithms for the Construction and Analysis of Systems | 2009-03-31 | Paper |
Bond Computing Systems: A Biologically Inspired and High-Level Dynamics Model for Pervasive Computing
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Minimum-cost delegation in service composition
Theoretical Computer Science | 2009-01-08 | Paper |
ON STATELESS AUTOMATA AND P SYSTEMS
International Journal of Foundations of Computer Science | 2008-12-01 | Paper |
DISCRETE NONDETERMINISTIC MODELING OF THE FAS PATHWAY
International Journal of Foundations of Computer Science | 2008-12-01 | Paper |
Simulating FAS-induced apoptosis by using P systems
Progress in Natural Science | 2008-11-10 | Paper |
Computing with cells: membrane systems – some complexity issues
International Journal of Parallel, Emergent and Distributed Systems | 2008-10-28 | Paper |
ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS
International Journal of Foundations of Computer Science | 2008-09-25 | Paper |
| On the decidability of model-checking for P systems | 2008-06-18 | Paper |
| Quality-aware service delegation in automated web service composition: an automata-theoretic approach | 2008-06-18 | Paper |
On spiking neural P systems and partially blind counter machines
Natural Computing | 2008-05-20 | Paper |
On Stateless Multihead Automata: Hierarchies and the Emptiness Problem
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Asynchronous Spiking Neural P Systems: Decidability and Undecidability
DNA Computing | 2008-04-04 | Paper |
Spiking Neural P Systems: Some Characterizations
Fundamentals of Computation Theory | 2008-02-26 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
On Spiking Neural P Systems and Partially Blind Counter Machines
Lecture Notes in Computer Science | 2007-11-29 | Paper |
Characterizations of Some Restricted Spiking Neural P Systems
Membrane Computing | 2007-09-03 | Paper |
On the computational complexity of P automata
Natural Computing | 2007-04-19 | Paper |
Normal forms for spiking neural P systems
Theoretical Computer Science | 2007-03-27 | Paper |
On symport/antiport P systems with a small number of objects
International Journal of Computer Mathematics | 2007-03-23 | Paper |
Deterministic catalytic systems are not universal
Theoretical Computer Science | 2007-01-09 | Paper |
| On the computational power of 1-deterministic and sequential \(P\) systems | 2006-11-21 | Paper |
Membrane Computing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Membrane Computing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
DNA Computing
Lecture Notes in Computer Science | 2006-10-19 | Paper |
Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems
Theoretical Computer Science | 2006-09-14 | Paper |
Unconventional Computation
Lecture Notes in Computer Science | 2006-07-07 | Paper |
On partially blind multihead finite automata.
Theoretical Computer Science | 2006-05-18 | Paper |
On the solvability of a class of Diophantine equations and applications
Theoretical Computer Science | 2006-03-24 | Paper |
Computing and Combinatorics
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
On determinism versus nondeterminism in P systems
Theoretical Computer Science | 2005-12-05 | Paper |
ON ONE-MEMBRANE P SYSTEMS OPERATING IN SEQUENTIAL MODE
International Journal of Foundations of Computer Science | 2005-11-14 | Paper |
On composition and lookahead delegation of \(e\)-services modeled by automata
Theoretical Computer Science | 2005-09-22 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2005-08-17 | Paper |
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2005-08-12 | Paper |
ON VARIOUS NOTIONS OF PARALLELISM IN P SYSTEMS
International Journal of Foundations of Computer Science | 2005-08-03 | Paper |
INSTANCE-SPECIFIC SOLUTIONS FOR ACCELERATING THE CKY PARSING OF LARGE CONTEXT-FREE GRAMMARS
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
THE EXISTENCE OF ω-CHAINS FOR TRANSITIVE MIXED LINEAR RELATIONS AND ITS APPLICATIONS
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
On membrane hierarchy in P systems
Theoretical Computer Science | 2005-06-01 | Paper |
| scientific article; zbMATH DE number 2163015 (Why is no real title available?) | 2005-04-29 | Paper |
On two-way nondeterministic finite automata with one reversal-bounded counter
Theoretical Computer Science | 2005-02-22 | Paper |
Catalytic P systems, semilinear sets, and vector addition systems
Theoretical Computer Science | 2004-10-27 | Paper |
On two-way FA with monotonic counters and quadratic Diophantine equations
Theoretical Computer Science | 2004-10-27 | Paper |
| scientific article; zbMATH DE number 2106353 (Why is no real title available?) | 2004-10-05 | Paper |
On the computational complexity of membrane systems
Theoretical Computer Science | 2004-08-10 | Paper |
| scientific article; zbMATH DE number 2081100 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080995 (Why is no real title available?) | 2004-08-04 | Paper |
Past pushdown timed automata and safety verification.
Theoretical Computer Science | 2004-03-14 | Paper |
Closure and decidability properties of some language classes with respect to ciliate bio-operations.
Theoretical Computer Science | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2038746 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 1979491 (Why is no real title available?) | 2003-09-14 | Paper |
Verification in loosely synchronous queue-connected discrete timed automata.
Theoretical Computer Science | 2003-08-17 | Paper |
Generalized discrete timed automata: Decidable approximations for safety verification.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1949647 (Why is no real title available?) | 2003-07-15 | Paper |
| scientific article; zbMATH DE number 1948510 (Why is no real title available?) | 2003-07-13 | Paper |
Eliminating the storage tape in reachability constructions.
Theoretical Computer Science | 2003-05-25 | Paper |
Some decision problems concerning semilinearity and commutation.
Journal of Computer and System Sciences | 2003-05-14 | Paper |
| scientific article; zbMATH DE number 1836416 (Why is no real title available?) | 2003-05-12 | Paper |
Counter machines and verification problems.
Theoretical Computer Science | 2003-01-21 | Paper |
Augmenting the discrete timed automaton with other data structures.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1759611 (Why is no real title available?) | 2002-11-28 | Paper |
| scientific article; zbMATH DE number 1832320 (Why is no real title available?) | 2002-11-19 | Paper |
| scientific article; zbMATH DE number 1832329 (Why is no real title available?) | 2002-11-19 | Paper |
| scientific article; zbMATH DE number 1798172 (Why is no real title available?) | 2002-11-04 | Paper |
| scientific article; zbMATH DE number 1773081 (Why is no real title available?) | 2002-07-28 | Paper |
| scientific article; zbMATH DE number 1773082 (Why is no real title available?) | 2002-07-28 | Paper |
| scientific article; zbMATH DE number 1759429 (Why is no real title available?) | 2002-06-25 | Paper |
| scientific article; zbMATH DE number 1754622 (Why is no real title available?) | 2002-06-12 | Paper |
| scientific article; zbMATH DE number 1741111 (Why is no real title available?) | 2002-05-15 | Paper |
| scientific article; zbMATH DE number 1670769 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1555966 (Why is no real title available?) | 2001-01-24 | Paper |
Image compression for fast wavelet-based subregion retrieval
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1408336 (Why is no real title available?) | 2000-02-29 | Paper |
A technique for proving decidability of containment and equivalence of linear constraint queries
Journal of Computer and System Sciences | 1999-11-23 | Paper |
| scientific article; zbMATH DE number 1346513 (Why is no real title available?) | 1999-10-03 | Paper |
| scientific article; zbMATH DE number 1333604 (Why is no real title available?) | 1999-09-19 | Paper |
Adaptive partitioning and scheduling for enhancing WWW application performance
Journal of Parallel and Distributed Computing | 1998-11-05 | Paper |
On the parallel complexity of loops
Theoretical Computer Science | 1998-07-22 | Paper |
On the Complexity of Commutativity Analysis
International Journal of Foundations of Computer Science | 1997-09-15 | Paper |
New Decidability Results Concerning Two-Way Counter Machines
SIAM Journal on Computing | 1996-01-02 | Paper |
On communication-bounded synchronized alternating finite automata
Acta Informatica | 1995-08-17 | Paper |
Fast parallel algorithms for solving triangular systems of linear equations on the hypercube
Journal of Parallel and Distributed Computing | 1995-01-02 | Paper |
| scientific article; zbMATH DE number 512842 (Why is no real title available?) | 1994-11-13 | Paper |
Synchronized finite automata and 2DFA reductions
Theoretical Computer Science | 1994-10-19 | Paper |
Some Efficient Algorithms for Permutation Graphs
Journal of Algorithms | 1994-05-05 | Paper |
ON THE EQUIVALENCE OF TWO-WAY PUSHDOWN AUTOMATA AND COUNTER MACHINES OVER BOUNDED LANGUAGES
International Journal of Foundations of Computer Science | 1994-04-27 | Paper |
Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata
Theoretical Computer Science | 1994-04-05 | Paper |
Quadtree building algorithms on an \(SIMD\) hypercube
Journal of Parallel and Distributed Computing | 1994-01-09 | Paper |
A note on simple programs with two variables
Theoretical Computer Science | 1993-05-24 | Paper |
| scientific article; zbMATH DE number 176142 (Why is no real title available?) | 1993-05-18 | Paper |
On Efficient Parallel Algorithms for Solving Set Recurrence Equations
Journal of Algorithms | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 140485 (Why is no real title available?) | 1993-03-28 | Paper |
A characterization of exponential-time languages by alternating context- free grammars
Theoretical Computer Science | 1992-09-27 | Paper |
On space-bounded synchronized alternating Turing machines
Theoretical Computer Science | 1992-09-27 | Paper |
A hierarchy result for 2-dimensional TM's operating in small space
Information Sciences | 1992-09-27 | Paper |
Parallel parsing on a one-way linear array of finite-state machines
Theoretical Computer Science | 1992-06-28 | Paper |
Iterative algorithms for the planar convex hull problem on mesh-connected arrays
Parallel Computing | 1992-06-28 | Paper |
Learning regular languages from counterexamples
Journal of Computer and System Sciences | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 10089 (Why is no real title available?) | 1992-06-25 | Paper |
Some classes of languages in \(NC^ 1\)
Information and Computation | 1991-01-01 | Paper |
The Power of Alternating One-Reversal Counters and Stacks
SIAM Journal on Computing | 1991-01-01 | Paper |
An efficient all-parses systolic algorithm for general context-free parsing
International Journal of Parallel Programming | 1990-01-01 | Paper |
Systolic algorithms for some scheduling and graph problems
Journal of VLSI signal processing systems for signal, image and video technology | 1990-01-01 | Paper |
Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
SIAM Journal on Computing | 1989-01-01 | Paper |
Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs
Theoretical Computer Science | 1989-01-01 | Paper |
Optimal simulation of tree arrays by linear arrays
Information Processing Letters | 1989-01-01 | Paper |
On iterative and cellular tree arrays
Journal of Computer and System Sciences | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4205997 (Why is no real title available?) | 1989-01-01 | Paper |
Some subclasses of context-free languages in \(NC^ 1\)
Information Processing Letters | 1988-01-01 | Paper |
Erratum to: Some observations concerning alternating Turing machines using small space
Information Processing Letters | 1988-01-01 | Paper |
Two-dimensional iterative arrays: Characterizations and applications
Theoretical Computer Science | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4080911 (Why is no real title available?) | 1988-01-01 | Paper |
Relating the power of cellular arrays to their closure properties
Theoretical Computer Science | 1988-01-01 | Paper |
Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties
Mathematical Systems Theory | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4060724 (Why is no real title available?) | 1988-01-01 | Paper |
On One-Way Cellular Arrays
SIAM Journal on Computing | 1987-01-01 | Paper |
Parallel Parsing on a One-Way Array of Finite-State Machines
IEEE Transactions on Computers | 1987-01-01 | Paper |
Some observations concerning alternating Turing machines using small space
Information Processing Letters | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4028909 (Why is no real title available?) | 1987-01-01 | Paper |
On Efficient Simulations of Systolic Arrays by Random-Access Machines
SIAM Journal on Computing | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4049114 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3978429 (Why is no real title available?) | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4014035 (Why is no real title available?) | 1986-01-01 | Paper |
On pebble automata
Theoretical Computer Science | 1986-01-01 | Paper |
Iterative tree arrays with logarithmic depth†
International Journal of Computer Mathematics | 1986-01-01 | Paper |
On efficient recognition of transductions and relations
Theoretical Computer Science | 1985-01-01 | Paper |
Fast parallel language recognition by cellular automata
Theoretical Computer Science | 1985-01-01 | Paper |
Sequential Machine Characterizations of Trellis and Cellular Automata and Applications
SIAM Journal on Computing | 1985-01-01 | Paper |
Some characterizations of multihead finite automata
Information and Control | 1985-01-01 | Paper |
The equivalence problem and correctness formulas for a simple class of programs
Information and Control | 1985-01-01 | Paper |
On space and time efficient TM simulations of some restricted classes of PDA's
Information and Control | 1985-01-01 | Paper |
On simple programs with primitive conditional statements
Information and Control | 1985-01-01 | Paper |
Some independence results in complexity theory†
International Journal of Computer Mathematics | 1985-01-01 | Paper |
Characterizations and computational complexity of systolic trellis automata
Theoretical Computer Science | 1984-01-01 | Paper |
A characterization of systolic binary tree automata and applications
Acta Informatica | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3883587 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3907803 (Why is no real title available?) | 1984-01-01 | Paper |
A note on the complexity of program evaluation
Mathematical Systems Theory | 1984-01-01 | Paper |
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
Journal of the ACM | 1983-01-01 | Paper |
A note on finite-valued and finitely ambiguous transducers
Mathematical Systems Theory | 1983-01-01 | Paper |
On the Simplification and Equivalence Problems for Straight-Line Programs
Journal of the ACM | 1983-01-01 | Paper |
On some decision questions concerning pushdown machines
Theoretical Computer Science | 1983-01-01 | Paper |
Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM’<scp>s</scp>
SIAM Journal on Computing | 1983-01-01 | Paper |
Simple programming languages and restricted classes of Turing machines
Theoretical Computer Science | 1983-01-01 | Paper |
On the finite-valuedness problem for sequential machines
Theoretical Computer Science | 1983-01-01 | Paper |
On the zero-inequivalence problem for loop programs
Journal of Computer and System Sciences | 1983-01-01 | Paper |
On the control power of integer division
Theoretical Computer Science | 1983-01-01 | Paper |
On the Space and Time Complexity of Functions Computable by Simple Programs
SIAM Journal on Computing | 1983-01-01 | Paper |
A generalization of the fast LUP matrix decomposition algorithm and applications
Journal of Algorithms | 1982-01-01 | Paper |
2DST mappings of languages and related problems
Theoretical Computer Science | 1982-01-01 | Paper |
(Semi)alternating stack automata
Mathematical Systems Theory | 1982-01-01 | Paper |
Two-Way Counter Machines and Diophantine Equations
Journal of the ACM | 1982-01-01 | Paper |
Some simplified undecidable and NP-hard problems for simple programs
Theoretical Computer Science | 1982-01-01 | Paper |
On some decision problems for RAM programs
Journal of Computer and System Sciences | 1982-01-01 | Paper |
On the complexity of simple arithmetic expressions
Theoretical Computer Science | 1982-01-01 | Paper |
The Complexity of the Equivalence Problem for Simple Loop-Free Programs
SIAM Journal on Computing | 1982-01-01 | Paper |
Straight-Line Programs with One Input Variable
SIAM Journal on Computing | 1982-01-01 | Paper |
The complexity of decision problems for finite-turn multicounter machines
Journal of Computer and System Sciences | 1981-01-01 | Paper |
The complexity of the equivalence problem for two characterizations of Presburger sets
Theoretical Computer Science | 1981-01-01 | Paper |
The Complexity of the Equivalence Problem for Simple Programs
Journal of the ACM | 1981-01-01 | Paper |
On the decidability of equivalence for deterministic pushdown transducers
Information Processing Letters | 1981-01-01 | Paper |
Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication
Information Processing Letters | 1981-01-01 | Paper |
Probabilistic algorithms and straight-line programs for some rank decision problems
Information Processing Letters | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3723859 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3757703 (Why is no real title available?) | 1981-01-01 | Paper |
Characterizations of Presburger Functions
SIAM Journal on Computing | 1981-01-01 | Paper |
On restricted one-counter machines
Mathematical Systems Theory | 1981-01-01 | Paper |
Path Systems: Constructions, Solutions and Applications
SIAM Journal on Computing | 1980-01-01 | Paper |
Simple counter machines and number-theoretic problems
Journal of Computer and System Sciences | 1979-01-01 | Paper |
Restricted one-counter machines with undecidable universe problems
Mathematical Systems Theory | 1979-01-01 | Paper |
An NP-Complete Number-Theoretic Problem
Journal of the ACM | 1979-01-01 | Paper |
Some decision problems concerning sequential transducers and checking automata
Journal of Computer and System Sciences | 1979-01-01 | Paper |
On the space complexity of recursive algorithms
Information Processing Letters | 1979-01-01 | Paper |
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM | 1978-01-01 | Paper |
The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
SIAM Journal on Computing | 1978-01-01 | Paper |
Approximation Algorithms for Certain Scheduling Problems
Mathematics of Operations Research | 1978-01-01 | Paper |
On two-way sequential transductions of full semi-AFL's
Theoretical Computer Science | 1978-01-01 | Paper |
Bounds for LPT Schedules on Uniform Processors
SIAM Journal on Computing | 1977-01-01 | Paper |
Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
Journal of the ACM | 1977-01-01 | Paper |
A useful device for showing the solvability of some decision problems
Journal of Computer and System Sciences | 1976-01-01 | Paper |
| scientific article; zbMATH DE number 3569843 (Why is no real title available?) | 1976-01-01 | Paper |
On Two—Processor Scheduling of One— or Two—Unit Time Tasks with Precedence Constraints
Journal of Cybernetics | 1976-01-01 | Paper |
Finite automata with multiplication
Theoretical Computer Science | 1976-01-01 | Paper |
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM | 1975-01-01 | Paper |
Polynomially Complete Fault Detection Problems
IEEE Transactions on Computers | 1975-01-01 | Paper |
On 3-head versus 2-head finite automata
Acta Informatica | 1975-01-01 | Paper |
Hierarchies of Turing machines with restricted tape alphabet size
Journal of Computer and System Sciences | 1975-01-01 | Paper |
A note on semilinear sets and bounded-reversal multihead pushdown automata
Information Processing Letters | 1974-01-01 | Paper |
A Hierarchy Theorem for Polynomial-Space Recognition
SIAM Journal on Computing | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3424001 (Why is no real title available?) | 1974-01-01 | Paper |
Some results concerning automata on two-dimensional tapes
International Journal of Computer Mathematics | 1974-01-01 | Paper |
On two-way multihead automata
Journal of Computer and System Sciences | 1973-01-01 | Paper |
Controlled pushdown automata
Information Sciences | 1973-01-01 | Paper |
A Note Concerning Nondeterministic Tape Complexities
Journal of the ACM | 1972-01-01 | Paper |
Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata
Journal of Computer and System Sciences | 1971-01-01 | Paper |
Characterizations of transductions defined by abstract families of transducers
Mathematical Systems Theory | 1971-01-01 | Paper |
Simple matrix languages
Information and Control | 1970-01-01 | Paper |
Tape-bounded Turing acceptors and principal AFLs
Journal of Computer and System Sciences | 1970-01-01 | Paper |
Multi-tape and multi-head pushdown automata
Information and Control | 1968-01-01 | Paper |
Two-way pushdown automata
Information and Control | 1967-01-01 | Paper |
Ferromagnetic Wire Memory
IEEE Transactions on Electronic Computers | 1967-01-01 | Paper |
