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

9783540414131, 9783540444503

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints

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

10.1007/3-540-44450-5_33 ◽

2000 ◽

pp. 409-420 ◽

Cited By ~ 13

Author(s):

Stefano Leonardi ◽

Alberto Marchetti-Spaccamela ◽

Andrea Vitaletti

Keyword(s):

Approximation Algorithms ◽

Real Time ◽

Time Constraints ◽

Storage Allocation ◽

Allocation Problems ◽

And Storage

Download Full-text

Keeping Track of the Latest Gossip in Shared Memory Systems

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

10.1007/3-540-44450-5_39 ◽

2000 ◽

pp. 477-488

Author(s):

Bharat Adsul ◽

Aranyak Mehta ◽

Milind Sohoni

Keyword(s):

Shared Memory ◽

Memory Systems

Download Full-text

Scheduling to Minimize the Average Completion Time of Dedicated Tasks

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

10.1007/3-540-44450-5_37 ◽

2000 ◽

pp. 454-464 ◽

Cited By ~ 12

Author(s):

Foto Afrati ◽

Evripidis Bampis ◽

Aleksei V. Fishkin ◽

Klaus Jansen ◽

Claire Kenyon

Keyword(s):

Completion Time ◽

Average Completion Time

Download Full-text

Irregularities of Distribution, Derandomization, and Complexity Theory

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

10.1007/3-540-44450-5_3 ◽

2000 ◽

pp. 46-54

Author(s):

Bernard Chazelle

Keyword(s):

Complexity Theory ◽

Irregularities Of Distribution

Download Full-text

On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation

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

10.1007/3-540-44450-5_27 ◽

2000 ◽

pp. 336-347

Author(s):

Johannes Köbler ◽

Wolfgang Lindner

Keyword(s):

Membership Queries ◽

Specific Learning ◽

Pseudorandom Generation

Download Full-text

A Complete Fragment of Higher-Order Duration μ-Calculus

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

10.1007/3-540-44450-5_21 ◽

2000 ◽

pp. 264-276 ◽

Cited By ~ 4

Author(s):

Dimitar P. Guelev

Keyword(s):

Higher Order

Download Full-text

The Bounded Weak Monadic Quantifier Alternation Hierarchy of Equational Graphs Is Infinite

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

10.1007/3-540-44450-5_15 ◽

2000 ◽

pp. 188-200

Author(s):

Olivier Ly

Keyword(s):

Quantifier Alternation

Download Full-text

Formal Verification of the Ricart-Agrawala Algorithm

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

10.1007/3-540-44450-5_26 ◽

2000 ◽

pp. 325-335 ◽

Cited By ~ 7

Author(s):

Ekaterina Sedletsky ◽

Amir Pnueli ◽

Mordechai Ben-Ari

Keyword(s):

Formal Verification

Download Full-text

Planar Graph Blocking for External Searching

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

10.1007/3-540-44450-5_20 ◽

2000 ◽

pp. 252-263

Author(s):

Surender Baswana ◽

Sandeep Sen

Keyword(s):

Planar Graph

Download Full-text

Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping

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

10.1007/3-540-44450-5_17 ◽

2000 ◽

pp. 214-226 ◽

Cited By ~ 2

Author(s):

Jan-Georg Smaus ◽

François Fages ◽

Pierre Deransart

Keyword(s):

Logic Programs

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Approximation Algorithms for Bandwidth and Storage Allocation Problems under Real Time Constraints

Keeping Track of the Latest Gossip in Shared Memory Systems

Scheduling to Minimize the Average Completion Time of Dedicated Tasks

Irregularities of Distribution, Derandomization, and Complexity Theory

On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation

A Complete Fragment of Higher-Order Duration μ-Calculus

The Bounded Weak Monadic Quantifier Alternation Hierarchy of Equational Graphs Is Infinite

Formal Verification of the Ricart-Agrawala Algorithm

Planar Graph Blocking for External Searching

Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping

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