FST TCS 2002: 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

9783540002253, 9783540362067

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality

FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-36206-1_7 ◽

2002 ◽

pp. 59-70 ◽

Cited By ~ 8

Author(s):

Hans-Joachim Böckenhauer ◽

Dirk Bongartz ◽

Juraj Hromkovič ◽

Ralf Klasing ◽

Guido Proietti ◽

...

Keyword(s):

Triangle Inequality ◽

Complete Graphs ◽

Spanning Subgraphs

Download Full-text

Model Checking Algol-Like Languages Using Game Semantics

FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-36206-1_4 ◽

2002 ◽

pp. 33-36

Author(s):

C. -H. L. Ong

Keyword(s):

Model Checking ◽

Game Semantics

Download Full-text

Knowledge over Dense Flows of Time (from a Hybrid Point of View)

FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-36206-1_18 ◽

2002 ◽

pp. 194-205 ◽

Cited By ~ 1

Author(s):

Bernhard Heinemann

Keyword(s):

Point Of View ◽

Dense Flows

Download Full-text

Pattern Matching for Arc-Annotated Sequences

FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-36206-1_17 ◽

2002 ◽

pp. 182-193 ◽

Cited By ~ 17

Author(s):

Jens Gramm ◽

Jiong Guo ◽

Rolf Niedermeier

Keyword(s):

Pattern Matching

Download Full-text

State Space Reductions for Alternating Büchi Automata Quotienting by Simulation Equivalences

FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-36206-1_15 ◽

2002 ◽

pp. 157-168 ◽

Cited By ~ 12

Author(s):

Carsten Fritz ◽

Thomas Wilke

Keyword(s):

State Space ◽

Büchi Automata ◽

Buchi Automata

Download Full-text

How to Compose Presburger-Accelerations: Applications to Broadcast Protocols

FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-36206-1_14 ◽

2002 ◽

pp. 145-156 ◽

Cited By ~ 73

Author(s):

Alain Finkel ◽

Jérôme Leroux

Download Full-text

Algorithmic Combinatorics Based on Slicing Posets

FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-36206-1_16 ◽

2002 ◽

pp. 169-181 ◽

Cited By ~ 3

Author(s):

Vijay K. Garg

Download Full-text

Communication Interference in Mobile Boxed Ambients

FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-36206-1_8 ◽

2002 ◽

pp. 71-84 ◽

Cited By ~ 19

Author(s):

Michele Bugliesi ◽

Silvia Crafa ◽

Massimo Merro ◽

Vladimiro Sassone

Download Full-text

Primality Testing with Gaussian Periods

FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-36206-1_1 ◽

2002 ◽

pp. 1-1 ◽

Cited By ~ 4

Author(s):

H. W. Lenstra

Keyword(s):

Primality Testing ◽

Gaussian Periods

Download Full-text

Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems

FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-36206-1_26 ◽

2002 ◽

pp. 289-300 ◽

Cited By ~ 1

Author(s):

Madhavan Mukund

Download Full-text

FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality

Model Checking Algol-Like Languages Using Game Semantics

Knowledge over Dense Flows of Time (from a Hybrid Point of View)

Pattern Matching for Arc-Annotated Sequences

State Space Reductions for Alternating Büchi Automata Quotienting by Simulation Equivalences

How to Compose Presburger-Accelerations: Applications to Broadcast Protocols

Algorithmic Combinatorics Based on Slicing Posets

Communication Interference in Mobile Boxed Ambients

Primality Testing with Gaussian Periods

Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems

FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science - Lecture Notes in Computer Science
Latest Publications