Integration of Sequential Scenarios
IEEE Transactions on Software Engineering
On the complexity of diophantine geometry in low dimensions (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
About the polynomial solutions of homogeneous linear differential equations depending on parameters
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On verifying consistency of XML specifications
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Generating finite state machines from abstract state machines
ISSTA '02 Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis
Minds and Machines
New results on the computability and complexity of points--to analysis
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Compiling dyadic first-order specifications into map algebra
Theoretical Computer Science - Algebraic methods in language processing
Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases
ICDT '03 Proceedings of the 9th International Conference on Database Theory
DATALOG with Constraints: A Foundation for Trust Management Languages
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
Communication Gap for Finite Memory Devices
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Polynomial Constants Are Decidable
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Generation of Diophantine Sets by Computing P Systems with External Output
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Diophantine Equations and Splicing: A New Demonstration of the Generative Capability of H Systems
DNA '00 Revised Papers from the 6th International Workshop on DNA-Based Computers: DNA Computing
Typechecking XML views of relational databases
ACM Transactions on Computational Logic (TOCL)
Learning power and language expressiveness
Theoretical Computer Science - Australasian computer science
Modular verification of software components in C
Proceedings of the 25th International Conference on Software Engineering
A retrospective on constraint databases
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
A note on commutative multivariate rational series
Information Processing Letters
Sound and complete qualitative simulation is impossible
Artificial Intelligence
On the existence of a new family of Diophantine equations for Ω
Fundamenta Informaticae
On two-way FA with monotonic counters and quadratic Diophantine equations
Theoretical Computer Science
Hypercomputation with quantum adiabatic processes
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Hypercomputation by definition
Theoretical Computer Science - Super-recursive algorithms and hypercomputation
Register cellular automata in the hyperbolic plane
Fundamenta Informaticae
Graph compression and the zeros of polynomials
Information Processing Letters
Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets
Mathematics and Computers in Simulation - Special issue: Applications of computer algebra in science, engineering, simulation and special software
On two-way nondeterministic finite automata with one reversal-bounded counter
Theoretical Computer Science - Insightful theory
Deciding well-definedness of XQuery fragments
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Encyclopedia of Computer Science
Theoretical Computer Science - Database theory
Learning via finitely many queries
Annals of Mathematics and Artificial Intelligence
On the expressiveness and decidability of o-minimal hybrid systems
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Two situations with unit-cost: ordered abelian semi-groups and some commutative rings
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Methods for justifying arithmetic hypotheses and computer algebra
Programming and Computing Software
The containment problem for Real conjunctive queries with inequalities
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the solvability of a class of diophantine equations and applications
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Synthesis of max-plus quasi-interpretations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
On the Problem Whether the Image of an N-Rational Series Equals
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Membrane Computing and Economics: Numerical P Systems
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
On deciding well-definedness for query languages on trees
Journal of the ACM (JACM)
On the correctness criteria of fine-grained access control in relational databases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
First-order complete and computationally complete query languages for spatio-temporal databases
ACM Transactions on Computational Logic (TOCL)
Journal of Computer and System Sciences
On the Additive Theory of Prime Numbers
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
Calysto: scalable and precise extended static checking
Proceedings of the 30th international conference on Software engineering
Tree Automata for Non-linear Arithmetic
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
On Bounded Reachability of Programs with Set Comprehensions
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
On post correspondence problem for letter monotonic languages
Theoretical Computer Science
Automated deduction for verification
ACM Computing Surveys (CSUR)
The computational status of physics
Natural Computing: an international journal
A First-Order Policy Language for History-Based Transaction Monitoring
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Causes of ineradicable spurious predictions in qualitative simulation
Journal of Artificial Intelligence Research
Artifact-Centric Workflow Dominance
ICSOC-ServiceWave '09 Proceedings of the 7th International Joint Conference on Service-Oriented Computing
On the expressiveness and decidability of o-minimal hybrid systems
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Two situations with unit-cost: ordered abelian semi-groups and some commutative rings
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
CDB-PV: a constraint database-based program verifier
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
On an undecidable problem related to difference equations with parameters
Programming and Computing Software
Test case generation for ultimately periodic paths
HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing
Pure, declarative, and constructive arithmetic relations (declarative pearl)
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
A Note on Two-pebble Automata Over Infinite Alphabets
Fundamenta Informaticae - Bridging Logic and Computer Science: to Johann A. Makowsky for his 60th birthday
Particle swarm optimisation based Diophantine equation solver
International Journal of Bio-Inspired Computation
On some decidable and undecidable problems related to q-difference equations with parameters
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
On the joint spectral radius for bounded matrix languages
RP'10 Proceedings of the 4th international conference on Reachability problems
The isomorphism problem for ω-automatic trees
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Communications of the ACM
On intersection problems for polynomially generated sets
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Signaling p systems and verification problems
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Note: Absoluteness of subword inequality is undecidable
Theoretical Computer Science
Termination of integer linear programs
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Consistency of XML specifications
Inconsistency Tolerance
Algorithmic randomness, quantum physics, and incompleteness
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Hilbert's tenth problem and paradigms of computation
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Finite automata over structures
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
On the Additive Theory of Prime Numbers
Fundamenta Informaticae - Topics in Logic, Philosophy and Foundations of Mathematics and Computer Science. In Recognition of Professor Andrzej Grzegorczyk
On the Problem Whether the Image of an N-Rational Series Equals
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Membrane Computing and Economics: Numerical P Systems
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Synthesis of max-plus quasi-interpretations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Register Cellular Automata in the Hyperbolic Plane
Fundamenta Informaticae
On the existence of a new family of Diophantine equations for Ω
Fundamenta Informaticae
On polynomial solutions of linear partial differential and (q-)difference equations
CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
Synthesis of sup-interpretations: A survey
Theoretical Computer Science
On rational solutions of linear partial differential or difference equations
Programming and Computing Software
Information Processing Letters
On computational complexity of graph inference from counting
Natural Computing: an international journal
Decision Problems for Probabilistic Finite Automata on Bounded Languages
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
Checking existence of solutions of partial differential equations in the fields of Laurent series
Programming and Computing Software
| Hi-index | 0.02 |