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/stacs96.bht:"
download as .bib file
@inproceedings{DBLP:conf/stacs/Ambainis96,
author = {Andris Ambainis},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Upper Bounds on Multiparty Communication Complexity of Shifts},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {631--642},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_51},
doi = {10.1007/3-540-60922-9\_51},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Ambainis96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AmbainisFS96,
author = {Andris Ambainis and
Rusins Freivalds and
Carl H. Smith},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {General Inductive Inference Types Based on Linearly-Ordered Sets},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {243--253},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_21},
doi = {10.1007/3-540-60922-9\_21},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AmbainisFS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Ambos-SpiesMWZ96,
author = {Klaus Ambos{-}Spies and
Elvira Mayordomo and
Yongge Wang and
Xizhong Zheng},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {63--74},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_6},
doi = {10.1007/3-540-60922-9\_6},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/Ambos-SpiesMWZ96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AndreevCR96,
author = {Alexander E. Andreev and
Andrea E. F. Clementi and
Jos{\'{e}} D. P. Rolim},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Optimal Bounds on the Approximation of Boolean Functions with Consequences
on the Concept of Hardware},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {319--330},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_27},
doi = {10.1007/3-540-60922-9\_27},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AndreevCR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ArvindV96,
author = {Vikraman Arvind and
N. V. Vinodchandran},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Solvable Black-Box Group Problems Are Low for {PP}},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {99--110},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_9},
doi = {10.1007/3-540-60922-9\_9},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ArvindV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BampisDK96,
author = {Evripidis Bampis and
Charles Delorme and
Jean{-}Claude K{\"{o}}nig},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended
Abstract)},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {655--666},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_53},
doi = {10.1007/3-540-60922-9\_53},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BampisDK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BarzdinsFS96,
author = {Janis Barzdins and
Rusins Freivalds and
Carl H. Smith},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Learning with Confidence},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {207--218},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_18},
doi = {10.1007/3-540-60922-9\_18},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BarzdinsFS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Bassino96,
author = {Fr{\'{e}}d{\'{e}}rique Bassino},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Star-Height of an N-Rational Series},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {125--135},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_11},
doi = {10.1007/3-540-60922-9\_11},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Bassino96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BealCR96,
author = {Marie{-}Pierre B{\'{e}}al and
Olivier Carton and
Christophe Reutenauer},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Cyclic Languages and Strongly Cyclic Languages},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {49--59},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_5},
doi = {10.1007/3-540-60922-9\_5},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BealCR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BealMR96,
author = {Marie{-}Pierre B{\'{e}}al and
Filippo Mignosi and
Antonio Restivo},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Minimal Forbidden Words and Symbolic Dynamics},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {555--566},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_45},
doi = {10.1007/3-540-60922-9\_45},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BealMR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Beaudry96,
author = {Martin Beaudry},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Languages Recognized by Finite Aperiodic Groupoids},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {113--124},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_10},
doi = {10.1007/3-540-60922-9\_10},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Beaudry96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BerardGP96,
author = {B{\'{e}}atrice B{\'{e}}rard and
Paul Gastin and
Antoine Petit},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {On the Power of Non-Observable Actions in Timed Automata},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {257--268},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_22},
doi = {10.1007/3-540-60922-9\_22},
timestamp = {Thu, 14 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BerardGP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BerenbrinkHS96,
author = {Petra Berenbrink and
Friedhelm Meyer auf der Heide and
Volker Stemann},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Fault-Tolerant Shared Memory Simulations},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {181--192},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_16},
doi = {10.1007/3-540-60922-9\_16},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BerenbrinkHS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BertolD96,
author = {Michael Bertol and
Volker Diekert},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Trace Rewriting: Computing Normal Forms in Time O(n log n)},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {269--280},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_23},
doi = {10.1007/3-540-60922-9\_23},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BertolD96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BleichenbacherM96,
author = {Daniel Bleichenbacher and
Ueli M. Maurer},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Optimal Tree-Based One-Time Digital Signature Schemes},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {363--374},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_30},
doi = {10.1007/3-540-60922-9\_30},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BleichenbacherM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BolligW96,
author = {Beate Bollig and
Ingo Wegener},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Read-once Projections and Formal Circuit Verification with Binary
Decision Diagrams},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {491--502},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_40},
doi = {10.1007/3-540-60922-9\_40},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BolligW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Bradfield96,
author = {Julian C. Bradfield},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {On the Expressivity of the Modal Mu-Calculus},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {479--490},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_39},
doi = {10.1007/3-540-60922-9\_39},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Bradfield96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Brassard96,
author = {Gilles Brassard},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {New Trends in Quantum Computing},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {3--10},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_1},
doi = {10.1007/3-540-60922-9\_1},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Brassard96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Breslauer96,
author = {Dany Breslauer},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {On Competitive On-Line Paging with Lookahead},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {593--603},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_48},
doi = {10.1007/3-540-60922-9\_48},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Breslauer96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanL96,
author = {Harry Buhrman and
Luc Longpr{\'{e}}},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Compressibility and Resource Bounded Measure},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {13--24},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_2},
doi = {10.1007/3-540-60922-9\_2},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanT96,
author = {Harry Buhrman and
Thomas Thierauf},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {The Complexity of Generating and Checking Proffs of Membership},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {75--86},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_7},
doi = {10.1007/3-540-60922-9\_7},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CaiNS96,
author = {Jin{-}yi Cai and
Ashish V. Naik and
D. Sivakumar},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {On the Existence of Hard Sparse Sets under Weak Reductions},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {307--318},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_26},
doi = {10.1007/3-540-60922-9\_26},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/CaiNS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CaiS96,
author = {Jin{-}yi Cai and
Alan L. Selman},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Fine Separation of Average Time Complexity Classes},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {331--343},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_28},
doi = {10.1007/3-540-60922-9\_28},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/CaiS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CulikK96,
author = {Karel Cul{\'{\i}}k II and
Jarkko Kari},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {An Aperiodic Set of Wang Cubes},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {137--146},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_12},
doi = {10.1007/3-540-60922-9\_12},
timestamp = {Wed, 24 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/CulikK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DammJS96,
author = {Carsten Damm and
Stasys Jukna and
Jir{\'{\i}} Sgall},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Some Bounds on Multiparty Communication Complexity of Pointer Jumping},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {643--654},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_52},
doi = {10.1007/3-540-60922-9\_52},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DammJS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DenisDG96,
author = {Fran{\c{c}}ois Denis and
Cyrille D'Halluin and
R{\'{e}}mi Gilleron},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {{PAC} Learning with Simple Examples},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {231--242},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_20},
doi = {10.1007/3-540-60922-9\_20},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DenisDG96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Dietzfelbinger96,
author = {Martin Dietzfelbinger},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Universal Hashing and k-Wise Independent Random Variables via Integer
Arithmetic without Primes},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {569--580},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_46},
doi = {10.1007/3-540-60922-9\_46},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Dietzfelbinger96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DurrTS96,
author = {Christoph D{\"{u}}rr and
Huong L{\^{e}} Thanh and
Miklos Santha},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {A Decision Procedure for Well-Formed Linear Quantum Cellular Automata},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {281--292},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_24},
doi = {10.1007/3-540-60922-9\_24},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DurrTS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FriedmanJRST96,
author = {Joel Friedman and
Antoine Joux and
Yuval Roichman and
Jacques Stern and
Jean{-}Pierre Tillich},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {The Action of a Few Random Permutations on r-Tuples and an Application
to Cryptography},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {375--386},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_31},
doi = {10.1007/3-540-60922-9\_31},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FriedmanJRST96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Frougny96,
author = {Christiane Frougny},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {On the Successor Function in Non-Classical Numeration Systems},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {543--553},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_44},
doi = {10.1007/3-540-60922-9\_44},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Frougny96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GartnerW96,
author = {Bernd G{\"{a}}rtner and
Emo Welzl},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Linear Programming - Randomization and Abstract Frameworks},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {669--687},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_54},
doi = {10.1007/3-540-60922-9\_54},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GartnerW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Giacobazzi96,
author = {Roberto Giacobazzi},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {"Optimal" Collecting Semantics for Analysis in a Hierarchy of Logic
Program Semantics},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {503--514},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_41},
doi = {10.1007/3-540-60922-9\_41},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Giacobazzi96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GuptaN96,
author = {Arvind Gupta and
Naomi Nishimura},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Characterizing the Complexity of Subgraph Isomorphism for Graphs of
Bounded Path-Width},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {453--464},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_37},
doi = {10.1007/3-540-60922-9\_37},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GuptaN96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HarjuKK96,
author = {Tero Harju and
Juhani Karhum{\"{a}}ki and
Daniel Krob},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Remarks on Generalized Post Correspondence Problem},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {39--48},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_4},
doi = {10.1007/3-540-60922-9\_4},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HarjuKK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HeunM96,
author = {Volker Heun and
Ernst W. Mayr},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Embedding Graphs with Bounded Treewidth into Optimal Hypercubes},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {157--168},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_14},
doi = {10.1007/3-540-60922-9\_14},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HeunM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HofmeisterL96,
author = {Thomas Hofmeister and
Hanno Lefmann},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {A Combinatorial Design Approach to {MAXCUT}},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {441--452},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_36},
doi = {10.1007/3-540-60922-9\_36},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HofmeisterL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Indyk96,
author = {Piotr Indyk},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {On Word-Level Parallelism in Fault-Tolerant Computing},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {193--204},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_17},
doi = {10.1007/3-540-60922-9\_17},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Indyk96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/JakobyS96,
author = {Andreas Jakoby and
Christian Schindelhauer},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {On the Complexity of Worst Case and Expected Time in a Circuit},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {295--306},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_25},
doi = {10.1007/3-540-60922-9\_25},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/JakobyS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Kelsen96,
author = {Pierre Kelsen},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Ranking and Unranking Trees Using Regular Reductions},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {581--592},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_47},
doi = {10.1007/3-540-60922-9\_47},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Kelsen96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KranakisK96,
author = {Evangelos Kranakis and
Danny Krizanc},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Lower Bounds for Compact Routing (Extended Abstract)},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {529--540},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_43},
doi = {10.1007/3-540-60922-9\_43},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KranakisK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Kummer96,
author = {Martin Kummer},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {On the Complexity of Random Strings (Extended Abstract)},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {25--36},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_3},
doi = {10.1007/3-540-60922-9\_3},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Kummer96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Lagergren96,
author = {Jens Lagergren},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Hypothesis Testing in Perfect Phylogeny for a Bounded Number of Characters},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {605--616},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_49},
doi = {10.1007/3-540-60922-9\_49},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Lagergren96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Lutz96,
author = {Jack H. Lutz},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Observations on Measure and Lowness for DeltaP{\_}2},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {87--97},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_8},
doi = {10.1007/3-540-60922-9\_8},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Lutz96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Marcinkowski96,
author = {Jerzy Marcinkowski},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {The 3 Frenchmen Method Proves Undecidability of the Uniform Boundedness
for Single Recursive Rule Ternary {DATALOG} Programs},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {427--438},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_35},
doi = {10.1007/3-540-60922-9\_35},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Marcinkowski96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Maurer96,
author = {Ueli M. Maurer},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {A Unified and Generalized Treatment of Authentification Theory},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {387--398},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_32},
doi = {10.1007/3-540-60922-9\_32},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Maurer96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MeinelW96,
author = {Christoph Meinel and
Stephan Waack},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {The "log Rank" Conjecture for Modular Communication Complexity},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {619--630},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_50},
doi = {10.1007/3-540-60922-9\_50},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/MeinelW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Melancon96,
author = {Guy Melan{\c{c}}on},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Lyndon Factorization of Infinite Words},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {147--154},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_13},
doi = {10.1007/3-540-60922-9\_13},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Melancon96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Mitchell96,
author = {Scott A. Mitchell},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {A Characterization of the Quadrilateral Meshes of a Surface Which
Admit a Compatible Hexahedral Mesh of the Enclosed Volume},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {465--476},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_38},
doi = {10.1007/3-540-60922-9\_38},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/Mitchell96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MorvanV96,
author = {Michel Morvan and
Laurent Viennot},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Parallel Comparability Graph Recognition and Modular Decomposition},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {169--180},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_15},
doi = {10.1007/3-540-60922-9\_15},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/MorvanV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Schmitt96,
author = {Vincent Schmitt},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Flip-Flop Nets},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {517--528},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_42},
doi = {10.1007/3-540-60922-9\_42},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Schmitt96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Schwentick96,
author = {Thomas Schwentick},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {On Bijections vs. Unary Functions},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {415--426},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_34},
doi = {10.1007/3-540-60922-9\_34},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Schwentick96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/SifakisY96,
author = {Joseph Sifakis and
Sergio Yovine},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Compositional Specification of Timed Systems (Extended Abstract)},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {347--359},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_29},
doi = {10.1007/3-540-60922-9\_29},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/SifakisY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/TateishiMM96,
author = {Erika Tateishi and
Osamu Maruyama and
Satoru Miyano},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Extracting Best Consensus Motifs from Positive and Negative Examples},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {219--230},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_19},
doi = {10.1007/3-540-60922-9\_19},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/TateishiMM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Walukiewicz96,
author = {Igor Walukiewicz},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Monadic Second Order Logic on Tree-Like Structures},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {401--413},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_33},
doi = {10.1007/3-540-60922-9\_33},
timestamp = {Mon, 22 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Walukiewicz96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/1996,
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9},
doi = {10.1007/3-540-60922-9},
isbn = {3-540-60922-9},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/1996.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-28 13:49 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:
