Lecture Notes in Computer Science - STACS 97
Latest Publications

TOTAL DOCUMENTS

49
(FIVE YEARS 0)

H-INDEX

14
(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540626169, 9783540683421
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Minimal transition systems for history-preserving bisimulation

1997 ◽  
pp. 413-425 ◽  
Author(s):  
Ugo Montanari ◽  
Marco Pistore
Keyword(s):  
Transition Systems

Deadlock-free interval routing schemes

1997 ◽  
pp. 351-362 ◽  
Author(s):  
Michele Flammini
Keyword(s):  
Routing Schemes ◽  
Free Interval ◽  
Interval Routing

Hybrid diagrams: A deductive-algorithmic approach to hybrid system verification

1997 ◽  
pp. 153-164 ◽  
Author(s):  
Luca de Alfaro ◽  
Arjun Kapur ◽  
Zohar Manna
Keyword(s):  
Hybrid System ◽  
Algorithmic Approach ◽  
System Verification

RNC-approximation algorithms for the steiner problem

1997 ◽  
pp. 559-570 ◽  
Author(s):  
Hans Jürgen Prömel ◽  
Angelika Steger
Keyword(s):  
Approximation Algorithms ◽  
Steiner Problem

Protocols for collusion-secure asymmetric fingerprinting

1997 ◽  
pp. 399-412 ◽  
Author(s):  
Ingrid Biehl ◽  
Bernd Meyer

A downward translation in the polynomial hierarchy

1997 ◽  
pp. 319-328 ◽  
Author(s):  
Edith Hemaspaandra ◽  
Lane A. Hemaspaandra ◽  
Harald Hempel
Keyword(s):  
Polynomial Hierarchy

The computational complexity of some problems of linear algebra

1997 ◽  
pp. 451-462 ◽  
Author(s):  
Jonathan F. Buss ◽  
Gudmund S. Frandsen ◽  
Jeffrey O. Shallit
Keyword(s):  
Computational Complexity ◽  
Linear Algebra

scholarly journals Memory management for Union-Find algorithms

1997 ◽  
pp. 67-79 ◽  
Author(s):  
Christophe Fiorio ◽  
Jens Gustedt
Keyword(s):  
Memory Management

Semi-dynamic shortest paths and breadth-first search in digraphs

1997 ◽  
pp. 33-46 ◽  
Author(s):  
Paolo Giulio Franciosa ◽  
Daniele Frigioni ◽  
Roberto Giaccio
Keyword(s):  
Shortest Paths ◽  
Breadth First Search ◽  
Dynamic Shortest Paths

Las Vegas versus determinism for one-way communication complexity, finite automata, and polynomial-time computations

1997 ◽  
pp. 117-128 ◽  
Author(s):  
Pavol Ďuriš ◽  
Juraj Hromkovič ◽  
José D. P. Rolim ◽  
Georg Schnitger
Keyword(s):  
Polynomial Time ◽  
Communication Complexity ◽  
Las Vegas ◽  
Finite Automata
Load More ...
Sign in / Sign up

Export Citation Format

Share Document