Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Search dblp for Publications

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

export results for "STACS 2002"

> Home > Search

download as .bib file

@inproceedings{DBLP:conf/stacs/AdcockC02,
  author       = {Mark Adcock and
                  Richard Cleve},
  title        = {A Quantum Goldreich-Levin Theorem with Cryptographic Applications},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {323--334},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_26},
  doi          = {10.1007/3-540-45841-7\_26},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/AdcockC02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/AdlerR02,
  author       = {Micah Adler and
                  Adi Ros{\'{e}}n},
  title        = {Tight Bounds for the Performance of Longest-in-System on DAGs},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {88--99},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_6},
  doi          = {10.1007/3-540-45841-7\_6},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/AdlerR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/AidaCRW02,
  author       = {Shin Aida and
                  Marcel Cr{\^{a}}smaru and
                  Kenneth W. Regan and
                  Osamu Watanabe},
  title        = {Games with a Uniqueness Property},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {396--407},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_32},
  doi          = {10.1007/3-540-45841-7\_32},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/AidaCRW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/BackofenNS02,
  author       = {Rolf Backofen and
                  N. S. Narayanaswamy and
                  Firas Swidan},
  title        = {On the Complexity of Protein Similarity Search under mRNA Structure
                  Constraints},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {274--286},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_22},
  doi          = {10.1007/3-540-45841-7\_22},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BackofenNS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/BaetenV02,
  author       = {Jos C. M. Baeten and
                  Erik P. de Vink},
  title        = {Axiomatizing {GSOS} with Termination},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {583--595},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_48},
  doi          = {10.1007/3-540-45841-7\_48},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BaetenV02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Bast02,
  author       = {Hannah Bast},
  title        = {Scheduling at Twilight the Easy Way},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {166--178},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_13},
  doi          = {10.1007/3-540-45841-7\_13},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Bast02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/BealP02,
  author       = {Marie{-}Pierre B{\'{e}}al and
                  Dominique Perrin},
  title        = {On the Enumerative Sequences of Regular Languages on k Symbols},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {547--558},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_45},
  doi          = {10.1007/3-540-45841-7\_45},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BealP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Blumensath02,
  author       = {Achim Blumensath},
  title        = {Axiomatising Tree-Interpretable Structures},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {596--607},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_49},
  doi          = {10.1007/3-540-45841-7\_49},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Blumensath02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/BodirskyK02,
  author       = {Manuel Bodirsky and
                  Martin Kutz},
  title        = {Pure Dominance Constraints},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {287--298},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_23},
  doi          = {10.1007/3-540-45841-7\_23},
  timestamp    = {Mon, 05 Jun 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BodirskyK02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/BorosGKM02,
  author       = {Endre Boros and
                  Vladimir Gurvich and
                  Leonid Khachiyan and
                  Kazuhisa Makino},
  title        = {On the Complexity of Generating Maximal Frequent and Minimal Infrequent
                  Sets},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {133--141},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_10},
  doi          = {10.1007/3-540-45841-7\_10},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/BorosGKM02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/ChandranR02,
  author       = {L. Sunil Chandran and
                  L. Shankar Ram},
  title        = {Approximations for {ATSP} with Parametrized Triangle Inequality},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {227--237},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_18},
  doi          = {10.1007/3-540-45841-7\_18},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/ChandranR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/DSouzaM02,
  author       = {Deepak D'Souza and
                  P. Madhusudan},
  title        = {Timed Control Synthesis for External Specifications},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {571--582},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_47},
  doi          = {10.1007/3-540-45841-7\_47},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/DSouzaM02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/DarteH02,
  author       = {Alain Darte and
                  Guillaume Huard},
  title        = {Complexity of Multi-dimensional Loop Alignment},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {179--191},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_14},
  doi          = {10.1007/3-540-45841-7\_14},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/DarteH02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/DemriLS02,
  author       = {St{\'{e}}phane Demri and
                  Fran{\c{c}}ois Laroussinie and
                  Philippe Schnoebelen},
  title        = {A Parametric Analysis of the State Explosion Problem in Model Checking},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {620--631},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_51},
  doi          = {10.1007/3-540-45841-7\_51},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/DemriLS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/DiekertL02,
  author       = {Volker Diekert and
                  Markus Lohrey},
  title        = {Existential and Positive Theories of Equations in Graph Products},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {501--512},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_41},
  doi          = {10.1007/3-540-45841-7\_41},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/DiekertL02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/DingR02,
  author       = {Yan Zong Ding and
                  Michael O. Rabin},
  title        = {Hyper-Encryption and Everlasting Security},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {1--26},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_1},
  doi          = {10.1007/3-540-45841-7\_1},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/DingR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Doerr02,
  author       = {Benjamin Doerr},
  title        = {Balanced Coloring: Equally Easy for All Numbers of Colors?},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {112--120},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_8},
  doi          = {10.1007/3-540-45841-7\_8},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Doerr02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Dowek02,
  author       = {Gilles Dowek},
  title        = {What Is a Theory?},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {50--64},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_3},
  doi          = {10.1007/3-540-45841-7\_3},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Dowek02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Elbassioni02,
  author       = {Khaled M. Elbassioni},
  title        = {On Dualization in Products of Forests},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {142--153},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_11},
  doi          = {10.1007/3-540-45841-7\_11},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Elbassioni02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/FellowsGN02,
  author       = {Michael R. Fellows and
                  Jens Gramm and
                  Rolf Niedermeier},
  title        = {On the Parameterized Intractability of {CLOSEST} SUBSTRINGsize and
                  Related Problems},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {262--273},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_21},
  doi          = {10.1007/3-540-45841-7\_21},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/FellowsGN02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/FlumG02,
  author       = {J{\"{o}}rg Flum and
                  Martin Grohe},
  title        = {Describing Parameterized Complexity Classes},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {359--371},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_29},
  doi          = {10.1007/3-540-45841-7\_29},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/FlumG02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/FraigniaudG02,
  author       = {Pierre Fraigniaud and
                  Cyril Gavoille},
  title        = {A Space Lower Bound for Routing in Trees},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {65--75},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_4},
  doi          = {10.1007/3-540-45841-7\_4},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/FraigniaudG02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Frick02,
  author       = {Markus Frick},
  title        = {Generalized Model-Checking over Locally Tree-Decomposable Classes},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {632--644},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_52},
  doi          = {10.1007/3-540-45841-7\_52},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Frick02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/GiesenJ02,
  author       = {Joachim Giesen and
                  Matthias John},
  title        = {A New Diagram from Disks in the Plane},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {238--249},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_19},
  doi          = {10.1007/3-540-45841-7\_19},
  timestamp    = {Sat, 30 Dec 2017 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/GiesenJ02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/GraafW02,
  author       = {Mart de Graaf and
                  Ronald de Wolf},
  title        = {On Quantum Versions of the Yao Principle},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {347--358},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_28},
  doi          = {10.1007/3-540-45841-7\_28},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/GraafW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/GrigorievHP02,
  author       = {Dima Grigoriev and
                  Edward A. Hirsch and
                  Dmitrii V. Pasechnik},
  title        = {Complexity of Semi-algebraic Proofs},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {419--430},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_34},
  doi          = {10.1007/3-540-45841-7\_34},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/GrigorievHP02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/GroheT02,
  author       = {Martin Grohe and
                  Gy{\"{o}}rgy Tur{\'{a}}n},
  title        = {Learnability and Definability in Trees and Similar Structures},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {645--658},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_53},
  doi          = {10.1007/3-540-45841-7\_53},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/GroheT02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/HofmeisterSSW02,
  author       = {Thomas Hofmeister and
                  Uwe Sch{\"{o}}ning and
                  Rainer Schuler and
                  Osamu Watanabe},
  title        = {A Probabilistic 3-SAT Algorithm Further Improved},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {192--202},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_15},
  doi          = {10.1007/3-540-45841-7\_15},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/HofmeisterSSW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/HoyerW02,
  author       = {Peter H{\o}yer and
                  Ronald de Wolf},
  title        = {Improved Quantum Communication Complexity Bounds for Disjointness
                  and Equality},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {299--310},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_24},
  doi          = {10.1007/3-540-45841-7\_24},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/HoyerW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Jansen02,
  author       = {Klaus Jansen},
  title        = {Approximate Strong Separation with Application in Fractional Graph
                  Coloring and Preemptive Scheduling},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {100--111},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_7},
  doi          = {10.1007/3-540-45841-7\_7},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Jansen02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Kieronski02,
  author       = {Emanuel Kieronski},
  title        = {EXPSPACE-Complete Variant of Guarded Fragment with Transitivity},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {608--619},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_50},
  doi          = {10.1007/3-540-45841-7\_50},
  timestamp    = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Kieronski02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Klauck02,
  author       = {Hartmut Klauck},
  title        = {On Quantum and Approximate Privacy},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {335--346},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_27},
  doi          = {10.1007/3-540-45841-7\_27},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Klauck02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/KoblerT02,
  author       = {Johannes K{\"{o}}bler and
                  Jacobo Tor{\'{a}}n},
  title        = {The Complexity of Graph Isomorphism for Colored Graphs with Color
                  Classes of Size 2 and 3},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {121--132},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_9},
  doi          = {10.1007/3-540-45841-7\_9},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/KoblerT02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/KormanPR02,
  author       = {Amos Korman and
                  David Peleg and
                  Yoav Rodeh},
  title        = {Labeling Schemes for Dynamic Tree Networks},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {76--87},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_5},
  doi          = {10.1007/3-540-45841-7\_5},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/KormanPR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Krause02,
  author       = {Matthias Krause},
  title        = {On the Computational Power of Boolean Decision Lists},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {372--383},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_30},
  doi          = {10.1007/3-540-45841-7\_30},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Krause02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/KrobMM02,
  author       = {Daniel Krob and
                  Jean Mairesse and
                  Ioannis Michos},
  title        = {On the Average Parallelism in Trace Monoids},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {477--488},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_39},
  doi          = {10.1007/3-540-45841-7\_39},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/KrobMM02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/KrokhinJJ02,
  author       = {Andrei A. Krokhin and
                  Peter Jeavons and
                  Peter Jonsson},
  title        = {The Complexity of Constraints on Intervals and Lengths},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {443--454},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_36},
  doi          = {10.1007/3-540-45841-7\_36},
  timestamp    = {Mon, 17 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/KrokhinJJ02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Kuske02,
  author       = {Dietrich Kuske},
  title        = {A Further Step towards a Theory of Regular {MSC} Languages},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {489--500},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_40},
  doi          = {10.1007/3-540-45841-7\_40},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Kuske02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/LangermanMS02,
  author       = {Stefan Langerman and
                  Pat Morin and
                  Michael A. Soss},
  title        = {Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees,
                  and Cycles},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {250--261},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_20},
  doi          = {10.1007/3-540-45841-7\_20},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/LangermanMS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/LepereR02,
  author       = {Renaud Lep{\`{e}}re and
                  Christophe Rapine},
  title        = {An Asymptotic O(ln rho/ln ln rho)-Approximation Algorithm for the
                  Scheduling Problem with Duplication on Large Communication Delay Graphs},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {154--165},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_12},
  doi          = {10.1007/3-540-45841-7\_12},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/LepereR02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Loding02,
  author       = {Christof L{\"{o}}ding},
  title        = {Ground Tree Rewriting Graphs of Bounded Tree Width},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {559--570},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_46},
  doi          = {10.1007/3-540-45841-7\_46},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Loding02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/LorenzM02,
  author       = {Ulf Lorenz and
                  Burkhard Monien},
  title        = {The Secret of Selective Game Tree Search, When Using Random-Error
                  Evaluations},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {203--214},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_16},
  doi          = {10.1007/3-540-45841-7\_16},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/LorenzM02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Morin02,
  author       = {R{\'{e}}mi Morin},
  title        = {Recognizable Sets of Message Sequence Charts},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {523--534},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_43},
  doi          = {10.1007/3-540-45841-7\_43},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Morin02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Nishimura02,
  author       = {Harumichi Nishimura},
  title        = {On Quantum Computation with Some Restricted Amplitudes},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {311--322},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_25},
  doi          = {10.1007/3-540-45841-7\_25},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Nishimura02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Pan02,
  author       = {Victor Y. Pan},
  title        = {Randomized Acceleration of Fundamental Matrix Computations},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {215--226},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_17},
  doi          = {10.1007/3-540-45841-7\_17},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Pan02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/PavanS02,
  author       = {Aduri Pavan and
                  Alan L. Selman},
  title        = {Bi-Immunity Separates Strong NP-Completeness Notions},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {408--418},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_33},
  doi          = {10.1007/3-540-45841-7\_33},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/PavanS02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Petersen02,
  author       = {Holger Petersen},
  title        = {The Membership Problem for Regular Expressions with Intersection Is
                  Complete in {LOGCFL}},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {513--522},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_42},
  doi          = {10.1007/3-540-45841-7\_42},
  timestamp    = {Fri, 15 Mar 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/Petersen02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Scheideler02,
  author       = {Christian Scheideler},
  title        = {Models and Techniques for Communication in Dynamic Networks},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {27--49},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_2},
  doi          = {10.1007/3-540-45841-7\_2},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Scheideler02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Simon02,
  author       = {Hans Ulrich Simon},
  title        = {How Many Missing Answers Can Be Tolerated by Query Learners?},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {384--395},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_31},
  doi          = {10.1007/3-540-45841-7\_31},
  timestamp    = {Fri, 08 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Simon02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Srba02,
  author       = {Jir{\'{\i}} Srba},
  title        = {Strong Bisimilarity and Regularity of Basic Parallel Processes Is
                  PSPACE-Hard},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {535--546},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_44},
  doi          = {10.1007/3-540-45841-7\_44},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Srba02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Tantau02,
  author       = {Till Tantau},
  title        = {Comparing Verboseness for Finite Automata and Turing Machines},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {465--476},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_38},
  doi          = {10.1007/3-540-45841-7\_38},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Tantau02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/TherienW02,
  author       = {Denis Th{\'{e}}rien and
                  Thomas Wilke},
  title        = {Nesting Until and Since in Linear Temporal Logic},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {455--464},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_37},
  doi          = {10.1007/3-540-45841-7\_37},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/TherienW02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/stacs/Woelfel02,
  author       = {Philipp Woelfel},
  title        = {A Lower Bound Technique for Restricted Branching Programs and Applications},
  booktitle    = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  pages        = {431--442},
  year         = {2002},
  crossref     = {DBLP:conf/stacs/2002},
  url          = {https://doi.org/10.1007/3-540-45841-7\_35},
  doi          = {10.1007/3-540-45841-7\_35},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/Woelfel02.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/stacs/2002,
  editor       = {Helmut Alt and
                  Afonso Ferreira},
  title        = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2285},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-45841-7},
  doi          = {10.1007/3-540-45841-7},
  isbn         = {3-540-43283-3},
  timestamp    = {Tue, 14 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/2002.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@proceedings{DBLP:conf/stacs/2002,
  editor       = {Helmut Alt and
                  Afonso Ferreira},
  title        = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
                  Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2285},
  publisher    = {Springer},
  year         = {2002},
  url          = {https://doi.org/10.1007/3-540-45841-7},
  doi          = {10.1007/3-540-45841-7},
  isbn         = {3-540-43283-3},
  timestamp    = {Sun, 23 Jun 2024 10:35:52 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/2002.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.