Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/conf/stacs/stacs97.bht:"
download as .bib file
@inproceedings{DBLP:conf/stacs/Alfaro97,
author = {Luca de Alfaro},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Temporal Logics for the Specification of Performance and Reliability},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {165--176},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023457},
doi = {10.1007/BFB0023457},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Alfaro97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AlfaroKM97,
author = {Luca de Alfaro and
Arjun Kapur and
Zohar Manna},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Hybrid Diagrams: {A} Deductive-Algorithmic Approach to Hybrid System
Verification},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {153--164},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023456},
doi = {10.1007/BFB0023456},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AlfaroKM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AndreevCR97,
author = {Alexander E. Andreev and
Andrea E. F. Clementi and
Jos{\'{e}} D. P. Rolim},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Efficient Construction of Hitting Sets for Systems of Linear Functions},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {387--398},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023475},
doi = {10.1007/BFB0023475},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AndreevCR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AulettaP97,
author = {Vincenzo Auletta and
Domenico Parente},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Better Algorithms for Minimum Weight Vertex-Connectivity Problems},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {547--558},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023488},
doi = {10.1007/BFB0023488},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AulettaP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Bertram-KretzbergL97,
author = {Claudia Bertram{-}Kretzberg and
Hanno Lefmann},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {MOD\({}_{\mbox{p}}\)-tests, Almost Independence and Small Probability
Spaces (Extended Abstract)},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {141--152},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023455},
doi = {10.1007/BFB0023455},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Bertram-KretzbergL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BiehlM97,
author = {Ingrid Biehl and
Bernd Meyer},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Protocols for Collusion-Secure Asymmetric Fingerprinting (Extended
Abstract)},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {399--412},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023476},
doi = {10.1007/BFB0023476},
timestamp = {Tue, 04 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BiehlM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BreutzmannL97,
author = {Josef M. Breutzmann and
Jack H. Lutz},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Equivalence of Measures of Complexity Classes},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {535--545},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023487},
doi = {10.1007/BFB0023487},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BreutzmannL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Brodal97,
author = {Gerth St{\o}lting Brodal},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Predecessor Queries in Dynamic Integer Sets},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {21--32},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023445},
doi = {10.1007/BFB0023445},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Brodal97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanF97,
author = {Harry Buhrman and
Lance Fortnow},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Resource-Bounded Kolmogorov Complexity Revisited},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {105--116},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023452},
doi = {10.1007/BFB0023452},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanF97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BussFS97,
author = {Jonathan F. Buss and
Gudmund Skovbjerg Frandsen and
Jeffrey O. Shallit},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {The Computational Complexity of Some Problems of Linear Algebra (Extended
Abstract)},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {451--462},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023480},
doi = {10.1007/BFB0023480},
timestamp = {Mon, 09 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BussFS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CaseKSS97,
author = {John Case and
Efim B. Kinber and
Arun Sharma and
Frank Stephan},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {On the Classification of Computable Languages},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {225--236},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023462},
doi = {10.1007/BFB0023462},
timestamp = {Wed, 22 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/CaseKSS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CattaneoFMM97,
author = {Gianpiero Cattaneo and
Enrico Formenti and
Giovanni Manzini and
Luciano Margara},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {On Ergodic Linear Cellular Automata over Z\({}_{\mbox{m}}\)},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {427--438},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023478},
doi = {10.1007/BFB0023478},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/CattaneoFMM97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Dahlhaus97,
author = {Elias Dahlhaus},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Sequential and Parallel Algorithms on Compactly Represented Chordal
and Strongly Chordal Graphs},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {487--498},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023483},
doi = {10.1007/BFB0023483},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Dahlhaus97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DiekertGP97,
author = {Volker Diekert and
Paul Gastin and
Antoine Petit},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Removing epsilon-Transitions in Timed Automata},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {583--594},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023491},
doi = {10.1007/BFB0023491},
timestamp = {Thu, 14 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/DiekertGP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Dietzfelbinger97,
author = {Martin Dietzfelbinger},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Gossiping and Broadcasting versus Computing Functions in Networks},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {189--200},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023459},
doi = {10.1007/BFB0023459},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Dietzfelbinger97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Durand-Lose97,
author = {J{\'{e}}r{\^{o}}me Olivier Durand{-}Lose},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Intrinsic Universality of a 1-Dimensional Reversible Cellular Automaton},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {439--450},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023479},
doi = {10.1007/BFB0023479},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Durand-Lose97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DurisHRS97,
author = {Pavol Duris and
Juraj Hromkovic and
Jos{\'{e}} D. P. Rolim and
Georg Schnitger},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Las Vegas Versus Determinism for One-way Communication Complexity,
Finite Automata, and Polynomial-time Computations},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {117--128},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023453},
doi = {10.1007/BFB0023453},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DurisHRS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FeigenbaumS97,
author = {Joan Feigenbaum and
Martin Strauss},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {An Information-Theoretic Treatment of Random-Self-Reducibility (Extended
Abstract)},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {523--534},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023486},
doi = {10.1007/BFB0023486},
timestamp = {Tue, 19 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/FeigenbaumS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FeldmannMMT97,
author = {Rainer Feldmann and
Burkhard Monien and
Peter Mysliwietz and
Stefan Tsch{\"{o}}ke},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {A Better Upper Bound on the Bisection Width of de Bruijn Networks
(Extended Abstract)},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {511--522},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023485},
doi = {10.1007/BFB0023485},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FeldmannMMT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FiorioG97,
author = {Christophe Fiorio and
Jens Gustedt},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Memory Management for Union-Find Algorithms},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {67--79},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023449},
doi = {10.1007/BFB0023449},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FiorioG97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Flammini97,
author = {Michele Flammini},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Deadlock-Free Interval Routing Schemes},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {351--362},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023472},
doi = {10.1007/BFB0023472},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Flammini97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FranciosaFG97,
author = {Paolo Giulio Franciosa and
Daniele Frigioni and
Roberto Giaccio},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {33--46},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023446},
doi = {10.1007/BFB0023446},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FranciosaFG97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Gaubert97,
author = {Stephane Gaubert and
Max Plus},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Methods and Applications of (MAX, +) Linear Algebra},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {261--282},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023465},
doi = {10.1007/BFB0023465},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Gaubert97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Goldreich97,
author = {Oded Goldreich},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Probabilistic Proof Systems - {A} Survey},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {595--611},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023492},
doi = {10.1007/BFB0023492},
timestamp = {Wed, 15 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/Goldreich97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GoldstineLW97,
author = {Jonathan Goldstine and
Hing Leung and
Detlef Wotschke},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Measuring Nondeterminism in Pushdown Automata},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {295--306},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023467},
doi = {10.1007/BFB0023467},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GoldstineLW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GradelOR97,
author = {Erich Gr{\"{a}}del and
Martin Otto and
Eric Rosen},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Undecidability Results on Two-Variable Logics},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {249--260},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023464},
doi = {10.1007/BFB0023464},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GradelOR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HemaspaandraHH97,
author = {Edith Hemaspaandra and
Lane A. Hemaspaandra and
Harald Hempel},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {A Downward Translation in the Polynomial Hierarchy},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {319--328},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023469},
doi = {10.1007/BFB0023469},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HemaspaandraHH97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HempelW97,
author = {Harald Hempel and
Gerd Wechsung},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {The Operators min and max on the Polynomial Hierarchy},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {93--104},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023451},
doi = {10.1007/BFB0023451},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HempelW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HromkovicSW97,
author = {Juraj Hromkovic and
Sebastian Seibert and
Thomas Wilke},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Translating Regular Expressions into Small epsilon-Free Nondeterministic
Finite Automata},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {55--66},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023448},
doi = {10.1007/BFB0023448},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HromkovicSW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KargKS97,
author = {Christoph Karg and
Johannes K{\"{o}}bler and
Rainer Schuler},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {The Complexity of Generating Test Instances},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {375--386},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023474},
doi = {10.1007/BFB0023474},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KargKS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Kern-Isberner97,
author = {Gabriele Kern{-}Isberner},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {A Conditional-Logical Approach to Minimum Cross-Entropy},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {237--248},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023463},
doi = {10.1007/BFB0023463},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Kern-Isberner97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KirousisKKP97,
author = {Lefteris M. Kirousis and
Evangelos Kranakis and
Danny Krizanc and
Andrzej Pelc},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Power Consumption in Packet Radio Networks (Extended Abstract)},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {363--374},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023473},
doi = {10.1007/BFB0023473},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KirousisKKP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KochB97,
author = {Robert Koch and
Norbert Blum},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Greibach Normal Form Transformation, Revisited},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {47--54},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023447},
doi = {10.1007/BFB0023447},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KochB97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Lange97,
author = {Klaus{-}J{\"{o}}rn Lange},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {An Unambiguous Class Possessing a Complete Set},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {339--350},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023471},
doi = {10.1007/BFB0023471},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Lange97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Liskiewicz97,
author = {Maciej Liskiewicz},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Interactive Proof Systems with Public Coin: Lower Space Bounds and
Hierarchies of Complexity Classes},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {129--140},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023454},
doi = {10.1007/BFB0023454},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Liskiewicz97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Matz97,
author = {Oliver Matz},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Regular Expressions and Context-Free Grammars for Picture Languages},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {283--294},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023466},
doi = {10.1007/BFB0023466},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Matz97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MeinelS97,
author = {Christoph Meinel and
Anna Slobodov{\'{a}}},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {A Reducibility Concept for Problems Defined in Terms of Ordered Binary
Decision Diagrams},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {213--224},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023461},
doi = {10.1007/BFB0023461},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/MeinelS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Messner97,
author = {Jochen Me{\ss}ner},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Pattern Matching in Trace Monoids (Extended Abstract)},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {571--582},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023490},
doi = {10.1007/BFB0023490},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Messner97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MontanariP97,
author = {Ugo Montanari and
Marco Pistore},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Minimal Transition Systems for History-Preserving Bisimulation},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {413--425},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023477},
doi = {10.1007/BFB0023477},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/MontanariP97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Nickelsen97,
author = {Arfst Nickelsen},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {On Polynomially D-Verbose Sets},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {307--318},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023468},
doi = {10.1007/BFB0023468},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Nickelsen97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Prisner97,
author = {Erich Prisner},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Distance Approximating Spanning Trees},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {499--510},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023484},
doi = {10.1007/BFB0023484},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Prisner97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/PromelS97,
author = {Hans J{\"{u}}rgen Pr{\"{o}}mel and
Angelika Steger},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {RNC-Approximation Algorithms for the Steiner Problem},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {559--570},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023489},
doi = {10.1007/BFB0023489},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/PromelS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Reinhardt97,
author = {Klaus Reinhardt},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Strict Sequential P-completeness},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {329--338},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023470},
doi = {10.1007/BFB0023470},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Reinhardt97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Ruppert97,
author = {Eric Ruppert},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Finding the k Shortest Paths in Parallel},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {475--486},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023482},
doi = {10.1007/BFB0023482},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Ruppert97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Schroder97,
author = {Matthias Schr{\"{o}}der},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Fast Online Multiplication of Real Numbers},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {81--92},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023450},
doi = {10.1007/BFB0023450},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Schroder97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Schwentick97,
author = {Thomas Schwentick},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Algebraic and Logical Characterizations of Deterministic Linear Time
Classes},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {463--474},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023481},
doi = {10.1007/BFB0023481},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Schwentick97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Steffen97,
author = {Bernhard Steffen},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Unifying Models},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {1--20},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023444},
doi = {10.1007/BFB0023444},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Steffen97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Waack97,
author = {Stephan Waack},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {On the Descriptive and Algorithmic Power of Parity Ordered Binary
Decision Diagrams},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {201--212},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023460},
doi = {10.1007/BFB0023460},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Waack97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/WeiseL97,
author = {Carsten Weise and
Dirk Lenzkes},
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {Efficient Scaling-Invariant Checking of Timed Bisimulation},
booktitle = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
pages = {177--188},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023458},
doi = {10.1007/BFB0023458},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/WeiseL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/1997,
editor = {R{\"{u}}diger Reischuk and
Michel Morvan},
title = {{STACS} 97, 14th Annual Symposium on Theoretical Aspects of Computer
Science, L{\"{u}}beck, Germany, February 27 - March 1, 1997,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1200},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0023443},
doi = {10.1007/BFB0023443},
isbn = {3-540-62616-6},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/1997.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
retrieved on 2024-05-11 01:53 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
