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/journals/mst/mst59.bht:"
download as .bib file
@article{DBLP:journals/mst/AlvarezSF16,
author = {Carme {\`{A}}lvarez and
Maria J. Serna and
Aleix Fern{\`{a}}ndez},
title = {Network Formation for Asymmetric Players and Bilateral Contracting},
journal = {Theory Comput. Syst.},
volume = {59},
number = {3},
pages = {397--415},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9640-6},
doi = {10.1007/S00224-015-9640-6},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AlvarezSF16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AnshelevichP16,
author = {Elliot Anshelevich and
John Postl},
title = {Profit Sharing with Thresholds and Non-monotone Player Utilities},
journal = {Theory Comput. Syst.},
volume = {59},
number = {4},
pages = {563--580},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9667-8},
doi = {10.1007/S00224-015-9667-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AnshelevichP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AnshelevichPW16,
author = {Elliot Anshelevich and
John Postl and
Tom Wexler},
title = {Assignment Games with Conflicts: Robust Price of Anarchy and Convergence
Results via Semi-Smoothness},
journal = {Theory Comput. Syst.},
volume = {59},
number = {3},
pages = {440--475},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9646-0},
doi = {10.1007/S00224-015-9646-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AnshelevichPW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AntunesBMST16,
author = {Luis Filipe Coelho Antunes and
Harry Buhrman and
Armando Matos and
Andr{\'{e}} Souto and
Andreia Teixeira},
title = {Distinguishing Two Probability Ensembles with One Sample from each
Ensemble},
journal = {Theory Comput. Syst.},
volume = {59},
number = {3},
pages = {517--531},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9661-1},
doi = {10.1007/S00224-015-9661-1},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AntunesBMST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AvgustinovichP16,
author = {Sergey V. Avgustinovich and
Svetlana Puzynina},
title = {Weak Abelian Periodicity of Infinite Words},
journal = {Theory Comput. Syst.},
volume = {59},
number = {2},
pages = {161--179},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9629-1},
doi = {10.1007/S00224-015-9629-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AvgustinovichP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Bollig16,
author = {Beate Bollig},
title = {On the Minimization of (Complete) Ordered Binary Decision Diagrams},
journal = {Theory Comput. Syst.},
volume = {59},
number = {3},
pages = {532--559},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9657-x},
doi = {10.1007/S00224-015-9657-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Bollig16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BravermanGPW16,
author = {Mark Braverman and
Ankit Garg and
Denis Pankratov and
Omri Weinstein},
title = {Information Lower Bounds via Self-Reducibility},
journal = {Theory Comput. Syst.},
volume = {59},
number = {2},
pages = {377--396},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9655-z},
doi = {10.1007/S00224-015-9655-Z},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BravermanGPW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BulatovK16,
author = {Andrei Bulatov and
Stephan Kreutzer},
title = {Preface},
journal = {Theory Comput. Syst.},
volume = {59},
number = {2},
pages = {159--160},
year = {2016},
url = {https://doi.org/10.1007/s00224-016-9696-y},
doi = {10.1007/S00224-016-9696-Y},
timestamp = {Tue, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BulatovK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CaragiannisV16,
author = {Ioannis Caragiannis and
Alexandros A. Voudouris},
title = {Welfare Guarantees for Proportional Allocations},
journal = {Theory Comput. Syst.},
volume = {59},
number = {4},
pages = {581--599},
year = {2016},
url = {https://doi.org/10.1007/s00224-016-9674-4},
doi = {10.1007/S00224-016-9674-4},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/CaragiannisV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CechlarovaEFMMM16,
author = {Katar{\'{\i}}na Cechl{\'{a}}rov{\'{a}} and
Pavlos Eirinakis and
Tam{\'{a}}s Fleiner and
Dimitrios Magos and
David F. Manlove and
Ioannis Mourtos and
Eva Ocel{\'{a}}kov{\'{a}} and
Baharak Rastegari},
title = {Pareto Optimal Matchings in Many-to-Many Markets with Ties},
journal = {Theory Comput. Syst.},
volume = {59},
number = {4},
pages = {700--721},
year = {2016},
url = {https://doi.org/10.1007/s00224-016-9677-1},
doi = {10.1007/S00224-016-9677-1},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CechlarovaEFMMM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChenDH16,
author = {Xujin Chen and
Zhuo Diao and
Xiaodong Hu},
title = {Network Characterizations for Excluding Braess's Paradox},
journal = {Theory Comput. Syst.},
volume = {59},
number = {4},
pages = {747--780},
year = {2016},
url = {https://doi.org/10.1007/s00224-016-9710-4},
doi = {10.1007/S00224-016-9710-4},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ChenDH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ChristodoulouST16,
author = {George Christodoulou and
Alkmini Sgouritsa and
Bo Tang},
title = {On the Efficiency of the Proportional Allocation Mechanism for Divisible
Resources},
journal = {Theory Comput. Syst.},
volume = {59},
number = {4},
pages = {600--618},
year = {2016},
url = {https://doi.org/10.1007/s00224-016-9701-5},
doi = {10.1007/S00224-016-9701-5},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ChristodoulouST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DevadasR16,
author = {Sheela Devadas and
Ronitt Rubinfeld},
title = {A Self-Tester for Linear Functions over the Integers with an Elementary
Proof of Correctness},
journal = {Theory Comput. Syst.},
volume = {59},
number = {1},
pages = {99--111},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9639-z},
doi = {10.1007/S00224-015-9639-Z},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DevadasR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Diaz0KMS16,
author = {Josep D{\'{\i}}az and
Ioannis Giotis and
Lefteris M. Kirousis and
Evangelos Markakis and
Maria J. Serna},
title = {On the Stability of Generalized Second Price Auctions with Budgets},
journal = {Theory Comput. Syst.},
volume = {59},
number = {1},
pages = {1--23},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9634-4},
doi = {10.1007/S00224-015-9634-4},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Diaz0KMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DiekertW16,
author = {Volker Diekert and
Armin Wei{\ss}},
title = {QuickHeapsort: Modifications and Improved Analysis},
journal = {Theory Comput. Syst.},
volume = {59},
number = {2},
pages = {209--230},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9656-y},
doi = {10.1007/S00224-015-9656-Y},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/DiekertW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/DrosteP16,
author = {Manfred Droste and
Vitaly Perevoshchikov},
title = {Multi-weighted Automata and {MSO} Logic},
journal = {Theory Comput. Syst.},
volume = {59},
number = {2},
pages = {231--261},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9658-9},
doi = {10.1007/S00224-015-9658-9},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/DrosteP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ElbassioniMR16,
author = {Khaled M. Elbassioni and
Kurt Mehlhorn and
Fahimeh Ramezani},
title = {Towards More Practical Linear Programming-based Techniques for Algorithmic
Mechanism Design},
journal = {Theory Comput. Syst.},
volume = {59},
number = {4},
pages = {641--663},
year = {2016},
url = {https://doi.org/10.1007/s00224-016-9704-2},
doi = {10.1007/S00224-016-9704-2},
timestamp = {Thu, 31 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/ElbassioniMR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FarczadiGK16,
author = {Linda Farczadi and
Konstantinos Georgiou and
Jochen K{\"{o}}nemann},
title = {Stable Marriage with General Preferences},
journal = {Theory Comput. Syst.},
volume = {59},
number = {4},
pages = {683--699},
year = {2016},
url = {https://doi.org/10.1007/s00224-016-9687-z},
doi = {10.1007/S00224-016-9687-Z},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FarczadiGK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FernauSV16,
author = {Henning Fernau and
Markus L. Schmid and
Yngve Villanger},
title = {On the Parameterised Complexity of String Morphism Problems},
journal = {Theory Comput. Syst.},
volume = {59},
number = {1},
pages = {24--51},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9635-3},
doi = {10.1007/S00224-015-9635-3},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/FernauSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FotakisTTZ16,
author = {Dimitris Fotakis and
Dimitris Tsipras and
Christos Tzamos and
Emmanouil Zampetakis},
title = {Efficient Money Burning in General Domains},
journal = {Theory Comput. Syst.},
volume = {59},
number = {4},
pages = {619--640},
year = {2016},
url = {https://doi.org/10.1007/s00224-016-9720-2},
doi = {10.1007/S00224-016-9720-2},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/FotakisTTZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GuptaKL16,
author = {Sushmita Gupta and
Shahin Kamali and
Alejandro L{\'{o}}pez{-}Ortiz},
title = {On the Advice Complexity of the k-server Problem Under Sparse Metrics},
journal = {Theory Comput. Syst.},
volume = {59},
number = {3},
pages = {476--499},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9649-x},
doi = {10.1007/S00224-015-9649-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GuptaKL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GuptaSS16,
author = {Manoj Gupta and
Yogish Sabharwal and
Sandeep Sen},
title = {The Update Complexity of Selection and Related Problems},
journal = {Theory Comput. Syst.},
volume = {59},
number = {1},
pages = {112--132},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9664-y},
doi = {10.1007/S00224-015-9664-Y},
timestamp = {Tue, 25 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GuptaSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GuruswamiL16,
author = {Venkatesan Guruswami and
Euiwoong Lee},
title = {Complexity of Approximating {CSP} with Balance / Hard Constraints},
journal = {Theory Comput. Syst.},
volume = {59},
number = {1},
pages = {76--98},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9638-0},
doi = {10.1007/S00224-015-9638-0},
timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GuruswamiL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HoeferL16,
author = {Martin Hoefer and
Ron Lavi},
title = {Preface to Special Issue on Algorithmic Game Theory},
journal = {Theory Comput. Syst.},
volume = {59},
number = {4},
pages = {561--562},
year = {2016},
url = {https://doi.org/10.1007/s00224-016-9721-1},
doi = {10.1007/S00224-016-9721-1},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/HoeferL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HubacekNU16,
author = {Pavel Hub{\'{a}}cek and
Moni Naor and
Jonathan R. Ullman},
title = {When Can Limited Randomness Be Used in Repeated Games?},
journal = {Theory Comput. Syst.},
volume = {59},
number = {4},
pages = {722--746},
year = {2016},
url = {https://doi.org/10.1007/s00224-016-9690-4},
doi = {10.1007/S00224-016-9690-4},
timestamp = {Tue, 27 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/HubacekNU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/JansenK16,
author = {Klaus Jansen and
Stefan Erich Julius Kraft},
title = {An Improved Approximation Scheme for Variable-Sized Bin Packing},
journal = {Theory Comput. Syst.},
volume = {59},
number = {2},
pages = {262--322},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9644-2},
doi = {10.1007/S00224-015-9644-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/JansenK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KovasznaiFB16,
author = {Gergely Kov{\'{a}}sznai and
Andreas Fr{\"{o}}hlich and
Armin Biere},
title = {Complexity of Fixed-Size Bit-Vector Logics},
journal = {Theory Comput. Syst.},
volume = {59},
number = {2},
pages = {323--376},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9653-1},
doi = {10.1007/S00224-015-9653-1},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KovasznaiFB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/KowalczykC16,
author = {Michael Kowalczyk and
Jin{-}Yi Cai},
title = {Holant Problems for 3-Regular Graphs with Complex Edge Functions},
journal = {Theory Comput. Syst.},
volume = {59},
number = {1},
pages = {133--158},
year = {2016},
url = {https://doi.org/10.1007/s00224-016-9671-7},
doi = {10.1007/S00224-016-9671-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/KowalczykC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/ManuelMP16,
author = {Amaldev Manuel and
Anca Muscholl and
Gabriele Puppis},
title = {Walking on Data Words},
journal = {Theory Comput. Syst.},
volume = {59},
number = {2},
pages = {180--208},
year = {2016},
url = {https://doi.org/10.1007/s00224-014-9603-3},
doi = {10.1007/S00224-014-9603-3},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/ManuelMP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Pauly16,
author = {Arno Pauly},
title = {The Computational Complexity of Iterated Elimination of Dominated
Strategies},
journal = {Theory Comput. Syst.},
volume = {59},
number = {1},
pages = {52--75},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9637-1},
doi = {10.1007/S00224-015-9637-1},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/Pauly16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Puente16,
author = {V{\'{\i}}ctor Lav{\'{\i}}n Puente},
title = {Learning Sets of Antecedent-restricted Functional and Multivalued
Dependencies with Queries},
journal = {Theory Comput. Syst.},
volume = {59},
number = {3},
pages = {500--516},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9659-8},
doi = {10.1007/S00224-015-9659-8},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Puente16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/StraubTW16,
author = {Simon Straub and
Thomas Thierauf and
Fabian Wagner},
title = {Counting the Number of Perfect Matchings in {K} 5-Free Graphs},
journal = {Theory Comput. Syst.},
volume = {59},
number = {3},
pages = {416--439},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9645-1},
doi = {10.1007/S00224-015-9645-1},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/StraubTW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/SundararajanT16,
author = {Mukund Sundararajan and
Inbal Talgam{-}Cohen},
title = {Prediction and Welfare in Ad Auctions},
journal = {Theory Comput. Syst.},
volume = {59},
number = {4},
pages = {664--682},
year = {2016},
url = {https://doi.org/10.1007/s00224-016-9679-z},
doi = {10.1007/S00224-016-9679-Z},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/SundararajanT16.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-27 05:14 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:
