FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540499947, 9783540499954

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

The Number of Crossing Free Configurations on Finite Point Sets in the Plane

FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/11944836_4 ◽

2006 ◽

pp. 20-20

Author(s):

Emo Welzl

Keyword(s):

Point Sets ◽

Finite Point

Download Full-text

Expressivity Properties of Boolean BI Through Relational Models

FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/11944836_33 ◽

2006 ◽

pp. 357-368 ◽

Cited By ~ 18

Author(s):

Didier Galmiche ◽

Dominique Larchey-Wendling

Keyword(s):

Relational Models

Download Full-text

Multi-stack Boundary Labeling Problems

FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/11944836_10 ◽

2006 ◽

pp. 81-92 ◽

Cited By ~ 10

Author(s):

Michael A. Bekos ◽

Michael Kaufmann ◽

Katerina Potika ◽

Antonios Symvonis

Keyword(s):

Boundary Labeling

Download Full-text

Normal and Feature Approximations from Noisy Point Clouds

FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/11944836_5 ◽

2006 ◽

pp. 21-32 ◽

Cited By ~ 12

Author(s):

Tamal K. Dey ◽

Jian Sun

Keyword(s):

Point Clouds

Download Full-text

On Decidability of LTL Model Checking for Process Rewrite Systems

FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/11944836_24 ◽

2006 ◽

pp. 248-259 ◽

Cited By ~ 2

Author(s):

Laura Bozzelli ◽

Mojmír Křetínský ◽

Vojtěch Řehák ◽

Jan Strejček

Keyword(s):

Model Checking ◽

Rewrite Systems ◽

Ltl Model Checking

Download Full-text

Validity Checking for Finite Automata over Linear Arithmetic Constraints

FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/11944836_37 ◽

2006 ◽

pp. 405-416 ◽

Cited By ~ 1

Author(s):

Gary Wassermann ◽

Zhendong Su

Keyword(s):

Finite Automata ◽

Linear Arithmetic

Download Full-text

Branching Pushdown Tree Automata

FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/11944836_36 ◽

2006 ◽

pp. 393-404

Author(s):

Rajeev Alur ◽

Swarat Chaudhuri

Keyword(s):

Tree Automata

Download Full-text

Tree Automata Make Ordinal Theory Easy

FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/11944836_27 ◽

2006 ◽

pp. 285-296

Author(s):

Thierry Cachat

Keyword(s):

Tree Automata

Download Full-text

Unbiased Rounding of Rational Matrices

FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/11944836_20 ◽

2006 ◽

pp. 200-211 ◽

Cited By ~ 1

Author(s):

Benjamin Doerr ◽

Christian Klein

Download Full-text

Distributed Synthesis for Well-Connected Architectures

FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/11944836_30 ◽

2006 ◽

pp. 321-332 ◽

Cited By ~ 5

Author(s):

Paul Gastin ◽

Nathalie Sznajder ◽

Marc Zeitoun

Download Full-text

FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

The Number of Crossing Free Configurations on Finite Point Sets in the Plane

Expressivity Properties of Boolean BI Through Relational Models

Multi-stack Boundary Labeling Problems

Normal and Feature Approximations from Noisy Point Clouds

On Decidability of LTL Model Checking for Process Rewrite Systems

Validity Checking for Finite Automata over Linear Arithmetic Constraints

Branching Pushdown Tree Automata

Tree Automata Make Ordinal Theory Easy

Unbiased Rounding of Rational Matrices

Distributed Synthesis for Well-Connected Architectures

FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science
Latest Publications