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

9783540430025, 9783540452942

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Semidefinite Programming Based Approximation Algorithms

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

10.1007/3-540-45294-x_5 ◽

2001 ◽

pp. 57-57

Author(s):

Uri Zwick

Keyword(s):

Approximation Algorithms ◽

Semidefinite Programming

Download Full-text

I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems

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

10.1007/3-540-45294-x_21 ◽

2001 ◽

pp. 244-255 ◽

Cited By ~ 1

Author(s):

Tamás Lukovszki ◽

Anil Maheshwari ◽

Norbert Zeh

Download Full-text

Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel

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

10.1007/3-540-45294-x_16 ◽

2001 ◽

pp. 183-194 ◽

Cited By ~ 1

Author(s):

Neelima Gupta ◽

Sumit Chopra ◽

Sandeep Sen

Keyword(s):

Line Segments ◽

Optimal Output

Download Full-text

Beyond Regular Model Checking

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

10.1007/3-540-45294-x_14 ◽

2001 ◽

pp. 156-170 ◽

Cited By ~ 9

Author(s):

Dana Fisman ◽

Amir Pnueli

Keyword(s):

Model Checking ◽

Regular Model ◽

Regular Model Checking

Download Full-text

Hard Sets and Pseudo-random Generators for Constant Depth Circuits

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

10.1007/3-540-45294-x_6 ◽

2001 ◽

pp. 58-69 ◽

Cited By ~ 4

Author(s):

Manindra Agrawal

Keyword(s):

Constant Depth ◽

Constant Depth Circuits ◽

Random Generators

Download Full-text

Rewrite Closure for Ground and Cancellative AC Theories

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

10.1007/3-540-45294-x_28 ◽

2001 ◽

pp. 334-346 ◽

Cited By ~ 4

Author(s):

Ashish Tiwari

Download Full-text

Using Nondeterminism to Design Efficient Deterministic Algorithms

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

10.1007/3-540-45294-x_11 ◽

2001 ◽

pp. 120-131 ◽

Cited By ~ 8

Author(s):

Jianer Chen ◽

Donald K. Friesen ◽

Weijia Jia ◽

Iyad A. Kanj

Keyword(s):

Deterministic Algorithms

Download Full-text

Computability and Complexity Results for a Spatial Assertion Language for Data Structures

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

10.1007/3-540-45294-x_10 ◽

2001 ◽

pp. 108-119 ◽

Cited By ~ 55

Author(s):

Cristiano Calcagno ◽

Hongseok Yang ◽

Peter W. O’Hearn

Keyword(s):

Data Structures ◽

Complexity Results

Download Full-text

A Mechanically Verified Compiling Specification for a Lisp Compiler

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

10.1007/3-540-45294-x_13 ◽

2001 ◽

pp. 144-155 ◽

Cited By ~ 9

Author(s):

Axel Dold ◽

Vincent Vialard

Download Full-text

The Directed Minimum-Degree Spanning Tree Problem

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

10.1007/3-540-45294-x_20 ◽

2001 ◽

pp. 232-243 ◽

Cited By ~ 5

Author(s):

Radha Krishnan ◽

Balaji Raghavachari

Keyword(s):

Spanning Tree ◽

Minimum Degree

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Semidefinite Programming Based Approximation Algorithms

I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems

Optimal, Output-Sensitive Algorithms for Constructing Upper Envelope of Line Segments in Parallel

Beyond Regular Model Checking

Hard Sets and Pseudo-random Generators for Constant Depth Circuits

Rewrite Closure for Ground and Cancellative AC Theories

Using Nondeterminism to Design Efficient Deterministic Algorithms

Computability and Complexity Results for a Spatial Assertion Language for Data Structures

A Mechanically Verified Compiling Specification for a Lisp Compiler

The Directed Minimum-Degree Spanning Tree Problem

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