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/stacs98.bht:"
download as .bib file
@inproceedings{DBLP:conf/stacs/AgostinoS98,
author = {Sergio De Agostino and
Riccardo Silvestri},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Bounded Size Dictionary Compression: SC\({}^{\mbox{k}}\)-Completeness
and {NC} Algorithms},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {522--532},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028587},
doi = {10.1007/BFB0028587},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AgostinoS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ArvindBL98,
author = {Vikraman Arvind and
Richard Beigel and
Antoni Lozano},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {The Complexity of Modular Graph Automorphism},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {172--182},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028559},
doi = {10.1007/BFB0028559},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ArvindBL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BarringtonLMS98,
author = {David A. Mix Barrington and
Chi{-}Jen Lu and
Peter Bro Miltersen and
Sven Skyum},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Searching Constant Width Mazes Captures the AC\({}^{\mbox{0}}\) Hierarchy},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {73--83},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028550},
doi = {10.1007/BFB0028550},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BarringtonLMS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BazganST98,
author = {Cristina Bazgan and
Miklos Santha and
Zsolt Tuza},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {On the Approximation of Finding A(nother) Hamilton Cycle in Cubic
Hamilton Graphs (Extended Abstract)},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {276--286},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028567},
doi = {10.1007/BFB0028567},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BazganST98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BehrensW98,
author = {Jan Behrens and
Stephan Waack},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Equivalence Test and Ordering Transformation for Parity-OBDDs of Different
Variable Ordering},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {227--237},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028564},
doi = {10.1007/BFB0028564},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BehrensW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Bradfield98,
author = {Julian C. Bradfield},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Simplifying the Modal Mu-Calculus Alternation Hierarchy},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {39--49},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028547},
doi = {10.1007/BFB0028547},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Bradfield98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BshoutyB98,
author = {Nader H. Bshouty and
Lynn Burroughs},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Massaging a Linear Programming Solution to Give a 2-Approximation
for a Generalization of the Vertex Cover Problem},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {298--308},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028569},
doi = {10.1007/BFB0028569},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BshoutyB98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanMRSS98,
author = {Harry Buhrman and
Dieter van Melkebeek and
Kenneth W. Regan and
D. Sivakumar and
Martin Strauss},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {A Generalization of Resource-Bounded Measure, With an Application
(Extended Abstract)},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {161--171},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028558},
doi = {10.1007/BFB0028558},
timestamp = {Tue, 19 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanMRSS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Burgisser98,
author = {Peter B{\"{u}}rgisser},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {On the Structure of Valiant's Complexity Classes},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {194--204},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028561},
doi = {10.1007/BFB0028561},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Burgisser98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CaludeHKW98,
author = {Cristian Calude and
Peter Hertling and
Bakhadyr Khoussainov and
Yongge Wang},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Recursively Enumerable Reals and Chaitin Omega Numbers},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {596--606},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028594},
doi = {10.1007/BFB0028594},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/CaludeHKW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CrescenzoSY98,
author = {Giovanni Di Crescenzo and
Kouichi Sakurai and
Moti Yung},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Result-Indistinguishable Zero-Knowledge Proofs: Increased Power and
Constant-Round Protocols},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {511--521},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028586},
doi = {10.1007/BFB0028586},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/CrescenzoSY98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DemriS98,
author = {St{\'{e}}phane Demri and
Philippe Schnoebelen},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {The Complexity of Propositional Linear Temporal Logics in Simple Cases
(Extended Abstract)},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {61--72},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028549},
doi = {10.1007/BFB0028549},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DemriS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DessmarkLOY98,
author = {Anders Dessmark and
Andrzej Lingas and
Hans Olsson and
Hiroaki Yamamoto},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Optimal Broadcasting in Almost Trees and Partial k-trees},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {432--443},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028579},
doi = {10.1007/BFB0028579},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DessmarkLOY98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DialloFR98,
author = {Mohamadou Diallo and
Afonso Ferreira and
Andrew Rau{-}Chaplin},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Communication-Efficient Deterministic Parallel Algorithms for Planar
Point Location and 2d Voronoi Diagram},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {399--409},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028576},
doi = {10.1007/BFB0028576},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DialloFR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DorkenooER98,
author = {Marius Dorkenoo and
Marie{-}Christine Eglin{-}Leclerc and
Eric R{\'{e}}mila},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Construction of Non-intersecting Colored Flows Through a Planar Cellular
Figure},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {587--595},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028593},
doi = {10.1007/BFB0028593},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DorkenooER98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EiterIM98,
author = {Thomas Eiter and
Toshihide Ibaraki and
Kazuhisa Makino},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {On Disguised Double Horn Functions and Extensions},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {50--60},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028548},
doi = {10.1007/BFB0028548},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/EiterIM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Esik98,
author = {Zolt{\'{a}}n {\'{E}}sik},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Axiomatizing the Equational Theory of Regular Tree Languages (Extended
Anstract)},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {455--465},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028581},
doi = {10.1007/BFB0028581},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Esik98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FeigenbaumKVV98,
author = {Joan Feigenbaum and
Sampath Kannan and
Moshe Y. Vardi and
Mahesh Viswanathan},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract)},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {216--226},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028563},
doi = {10.1007/BFB0028563},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FeigenbaumKVV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FortnowL98,
author = {Lance Fortnow and
Sophie Laplante},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Nearly Optimal Language Compression Using Extractors},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {84--93},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028551},
doi = {10.1007/BFB0028551},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FortnowL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Frid98,
author = {Anna E. Frid},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {On Uniform {DOL} Words},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {544--554},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028589},
doi = {10.1007/BFB0028589},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Frid98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GolumbicK98,
author = {Martin Charles Golumbic and
Haim Kaplan},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Cell Flipping in Permutation Diagrams},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {577--586},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028592},
doi = {10.1007/BFB0028592},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GolumbicK98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GroplPS98,
author = {Clemens Gr{\"{o}}pl and
Hans J{\"{u}}rgen Pr{\"{o}}mel and
Anand Srivastav},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Size and Structure of Random Ordered Binary Decision Diagrams (Extended
Abstract)},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {238--248},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028565},
doi = {10.1007/BFB0028565},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GroplPS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Gustedt98,
author = {Jens Gustedt},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {421--431},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028578},
doi = {10.1007/BFB0028578},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Gustedt98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HabibPV98,
author = {Michel Habib and
Christophe Paul and
Laurent Viennot},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {A Synthesis on Partition Refinement: {A} Useful Routine for Strings,
Graphs, Boolean Matrices and Automata},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {25--38},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028546},
doi = {10.1007/BFB0028546},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HabibPV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Hagerup98,
author = {Torben Hagerup},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Sorting and Searching on the Word {RAM}},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {366--398},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028575},
doi = {10.1007/BFB0028575},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Hagerup98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/IvanovR98,
author = {Sergei Ivanov and
Michel de Rougemont},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Interactive Protocols on the Reals},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {499--510},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028585},
doi = {10.1007/BFB0028585},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/IvanovR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Jansen98,
author = {Klaus Jansen},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {The Mutual Exclusion Scheduling Problem for Permutation and Comparability
Graphs},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {287--297},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028568},
doi = {10.1007/BFB0028568},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Jansen98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/JanssenKNS98,
author = {Jeannette C. M. Janssen and
Danny Krizanc and
Lata Narayanan and
Sunil M. Shende},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Distributed Online Frequency Assignment in Cellular Networks},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {3--13},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028544},
doi = {10.1007/BFB0028544},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/JanssenKNS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Jantzen98,
author = {Matthias Jantzen},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Hierarchies of Principal Twist-Closed Trios},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {344--355},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028573},
doi = {10.1007/BFB0028573},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Jantzen98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Karp98,
author = {Richard M. Karp},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Random Graphs, Random Walks, Differential Equations and the Probabilistic
Analysis of Algorithms},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {1--2},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028543},
doi = {10.1007/BFB0028543},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Karp98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Kemp98,
author = {Rainer Kemp},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {On the Expected Number of Nodes at Level k in 0-balanced Trees},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {566--576},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028591},
doi = {10.1007/BFB0028591},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Kemp98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KosubSV98,
author = {Sven Kosub and
Heinz Schmitz and
Heribert Vollmer},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Uniformly Defining Complexity Classes of Functions},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {607--617},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028595},
doi = {10.1007/BFB0028595},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KosubSV98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Lapoire98,
author = {Denis Lapoire},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Recognizability Equals Monadic Second-Order Definability for Sets
of Graphs of Bounded Tree-Width},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {618--628},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028596},
doi = {10.1007/BFB0028596},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Lapoire98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Larsen98,
author = {Kim S. Larsen},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Partially Persistent Search Trees with Transcript Operations},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {309--319},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028570},
doi = {10.1007/BFB0028570},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Larsen98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/LibkinW98,
author = {Leonid Libkin and
Limsoon Wong},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Unary Quantifiers, Transitive Closure, and Relations of Large Degree},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {183--193},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028560},
doi = {10.1007/BFB0028560},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/LibkinW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/LodayaW98,
author = {Kamal Lodaya and
Pascal Weil},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Series-Parallel Posets: Algebra, Automata and Languages},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {555--565},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028590},
doi = {10.1007/BFB0028590},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/LodayaW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ManziniM98,
author = {Giovanni Manzini and
Luciano Margara},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Attractors of D-dimensional Linear Cellular Automata},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {128--138},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028555},
doi = {10.1007/BFB0028555},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ManziniM98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Mateescu98,
author = {Alexandru Mateescu},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Shuffle of omega-Words: Algebraic Aspects (Extended Abstract)},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {150--160},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028557},
doi = {10.1007/BFB0028557},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Mateescu98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MazoyerR98,
author = {Jacques Mazoyer and
Ivan Rapaport},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Inducing an Order on Cellular Automata by a Grouping Operation},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {116--127},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028554},
doi = {10.1007/BFB0028554},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/MazoyerR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MereghettiP98,
author = {Carlo Mereghetti and
Giovanni Pighizzini},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Optimal Simulations Between Unary Automata},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {139--149},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028556},
doi = {10.1007/BFB0028556},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/MereghettiP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MessnerT98,
author = {Jochen Me{\ss}ner and
Jacobo Tor{\'{a}}n},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Optimal Proof Systems for Propositional Logic and Complete Sets},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {477--487},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028583},
doi = {10.1007/BFB0028583},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/MessnerT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MeyerP98,
author = {Rapha{\"{e}}l Meyer and
Antoine Petit},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Expressive Completeness of LTrL on Finite Traces: An Algebraic Proof},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {533--543},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028588},
doi = {10.1007/BFB0028588},
timestamp = {Thu, 14 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/MeyerP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/MontiP98,
author = {Angelo Monti and
Adriano Peron},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {A Logical Characterization of Systolic Languages},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {466--476},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028582},
doi = {10.1007/BFB0028582},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/MontiP98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/NiwinskiW98,
author = {Damian Niwinski and
Igor Walukiewicz},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Relating Hierarchies of Word and Tree Automata},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {320--331},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028571},
doi = {10.1007/BFB0028571},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/NiwinskiW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Rub98,
author = {Christine R{\"{u}}b},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {On Batcher's Merge Sorts as Parallel Sorting Algorithms},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {410--420},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028577},
doi = {10.1007/BFB0028577},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Rub98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Safer98,
author = {Taoufik Safer},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Radix Representations of Algebraic Number Fields and Finite Automata},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {356--365},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028574},
doi = {10.1007/BFB0028574},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Safer98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Sauerhoff98,
author = {Martin Sauerhoff},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Lower Bounds for Randomized Read-k-Times Branching Programs (Extended
Abstract)},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {105--115},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028553},
doi = {10.1007/BFB0028553},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Sauerhoff98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/SchwentickB98,
author = {Thomas Schwentick and
Klaus Barthelmann},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Local Normal Forms for First-Order Logic with Applications to Games
and Automata},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {444--454},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028580},
doi = {10.1007/BFB0028580},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/SchwentickB98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/SernaTX98,
author = {Maria J. Serna and
Luca Trevisan and
Fatos Xhafa},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {The (Parallel) Approximability of Non-Boolean Satisfiability Problems
and Restricted Integer Programming},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {488--498},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028584},
doi = {10.1007/BFB0028584},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/SernaTX98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Sieling98,
author = {Detlef Sieling},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {On the Existence of Polynomial Time Approximation Schemes for {OBDD}
Minimization (Extended Abstract)},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {205--215},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028562},
doi = {10.1007/BFB0028562},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Sieling98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/SpencerJ98,
author = {Joel Spencer and
Katherine St. John},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Random Sparse Bit Strings at the Threshold of Adjacency},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {94--104},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028552},
doi = {10.1007/BFB0028552},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/SpencerJ98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Straubing98,
author = {Howard Straubing},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Languages Defined With Modular Counting Quantifiers (Extended Abstract)},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {332--343},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028572},
doi = {10.1007/BFB0028572},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Straubing98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Thorup98,
author = {Mikkel Thorup},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Floats, Integers, and Single Source Shortest Paths},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {14--24},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028545},
doi = {10.1007/BFB0028545},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Thorup98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Vaudenay98,
author = {Serge Vaudenay},
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {Provable Security for Block Ciphers by Decorrelation},
booktitle = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
pages = {249--275},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028566},
doi = {10.1007/BFB0028566},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Vaudenay98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/1998,
editor = {Michel Morvan and
Christoph Meinel and
Daniel Krob},
title = {{STACS} 98, 15th Annual Symposium on Theoretical Aspects of Computer
Science, Paris, France, February 25-27, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1373},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0028542},
doi = {10.1007/BFB0028542},
isbn = {3-540-64230-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/1998.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-04-24 03:05 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:
