FSTTCS 2004: 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

9783540240587, 9783540305385

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Regular Languages, Unambiguous Concatenation and Computational Complexity

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

10.1007/978-3-540-30538-5_5 ◽

2004 ◽

pp. 49-57

Author(s):

Denis Thérien

Keyword(s):

Computational Complexity ◽

Regular Languages

Download Full-text

Complexity of Linear Connectivity Problems in Directed Hypergraphs

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

10.1007/978-3-540-30538-5_40 ◽

2004 ◽

pp. 481-493 ◽

Cited By ~ 1

Author(s):

Mayur Thakur ◽

Rahul Tripathi

Keyword(s):

Directed Hypergraphs

Download Full-text

Join Algorithms for the Theory of Uninterpreted Functions

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

10.1007/978-3-540-30538-5_26 ◽

2004 ◽

pp. 311-323 ◽

Cited By ~ 9

Author(s):

Sumit Gulwani ◽

Ashish Tiwari ◽

George C. Necula

Keyword(s):

Join Algorithms

Download Full-text

An Almost Linear Time Approximation Algorithm for the Permanent of a Random (0-1) Matrix

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

10.1007/978-3-540-30538-5_22 ◽

2004 ◽

pp. 263-274 ◽

Cited By ~ 2

Author(s):

Martin Fürer ◽

Shiva Prasad Kasiviswanathan

Keyword(s):

Approximation Algorithm ◽

Linear Time ◽

Time Approximation

Download Full-text

The Complexity of the Local Hamiltonian Problem

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

10.1007/978-3-540-30538-5_31 ◽

2004 ◽

pp. 372-383 ◽

Cited By ~ 10

Author(s):

Julia Kempe ◽

Alexei Kitaev ◽

Oded Regev

Download Full-text

Genome Halving Problem Revisited

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

10.1007/978-3-540-30538-5_1 ◽

2004 ◽

pp. 1-15

Author(s):

Max A. Alekseyev ◽

Pavel A. Pevzner

Download Full-text

On the Urgency Expressiveness

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

10.1007/978-3-540-30538-5_7 ◽

2004 ◽

pp. 71-83

Author(s):

Michaël Adélaïde ◽

Claire Pagetti

Download Full-text

Streaming Algorithms for Geometric Problems

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

10.1007/978-3-540-30538-5_3 ◽

2004 ◽

pp. 32-34 ◽

Cited By ~ 2

Author(s):

Piotr Indyk

Keyword(s):

Streaming Algorithms ◽

Geometric Problems

Download Full-text

Short-Cuts on Star, Source and Planar Unfoldings

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

10.1007/978-3-540-30538-5_15 ◽

2004 ◽

pp. 174-185 ◽

Cited By ~ 2

Author(s):

Vijay Chandru ◽

Ramesh Hariharan ◽

Narasimha M. Krishnakumar

Download Full-text

Adaptive Stabilization of Reactive Protocols

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

10.1007/978-3-540-30538-5_33 ◽

2004 ◽

pp. 396-407 ◽

Cited By ~ 4

Author(s):

Shay Kutten ◽

Boaz Patt-Shamir

Keyword(s):

Adaptive Stabilization

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Regular Languages, Unambiguous Concatenation and Computational Complexity

Complexity of Linear Connectivity Problems in Directed Hypergraphs

Join Algorithms for the Theory of Uninterpreted Functions

An Almost Linear Time Approximation Algorithm for the Permanent of a Random (0-1) Matrix

The Complexity of the Local Hamiltonian Problem

Genome Halving Problem Revisited

On the Urgency Expressiveness

Streaming Algorithms for Geometric Problems

Short-Cuts on Star, Source and Planar Unfoldings

Adaptive Stabilization of Reactive Protocols

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