Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/conf/stacs/stacs2014.bht:"
@inproceedings{DBLP:conf/stacs/0001GR14, author = {Andreas G{\"{o}}bel and Leslie Ann Goldberg and David Richerby}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Counting Homomorphisms to Cactus Graphs Modulo 2}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {350--361}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.350}, doi = {10.4230/LIPICS.STACS.2014.350}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/0001GR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/AdamczykSW14, author = {Marek Adamczyk and Maxim Sviridenko and Justin Ward}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Submodular Stochastic Probing on Matroids}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {29--40}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.29}, doi = {10.4230/LIPICS.STACS.2014.29}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/AdamczykSW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/AndersonD14, author = {Matthew Anderson and Anuj Dawar}, editor = {Ernst W. Mayr and Natacha Portier}, title = {On Symmetric Circuits and Fixed-Point Logics}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {41--52}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.41}, doi = {10.4230/LIPICS.STACS.2014.41}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/AndersonD14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/AngelBC14, author = {Eric Angel and Evripidis Bampis and Vincent Chau}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Throughput Maximization in the Speed-Scaling Setting}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {53--62}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.53}, doi = {10.4230/LIPICS.STACS.2014.53}, timestamp = {Thu, 23 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/AngelBC14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/AntoniadisBCKNPS14, author = {Antonios Antoniadis and Neal Barcelo and Mario E. Consuegra and Peter Kling and Michael Nugent and Kirk Pruhs and Michele Scquizzato}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {63--74}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.63}, doi = {10.4230/LIPICS.STACS.2014.63}, timestamp = {Wed, 10 May 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/AntoniadisBCKNPS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/AraujoNP14, author = {J{\'{u}}lio Ara{\'{u}}jo and Nicolas Nisse and St{\'{e}}phane P{\'{e}}rennes}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Weighted Coloring in Trees}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {75--86}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.75}, doi = {10.4230/LIPICS.STACS.2014.75}, timestamp = {Wed, 02 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/AraujoNP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/AzarEGK14, author = {Yossi Azar and Matthias Englert and Iftah Gamzu and Eytan Kidron}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Generalized Reordering Buffer Management}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {87--98}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.87}, doi = {10.4230/LIPICS.STACS.2014.87}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/AzarEGK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/AzizK14, author = {Haris Aziz and Bart de Keijzer}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Shapley meets Shapley}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {99--111}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.99}, doi = {10.4230/LIPICS.STACS.2014.99}, timestamp = {Fri, 09 Apr 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/AzizK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Bacquey14, author = {Nicolas Bacquey}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Complexity classes on spatially periodic Cellular Automata}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {112--124}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.112}, doi = {10.4230/LIPICS.STACS.2014.112}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Bacquey14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Bauwens14, author = {Bruno Bauwens}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Asymmetry of the Kolmogorov complexity of online predicting odd and even bits}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {125--136}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.125}, doi = {10.4230/LIPICS.STACS.2014.125}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Bauwens14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BekosGR14, author = {Michael A. Bekos and Martin Gronemann and Chrysanthi N. Raftopoulou}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Two-Page Book Embeddings of 4-Planar Graphs}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {137--148}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.137}, doi = {10.4230/LIPICS.STACS.2014.137}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/BekosGR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BerenbrinkEMA14, author = {Petra Berenbrink and Funda Erg{\"{u}}n and Frederik Mallmann{-}Trenn and Erfan Sadeqi Azer}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Palindrome Recognition In The Streaming Model}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {149--161}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.149}, doi = {10.4230/LIPICS.STACS.2014.149}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/BerenbrinkEMA14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Blanchet-SadriBW14, author = {Francine Blanchet{-}Sadri and Michelle Bodnar and Benjamin De Winkle}, editor = {Ernst W. Mayr and Natacha Portier}, title = {New Bounds and Extended Relations Between Prefix Arrays, Border Arrays, Undirected Graphs, and Indeterminate Strings}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {162--173}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.162}, doi = {10.4230/LIPICS.STACS.2014.162}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Blanchet-SadriBW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BoyarKLL14, author = {Joan Boyar and Shahin Kamali and Kim S. Larsen and Alejandro L{\'{o}}pez{-}Ortiz}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Online Bin Packing with Advice}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {174--186}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.174}, doi = {10.4230/LIPICS.STACS.2014.174}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/BoyarKLL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BringmannSS014, author = {Karl Bringmann and Thomas Sauerwald and Alexandre Stauffer and He Sun}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Balls into bins via local search: cover time and maximum load}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {187--198}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.187}, doi = {10.4230/LIPICS.STACS.2014.187}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/BringmannSS014.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/BruyereFRR14, author = {V{\'{e}}ronique Bruy{\`{e}}re and Emmanuel Filiot and Mickael Randour and Jean{-}Fran{\c{c}}ois Raskin}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {199--213}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.199}, doi = {10.4230/LIPICS.STACS.2014.199}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/BruyereFRR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/CaoM14, author = {Yixin Cao and D{\'{a}}niel Marx}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Chordal Editing is Fixed-Parameter Tractable}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {214--225}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.214}, doi = {10.4230/LIPICS.STACS.2014.214}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/CaoM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/ChenKLRW14, author = {Jian{-}Jia Chen and Mong{-}Jen Kao and D. T. Lee and Ignaz Rutter and Dorothea Wagner}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Online Dynamic Power Management with Hard Real-Time Guarantees}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {226--238}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.226}, doi = {10.4230/LIPICS.STACS.2014.226}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/ChenKLRW14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/ChillaraM14, author = {Suryajith Chillara and Partha Mukhopadhyay}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Depth-4 Lower Bounds, Determinantal Complexity: {A} Unified Approach}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {239--250}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.239}, doi = {10.4230/LIPICS.STACS.2014.239}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/ChillaraM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/CyganK14, author = {Marek Cygan and Tomasz Kociumaka}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Constant Factor Approximation for Capacitated k-Center with Outliers}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {251--262}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.251}, doi = {10.4230/LIPICS.STACS.2014.251}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/CyganK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/DereniowskiKPU14, author = {Dariusz Dereniowski and Adrian Kosowski and Dominik Pajak and Przemyslaw Uznanski}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Bounds on the Cover Time of Parallel Rotor Walks}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {263--275}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.263}, doi = {10.4230/LIPICS.STACS.2014.263}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/DereniowskiKPU14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/DisserKMS14, author = {Yann Disser and Max Klimm and Nicole Megow and Sebastian Stiller}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Packing a Knapsack of Unknown Capacity}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {276--287}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.276}, doi = {10.4230/LIPICS.STACS.2014.276}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/DisserKMS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/DrangeFPV14, author = {P{\aa}l Gr{\o}n{\aa}s Drange and Fedor V. Fomin and Michal Pilipczuk and Yngve Villanger}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Exploring Subexponential Parameterized Complexity of Completion Problems}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {288--299}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.288}, doi = {10.4230/LIPICS.STACS.2014.288}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/DrangeFPV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Esparza14, author = {Javier Esparza}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk)}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {1--10}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.1}, doi = {10.4230/LIPICS.STACS.2014.1}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Esparza14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/FigueiraL14, author = {Diego Figueira and Leonid Libkin}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Synchronizing Relations on Words}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {518--529}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.518}, doi = {10.4230/LIPICS.STACS.2014.518}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/FigueiraL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/FilmusLMNV14, author = {Yuval Filmus and Massimo Lauria and Mladen Miksa and Jakob Nordstr{\"{o}}m and Marc Vinyals}, editor = {Ernst W. Mayr and Natacha Portier}, title = {From Small Space to Small Width in Resolution}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {300--311}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.300}, doi = {10.4230/LIPICS.STACS.2014.300}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/FilmusLMNV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/GarneroPST14, author = {Valentin Garnero and Christophe Paul and Ignasi Sau and Dimitrios M. Thilikos}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Explicit Linear Kernels via Dynamic Programming}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {312--324}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.312}, doi = {10.4230/LIPICS.STACS.2014.312}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/GarneroPST14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/GavinskyP14, author = {Dmitry Gavinsky and Pavel Pudl{\'{a}}k}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Partition Expanders}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {325--336}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.325}, doi = {10.4230/LIPICS.STACS.2014.325}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/GavinskyP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/GawrychowskiMN14, author = {Pawel Gawrychowski and Florin Manea and Dirk Nowotka}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Testing Generalised Freeness of Words}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {337--349}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.337}, doi = {10.4230/LIPICS.STACS.2014.337}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/GawrychowskiMN14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Hoyrup14, author = {Mathieu Hoyrup}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Irreversible computable functions}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {362--373}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.362}, doi = {10.4230/LIPICS.STACS.2014.362}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Hoyrup14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/HuschenbettK14, author = {Martin Huschenbett and Manfred Kufleitner}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Ehrenfeucht-Fra{\"{\i}}ss{\'{e}} Games on Omega-Terms}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {374--385}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.374}, doi = {10.4230/LIPICS.STACS.2014.374}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/HuschenbettK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/IKK14, author = {Tomohiro I and Juha K{\"{a}}rkk{\"{a}}inen and Dominik Kempa}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Faster Sparse Suffix Sorting}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {386--396}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.386}, doi = {10.4230/LIPICS.STACS.2014.386}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/IKK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/IvanyosKQS14, author = {G{\'{a}}bor Ivanyos and Marek Karpinski and Youming Qiao and Miklos Santha}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Generalized Wong sequences and their applications to Edmonds' problems}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {397--408}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.397}, doi = {10.4230/LIPICS.STACS.2014.397}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/IvanyosKQS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/IwamaN14, author = {Kazuo Iwama and Atsuki Nagao}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Read-Once Branching Programs for Tree Evaluation Problems}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {409--420}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.409}, doi = {10.4230/LIPICS.STACS.2014.409}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/IwamaN14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Jeandel14, author = {Emmanuel Jeandel}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Computability of the entropy of one-tape Turing machines}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {421--432}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.421}, doi = {10.4230/LIPICS.STACS.2014.421}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Jeandel14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/JelinekKS14, author = {Tomas Jelinek and Marcus Klaas and Guido Sch{\"{a}}fer}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Computing Optimal Tolls with Arc Restrictions and Heterogeneous Players}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {433--444}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.433}, doi = {10.4230/LIPICS.STACS.2014.433}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/JelinekKS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/JezL14, author = {Artur Jez and Markus Lohrey}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Approximation of smallest linear tree grammar}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {445--457}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.445}, doi = {10.4230/LIPICS.STACS.2014.445}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/JezL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/KawarabayashiT14, author = {Ken{-}ichi Kawarabayashi and Mikkel Thorup}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Coloring 3-colorable graphs with o(n\{1/5\}) colors}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {458--469}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.458}, doi = {10.4230/LIPICS.STACS.2014.458}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/KawarabayashiT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Kayal14, author = {Neeraj Kayal}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Arithmetic Circuit Complexity (Tutorial)}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {28--28}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.28}, doi = {10.4230/LIPICS.STACS.2014.28}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Kayal14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/KommKKM14, author = {Dennis Komm and Rastislav Kr{\'{a}}lovic and Richard Kr{\'{a}}lovic and Tobias M{\"{o}}mke}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Randomized Online Algorithms with High Probability Guarantees}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {470--481}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.470}, doi = {10.4230/LIPICS.STACS.2014.470}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/KommKKM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Kothari14, author = {Robin Kothari}, editor = {Ernst W. Mayr and Natacha Portier}, title = {An optimal quantum algorithm for the oracle identification problem}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {482--493}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.482}, doi = {10.4230/LIPICS.STACS.2014.482}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Kothari14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Kotzing14, author = {Timo K{\"{o}}tzing}, editor = {Ernst W. Mayr and Natacha Portier}, title = {A Solution to Wiehagen's Thesis}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {494--505}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.494}, doi = {10.4230/LIPICS.STACS.2014.494}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Kotzing14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/LewensteinNV14, author = {Moshe Lewenstein and Yakov Nekrich and Jeffrey Scott Vitter}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Space-Efficient String Indexing for Wildcard Pattern Matching}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {506--517}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.506}, doi = {10.4230/LIPICS.STACS.2014.506}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/LewensteinNV14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/LohreyZ14, author = {Markus Lohrey and Georg Zetzsche}, editor = {Ernst W. Mayr and Natacha Portier}, title = {On Boolean closed full trios and rational Kripke frames}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {530--541}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.530}, doi = {10.4230/LIPICS.STACS.2014.530}, timestamp = {Fri, 30 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/LohreyZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/MarxP14, author = {D{\'{a}}niel Marx and Michal Pilipczuk}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask)}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {542--553}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.542}, doi = {10.4230/LIPICS.STACS.2014.542}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/MarxP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Miltersen14, author = {Peter Bro Miltersen}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Semi-algebraic geometry in computational game theory - a consumer's perspective (Invited Talk)}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {11--12}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.11}, doi = {10.4230/LIPICS.STACS.2014.11}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Miltersen14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/MitchellZ14, author = {John C. Mitchell and Joe Zimmerman}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Data-Oblivious Data Structures}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {554--565}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.554}, doi = {10.4230/LIPICS.STACS.2014.554}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/MitchellZ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Monin14, author = {Benoit Monin}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Higher randomness and forcing with closed sets}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {566--577}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.566}, doi = {10.4230/LIPICS.STACS.2014.566}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Monin14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/MustafaR14, author = {Nabil H. Mustafa and Saurabh Ray}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Near-Optimal Generalisations of a Theorem of Macbeath}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {578--589}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.578}, doi = {10.4230/LIPICS.STACS.2014.578}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/MustafaR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/NguyenS14, author = {Dung T. Nguyen and Alan L. Selman}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Non-autoreducible Sets for {NEXP}}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {590--601}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.590}, doi = {10.4230/LIPICS.STACS.2014.590}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/NguyenS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Nies14, author = {Andr{\'{e}} Nies}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Differentiability of polynomial time computable functions}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {602--613}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.602}, doi = {10.4230/LIPICS.STACS.2014.602}, timestamp = {Sat, 19 Oct 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Nies14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/PierrotR14, author = {Adeline Pierrot and Dominique Rossin}, editor = {Ernst W. Mayr and Natacha Portier}, title = {2-Stack Sorting is polynomial}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {614--626}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.614}, doi = {10.4230/LIPICS.STACS.2014.614}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/PierrotR14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/ScquizzatoS14, author = {Michele Scquizzato and Francesco Silvestri}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Communication Lower Bounds for Distributed-Memory Computations}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {627--638}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.627}, doi = {10.4230/LIPICS.STACS.2014.627}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/ScquizzatoS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Segoufin14, author = {Luc Segoufin}, editor = {Ernst W. Mayr and Natacha Portier}, title = {A glimpse on constant delay enumeration (Invited Talk)}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {13--27}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.13}, doi = {10.4230/LIPICS.STACS.2014.13}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Segoufin14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/SkutellaSU14, author = {Martin Skutella and Maxim Sviridenko and Marc Uetz}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Stochastic Scheduling on Unrelated Machines}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {639--650}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.639}, doi = {10.4230/LIPICS.STACS.2014.639}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/SkutellaSU14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Uppman14, author = {Hannes Uppman}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Computational Complexity of the Extended Minimum Cost Homomorphism Problem on Three-Element Domains}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {651--662}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.651}, doi = {10.4230/LIPICS.STACS.2014.651}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/Uppman14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/Watson14, author = {Thomas Watson}, editor = {Ernst W. Mayr and Natacha Portier}, title = {The Complexity of Deciding Statistical Properties of Samplable Distributions}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {663--674}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.663}, doi = {10.4230/LIPICS.STACS.2014.663}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/Watson14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/X14, editor = {Ernst W. Mayr and Natacha Portier}, title = {Frontmatter, Table of Contents, Preface, Conference Organization}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.i}, doi = {10.4230/LIPICS.STACS.2014.I}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/X14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/YamamotoIBIT14, author = {Jun{-}ichi Yamamoto and Tomohiro I and Hideo Bannai and Shunsuke Inenaga and Masayuki Takeda}, editor = {Ernst W. Mayr and Natacha Portier}, title = {Faster Compact On-Line Lempel-Ziv Factorization}, booktitle = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, pages = {675--686}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, url = {https://doi.org/10.4230/LIPIcs.STACS.2014.675}, doi = {10.4230/LIPICS.STACS.2014.675}, timestamp = {Sat, 30 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/YamamotoIBIT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/stacs/2014, editor = {Ernst W. Mayr and Natacha Portier}, title = {31st International Symposium on Theoretical Aspects of Computer Science {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France}, series = {LIPIcs}, volume = {25}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2014}, isbn = {978-3-939897-65-1}, timestamp = {Tue, 11 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/2014.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.