Mathematical Foundations of Computer Science 2013 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642403125, 9783642403132

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A More Efficient Simulation Algorithm on Kripke Structures

Mathematical Foundations of Computer Science 2013 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-40313-2_66 ◽

2013 ◽

pp. 753-764 ◽

Cited By ~ 5

Author(s):

Francesco Ranzato

Keyword(s):

Simulation Algorithm ◽

Efficient Simulation ◽

Kripke Structures

Download Full-text

Rewriting Guarded Negation Queries

Mathematical Foundations of Computer Science 2013 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-40313-2_11 ◽

2013 ◽

pp. 98-110 ◽

Cited By ~ 7

Author(s):

Vince Bárány ◽

Michael Benedikt ◽

Balder ten Cate

Download Full-text

Synthesis from Temporal Specifications: New Applications in Robotics and Model-Driven Development

Mathematical Foundations of Computer Science 2013 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-40313-2_6 ◽

2013 ◽

pp. 45-49

Author(s):

Nir Piterman

Keyword(s):

Model Driven Development ◽

Model Driven ◽

Temporal Specifications ◽

New Applications

Download Full-text

Reachability Analysis of Recursive Quantum Markov Chains

Mathematical Foundations of Computer Science 2013 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-40313-2_35 ◽

2013 ◽

pp. 385-396 ◽

Cited By ~ 1

Author(s):

Yuan Feng ◽

Nengkun Yu ◽

Mingsheng Ying

Keyword(s):

Markov Chains ◽

Reachability Analysis ◽

Quantum Markov Chains

Download Full-text

Parameterized Algorithms for Module Motif

Mathematical Foundations of Computer Science 2013 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-40313-2_72 ◽

2013 ◽

pp. 825-836 ◽

Cited By ~ 1

Author(s):

Meirav Zehavi

Keyword(s):

Parameterized Algorithms

Download Full-text

Hardness of Classically Simulating Quantum Circuits with Unbounded Toffoli and Fan-Out Gates

Mathematical Foundations of Computer Science 2013 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-40313-2_70 ◽

2013 ◽

pp. 801-812 ◽

Cited By ~ 1

Author(s):

Yasuhiro Takahashi ◽

Takeshi Yamazaki ◽

Kazuyuki Tanaka

Keyword(s):

Quantum Circuits

Download Full-text

Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian

Mathematical Foundations of Computer Science 2013 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-40313-2_57 ◽

2013 ◽

pp. 643-654 ◽

Cited By ~ 2

Author(s):

Ranko Lazić ◽

Joël Ouaknine ◽

James Worrell

Download Full-text

Logical and Structural Approaches to the Graph Isomorphism Problem

Mathematical Foundations of Computer Science 2013 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-40313-2_4 ◽

2013 ◽

pp. 42-42

Author(s):

Martin Grohe

Keyword(s):

Graph Isomorphism ◽

Isomorphism Problem ◽

Graph Isomorphism Problem

Download Full-text

Validity of Tree Pattern Queries with Respect to Schema Information

Mathematical Foundations of Computer Science 2013 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-40313-2_17 ◽

2013 ◽

pp. 171-182 ◽

Cited By ~ 10

Author(s):

Henrik Björklund ◽

Wim Martens ◽

Thomas Schwentick

Keyword(s):

Tree Pattern

Download Full-text

A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items

Mathematical Foundations of Computer Science 2013 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-40313-2_14 ◽

2013 ◽

pp. 135-145 ◽

Cited By ~ 1

Author(s):

Marco Bender ◽

Clemens Thielen ◽

Stephan Westphal

Keyword(s):

Assignment Problem ◽

Constant Factor ◽

Unit Size ◽

Generalized Assignment Problem ◽

Generalized Assignment

Download Full-text

Mathematical Foundations of Computer Science 2013 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A More Efficient Simulation Algorithm on Kripke Structures

Rewriting Guarded Negation Queries

Synthesis from Temporal Specifications: New Applications in Robotics and Model-Driven Development

Reachability Analysis of Recursive Quantum Markov Chains

Parameterized Algorithms for Module Motif

Hardness of Classically Simulating Quantum Circuits with Unbounded Toffoli and Fan-Out Gates

Zeno, Hercules and the Hydra: Downward Rational Termination Is Ackermannian

Logical and Structural Approaches to the Graph Isomorphism Problem

Validity of Tree Pattern Queries with Respect to Schema Information

A Constant Factor Approximation for the Generalized Assignment Problem with Minimum Quantities and Unit Size Items

Mathematical Foundations of Computer Science 2013 - Lecture Notes in Computer Science
Latest Publications