Oscar H. Ibarra

Inf. Comput., October, 2023

New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines.

[BibT_eX]

[DOI]

Inf. Comput., June, 2023

Unboundedness Problems for Machines with Reversal-Bounded Counters.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2023

On the Containment Problem for Deterministic Multicounter Machine Models.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2023

2022

On the Complexity of Decision Problems for Counter Machines with Applications to Coding Theory.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2021

Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Announcement.

[BibT_eX]

[DOI]

Sartaj K. Sahni

Int. J. Found. Comput. Sci., 2021

Generalizations of Checking Stack Automata: Characterizations and Hierarchies.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2021

Space Complexity of Stack Automata Models.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2021

On finite-index indexed grammars and their restrictions.

[BibT_eX]

[DOI]

Flavio D'Alessandro

Inf. Comput., 2021

2020

Semilinearity of Families of Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2020

2019

On counting functions and slenderness of languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

On families of full trios containing counter machine languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

State grammars with stores.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Insertion operations on deterministic reversal-bounded counter machines.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

On store languages and applications.

[BibT_eX]

[DOI]

Inf. Comput., 2019

2018

On store languages of language acceptors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Variations of checking stack automata: Obtaining unexpected decidability properties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Grammatical characterizations of NPDAs and VPDAs with counters.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

On the Density of Languages Accepted by Turing Machines and Other Machine Models.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2018

On the Density of Context-Free and Counter Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

Accepting runs in a two-way finite automaton.

[BibT_eX]

[DOI]

Qin Li

Inf. Comput., 2018

On the complexity and decidability of some problems involving shuffle.

[BibT_eX]

[DOI]

Inf. Comput., 2018

Introduction to APDCM 2018.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, 2018

On Counting Functions of Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

Input-Position-Restricted Models of Language Acceptors.

[BibT_eX]

[DOI]

Proceedings of the Reversibility and Universality, 2018

2017

On the overlap assembly of strings and languages.

[BibT_eX]

[DOI]

Srujan Kumar Enaganti

Steffen Kopecki

Nat. Comput., 2017

Deletion operations on deterministic families of automata.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Further remarks on DNA overlap assembly.

[BibT_eX]

[DOI]

Srujan Kumar Enaganti

Steffen Kopecki

Inf. Comput., 2017

Information rate of some classes of non-regular languages: An automata-theoretic approach.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Lossiness of communication channels modeled by transducers.

[BibT_eX]

[DOI]

Comput., 2017

Introduction to APDCM Workshop.

[BibT_eX]

[DOI]

Koji Nakano

Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

2016

The effect of end-markers on counter machines and commutativity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

Quantifying communication in synchronized languages.

[BibT_eX]

[DOI]

Thomas R. Fischer

William J. Hutton III

Qin Li

Theor. Comput. Sci., 2016

Preface.

[BibT_eX]

[DOI]

Steffen Kopecki

Nat. Comput., 2016

On decidability and closure properties of language classes with respect to bio-operations.

[BibT_eX]

[DOI]

Nat. Comput., 2016

Announcement.

[BibT_eX]

[DOI]

Francis Y. L. Chin

Sartaj K. Sahni

Int. J. Found. Comput. Sci., 2016

On bounded languages and reversal-bounded automata.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Execution information rate for some classes of automata.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Visibly Pushdown Automata and Transducers with Counters.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2016

On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2016

APDCM Introduction and Committees.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, 2016

2015

Alberto Apostolico.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2015

On the Ambiguity and Finite-Valuedness Problems in Acceptors and Transducers.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2015

Semilinear Sets and Counter Machines: a Brief Survey.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2015

2014

Weak Synchronization and Synchronizability of Multi-tape Pushdown Automata and Turing Machines.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2014

Some Decision Questions Concerning the Time Complexity of Language Acceptors.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

Automata-based symbolic string analysis for vulnerability detection.

[BibT_eX]

[DOI]

Formal Methods Syst. Des., 2014

On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and Transducers.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2014

Information Rate of Some Classes of Non-regular Languages: An Automata-Theoretic Approach - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

On the Parikh Membership Problem for FAs, PDAs, and CMs.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2014

APDCM Introduction and Committees.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Parallel & Distributed Processing Symposium Workshops, 2014

Automata with Reversal-Bounded Counters: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013

On the open problem of Ginsburg concerning semilinear sets and related problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Similarity in languages and programs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

How to synchronize the Heads of a Multitape Automaton.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2013

On the Boundedness Property of Semilinear Sets.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2013

2012

On the containment and equivalence problems for two-way transducers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

On synchronized multi-tape and multi-head automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

One-reversal counter machines and multihead automata: Revisited.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Characterizations of Bounded semilinear Languages by One-Way and Two-Way Deterministic Machines.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

Sheng Yu.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

A Survey of Results on Stateless Multicounter Automata.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

Multitape NFA: Weak Synchronization of the Input Heads.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2012: Theory and Practice of Computer Science, 2012

Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2012

APDCM Introduction.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

2011

Relational String Verification Using Multi-Track Automata.

[BibT_eX]

[DOI]

Fang Yu

Int. J. Found. Comput. Sci., 2011

On Strong Reversibility in P Systems and Related Problems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2011

On Two-Way Transducers.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

On Synchronized Multitape and Multihead Automata.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2011

2010

On decision problems for parameterized machines.

[BibT_eX]

[DOI]

Igor Potapov

Theor. Comput. Sci., 2010

On stateless multihead automata: Hierarchies and the emptiness problem.

[BibT_eX]

[DOI]

Juhani Karhumäki

Alexander Okhotin

Theor. Comput. Sci., 2010

On sets of numbers accepted by P/T systems composed by join.

[BibT_eX]

[DOI]

Pierluigi Frisco

Theor. Comput. Sci., 2010

Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing.

[BibT_eX]

[DOI]

Linmin Yang

Nat. Comput., 2010

On spiking neural P systems.

[BibT_eX]

[DOI]

Mario J. Pérez-Jiménez

Takashi Yokomori

Nat. Comput., 2010

On the universe, disjointness, and containment problems for simple machines.

[BibT_eX]

[DOI]

Inf. Comput., 2010

Advances in parallel and distributed computing models - APDCM.

[BibT_eX]

[DOI]

Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

On Decision Problems for Simple and Parameterized Machines.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

Computing with Cells: Membrane Systems.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009

Sequential SNP systems based on min/max spike number.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Asynchronous spiking neural P systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2009

On Languages Accepted by P/T Systems Composed of joins

[BibT_eX]

[DOI]

Pierluigi Frisco

Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

Symbolic String Verification: Combining String Analysis and Size Analysis.

[BibT_eX]

[DOI]

Fang Yu

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2009

A Look Back at Some Early Results in Membrane Computing.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 10th International Workshop, 2009

On Stateless Multihead Finite Automata and Multihead Pushdown Automata.

[BibT_eX]

[DOI]

Pierluigi Frisco

Proceedings of the Developments in Language Theory, 13th International Conference, 2009

Hierarchies and Characterizations of Stateless Multicounter Machines.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

On Stateless Multicounter Machines.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Theory and Computational Practice, 2009

On Nonuniversal Symport/Antiport P Systems.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Bioprocesses, 2009

2008

Minimum-cost delegation in service composition.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Computing with cells: membrane systems - some complexity issues.

[BibT_eX]

[DOI]

Int. J. Parallel Emergent Distributed Syst., 2008

On spiking neural P systems and partially blind counter machines.

[BibT_eX]

[DOI]

Nat. Comput., 2008

Characterizations of some classes of spiking neural P systems.

[BibT_eX]

[DOI]

Nat. Comput., 2008

On Stateless Automata and P Systems.

[BibT_eX]

[DOI]

Linmin Yang

Int. J. Found. Comput. Sci., 2008

Discrete Nondeterministic Modeling of the Fas Pathway.

[BibT_eX]

[DOI]

John Jack

Int. J. Found. Comput. Sci., 2008

On Counter Machines, Reachability Problems, and Diophantine Equations.

[BibT_eX]

[DOI]

Linmin Yang

Int. J. Found. Comput. Sci., 2008

Symbolic String Verification: An Automata-Based Approach.

[BibT_eX]

[DOI]

Proceedings of the Model Checking Software, 2008

Sequentiality Induced by Spike Number in SNP Systems.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 14th International Meeting on DNA Computing, 2008

2007

Membrane Systems.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Parallel Computing - Models, Algorithms and Applications., 2007

Normal forms for spiking neural P systems.

[BibT_eX]

[DOI]

Gheorghe Paun

Petr Sosík

Theor. Comput. Sci., 2007

Developments in language theory.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

Characterizing Regular Languages by Spiking Neural P Systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

Spiking Neural P Systems: Some Characterizations.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 16th International Symposium, 2007

Asynchronous Spiking Neural P Systems: Decidability and Undecidability.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 13th International Meeting on DNA Computing, 2007

A q-Analogue of the Parikh Matrix Mapping.

[BibT_eX]

[DOI]

Proceedings of the Formal Models, 2007

2006

Deterministic catalytic systems are not universal.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

On partially blind multihead finite automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems.

[BibT_eX]

[DOI]

Gheorghe Paun

Theor. Comput. Sci., 2006

On the solvability of a class of diophantine equations and applications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

On the Computational Complexity of P Automata.

[BibT_eX]

[DOI]

Erzsébet Csuhaj-Varjú

György Vaszil

Nat. Comput., 2006

Quality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic Approach.

[BibT_eX]

[DOI]

Cagdas Evren Gerede

J. Autom. Lang. Comb., 2006

On the Decidability of Model-Checking for P Systems.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2006

On symport/antiport P systems with a small number of objects.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2006

On the Computational Power of 1-Deterministic and Sequential P Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

Characterizations of Some Restricted Spiking Neural P Systems.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 7th International Workshop, 2006

2005

On determinism versus nondeterminism in P systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

On membrane hierarchy in P systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

On composition and lookahead delegation of <i>e</i>-services modeled by automata<sup>, </sup>.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

On two-way nondeterministic finite automata with one reversal-bounded counter.

[BibT_eX]

[DOI]

Zhi-Wei Sun

Theor. Comput. Sci., 2005

On various notions of parallelism in P Systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

On one-membrane P systems operating in sequential mode.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

On Deterministic Catalytic Systems.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2005

On Model-Checking of P Systems.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation, 4th International Conference, 2005

On Symport/Antiport P Systems with One or Two Symbols.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2005), 2005

Some Computational Issues in Membrane Computing.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

On Symport/Antiport P Systems and Semilinear Sets.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 6th International Workshop, 2005

Some Recent Results Concerning Deterministic P Systems.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, 6th International Workshop, 2005

SPiDeR: P2P-Based Web Service Discovery.

[BibT_eX]

[DOI]

Proceedings of the Service-Oriented Computing, 2005

Signaling P Systems and Verification Problems.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

On Bounded Symport/Antiport P Systems.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

Counting Time in Computing with Cells.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

On Sequential and 1-Deterministic P Systems.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Online and Minimum-Cost Ad Hoc Delegation in e-Service Composition.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Conference on Services Computing (SCC 2005), 2005

2004

Catalytic P systems, semilinear sets, and vector addition systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

On two-way FA with monotonic counters and quadratic Diophantine equations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Editorial.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

On the computational complexity of membrane systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Past pushdown timed automata and safety verification.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Computing And Combinatorics Conference -- Cocoon'02.

[BibT_eX]

[DOI]

Louxin Zhang

Int. J. Found. Comput. Sci., 2004

Instance-Specific Solutions For Accelerating The Cky Parsing Of Large Context-Free Grammars.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2004

Automata-Theoretic Techniques for Analyzing Infinite-State Systems.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2004

P Systems: Some Recent Results and Research Problems.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Programming Paradigms, 2004

Composability of Infinite-State Activity Automata.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

A Matrix q-Analogue of the Parikh Map.

[BibT_eX]

[DOI]

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Automated composition of e-services: lookaheads.

[BibT_eX]

[DOI]

Proceedings of the Service-Oriented Computing, 2004

Modeling Affective Responses in Intelligent Tutoring Systems.

[BibT_eX]

[DOI]

Yasmín Pérez

Rafael Gamboa

Proceedings of the IEEE International Conference on Advanced Learning Technologies, 2004

Real-Counter Automata and Their Decision Problems.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

The Power of Maximal Parallelism in P Systems.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 2004

On P Systems Operating in Sequential Mode.

[BibT_eX]

Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

2003

Verification in loosely synchronous queue-connected discrete timed automata.

[BibT_eX]

[DOI]

Pierluigi San Pietro

Theor. Comput. Sci., 2003

Eliminating the storage tape in reachability constructions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Generalized discrete timed automata: decidable approximations for safety verificatio.

[BibT_eX]

[DOI]

Richard A. Kemmerer

Theor. Comput. Sci., 2003

Closure and decidability properties of some language classes with respect to ciliate bio-operations.

[BibT_eX]

[DOI]

Mark Daley

Theor. Comput. Sci., 2003

The LD and DLAD Bio-Operations on Formal Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2003

Characterizations of Catalytic Membrane Computing Systems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

The Number of Membranes Matters.

[BibT_eX]

[DOI]

Proceedings of the Membrane Computing, International Workshop, 2003

A Solvable Class of Quadratic Diophantine Equations with Applications to Verification of Infinite-State Systems.

[BibT_eX]

[DOI]

Gaoyan Xie

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Dense Counter Machines and Verification Problems.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 15th International Conference, 2003

2002

Counter Machines and Verification Problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Augmenting the discrete timed automaton with other data structures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Some Decision Problems Concerning Semilinearity and Commutation.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2002

Verification in Queue-Connected Multicounter Machines.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2002

The Existence of w-Chains for Transitive Mixed Linear Relations and Its Applications.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2002

On Moving Object Queries.

[BibT_eX]

[DOI]

Hoda M. O. Mokhtar

Proceedings of the Twenty-first ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2002

On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter.

[BibT_eX]

[DOI]

Zhi-Wei Sun

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Workshop Introduction.

[BibT_eX]

[DOI]

Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

Safety Verification for Two-Way Finite Automata with Monotonic Counters.

[BibT_eX]

[DOI]

Zhi-Wei Sun

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

Trajectory queries and octagons in moving object databases.

[BibT_eX]

[DOI]

Proceedings of the 2002 ACM CIKM International Conference on Information and Knowledge Management, 2002

2001

On Reachability and Safety in Infinite-State Systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2001

Past Pushdown Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2001

On Multi-way Spatial Joins with Direction Predicates.

[BibT_eX]

[DOI]

Proceedings of the Advances in Spatial and Temporal Databases, 7th International Symposium, 2001

Moving Objects: Logical Relationships and Queries.

[BibT_eX]

[DOI]

Haiyan Xu

Proceedings of the Advances in Spatial and Temporal Databases, 7th International Symposium, 2001

On Removing the Pushdown Stack in Reachability Constructions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Decision Questions Concerning Semilinearity, Morphisms, and Commutation of Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter.

[BibT_eX]

[DOI]

Pierluigi San Pietro

Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

Decidable Approximations on Generalized and Parameterized Discrete Timed Automata.

[BibT_eX]

[DOI]

Richard A. Kemmerer

Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

Counter machines and the safety and disjointness problems for database queries with linear constraints.

[BibT_eX]

Athanassios S. Poulakidas

Constantinos Bartzis

Proceedings of the Where Mathematics, 2001

2000

Image compression for fast wavelet-based subregion retrieval.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Adaptive Load Sharing for Clustered Digital Library Servers.

[BibT_eX]

[DOI]

Int. J. Digit. Libr., 2000

Generalizing the Discrete Timed Automaton.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2000

Reachability and Safety in Queue Systems.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2000

Extending Rectangle Join Algorithms for Rectilinear Polygons.

[BibT_eX]

[DOI]

Proceedings of the Web-Age Information Management, First International Conference, 2000

Toward Spatial Joins for Polygons.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Scientific and Statistical Database Management, 2000

Conter Machines: Decidable Properties and Applications to Verification Problems.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Workshop on Advances in Parallel and Distributed Computational Models.

[BibT_eX]

[DOI]

Koji Nakano

Stephan Olariu

Proceedings of the Parallel and Distributed Processing, 2000

Reachability Analysis for Some Models of Infinite-State Transition Systems.

[BibT_eX]

[DOI]

Proceedings of the CONCUR 2000, 2000

Binary Reachability Analysis of Discrete Pushdown Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999

A Technique for Proving Decidability of Containment and Equivalence of Linear Constraint Queries.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1999

An Index Structure for Spatial Joins in Linear Constraint Databases.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on Data Engineering, 1999

Counter Machines: Decision Problems and Applications.

[BibT_eX]

Proceedings of the Jewels are Forever, 1999

1998

Adaptive Partitioning and Scheduling for Enhancing WWW Application Performance.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1998

1997

On the Parallel Complexity of Loops.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Parallel Progressive Radiosity with Adaptive Meshing.

[BibT_eX]

[DOI]

Yizhou Yu

J. Parallel Distributed Comput., 1997

Toward a Scalable Distributed {WWW} Server on Workstation Clusters.

[BibT_eX]

[DOI]

Daniel Andresen

J. Parallel Distributed Comput., 1997

On the Complexity of Commutativity Analysis.

[BibT_eX]

[DOI]

Pedro C. Diniz

Martin C. Rinard

Int. J. Found. Comput. Sci., 1997

On the Containment and Equivalence of Database Queries with Linear Constraints.

[BibT_eX]

[DOI]

Athanassios S. Poulakidas

Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1997

A Compact Storage Scheme for Fast Wavelet-Based Subregion Retrieval.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, Third Annual International Conference, 1997

1996

Performance Prediction in Symbolic Scheduling of Partitioned Programs with Weight Variation.

[BibT_eX]

[DOI]

Athanassios S. Poulakidas

J. Parallel Distributed Comput., 1996

SWEB: Towards a Scalable World Wide Web Server on Multicomputers.

[BibT_eX]

[DOI]

Proceedings of IPPS '96, 1996

Experimental Studies on a Compact Storage Scheme for Wavelet-Based Multiresolution Subregion Retrieval.

[BibT_eX]

Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996

Scalability Issues for High Performance Digital Libraries on the World Wide Web.

[BibT_eX]

[DOI]

Proceedings of the Third Forum on Research and Technology Advances in Digital Library, 1996

1995

New Decidability Results Concerning Two-Way Counter Machines.

[BibT_eX]

[DOI]

SIAM J. Comput., 1995

A note on parsing pattern languages.

[BibT_eX]

[DOI]

Ting-Chuen Pong

Pattern Recognit. Lett., 1995

An Optimal Shortest Path Parallel Algorithm for Permutation Graphs.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1995

On symbolic scheduling and parallel complexity of loops.

[BibT_eX]

[DOI]

Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995

1994

Some Results Concerning 2-D On-Line Tessellation Acceptors and 2-D Alternating Finite Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Fast Parallel Algorithms for Solving Triangular Systems of Linear Equations on the Hypercube.

[BibT_eX]

[DOI]

Myung Hee Kim

J. Parallel Distributed Comput., 1994

Some Efficient Algorithms for Permutation Graphs.

[BibT_eX]

[DOI]

J. Algorithms, 1994

On Communication-Bounded Synchronized Alternating Finite Automata.

[BibT_eX]

[DOI]

Acta Informatica, 1994

On the Parallel Complexity of Solving Recurrence Equations.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Transformations Between Boundary Codes, Run Length Codes, and Linear Quadtrees.

[BibT_eX]

[DOI]

Myung Hee Kim

Proceedings of the 8th International Symposium on Parallel Processing, 1994

A flow based approach to the pin redistribution problem for multi-chip modules.

[BibT_eX]

[DOI]

Douglas Chang

Teofilo F. Gonzalez

Proceedings of the Fourth Great Lakes Symposium on Design Automation of High Performance VLSI Systems, 1994

On Some Open Problems Concerning the Complexity of Cellular Arrays.

[BibT_eX]

[DOI]

Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993

Synchronized Finite Automata and 2DFA Reductions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

A Note on Simple Programs with Two Variables.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

Quadtree Building Algorithms on an SIMD Hypercube.

[BibT_eX]

[DOI]

Myung Hee Kim

J. Parallel Distributed Comput., 1993

On Efficient Parallel Algorithms for Solving Set Recurrence Equations.

[BibT_eX]

[DOI]

J. Algorithms, 1993

On the Equivalence of Two-Way Pushdown Automata and Counter Machines Over Bounded Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1993

On the Communication Complexity of Parallel Computation.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

On the Shortest Path Problems for Permutation Graphs.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Parallel Processing Symposium, 1993

Finding Articulation Points and Bridges of Permutation Graphs.

[BibT_eX]

[DOI]

Proceedings of the 1993 International Conference on Parallel Processing, 1993

New Decidability Results Concerning Two-way Counter Machines and Applications.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992

On Space-Bounded Synchronized Alternating Turing Machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

A Characterization of Exponential-Time Languages by Alternating Context-Free Grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

String Editing on a One-Way Linear Array of Finite-State Machines.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1992

Iterative algorithms for the planar convex hull problem on mesh-connected arrays.

[BibT_eX]

[DOI]

Parallel Comput., 1992

A hierarchy result for 2-dimensional TM's operating in small space.

[BibT_eX]

[DOI]

Inf. Sci., 1992

New Results Concerning Synchronized Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991

Some Classes of Languages in NC¹

[BibT_eX]

[DOI]

Inf. Comput., January, 1991

Parallel Parsing on a One-Way Linear Array of Finite-State Machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Parallel Regognition and Parsing on the Hypercube.

[BibT_eX]

[DOI]

Ting-Chuen Pong

IEEE Trans. Computers, 1991

On resetting DLBA's.

[BibT_eX]

[DOI]

SIGACT News, 1991

The Power of Alternating One-Reversal Counters and Stacks.

[BibT_eX]

[DOI]

SIAM J. Comput., 1991

Learning Regular Languages from Counterexamples.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1991

On Resetiting DLBA's.

[BibT_eX]

Bull. EATCS, 1991

Triangulation in a Plane and 3-D Convex Hull on Mesh-Connected Arrays and Hypercubes.

[BibT_eX]

[DOI]

Proceedings of the Fifth International Parallel Processing Symposium, Proceedings, Anaheim, California, USA, April 30, 1991

Triangulation Voronoi Diagram and Convex Hull in k-Space on Mesh-Connected Arrays and Hypercubes.

[BibT_eX]

Proceedings of the International Conference on Parallel Processing, 1991

1990

Systolic algorithms for some scheduling and graph problems.

[BibT_eX]

[DOI]

J. VLSI Signal Process., 1990

String processing on the hypercube.

[BibT_eX]

[DOI]

Ting-Chuen Pong

IEEE Trans. Acoust. Speech Signal Process., 1990

On Mapping Systolic Algorithms onto the Hypercube.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1990

An efficient all-parses systolic algorithm for general context-free parsing.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1990

Efficient parallel algorithms for solving set recurrence equations and applications.

[BibT_eX]

[DOI]

Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, 1990

Iterative Algorithms for Planar Convex Hull on Mesh-Connected Arrays.

[BibT_eX]

Proceedings of the 1990 International Conference on Parallel Processing, 1990

1989

Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATMs and Space-Bounded TMs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1989

Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation.

[BibT_eX]

[DOI]

SIAM J. Comput., 1989

On Iterative and Cellular Tree Arrays.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1989

Optimal Simulation of Tree Arrays by Linear Arrays.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1989

Parallel Parsing on a One-way Linear Array of Finite-State Machines.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989

1988

Two-Dimensional Iterative Arrays: Characterizations and Applications.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

Relating the Power of Cellular Arrays to Their Closure Properties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

On Two-Dimensional Via Assignment for Single-Row Routing.

[BibT_eX]

[DOI]

David Hung-Chang Du

J. Fernando Naveda

IEEE Trans. Computers, 1988

Systolic Tree Implementation of Data Structures.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1988

Two-Dimensional Convolution on a Pyramid Computer.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 1988

Sublogarithmic-Space Turing Machines, Nonuniform Space Complexity, and Closure Properties.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1988

On the power of one-way communication.

[BibT_eX]

[DOI]

Anastasios Vergis

J. ACM, 1988

Some Subclasses of Context-Free Languages In NC1.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1988

Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM's and Space-Bounded TM's.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 15th International Colloquium, 1988

Trading reversals for alternation.

[BibT_eX]

[DOI]

Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988

On Some Languages in NC.

[BibT_eX]

[DOI]

Proceedings of the VLSI Algorithms and Architectures, 3rd Aegean Workshop on Computing, 1988

1987

VLSI algorithms for solving recurrence equations and applications.

[BibT_eX]

[DOI]

IEEE Trans. Acoust. Speech Signal Process., 1987

Single-Row Routing with Crossover Bound.

[BibT_eX]

[DOI]

David Hung-Chang Du

J. Fernando Naveda

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1987

Parallel Parsing on a One-Way Array of Finite-State Machines.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1987

On Efficient Simulations of Systolic Arrays of Random-Access Machines.

[BibT_eX]

[DOI]

SIAM J. Comput., 1987

On One-Way Cellular Arrays.

[BibT_eX]

[DOI]

SIAM J. Comput., 1987

Some Observations Concerning Alternating Turing Machines Using Small Space.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

On the Computing Power of One-Way Cellular Arrays.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

Relating the Degree of Ambiguity of Finite Automata to the Succinctness of their Representation.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1987

1986

On Pebble Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

Designing Systolic Algorithms Using Sequential Machines.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1986

On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers.

[BibT_eX]

[DOI]

Proceedings of the STACS 86, 1986

Systolic Arrays: Characterizations and Complexity.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985

On Simple Programs with Primitive Conditional Statements

[BibT_eX]

[DOI]

Inf. Control., April, 1985

The Equivalence Problem and Correctness Formulas for a Simple Class of Programs

[BibT_eX]

[DOI]

Inf. Control., April, 1985

Fast Parallel Language Recognition by Cellular Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

On Efficient Recognition of Transductions and Relations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1985

Sequential Machine Characterizations of Trellis and Cellular Automata and Applications.

[BibT_eX]

[DOI]

SIAM J. Comput., 1985

Some results concerning linear iterative (systolic) arrays.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1985

On Space and Time Efficient TM Simulations of Some Restricted Classes of PDA's

[BibT_eX]

[DOI]

Inf. Control., 1985

Some Characterizations of Multihead Finite Automata

[BibT_eX]

[DOI]

Inf. Control., 1985

1984

Characterizations and Computational Complexity of Systolic Trellis Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1984

A Note on the Complexity of Program Evaluation.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1984

A Characterization of Systolic Binary Tree Automata and Applications.

[BibT_eX]

[DOI]

Acta Informatica, 1984

The Equivalence Problem and Correctness Formulas for a Simple Class of Programs (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1984

1983

On the Simplification and Equivalence Problems for Straight-Line Programs

[BibT_eX]

[DOI]

J. ACM, July, 1983

Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs

[BibT_eX]

[DOI]

J. ACM, January, 1983

Simple Programming Languages and Restricted Classes of Turing Machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1983

On the Control Power of Integer Division.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1983

On Some Decision Questions Concerning Pushdown Machines.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1983

On the Finite-Valuedness Problem for Sequential Machines.

[BibT_eX]

[DOI]

Tat-hung Chan

Theor. Comput. Sci., 1983

Some Time-Space Tradeoff Results Concerning Single-Tape and Offline TM's.

[BibT_eX]

[DOI]

SIAM J. Comput., 1983

On the Space and Time Complexity of Functions Computable by Simple Programs.

[BibT_eX]

[DOI]

Tat-hung Chan

SIAM J. Comput., 1983

A Note on Finitely-Valued and Finitely Ambiguous Transducers.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1983

On the Zero-Inequivalence Problem for Loop Programs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1983

1982

On the Complexity of Simple Arithmetic Expressions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

2DST Mapppings on Languages and Related Problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

Some Simplified Undecidable and NP-Hard Problems for Simple Programs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

The Complexity of the Equivalence Problem for Simple Loop-Free Programs.

[BibT_eX]

[DOI]

SIAM J. Comput., 1982

Straight-Line Programs with One Input Variable.

[BibT_eX]

[DOI]

SIAM J. Comput., 1982

(Semi)Alternating Stack Automata.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1982

On Some Decision Problems for RAM Programs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1982

A Generalization of the Fast LUP Matrix Decomposition Algorithm and Applications.

[BibT_eX]

[DOI]

Roger Hui

J. Algorithms, 1982

Two-Way Counter Machines and Diophantine Equations.

[BibT_eX]

[DOI]

J. ACM, 1982

1981

The Complexity of the Equivalence Problem for two Characterizations of Presburger Sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1981

Characterizations of Presburger Functions.

[BibT_eX]

[DOI]

SIAM J. Comput., 1981

On Restricted One-counter Machines.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1981

The Complexity of Decision Problems for Finite-Turn Multicounter Machines.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1981

The Complexity of the Equivalence Problem for Simple Programs.

[BibT_eX]

[DOI]

J. ACM, 1981

On the Decidability of Equivalence for Deterministic Pushdown Transducers.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

Probabilistic Algorithms and Straight-Line Programs for Some Rank Decision Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

Deterministic and Probabilistic Algorithms for Maximum Bipartite Matching Via Fast Matrix Multiplication.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

1980

Path Systems: Constructions, Solutions and Applications.

[BibT_eX]

[DOI]

SIAM J. Comput., 1980

A Note on the Parallel Complexity of Computing the Rank of Order n Matrices.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1980

The Complexity of the Equivalence Problem for Straight-Line Programs

[BibT_eX]

[DOI]

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1979

Restricted One-Counter Machines with Undecidable Universe Problems.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1979

Simple Counter Machines and Number-Theoretic Problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1979

Some Decision Problems Concerning Sequential Transducers and Checking Automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1979

An NP-Complete Number-Theoretic Problem.

[BibT_eX]

[DOI]

J. ACM, 1979

On the Space Complexity of Recursive Algorithms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1979

The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs

[BibT_eX]

[DOI]

Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

1978

On Two-Way Sequential Transductions of Full Semi-AFL's.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1978

The Unsolvability of the Equivalence Problem for epsilon-Free NGSM's with Unary Input (Output) Alphabet and Applications.

[BibT_eX]

[DOI]

SIAM J. Comput., 1978

Approximation Algorithms for Certain Scheduling Problems.

[BibT_eX]

[DOI]

Math. Oper. Res., 1978

Reversal-Bounded Multicounter Machines and Their Decision Problems.

[BibT_eX]

[DOI]

J. ACM, 1978

1977

Bounds for LPT Schedules on Uniform Processors.

[BibT_eX]

[DOI]

Teofilo F. Gonzalez

SIAM J. Comput., 1977

Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors.

[BibT_eX]

[DOI]

J. ACM, 1977

1976

Finite Automata with Multiplication.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1976

A Useful Device for Showing the Solvability of Some Decision Problems.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1976

1975

Polynomially Complete Fault Detection Problems.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1975

Hierarchies of Turing Machines with Restricted Tape Alphabet Size.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1975

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems.

[BibT_eX]

[DOI]

J. ACM, 1975

1974

A Hierarchy Theorem for Polynomial-Space Recognition.

[BibT_eX]

[DOI]

SIAM J. Comput., 1974

A Note on Semilinear Sets and Bounded-Reversal Multihead Pushdown Automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1974

On 3-Head Versus 2-Head Finite Automata.

[BibT_eX]

[DOI]

Acta Informatica, 1974

1973

On Two-way Multihead Automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1973

Controlled pushdown automata.

[BibT_eX]

[DOI]

Inf. Sci., 1973

1972

A Note Concerning Nondeterministic Tape Complexities.

[BibT_eX]

[DOI]

J. ACM, 1972

1971

Characterizations of Transductions Defined by Abstract Families of Transducers.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1971

Characterizations of Some Tape and Time Complexity Classes of Turing Machines in Terms of Multihead and Auxiliary Stack Automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1971

1970

Simple Matrix Languages

[BibT_eX]

[DOI]

Inf. Control., November, 1970

Tape-Bounded Turing Acceptors and Principal AFLs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1970

1968

Multi-Tape and Multi-Head Pushdown Automata

[BibT_eX]

[DOI]

Michael A. Harrison

Inf. Control., November, 1968

1967

On the Equivalence of Finite-State Sequential Machine Models.

[BibT_eX]

[DOI]

IEEE Trans. Electron. Comput., 1967

Two-Way Pushdown Automata

[BibT_eX]

[DOI]

Jim Gray

Michael A. Harrison