ACM Computing Surveys (CSUR)
A dichotomy theorem for learning quantified Boolean formulas
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
A Dichotomy Theorem for Learning Quantified Boolean Formulas
Machine Learning - Special issue: computational learning theory, COLT '97
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Typechecking for XML transformers
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Distributed query evaluation on semistructured data
ACM Transactions on Database Systems (TODS)
A survey of graph layout problems
ACM Computing Surveys (CSUR)
The undecidability of associativity and commutativity analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallelizability of Some P-Complete Problems
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Complexity Results for Confluence Problems
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
The Complexity of Some Basic Problems for Dynamic Process Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Parallel Model Checking for the Alternation Free µ-Calculus
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of Membership Problems for Circuits over Sets of Natural Numbers
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Positive Linear Programming Extensions: Parallel Complexity and Applications (Research Note)
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Parallel Distance-k Coloring Algorithms for Numerical Optimization
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Logspace Reducibility via Abstract State Machines
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Bounded size dictionary compression: SCk -completeness and NC algorithms
Information and Computation
Distributed credential chain discovery in trust management
Journal of Computer Security
The complexity of XPath query evaluation
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
Graph coloring on coarse grained multicomputers
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
SIGACT news complexity theory column 42
ACM SIGACT News
A PTIME-complete matching problem for SLP-compressed words
Information Processing Letters
Optimal strategies for testing nondeterministic systems
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Hypercomputation by definition
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
The Lixto data extraction project: back and forth between theory and practice
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of XPath query evaluation and XML typing
Journal of the ACM (JACM)
On the complexity of nonrecursive XQuery and functional query languages on complex values
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Parallelizing time with polynomial circuits
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
The enumerability of P collapses P to NC
Theoretical Computer Science - Mathematical foundations of computer science 2004
Why are there so many loop formulas?
ACM Transactions on Computational Logic (TOCL)
On the universal and existential fragments of the μ-calculus
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
The complexity of data exchange
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Processing queries on tree-structured data efficiently
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Complexity of Pure Literal Elimination
Journal of Automated Reasoning
On the complexity of nonrecursive XQuery and functional query languages on complex values
ACM Transactions on Database Systems (TODS)
Crossing information in two-dimensional sandpiles
Theoretical Computer Science
Management of probabilistic data: foundations and challenges
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
PRO: a model for the design and analysis of efficient and scalable parallel algorithms
Nordic Journal of Computing
The complexity of linear programming in (γ,κ)-form
Information Processing Letters
On distributing symmetric streaming computations
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-TimeMaximisation Classes: Syntactic Hierarchy
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
The Complexity of Small Universal Turing Machines
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
On the Complexity of Equilibria Problems in Angel-Daemon Games
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Parallel and Sequential Optical Computing
OSC '08 Proceedings of the 1st international workshop on Optical SuperComputing
A Characterisation of NL Using Membrane Systems without Charges and Dissolution
UC '08 Proceedings of the 7th international conference on Unconventional Computing
ACM Computing Surveys (CSUR)
The complexity of small universal Turing machines: A survey
Theoretical Computer Science
Repair checking in inconsistent databases: algorithms and complexity
Proceedings of the 12th International Conference on Database Theory
Boolean circuit programming: A new paradigm to design parallel algorithms
Journal of Discrete Algorithms
Alternation as a programming paradigm
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Nonapproximability results for partially observable Markov decision processes
Journal of Artificial Intelligence Research
How to Order Vertices for Distributed LTL Model-Checking Based on Accepting Predecessors
Electronic Notes in Theoretical Computer Science (ENTCS)
Size matters: logarithmic space is real time
International Journal of Computers and Applications
On the universal and existential fragments of the µ-calculus
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
A simple P-complete problem and its representations by language equations
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Small weakly universal turing machines
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
On distributing symmetric streaming computations
ACM Transactions on Algorithms (TALG)
The computational complexity of RACETRACK
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
The complexity of model checking for intuitionistic logics and their modal companions
RP'10 Proceedings of the 4th international conference on Reachability problems
Algorithms and theory of computation handbook
Parallel computation: models and complexity issues
Algorithms and theory of computation handbook
A simple P-complete problem and its language-theoretic representations
Theoretical Computer Science
Queries and materialized views on probabilistic databases
Journal of Computer and System Sciences
The complexity of acyclic subhypergraph problems
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
The computational power of membrane systems under tight uniformity conditions
Natural Computing: an international journal
Nodes connected by path languages
DLT'11 Proceedings of the 15th international conference on Developments in language theory
The role of polymorphism in the characterisation of complexity by soft types
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
The complexity of game isomorphism
Theoretical Computer Science
Improving CUDA™ C/C++ encoding readability to foster parallel application development
ACM SIGSOFT Software Engineering Notes
Optical computing and computational complexity
UC'06 Proceedings of the 5th international conference on Unconventional Computation
Extending Dijkstra's algorithm to maximize the shortest path by node-wise limited arc interdiction
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Lower bounds on the computational power of an optical model of computation
UC'05 Proceedings of the 4th international conference on Unconventional Computation
PVM/MPI'05 Proceedings of the 12th European PVM/MPI users' group conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface
The complexity of problems on implicitly represented inputs
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
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
P-completeness of cellular automaton rule 110
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Querying and embedding compressed texts
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Dynamic complexity theory revisited
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
The complexity of model checking concurrent programs against CTLK specifications
DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies
The complexity of small universal turing machines: a survey
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Two complexity results on c-optimality in experimental design
Computational Optimization and Applications
On the complexity of computing probabilistic bisimilarity
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
On the complexity of the equivalence problem for probabilistic automata
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Greedy sequential maximal independent set and matching are parallel on average
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Polynomial-TimeMaximisation Classes: Syntactic Hierarchy
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Computational Complexity of Avalanches in the Kadanoff Sandpile Model
Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
On the complexity of game isomorphism
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
An experiment on parallel model checking of a CTL fragment
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Data exchange with arithmetic operations
Proceedings of the 16th International Conference on Extending Database Technology
Proceedings of the 32nd symposium on Principles of database systems
BNCOD'13 Proceedings of the 29th British National conference on Big Data
The complexity of the bootstraping percolation and other problems
Theoretical Computer Science
Making queries tractable on big data with preprocessing: through the eyes of complexity theory
Proceedings of the VLDB Endowment
ASC: automatically scalable computation
Proceedings of the 19th international conference on Architectural support for programming languages and operating systems
Algorithms and hardness results for parallel large margin learning
The Journal of Machine Learning Research
Computational Aspects of Uncertainty Profiles and Angel-Daemon Games
Theory of Computing Systems
Survey of Clustering: Algorithms and Applications
International Journal of Information Retrieval Research
| Hi-index | 0.01 |