Machine models and linear time complexity
ACM SIGACT News
On the adequacy of graph rewriting for simulating term rewriting
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM SIGACT News
Discontinuities in recurrent neural networks
Neural Computation
Worst case constant time priority queue
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Quantum computers that can be simulated classically in polynomial time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Datalog LITE: a deductive query language with linear time model checking
ACM Transactions on Computational Logic (TOCL)
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Linear time datalog and branching time logic
Logic-based artificial intelligence
On non-determinism in machines and languages
Annals of Mathematics and Artificial Intelligence
Query evaluation via tree-decompositions
Journal of the ACM (JACM)
Query Evaluation via Tree-Decompositions
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Generalized Model-Checking Problems for First-Order Logic
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Computational Power of BSP Computers
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Pipelined Decomposable BSP Computers
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Beyond the Turing Limit: Evolving Interactive Systems
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Decomposable Bulk Synchronous Parallel Computers
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
An Existential Locality Theorem
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Approximate pattern matching and transitive closure logics
Theoretical Computer Science
Approximate Pattern Matching is Expressible in Transitive Closure Logic
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
The complexity of the temporal logic with "until" over general linear time
Journal of Computer and System Sciences
Some Dichotomy Theorems for Neural Learning Problems
The Journal of Machine Learning Research
Computability in linear algebra
Theoretical Computer Science
Small fast universal turing machines
Theoretical Computer Science
Membrane computing and complexity theory: A characterization of PSPACE
Journal of Computer and System Sciences
Tight lower bounds for query processing on streaming and external memory data
Theoretical Computer Science
Balanced parentheses strike back
ACM Transactions on Algorithms (TALG)
The weak lambda calculus as a reasonable machine
Theoretical Computer Science
Parallel and Sequential Optical Computing
OSC '08 Proceedings of the 1st international workshop on Optical SuperComputing
The computational power and complexity of constraint handling rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
On Constructor Rewrite Systems and the Lambda-Calculus
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On the polynomial transparency of resolution
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
On the expressiveness of interaction
Theoretical Computer Science
Difficulties in forcing fairness of polynomial time inductive inference
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Basic notions in computational complexity
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Derivational complexity is an invariant cost model
FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
An Interview with Joseph F. Traub
Ubiquity
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Realizability models and implicit complexity
Theoretical Computer Science
Nanotechnology based optical solution for NP-hard problems
OSC'10 Proceedings of the Third international conference on Optical supercomputing
Optical computing and computational complexity
UC'06 Proceedings of the 5th international conference on Unconventional Computation
An invariant cost model for the lambda calculus
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Lower bounds on the computational power of an optical model of computation
UC'05 Proceedings of the 4th international conference on Unconventional Computation
Tight lower bounds for query processing on streaming and external memory data
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Unifying framework for message passing
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Upper bounds on the computational power of an optical model of computation
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Quantitative models and implicit complexity
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Playing savitch and cooking games
Concurrency, Compositionality, and Correctness
On the power of computing with proteins on membranes
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Turing machines for dummies: why representations do matter
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Survey: Equilibria, fixed points, and complexity classes
Computer Science Review
On selective unboundedness of VASS
Journal of Computer and System Sciences
Hi-index | 0.01 |