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

TOTAL DOCUMENTS

45

(FIVE YEARS 0)

H-INDEX

11

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540304951, 9783540324195

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems

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

10.1007/11590156_34 ◽

2005 ◽

pp. 420-431 ◽

Author(s):

Sathya Peri ◽

Neeraj Mittal

Keyword(s):

Distributed Systems ◽

Download Full-text

Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains

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

10.1007/11590156_30 ◽

2005 ◽

pp. 372-383 ◽

Author(s):

Tomáš Brázdil ◽

Antonín Kučera

Keyword(s):

Markov Chains ◽

Accumulated Reward

Download Full-text

Computational Complexity Since 1980

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

10.1007/11590156_2 ◽

2005 ◽

pp. 19-47

Author(s):

Russell Impagliazzo

Keyword(s):

Computational Complexity

Download Full-text

The Directed Planar Reachability Problem

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

10.1007/11590156_19 ◽

2005 ◽

pp. 238-249 ◽

Author(s):

Eric Allender ◽

Samir Datta ◽

Sambuddha Roy

Keyword(s):

Reachability Problem

Download Full-text

From Logic to Games

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

10.1007/11590156_5 ◽

2005 ◽

pp. 79-91

Author(s):

Igor Walukiewicz

Download Full-text

Semiperfect-Information Games

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

10.1007/11590156_1 ◽

2005 ◽

pp. 1-18 ◽

Author(s):

Krishnendu Chatterjee ◽

Thomas A. Henzinger

Keyword(s):

Information Games

Download Full-text

Refining the Undecidability Frontier of Hybrid Automata

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

10.1007/11590156_21 ◽

2005 ◽

pp. 261-272 ◽

Author(s):

Venkatesh Mysore ◽

Amir Pnueli

Keyword(s):

Hybrid Automata

Download Full-text

On the Bisimulation Congruence in χ-Calculus

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

10.1007/11590156_10 ◽

2005 ◽

pp. 128-139 ◽

Author(s):

Taolue Chen ◽

Tingting Han ◽

Jian Lu

Download Full-text

Comparing Trees Via Crossing Minimization

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

10.1007/11590156_37 ◽

2005 ◽

pp. 457-469 ◽

Author(s):

Henning Fernau ◽

Michael Kaufmann ◽

Mathias Poths

Keyword(s):

Crossing Minimization

Download Full-text

On Counting the Number of Consistent Genotype Assignments for Pedigrees

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

10.1007/11590156_38 ◽

2005 ◽

pp. 470-482

Author(s):

Jiří Srba

Download Full-text