On the public citation graph
The method of forced enumeration for nondeterministic automata
0 signed · 357 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/s0019-9958(64)90120-2openalex-snapshot
Classes of languages and linear-bounded automata
inferredcites →https://doi.org/10.1109/sct.1988.5270openalex-snapshot
Nondeterministic space is closed under complementation
inferredcites →https://doi.org/10.13182/nse70-a19706openalex-snapshot
Formal Languages and their Relation to Automata
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.3217/jucs-008-07-0722openalex-extracted
Heyting Algebras and Formal Languages
inferred← citeshttps://doi.org/10.1002/047134608x.w1617openalex-snapshot
Computational Complexity Theory
inferred← citeshttps://doi.org/10.1002/malq.19980440108openalex-snapshot
Capturing Relativized Complexity Classes without Order
inferred← citeshttps://doi.org/10.1006/inco.1995.1039openalex-snapshot
On Deciding Readiness and Failure Equivalences for Processes
inferred← citeshttps://doi.org/10.1006/inco.1996.0071openalex-snapshot
Logspace and Logtime Leaf Languages
inferred← citeshttps://doi.org/10.1006/inco.1996.0084openalex-snapshot
Inductive Counting for Width-Restricted Branching Programs
inferred← citeshttps://doi.org/10.1006/inco.1996.0085openalex-snapshot
Time-Space Tradeoffs for Undirected Graph Traversal by Graph Automata
inferred← citeshttps://doi.org/10.1006/inco.1997.2682openalex-snapshot
Bridging across the log(n) Space Frontier
inferred← citeshttps://doi.org/10.1006/inco.1998.2742openalex-snapshot
Positive Versions of Polynomial Time
inferred← citeshttps://doi.org/10.1006/inco.2001.3039openalex-snapshot
The Complexity of the Exponential Output Size Problem for Top-Down and Bottom-Up Tree Transducers,
inferred← citeshttps://doi.org/10.1006/jcss.1996.0068openalex-snapshot
On the Isomorphism Conjecture for Weak Reducibilities
inferred← citeshttps://doi.org/10.1006/jcss.1997.1483openalex-snapshot
DSPACE(n)=?NSPACE(n): A Degree Theoretic Characterization
inferred← citeshttps://doi.org/10.1006/jcss.1999.1646openalex-snapshot
Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds
inferred← citeshttps://doi.org/10.1007/11505877_23openalex-snapshot
Complementing Two-Way Finite Automata
inferred← citeshttps://doi.org/10.1007/11549345_8openalex-snapshot
The Complexity of Satisfiability Problems: Refining Schaefer’s Theorem
inferred← citeshttps://doi.org/10.1007/11590156_19openalex-snapshot
The Directed Planar Reachability Problem
inferred← citeshttps://doi.org/10.1007/11786986_40openalex-snapshot
On the Bipartite Unique Perfect Matching Problem
inferred← citeshttps://doi.org/10.1007/3-540-28520-2_3openalex-snapshot
Foundations of Complexity Theory
inferred← citeshttps://doi.org/10.1007/3-540-28520-2_8openalex-snapshot
Other Public-Key Cryptosystems and Protocols
inferred← citeshttps://doi.org/10.1007/3-540-28788-4_12openalex-snapshot
Quantifiers and Logical Reductions
inferred← citeshttps://doi.org/10.1007/3-540-32743-6_8openalex-snapshot
Von der Turingmaschine zum Quantencomputer — ein Gang durch die Geschichte der Komplexitätstheorie
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_37openalex-snapshot
Alternating and Empty Alternating Auxiliary Stack Automata
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_34openalex-snapshot
Space Hierarchy Theorem Revised
inferred← citeshttps://doi.org/10.1007/3-540-45007-6_26openalex-snapshot
Computation with Absolutely No Space Overhead
inferred← citeshttps://doi.org/10.1007/3-540-45294-x_1openalex-snapshot
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1007/3-540-45655-4_6openalex-snapshot
On the Minimal Polynomial of a Matrix
inferred← citeshttps://doi.org/10.1007/3-540-45687-2_52openalex-snapshot
Towards a Cardinality Theorem for Finite Automata
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_42openalex-snapshot
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL
inferred← citeshttps://doi.org/10.1007/3-540-46541-3_7openalex-snapshot
The Complexity of Planarity Testing
inferred← citeshttps://doi.org/10.1007/3-540-46583-9_3openalex-snapshot
A Perspective on Lindström Quantifiers and Oracles
inferred← citeshttps://doi.org/10.1007/3-540-52753-2_38openalex-snapshot
On logical descriptions of some concepts in structural complexity theory
inferred← citeshttps://doi.org/10.1007/3-540-53414-8_44openalex-snapshot
Hierarchies over the context-free languages
inferred← citeshttps://doi.org/10.1007/3-540-53507-1_67openalex-snapshot
Finite-model theory—a personal perspective
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_150openalex-snapshot
Collapsing degrees via strong computation
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_61openalex-snapshot
Unambiguity and fewness for logarithmic space
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_173openalex-snapshot
The effect of Vector synchronization: Residue and loss
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_29openalex-snapshot
Characterization of context-pree languages by erasing automata
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_22openalex-snapshot
Counting, selecting, and sorting by query-bounded machines
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_3openalex-snapshot
Alternation for two-way machines with sublogarithmic space
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_4openalex-snapshot
Separating the lower levels of the sublogarithmic space hierarchy
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_133openalex-snapshot
The alternation hierarchy for machines with sublogarithmic space is infinite
inferred← citeshttps://doi.org/10.1007/3-540-58338-6_74openalex-snapshot
Inductive counting below logspace
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_130openalex-snapshot
My favorite ten complexity theorems of the past decade
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_103openalex-snapshot
Multihead two-way probabilistic finite automata
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_112openalex-snapshot
Bridging across the log(n) space frontier
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_71openalex-snapshot
On the synchronization of semi-traces
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_84openalex-snapshot
Verification of fair transition systems
inferred← citeshttps://doi.org/10.1007/978-0-387-35358-6_21openalex-snapshot
Relating Linear and Branching Model Checking
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_7openalex-snapshot
The Complexity of Obtaining Solutions for Problems in NP and NL
inferred← citeshttps://doi.org/10.1007/978-1-4612-1872-2_9openalex-snapshot
Computing with Sublogarithmic Space
inferred← citeshttps://doi.org/10.1007/978-1-4612-4478-3_4openalex-snapshot
Juris Hartmanis: Fundamental Contributions to Isomorphism Problems
inferred← citeshttps://doi.org/10.1007/978-1-4612-4478-3_6openalex-snapshot
Self-Reducibility: Effects of Internal Structure on Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-1-4613-8853-1openalex-snapshot
Finite Automata, Their Algebras and Grammars: Towards a Theory of Formal Expressions
inferred← citeshttps://doi.org/10.1007/978-1-4615-3422-8_30openalex-snapshot
The Complexity of Algorithmic Problems on Succinct Instances
inferred← citeshttps://doi.org/10.1007/978-3-030-14812-6_41openalex-snapshot
Supportive Oracles for Parameterized Polynomial-Time Sub-Linear-Space Computations in Relation to L, NL, and P
inferred← citeshttps://doi.org/10.1007/978-3-030-30806-3_11openalex-snapshot
On the Termination Problem for Counter Machines with Incrementing Errors
inferred← citeshttps://doi.org/10.1007/978-3-030-59671-2_1openalex-snapshot
What is Spatial Complexity?
inferred← citeshttps://doi.org/10.1007/978-3-031-18461-1_51openalex-snapshot
Parameterized-NL Completeness of Combinatorial Problems by Short Logarithmic-Space Reductions and Immediate Consequences of the Linear Space Hypothesis
inferred← citeshttps://doi.org/10.1007/978-3-031-62687-6_17openalex-snapshot
Logical Expressibility of Syntactic NL for Complementarity and Maximization
inferred← citeshttps://doi.org/10.1007/978-3-031-71112-1_13openalex-snapshot
Decision Problems for Subregular Classes
inferred← citeshttps://doi.org/10.1007/978-3-031-95908-0_35openalex-snapshot
Alternation-Bounded Semi-unbounded Fan-in Cascading Circuits and the Complementation Closure Property
inferred← citeshttps://doi.org/10.1007/978-3-032-04700-7_5openalex-snapshot
Inductive Tracing and the Complexity of Finding Hamiltonian Path in DAGs
inferred← citeshttps://doi.org/10.1007/978-3-319-03545-1_11openalex-snapshot
A Formal Proof of Borodin-Trakhtenbrot’s Gap Theorem
inferred← citeshttps://doi.org/10.1007/978-3-319-03780-6_28openalex-snapshot
Uniform-Circuit and Logarithmic-Space Approximations of Refined Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-04657-0_26openalex-snapshot
Collapsing Exact Arithmetic Hierarchies
inferred← citeshttps://doi.org/10.1007/978-3-319-05446-9_1openalex-snapshot
Complexity Theory Basics: NP and NL
inferred← citeshttps://doi.org/10.1007/978-3-319-05446-9_3openalex-snapshot
Space Complexity of the Directed Reachability Problem over Surface-Embedded Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-08846-4_3openalex-snapshot
Investigations on Automata and Languages over a Unary Alphabet
inferred← citeshttps://doi.org/10.1007/978-3-319-09698-8_26openalex-snapshot
Minimal and Hyper-Minimal Biautomata
inferred← citeshttps://doi.org/10.1007/978-3-319-19225-3_10openalex-snapshot
On the Computational Complexity of Problems Related to Distinguishability Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-21500-6_22openalex-snapshot
Minimal Reversible Deterministic Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-21500-6_29openalex-snapshot
On the Complexity of k-Piecewise Testability and the Depth of Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-26850-7_9openalex-snapshot
Homonym Population Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-32162-2_1openalex-snapshot
$$P\mathop{ =}\limits^{?}NP$$
inferred← citeshttps://doi.org/10.1007/978-3-319-67089-8_13openalex-snapshot
Parameterized Graph Connectivity and Polynomial-Time Sub-Linear-Space Short Reductions
inferred← citeshttps://doi.org/10.1007/978-3-319-90530-3_12openalex-snapshot
Complement for Two-Way Alternating Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_2openalex-snapshot
Some Estimated Likelihoods for Computational Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-96154-5_21openalex-snapshot
Inductive Counting and the Reachability Problem for Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-98654-8_17openalex-snapshot
Recognizability for Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-98654-8_33openalex-snapshot
Computational Complexity of Decision Problems on Self-verifying Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-98654-8_9openalex-snapshot
Decidability of Right One-Way Jumping Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-322-90191-0_1openalex-snapshot
Mathematik und Informatik
inferred← citeshttps://doi.org/10.1007/978-3-322-95375-9_1openalex-snapshot
Mathematik und Informatik
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_23openalex-snapshot
The Complexity of Membership Problems for Circuits over Sets of Integers
inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_29openalex-snapshot
Logical Characterizations of PSPACE
inferred← citeshttps://doi.org/10.1007/978-3-540-30550-7_9openalex-snapshot
Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-39886-8_7openalex-snapshot
On Context-Sensitive Grammars
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_37openalex-snapshot
Weak Cardinality Theorems for First-Order Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-69407-6_35openalex-snapshot
Many Facets of Complexity in Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_3openalex-snapshot
Descriptional and Computational Complexity of Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-20877-5_52openalex-snapshot
Planarity Testing Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-29485-3_3openalex-snapshot
Experimental Descriptive Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-31623-4_16openalex-snapshot
Descriptional Complexity of Pushdown Store Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-31653-1_18openalex-snapshot
From Equivalence to Almost-Equivalence, and Beyond—Minimizing Automata with Errors
inferred← citeshttps://doi.org/10.1007/978-3-642-39310-5_19openalex-snapshot
A Characterisation of NL/poly via Nondeterministic Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_4openalex-snapshot
Aspects of Classical Language Theory
inferred← citeshttps://doi.org/10.1007/978-3-662-03182-7_11openalex-snapshot
Quantifiers and Logical Reductions
inferred← citeshttps://doi.org/10.1007/978-3-662-07003-1_10openalex-snapshot
Fixed Point Logics and Complexity Classes
inferred← citeshttps://doi.org/10.1007/978-3-662-07675-0_1openalex-snapshot
Complexity: A Language-Theoretic Point of View
inferred← citeshttps://doi.org/10.1007/978-3-662-53132-7_16openalex-snapshot
Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space
inferred← citeshttps://doi.org/10.1007/978-3-662-54458-7_10openalex-snapshot
Optimal Reachability in Divergent Weighted Timed Games
inferred← citeshttps://doi.org/10.1007/978-3-662-55751-8_2openalex-snapshot
What One Has to Know When Attacking $$\textsf {P}$$ vs. $$\textsf {NP}$$ (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-981-97-2340-9_2openalex-snapshot
Unambiguous and Co-nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters
inferred← citeshttps://doi.org/10.1007/bf00277390openalex-snapshot
Attribute storage optimization by stacks
inferred← citeshttps://doi.org/10.1007/bf01271368openalex-snapshot
The alternation hierarchy for sublogarithmic space is infinite
inferred← citeshttps://doi.org/10.1007/bf01301970openalex-snapshot
Alternating time versus deterministic time: A separation
inferred← citeshttps://doi.org/10.1007/bf01374526openalex-snapshot
Structure and importance of logspace-MOD class
inferred← citeshttps://doi.org/10.1007/bf02127798openalex-snapshot
Sorting, linear time and the satisfiability problem
inferred← citeshttps://doi.org/10.1007/bf02127803openalex-snapshot
Logic, semigroups and automata on words
inferred← citeshttps://doi.org/10.1007/bf02679455openalex-snapshot
Multihead two-way probabilistic finite automata
inferred← citeshttps://doi.org/10.1007/bfb0009495openalex-snapshot
StUSPACE(log n) ⊂-DSPACE(log2 n/log log n)
inferred← citeshttps://doi.org/10.1007/bfb0020812openalex-snapshot
Structure and importance of logspace-MOD-classes
inferred← citeshttps://doi.org/10.1007/bfb0023471openalex-snapshot
An unambiguous class possessing a complete set
inferred← citeshttps://doi.org/10.1007/bfb0029607openalex-snapshot
Using inductive counting to simulate nondeterministic computation
inferred← citeshttps://doi.org/10.1007/bfb0032026openalex-snapshot
Nondeterministic computations in sublogarithmic space and space constructibility
inferred← citeshttps://doi.org/10.1007/bfb0052085openalex-snapshot
Closure under complementation of logspace complexity classes - A survey -
inferred← citeshttps://doi.org/10.1007/s00012-011-0126-3openalex-snapshot
The equational complexity of Lyndon’s algebra
inferred← citeshttps://doi.org/10.1007/s00224-007-2034-7openalex-snapshot
Polynomial-Space Decidable Membership Problems for Recurrent Systems over Sets of Natural Numbers
inferred← citeshttps://doi.org/10.1007/s00224-009-9172-zopenalex-snapshot
Planar and Grid Graph Reachability Problems
inferred← citeshttps://doi.org/10.1007/s00224-009-9188-4openalex-snapshot
The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous Logspace
inferred← citeshttps://doi.org/10.1007/s00224-017-9784-7openalex-snapshot
Catalytic Space: Non-determinism and Hierarchy
inferred← citeshttps://doi.org/10.1007/s00224-017-9833-2openalex-snapshot
Homonym Population Protocols
inferred← citeshttps://doi.org/10.1007/s00236-006-0022-zopenalex-snapshot
Linearly bounded infinite graphs
inferred← citeshttps://doi.org/10.1007/s00236-017-0306-5openalex-snapshot
Hierarchical information and the synthesis of distributed strategies
inferred← citeshttps://doi.org/10.1007/s00236-020-00373-8openalex-snapshot
Complement for two-way alternating automata
inferred← citeshttps://doi.org/10.1007/s10626-021-00344-2openalex-snapshot
Comparing the notions of opacity for discrete-event systems
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90158-0openalex-snapshot
Some remarks on the alternating hierarchy and closure under complement for sublogarithmic space
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90095-dopenalex-snapshot
The parallel complexity of coarsest set partition problems
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90127-hopenalex-snapshot
A lower bound for the nondeterministic space complexity of context-free recognition
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00059-xopenalex-snapshot
Census techniques collapse space classes
inferred← citeshttps://doi.org/10.1016/0020-0255(91)90008-iopenalex-snapshot
A survey of two-dimensional automata theory
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90004-5openalex-snapshot
The complexity of regular DNLC graph languages
inferred← citeshttps://doi.org/10.1016/0022-0000(92)90024-dopenalex-snapshot
The complexity of circuit value and network stability
inferred← citeshttps://doi.org/10.1016/0022-0000(93)90009-lopenalex-snapshot
Collapsing degrees via strong computation
inferred← citeshttps://doi.org/10.1016/0168-0072(95)00021-6openalex-snapshot
Hierarchies in transitive closure logic, stratified Datalog and infinitary logic
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90228-topenalex-snapshot
A taxonomy of fairness and temporal logic problems for Petri nets
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90149-aopenalex-snapshot
Capturing complexity classes by fragments of second-order logic
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90151-5openalex-snapshot
A survey of space complexity
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90218-iopenalex-snapshot
Finite-model theory - a personal perspective
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90222-fopenalex-snapshot
A closed-form evaluation for Datalog queries with integer (gap)-order constraints
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90252-oopenalex-snapshot
A very hard log-space counting class
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00272-xopenalex-snapshot
Characterization and complexity of uniformly nonprimitive labeled 2-structures
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90238-0openalex-snapshot
Deterministic versus nondeterministic space in terms of synchronized alternating machines
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00032-ropenalex-snapshot
On the acceptance power of regular languages
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90002-wopenalex-snapshot
The parallel complexity of finite-state automata problems
inferred← citeshttps://doi.org/10.1016/b978-0-443-16147-6.00005-0openalex-snapshot
Discrete and combinatorial optimization
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50011-3openalex-snapshot
Computational Complexity
inferred← citeshttps://doi.org/10.1016/j.aam.2017.05.008openalex-snapshot
On the complexity of the word problem for automaton semigroups and automaton groups
inferred← citeshttps://doi.org/10.1016/j.automatica.2018.03.077openalex-snapshot
Complexity of deciding detectability in discrete event systems
inferred← citeshttps://doi.org/10.1016/j.automatica.2021.109884openalex-snapshot
On verification of D-detectability for discrete event systems
inferred← citeshttps://doi.org/10.1016/j.ejor.2026.08.051openalex-snapshot
Parameterized complexity of scheduling problems in robotic process automation
inferred← citeshttps://doi.org/10.1016/j.ic.2003.09.002openalex-snapshot
The complexity of planarity testing
inferred← citeshttps://doi.org/10.1016/j.ic.2005.05.005openalex-snapshot
Context-free languages can be accepted with absolutely no space overhead
inferred← citeshttps://doi.org/10.1016/j.ic.2007.01.008openalex-snapshot
Complementing two-way finite automata
inferred← citeshttps://doi.org/10.1016/j.ic.2010.11.013openalex-snapshot
Descriptional and computational complexity of finite automata—A survey
inferred← citeshttps://doi.org/10.1016/j.ic.2010.11.027openalex-snapshot
Observations on complete sets between linear time and polynomial time
inferred← citeshttps://doi.org/10.1016/j.ic.2017.01.009openalex-snapshot
Further remarks on DNA overlap assembly
inferred← citeshttps://doi.org/10.1016/j.ic.2017.02.001openalex-snapshot
Alternating space is closed under complement and other simulations for sublogarithmic space
inferred← citeshttps://doi.org/10.1016/j.ic.2017.09.003openalex-snapshot
On the computational complexity of problems related to distinguishability sets
inferred← citeshttps://doi.org/10.1016/j.jco.2026.102055openalex-snapshot
Quantifying the robustness of dynamical systems. Relating time and space to length and precision
inferred← citeshttps://doi.org/10.1016/j.jcss.2011.05.006openalex-snapshot
Model-checking hierarchical structures
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.11.004openalex-snapshot
Infinite vs. finite size-bounded randomized computations
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.06.004openalex-snapshot
What one has to know when attacking P vs. NP
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.02.004openalex-snapshot
Closure and nonclosure properties of the classes of compressible and rankable sets
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.05.001openalex-snapshot
Clocked population protocols
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.03.001openalex-snapshot
The 2CNF Boolean formula satisfiability problem and the linear space hypothesis
inferred← citeshttps://doi.org/10.1016/j.jda.2015.05.011openalex-snapshot
Interval graph representation with given interval and intersection lengths
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.005openalex-snapshot
NL-printable sets and nondeterministic Kolmogorov complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.03.003openalex-snapshot
Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.08.017openalex-snapshot
The complexity of membership problems for circuits over sets of integers
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.08.022openalex-snapshot
A note on algebras of languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.04.044openalex-snapshot
An alternating hierarchy for finite automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.08.028openalex-snapshot
On the sizes of DPDAs, PDAs, LBAs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.08.041openalex-snapshot
Positive and negative proofs for circuits and branching programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.01.017openalex-snapshot
On Boolean combinations forming piecewise testable languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.004openalex-snapshot
Separability by piecewise testable languages is PTime-complete
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.12.037openalex-snapshot
Orbit expandability of automaton semigroups and groups
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.04.038openalex-snapshot
A computation model with automatic functions and relations as primitive operations
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116010openalex-snapshot
The expressive power of population protocols with logarithmic space
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116049openalex-snapshot
Language membership problems for subregular classes
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00091-0openalex-snapshot
A note on closure properties of logspace MOD classes
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00296-4openalex-snapshot
For completeness, sublogarithmic space is no space
inferred← citeshttps://doi.org/10.1016/s0020-0190(05)80005-5openalex-snapshot
On “inherently context-sensitive” languages — An application of complexity cores
showing the first 200 of 354 · page through all 354
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.