Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Mihalis Yannakakis
@inproceedings{DBLP:conf/soda/ChenGVY24,
author = {Xi Chen and
Chenghao Guo and
Emmanouil V. Vlatakis{-}Gkaragkounis and
Mihalis Yannakakis},
editor = {David P. Woodruff},
title = {Smoothed Complexity of {SWAP} in Local Graph Partitioning},
booktitle = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
pages = {5057--5083},
publisher = {{SIAM}},
year = {2024},
url = {https://doi.org/10.1137/1.9781611977912.182},
doi = {10.1137/1.9781611977912.182},
timestamp = {Thu, 04 Apr 2024 19:38:10 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChenGVY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2403-19911,
author = {Xi Chen and
Yuhao Li and
Mihalis Yannakakis},
title = {Computing a Fixed Point of Contraction Maps in Polynomial Queries},
journal = {CoRR},
volume = {abs/2403.19911},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2403.19911},
doi = {10.48550/ARXIV.2403.19911},
eprinttype = {arXiv},
eprint = {2403.19911},
timestamp = {Wed, 10 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2403-19911.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/00010Y24,
author = {Xi Chen and
Yuhao Li and
Mihalis Yannakakis},
title = {Computing a Fixed Point of Contraction Maps in Polynomial Queries},
journal = {Electron. Colloquium Comput. Complex.},
pages = {TR24--057},
year = {2024},
url = {https://eccc.weizmann.ac.il/report/2024/057},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/00010Y24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/0001LY23,
author = {Xi Chen and
Yuhao Li and
Mihalis Yannakakis},
editor = {Amnon Ta{-}Shma},
title = {Reducing Tarski to Unique Tarski (In the Black-Box Model)},
booktitle = {38th Computational Complexity Conference, {CCC} 2023, July 17-20,
2023, Warwick, {UK}},
series = {LIPIcs},
volume = {264},
pages = {21:1--21:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.21},
doi = {10.4230/LIPICS.CCC.2023.21},
timestamp = {Wed, 04 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/0001LY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/PasarkarPY23,
author = {Amol Pasarkar and
Christos H. Papadimitriou and
Mihalis Yannakakis},
editor = {Yael Tauman Kalai},
title = {Extremal Combinatorics, Iterated Pigeonhole Arguments and Generalizations
of {PPP}},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {88:1--88:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.88},
doi = {10.4230/LIPICS.ITCS.2023.88},
timestamp = {Thu, 02 Feb 2023 12:50:42 +0100},
biburl = {https://dblp.org/rec/conf/innovations/PasarkarPY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChristY23,
author = {Miranda Christ and
Mihalis Yannakakis},
editor = {Barna Saha and
Rocco A. Servedio},
title = {The Smoothed Complexity of Policy Iteration for Markov Decision Processes},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1890--1903},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585220},
doi = {10.1145/3564246.3585220},
timestamp = {Mon, 22 May 2023 13:01:48 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChristY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-15804,
author = {Xi Chen and
Chenghao Guo and
Emmanouil V. Vlatakis{-}Gkaragkounis and
Mihalis Yannakakis},
title = {Smoothed Complexity of {SWAP} in Local Graph Partitioning},
journal = {CoRR},
volume = {abs/2305.15804},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.15804},
doi = {10.48550/ARXIV.2305.15804},
eprinttype = {arXiv},
eprint = {2305.15804},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-15804.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChenLY23,
author = {Xi Chen and
Yuhao Li and
Mihalis Yannakakis},
title = {Reducing Tarski to Unique Tarski (in the Black-box Model)},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-073}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/073},
eprinttype = {ECCC},
eprint = {TR23-073},
timestamp = {Wed, 04 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChenLY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/ChenDOPSY22,
author = {Xi Chen and
Ilias Diakonikolas and
Anthi Orfanou and
Dimitris Paparas and
Xiaorui Sun and
Mihalis Yannakakis},
title = {On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms
for a Unit-Demand Buyer},
journal = {{SIAM} J. Comput.},
volume = {51},
number = {3},
pages = {492--548},
year = {2022},
url = {https://doi.org/10.1137/17m1136481},
doi = {10.1137/17M1136481},
timestamp = {Mon, 27 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/ChenDOPSY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigmod/Yannakakis22,
author = {Mihalis Yannakakis},
title = {Technical Perspective: Structure and Complexity of Bag Consistency},
journal = {{SIGMOD} Rec.},
volume = {51},
number = {1},
pages = {77},
year = {2022},
url = {https://doi.org/10.1145/3542700.3542718},
doi = {10.1145/3542700.3542718},
timestamp = {Fri, 08 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigmod/Yannakakis22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChenCPY22,
author = {Thomas Chen and
Xi Chen and
Binghui Peng and
Mihalis Yannakakis},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Computational Hardness of the Hylland-Zeckhauser Scheme},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {2253--2268},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.90},
doi = {10.1137/1.9781611977073.90},
timestamp = {Thu, 13 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/ChenCPY22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-13217,
author = {Daniel Mitropolsky and
Adiba Ejaz and
Mirah Shi and
Mihalis Yannakakis and
Christos H. Papadimitriou},
title = {Center-Embedding and Constituency in the Brain and a New Characterization
of Context-Free Languages},
journal = {CoRR},
volume = {abs/2206.13217},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.13217},
doi = {10.48550/ARXIV.2206.13217},
eprinttype = {arXiv},
eprint = {2206.13217},
timestamp = {Mon, 04 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-13217.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2209-07625,
author = {Amol Pasarkar and
Mihalis Yannakakis and
Christos H. Papadimitriou},
title = {Extremal combinatorics, iterated pigeonhole arguments, and generalizations
of {PPP}},
journal = {CoRR},
volume = {abs/2209.07625},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2209.07625},
doi = {10.48550/ARXIV.2209.07625},
eprinttype = {arXiv},
eprint = {2209.07625},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2209-07625.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2212-00083,
author = {Miranda Christ and
Mihalis Yannakakis},
title = {The Smoothed Complexity of Policy Iteration for Markov Decision Processes},
journal = {CoRR},
volume = {abs/2212.00083},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2212.00083},
doi = {10.48550/ARXIV.2212.00083},
eprinttype = {arXiv},
eprint = {2212.00083},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2212-00083.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icccn/WangSAKQY21,
author = {Huazhe Wang and
Puneet Sharma and
Faraz Ahmed and
Joon{-}Myung Kang and
Chen Qian and
Mihalis Yannakakis},
title = {Epinoia: Intent Checker for Stateful Networks},
booktitle = {30th International Conference on Computer Communications and Networks,
{ICCCN} 2021, Athens, Greece, July 19-22, 2021},
pages = {1--9},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/ICCCN52240.2021.9522299},
doi = {10.1109/ICCCN52240.2021.9522299},
timestamp = {Wed, 22 Sep 2021 16:08:30 +0200},
biburl = {https://dblp.org/rec/conf/icccn/WangSAKQY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/VaziraniY21,
author = {Vijay V. Vazirani and
Mihalis Yannakakis},
editor = {James R. Lee},
title = {Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided
Matching Markets},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {59:1--59:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.59},
doi = {10.4230/LIPICS.ITCS.2021.59},
timestamp = {Thu, 04 Feb 2021 10:38:38 +0100},
biburl = {https://dblp.org/rec/conf/innovations/VaziraniY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/PapadimitriouVY21,
author = {Christos Harilaos Papadimitriou and
Kiran Vodrahalli and
Mihalis Yannakakis},
editor = {Michal Feldman and
Hu Fu and
Inbal Talgam{-}Cohen},
title = {The Platform Design Problem},
booktitle = {Web and Internet Economics - 17th International Conference, {WINE}
2021, Potsdam, Germany, December 14-17, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13112},
pages = {317--333},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-94676-0\_18},
doi = {10.1007/978-3-030-94676-0\_18},
timestamp = {Mon, 30 Oct 2023 12:09:00 +0100},
biburl = {https://dblp.org/rec/conf/wine/PapadimitriouVY21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-05746,
author = {Thomas Chen and
Xi Chen and
Binghui Peng and
Mihalis Yannakakis},
title = {Computational Hardness of the Hylland-Zeckhauser Scheme},
journal = {CoRR},
volume = {abs/2107.05746},
year = {2021},
url = {https://arxiv.org/abs/2107.05746},
eprinttype = {arXiv},
eprint = {2107.05746},
timestamp = {Thu, 13 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-05746.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/Yannakakis20,
author = {Mihalis Yannakakis},
title = {Planar graphs that need four pages},
journal = {J. Comb. Theory, Ser. {B}},
volume = {145},
pages = {241--263},
year = {2020},
url = {https://doi.org/10.1016/j.jctb.2020.05.008},
doi = {10.1016/J.JCTB.2020.05.008},
timestamp = {Thu, 01 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jctb/Yannakakis20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/EtessamiSY20,
author = {Kousha Etessami and
Alistair Stewart and
Mihalis Yannakakis},
title = {Polynomial Time Algorithms for Branching Markov Decision Processes
and Probabilistic Min(Max) Polynomial Bellman Equations},
journal = {Math. Oper. Res.},
volume = {45},
number = {1},
pages = {34--62},
year = {2020},
url = {https://doi.org/10.1287/moor.2018.0970},
doi = {10.1287/MOOR.2018.0970},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/EtessamiSY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/SoltanYZ20,
author = {Saleh Soltan and
Mihalis Yannakakis and
Gil Zussman},
title = {Doubly Balanced Connected Graph Partitioning},
journal = {{ACM} Trans. Algorithms},
volume = {16},
number = {2},
pages = {20:1--20:24},
year = {2020},
url = {https://doi.org/10.1145/3381419},
doi = {10.1145/3381419},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/SoltanYZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/TootaghajASY20,
author = {Diman Zad Tootaghaj and
Faraz Ahmed and
Puneet Sharma and
Mihalis Yannakakis},
title = {Homa: An Efficient Topology and Route Management Approach in {SD-WAN}
Overlays},
booktitle = {39th {IEEE} Conference on Computer Communications, {INFOCOM} 2020,
Toronto, ON, Canada, July 6-9, 2020},
pages = {2351--2360},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/INFOCOM41043.2020.9155503},
doi = {10.1109/INFOCOM41043.2020.9155503},
timestamp = {Mon, 10 Aug 2020 16:29:29 +0200},
biburl = {https://dblp.org/rec/conf/infocom/TootaghajASY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/EtessamiPRY20,
author = {Kousha Etessami and
Christos H. Papadimitriou and
Aviad Rubinstein and
Mihalis Yannakakis},
editor = {Thomas Vidick},
title = {Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria},
booktitle = {11th Innovations in Theoretical Computer Science Conference, {ITCS}
2020, January 12-14, 2020, Seattle, Washington, {USA}},
series = {LIPIcs},
volume = {151},
pages = {18:1--18:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2020.18},
doi = {10.4230/LIPICS.ITCS.2020.18},
timestamp = {Mon, 06 Jan 2020 16:50:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/EtessamiPRY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenGVYZ20,
author = {Xi Chen and
Chenghao Guo and
Emmanouil V. Vlatakis{-}Gkaragkounis and
Mihalis Yannakakis and
Xinzhi Zhang},
editor = {Konstantin Makarychev and
Yury Makarychev and
Madhur Tulsiani and
Gautam Kamath and
Julia Chuzhoy},
title = {Smoothed complexity of local max-cut and binary max-CSP},
booktitle = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
pages = {1052--1065},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3357713.3384325},
doi = {10.1145/3357713.3384325},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenGVYZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-01348,
author = {Vijay V. Vazirani and
Mihalis Yannakakis},
title = {Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided
Matching Markets},
journal = {CoRR},
volume = {abs/2004.01348},
year = {2020},
url = {https://arxiv.org/abs/2004.01348},
eprinttype = {arXiv},
eprint = {2004.01348},
timestamp = {Wed, 08 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-01348.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-14111,
author = {Mihalis Yannakakis},
title = {Planar Graphs that Need Four Pages},
journal = {CoRR},
volume = {abs/2005.14111},
year = {2020},
url = {https://arxiv.org/abs/2005.14111},
eprinttype = {arXiv},
eprint = {2005.14111},
timestamp = {Wed, 03 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-14111.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-06117,
author = {Christos H. Papadimitriou and
Kiran Vodrahalli and
Mihalis Yannakakis},
title = {The Platform Design Problem},
journal = {CoRR},
volume = {abs/2009.06117},
year = {2020},
url = {https://arxiv.org/abs/2009.06117},
eprinttype = {arXiv},
eprint = {2009.06117},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-06117.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EtessamiWY19,
author = {Kousha Etessami and
Dominik Wojtczak and
Mihalis Yannakakis},
title = {Recursive stochastic games with positive rewards},
journal = {Theor. Comput. Sci.},
volume = {777},
pages = {308--328},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2018.12.018},
doi = {10.1016/J.TCS.2018.12.018},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/EtessamiWY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tnse/SoltanYZ19,
author = {Saleh Soltan and
Mihalis Yannakakis and
Gil Zussman},
title = {{REACT} to Cyber Attacks on Power Grids},
journal = {{IEEE} Trans. Netw. Sci. Eng.},
volume = {6},
number = {3},
pages = {459--473},
year = {2019},
url = {https://doi.org/10.1109/TNSE.2018.2837894},
doi = {10.1109/TNSE.2018.2837894},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tnse/SoltanYZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/KolisettyLVY19,
author = {Sanjana Kolisetty and
Linh Le and
Ilya Volkovich and
Mihalis Yannakakis},
editor = {Arkadev Chattopadhyay and
Paul Gastin},
title = {The Complexity of Finding S-Factors in Regular Graphs},
booktitle = {39th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2019, December 11-13, 2019,
Bombay, India},
series = {LIPIcs},
volume = {150},
pages = {21:1--21:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2019.21},
doi = {10.4230/LIPICS.FSTTCS.2019.21},
timestamp = {Thu, 05 Dec 2019 15:12:21 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/KolisettyLVY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Yannakakis19,
author = {Mihalis Yannakakis},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Fixed Point Computation Problems and Facets of Complexity (Invited
Talk)},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {5:1--5:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.5},
doi = {10.4230/LIPICS.ICALP.2019.5},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Yannakakis19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EtessamiMSY19,
author = {Kousha Etessami and
Emanuel Martinov and
Alistair Stewart and
Mihalis Yannakakis},
editor = {Christel Baier and
Ioannis Chatzigiannakis and
Paola Flocchini and
Stefano Leonardi},
title = {Reachability for Branching Concurrent Stochastic Games},
booktitle = {46th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2019, July 9-12, 2019, Patras, Greece},
series = {LIPIcs},
volume = {132},
pages = {115:1--115:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2019.115},
doi = {10.4230/LIPICS.ICALP.2019.115},
timestamp = {Mon, 08 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/EtessamiMSY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nsdi/MoonHYBBSWYZ19,
author = {Soo{-}Jin Moon and
Jeffrey Helt and
Yifei Yuan and
Yves Bieri and
Sujata Banerjee and
Vyas Sekar and
Wenfei Wu and
Mihalis Yannakakis and
Ying Zhang},
editor = {Jay R. Lorch and
Minlan Yu},
title = {Alembic: Automated Model Inference for Stateful Network Functions},
booktitle = {16th {USENIX} Symposium on Networked Systems Design and Implementation,
{NSDI} 2019, Boston, MA, February 26-28, 2019},
pages = {699--718},
publisher = {{USENIX} Association},
year = {2019},
url = {https://www.usenix.org/conference/nsdi19/presentation/moon},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/nsdi/MoonHYBBSWYZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-03210,
author = {Kousha Etessami and
Christos H. Papadimitriou and
Aviad Rubinstein and
Mihalis Yannakakis},
title = {Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria},
journal = {CoRR},
volume = {abs/1909.03210},
year = {2019},
url = {http://arxiv.org/abs/1909.03210},
eprinttype = {arXiv},
eprint = {1909.03210},
timestamp = {Wed, 18 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-03210.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-10381,
author = {Xi Chen and
Chenghao Guo and
Emmanouil V. Vlatakis{-}Gkaragkounis and
Mihalis Yannakakis and
Xinzhi Zhang},
title = {Smoothed complexity of local Max-Cut and binary Max-CSP},
journal = {CoRR},
volume = {abs/1911.10381},
year = {2019},
url = {http://arxiv.org/abs/1911.10381},
eprinttype = {arXiv},
eprint = {1911.10381},
timestamp = {Thu, 04 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-10381.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/KolisettyLVY19,
author = {Sanjana Kolisetty and
Linh Le and
Ilya Volkovich and
Mihalis Yannakakis},
title = {The Complexity of Finding \emph{S}-factors in Regular Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-040}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/040},
eprinttype = {ECCC},
eprint = {TR19-040},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/KolisettyLVY19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/geb/ChenDPSY18,
author = {Xi Chen and
Ilias Diakonikolas and
Dimitris Paparas and
Xiaorui Sun and
Mihalis Yannakakis},
title = {The complexity of optimal multidimensional pricing for a unit-demand
buyer},
journal = {Games Econ. Behav.},
volume = {110},
pages = {139--164},
year = {2018},
url = {https://doi.org/10.1016/j.geb.2018.03.016},
doi = {10.1016/J.GEB.2018.03.016},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/geb/ChenDPSY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/EtessamiSY18,
author = {Kousha Etessami and
Alistair Stewart and
Mihalis Yannakakis},
title = {Greatest fixed points of probabilistic min/max polynomial equations,
and reachability for branching Markov decision processes},
journal = {Inf. Comput.},
volume = {261},
pages = {355--382},
year = {2018},
url = {https://doi.org/10.1016/j.ic.2018.02.013},
doi = {10.1016/J.IC.2018.02.013},
timestamp = {Tue, 03 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/EtessamiSY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigmetrics/SoltanYZ18,
author = {Saleh Soltan and
Mihalis Yannakakis and
Gil Zussman},
title = {{REACT} to Cyber-Physical Attacks on Power grids (Extended Abstract)},
journal = {{SIGMETRICS} Perform. Evaluation Rev.},
volume = {46},
number = {2},
pages = {50--51},
year = {2018},
url = {https://doi.org/10.1145/3305218.3305238},
doi = {10.1145/3305218.3305238},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigmetrics/SoltanYZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcns/SoltanYZ18,
author = {Saleh Soltan and
Mihalis Yannakakis and
Gil Zussman},
title = {Power Grid State Estimation Following a Joint Cyber and Physical Attack},
journal = {{IEEE} Trans. Control. Netw. Syst.},
volume = {5},
number = {1},
pages = {499--512},
year = {2018},
url = {https://doi.org/10.1109/TCNS.2016.2620807},
doi = {10.1109/TCNS.2016.2620807},
timestamp = {Thu, 09 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcns/SoltanYZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/rss/Haas-HegerPYIC18,
author = {Maximilian Haas{-}Heger and
Christos H. Papadimitriou and
Mihalis Yannakakis and
Garud Iyengar and
Matei T. Ciocarlie},
editor = {Hadas Kress{-}Gazit and
Siddhartha S. Srinivasa and
Tom Howard and
Nikolay Atanasov},
title = {Passive Static Equilibrium with Frictional Contacts and Application
to Grasp Stability Analysis},
booktitle = {Robotics: Science and Systems XIV, Carnegie Mellon University, Pittsburgh,
Pennsylvania, USA, June 26-30, 2018},
year = {2018},
url = {http://www.roboticsproceedings.org/rss14/p64.html},
doi = {10.15607/RSS.2018.XIV.064},
timestamp = {Fri, 04 Aug 2023 08:25:46 +0200},
biburl = {https://dblp.org/rec/conf/rss/Haas-HegerPYIC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChenMPY18,
author = {Xi Chen and
George Matikas and
Dimitris Paparas and
Mihalis Yannakakis},
editor = {Artur Czumaj},
title = {On the Complexity of Simple and Optimal Deterministic Mechanisms for
an Additive Buyer},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {2036--2049},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.133},
doi = {10.1137/1.9781611975031.133},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChenMPY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-01384,
author = {Maximilian Haas{-}Heger and
Christos H. Papadimitriou and
Mihalis Yannakakis and
Garud Iyengar and
Matei T. Ciocarlie},
title = {Passive Static Equilibrium with Frictional Contacts and Application
to Grasp Stability Analysis},
journal = {CoRR},
volume = {abs/1806.01384},
year = {2018},
url = {http://arxiv.org/abs/1806.01384},
eprinttype = {arXiv},
eprint = {1806.01384},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-01384.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-03907,
author = {Kousha Etessami and
Emanuel Martinov and
Alistair Stewart and
Mihalis Yannakakis},
title = {Reachability for Branching Concurrent Stochastic Games},
journal = {CoRR},
volume = {abs/1806.03907},
year = {2018},
url = {http://arxiv.org/abs/1806.03907},
eprinttype = {arXiv},
eprint = {1806.03907},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-03907.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ChenPY17,
author = {Xi Chen and
Dimitris Paparas and
Mihalis Yannakakis},
title = {The Complexity of Non-Monotone Markets},
journal = {J. {ACM}},
volume = {64},
number = {3},
pages = {20:1--20:56},
year = {2017},
url = {https://doi.org/10.1145/3064810},
doi = {10.1145/3064810},
timestamp = {Wed, 19 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/ChenPY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EtessamiSY17,
author = {Kousha Etessami and
Alistair Stewart and
Mihalis Yannakakis},
title = {A Polynomial Time Algorithm for Computing Extinction Probabilities
of Multitype Branching Processes},
journal = {{SIAM} J. Comput.},
volume = {46},
number = {5},
pages = {1515--1553},
year = {2017},
url = {https://doi.org/10.1137/16M105678X},
doi = {10.1137/16M105678X},
timestamp = {Mon, 20 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/EtessamiSY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/SoltanYZ17,
author = {Saleh Soltan and
Mihalis Yannakakis and
Gil Zussman},
editor = {Philip N. Klein},
title = {Doubly Balanced Connected Graph Partitioning},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {1939--1950},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.126},
doi = {10.1137/1.9781611974782.126},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/SoltanYZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChenMPY17,
author = {Xi Chen and
George Matikas and
Dimitris Paparas and
Mihalis Yannakakis},
title = {On the Complexity of Bundle-Pricing and Simple Mechanisms},
journal = {CoRR},
volume = {abs/1702.07032},
year = {2017},
url = {http://arxiv.org/abs/1702.07032},
eprinttype = {arXiv},
eprint = {1702.07032},
timestamp = {Wed, 19 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChenMPY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-06934,
author = {Saleh Soltan and
Mihalis Yannakakis and
Gil Zussman},
title = {{REACT} to Cyber Attacks on Power Grids},
journal = {CoRR},
volume = {abs/1709.06934},
year = {2017},
url = {http://arxiv.org/abs/1709.06934},
eprinttype = {arXiv},
eprint = {1709.06934},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-06934.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DaskalakisDY16,
author = {Constantinos Daskalakis and
Ilias Diakonikolas and
Mihalis Yannakakis},
title = {How Good is the Chord Algorithm?},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {3},
pages = {811--858},
year = {2016},
url = {https://doi.org/10.1137/13093875X},
doi = {10.1137/13093875X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DaskalakisDY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/SoltanYZ16,
author = {Saleh Soltan and
Mihalis Yannakakis and
Gil Zussman},
title = {Doubly Balanced Connected Graph Partitioning},
journal = {CoRR},
volume = {abs/1607.06509},
year = {2016},
url = {http://arxiv.org/abs/1607.06509},
eprinttype = {arXiv},
eprint = {1607.06509},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/SoltanYZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EtessamiY15,
author = {Kousha Etessami and
Mihalis Yannakakis},
title = {Recursive Markov Decision Processes and Recursive Stochastic Games},
journal = {J. {ACM}},
volume = {62},
number = {2},
pages = {11:1--11:69},
year = {2015},
url = {https://doi.org/10.1145/2699431},
doi = {10.1145/2699431},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EtessamiY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/StewartEY15,
author = {Alistair Stewart and
Kousha Etessami and
Mihalis Yannakakis},
title = {Upper Bounds for Newton's Method on Monotone Polynomial Systems, and
P-Time Model Checking of Probabilistic One-Counter Automata},
journal = {J. {ACM}},
volume = {62},
number = {4},
pages = {30:1--30:33},
year = {2015},
url = {https://doi.org/10.1145/2789208},
doi = {10.1145/2789208},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/StewartEY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChenDOPSY15,
author = {Xi Chen and
Ilias Diakonikolas and
Anthi Orfanou and
Dimitris Paparas and
Xiaorui Sun and
Mihalis Yannakakis},
editor = {Venkatesan Guruswami},
title = {On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1464--1479},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.93},
doi = {10.1109/FOCS.2015.93},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChenDOPSY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EtessamiSY15,
author = {Kousha Etessami and
Alistair Stewart and
Mihalis Yannakakis},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations,
and Reachability for Branching Markov Decision Processes},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9135},
pages = {184--196},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47666-6\_15},
doi = {10.1007/978-3-662-47666-6\_15},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/EtessamiSY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigmetrics/SoltanYZ15,
author = {Saleh Soltan and
Mihalis Yannakakis and
Gil Zussman},
editor = {Bill Lin and
Jun (Jim) Xu and
Sudipta Sengupta and
Devavrat Shah},
title = {Joint Cyber and Physical Attacks on Power Grids: Graph Theoretical
Approaches for Information Recovery},
booktitle = {Proceedings of the 2015 {ACM} {SIGMETRICS} International Conference
on Measurement and Modeling of Computer Systems, Portland, OR, USA,
June 15-19, 2015},
pages = {361--374},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2745844.2745846},
doi = {10.1145/2745844.2745846},
timestamp = {Mon, 01 Aug 2022 08:51:52 +0200},
biburl = {https://dblp.org/rec/conf/sigmetrics/SoltanYZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EtessamiSY15,
author = {Kousha Etessami and
Alistair Stewart and
Mihalis Yannakakis},
title = {Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations,
and Reachability for Branching Markov Decision Processes},
journal = {CoRR},
volume = {abs/1502.05533},
year = {2015},
url = {http://arxiv.org/abs/1502.05533},
eprinttype = {arXiv},
eprint = {1502.05533},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EtessamiSY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/EtessamiSY14,
author = {Kousha Etessami and
Alistair Stewart and
Mihalis Yannakakis},
title = {A Note on the Complexity of Comparing Succinctly Represented Integers,
with an Application to Maximum Probability Parsing},
journal = {{ACM} Trans. Comput. Theory},
volume = {6},
number = {2},
pages = {9:1--9:23},
year = {2014},
url = {https://doi.org/10.1145/2601327},
doi = {10.1145/2601327},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/EtessamiSY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/ChenDPSY14,
author = {Xi Chen and
Ilias Diakonikolas and
Dimitris Paparas and
Xiaorui Sun and
Mihalis Yannakakis},
editor = {Chandra Chekuri},
title = {The Complexity of Optimal Multidimensional Pricing},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
pages = {1319--1328},
publisher = {{SIAM}},
year = {2014},
url = {https://doi.org/10.1137/1.9781611973402.97},
doi = {10.1137/1.9781611973402.97},
timestamp = {Tue, 02 Feb 2021 17:07:40 +0100},
biburl = {https://dblp.org/rec/conf/soda/ChenDPSY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/StewartEY13,
author = {Alistair Stewart and
Kousha Etessami and
Mihalis Yannakakis},
editor = {Natasha Sharygina and
Helmut Veith},
title = {Upper Bounds for Newton's Method on Monotone Polynomial Systems, and
P-Time Model Checking of Probabilistic One-Counter Automata},
booktitle = {Computer Aided Verification - 25th International Conference, {CAV}
2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8044},
pages = {495--510},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39799-8\_33},
doi = {10.1007/978-3-642-39799-8\_33},
timestamp = {Wed, 07 Dec 2022 23:12:58 +0100},
biburl = {https://dblp.org/rec/conf/cav/StewartEY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EtessamiSY13,
author = {Kousha Etessami and
Alistair Stewart and
Mihalis Yannakakis},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Stochastic Context-Free Grammars, Regular Languages, and Newton's
Method},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {7966},
pages = {199--211},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39212-2\_20},
doi = {10.1007/978-3-642-39212-2\_20},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/EtessamiSY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChenPY13,
author = {Xi Chen and
Dimitris Paparas and
Mihalis Yannakakis},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {The complexity of non-monotone markets},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {181--190},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488632},
doi = {10.1145/2488608.2488632},
timestamp = {Wed, 19 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/ChenPY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tacas/GodefroidY13,
author = {Patrice Godefroid and
Mihalis Yannakakis},
editor = {Nir Piterman and
Scott A. Smolka},
title = {Analysis of Boolean Programs},
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems
- 19th International Conference, {TACAS} 2013, Held as Part of the
European Joint Conferences on Theory and Practice of Software, {ETAPS}
2013, Rome, Italy, March 16-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7795},
pages = {214--229},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-36742-7\_16},
doi = {10.1007/978-3-642-36742-7\_16},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/tacas/GodefroidY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-3741,
author = {Alistair Stewart and
Kousha Etessami and
Mihalis Yannakakis},
title = {Upper bounds for Newton's method on monotone polynomial systems, and
P-time model checking of probabilistic one-counter automata},
journal = {CoRR},
volume = {abs/1302.3741},
year = {2013},
url = {http://arxiv.org/abs/1302.3741},
eprinttype = {arXiv},
eprint = {1302.3741},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-3741.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1302-6411,
author = {Kousha Etessami and
Alistair Stewart and
Mihalis Yannakakis},
title = {Stochastic Context-Free Grammars, Regular Languages, and Newton's
Method},
journal = {CoRR},
volume = {abs/1302.6411},
year = {2013},
url = {http://arxiv.org/abs/1302.6411},
eprinttype = {arXiv},
eprint = {1302.6411},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1302-6411.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-5429,
author = {Kousha Etessami and
Alistair Stewart and
Mihalis Yannakakis},
title = {A note on the complexity of comparing succinctly represented integers,
with an application to maximum probability parsing},
journal = {CoRR},
volume = {abs/1304.5429},
year = {2013},
url = {http://arxiv.org/abs/1304.5429},
eprinttype = {arXiv},
eprint = {1304.5429},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-5429.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DaskalakisDY13,
author = {Constantinos Daskalakis and
Ilias Diakonikolas and
Mihalis Yannakakis},
title = {How good is the Chord algorithm?},
journal = {CoRR},
volume = {abs/1309.7084},
year = {2013},
url = {http://arxiv.org/abs/1309.7084},
eprinttype = {arXiv},
eprint = {1309.7084},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DaskalakisDY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChenDPSY13,
author = {Xi Chen and
Ilias Diakonikolas and
Dimitris Paparas and
Xiaorui Sun and
Mihalis Yannakakis},
title = {The Complexity of Optimal Multidimensional Pricing},
journal = {CoRR},
volume = {abs/1311.2138},
year = {2013},
url = {http://arxiv.org/abs/1311.2138},
eprinttype = {arXiv},
eprint = {1311.2138},
timestamp = {Wed, 19 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChenDPSY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/EtessamiSY13,
author = {Kousha Etessami and
Alistair Stewart and
Mihalis Yannakakis},
title = {A note on the complexity of comparing succinctly represented integers,
with an application to maximum probability parsing},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-069}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/069},
eprinttype = {ECCC},
eprint = {TR13-069},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/EtessamiSY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/EtessamiY12,
author = {Kousha Etessami and
Mihalis Yannakakis},
title = {Model Checking of Recursive Probabilistic Systems},
journal = {{ACM} Trans. Comput. Log.},
volume = {13},
number = {2},
pages = {12:1--12:40},
year = {2012},
url = {https://doi.org/10.1145/2159531.2159534},
doi = {10.1145/2159531.2159534},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/EtessamiY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EtessamiSY12,
author = {Kousha Etessami and
Alistair Stewart and
Mihalis Yannakakis},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Polynomial Time Algorithms for Branching Markov Decision Processes
and Probabilistic Min(Max) Polynomial Bellman Equations},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {314--326},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_27},
doi = {10.1007/978-3-642-31594-7\_27},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/EtessamiSY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Yannakakis12,
author = {Mihalis Yannakakis},
editor = {Branislav Rovan and
Vladimiro Sassone and
Peter Widmayer},
title = {Computation of Least Fixed Points},
booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International
Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7464},
pages = {63},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32589-2\_8},
doi = {10.1007/978-3-642-32589-2\_8},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Yannakakis12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/EtessamiSY12,
author = {Kousha Etessami and
Alistair Stewart and
Mihalis Yannakakis},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {Polynomial time algorithms for multi-type branching processesand stochastic
context-free grammars},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {579--588},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2214030},
doi = {10.1145/2213977.2214030},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/EtessamiSY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-2374,
author = {Kousha Etessami and
Alistair Stewart and
Mihalis Yannakakis},
title = {Polynomial Time Algorithms for Multi-Type Branching Processes and
Stochastic Context-Free Grammars},
journal = {CoRR},
volume = {abs/1201.2374},
year = {2012},
url = {http://arxiv.org/abs/1201.2374},
eprinttype = {arXiv},
eprint = {1201.2374},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-2374.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-4798,
author = {Kousha Etessami and
Alistair Stewart and
Mihalis Yannakakis},
title = {Polynomial Time Algorithms for Branching Markov Decision Processes
and Probabilistic Min(Max) Polynomial Bellman Equations},
journal = {CoRR},
volume = {abs/1202.4798},
year = {2012},
url = {http://arxiv.org/abs/1202.4798},
eprinttype = {arXiv},
eprint = {1202.4798},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-4798.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-4918,
author = {Xi Chen and
Dimitris Paparas and
Mihalis Yannakakis},
title = {The Complexity of Non-Monotone Markets},
journal = {CoRR},
volume = {abs/1211.4918},
year = {2012},
url = {http://arxiv.org/abs/1211.4918},
eprinttype = {arXiv},
eprint = {1211.4918},
timestamp = {Wed, 19 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-4918.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/VaziraniY11,
author = {Vijay V. Vazirani and
Mihalis Yannakakis},
title = {Market equilibrium under separable, piecewise-linear, concave utilities},
journal = {J. {ACM}},
volume = {58},
number = {3},
pages = {10:1--10:25},
year = {2011},
url = {https://doi.org/10.1145/1970392.1970394},
doi = {10.1145/1970392.1970394},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/VaziraniY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KupfermanLVY11,
author = {Orna Kupferman and
Yoad Lustig and
Moshe Y. Vardi and
Mihalis Yannakakis},
editor = {Thomas Schwentick and
Christoph D{\"{u}}rr},
title = {Temporal Synthesis for Bounded Systems and Environments},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2011, March 10-12, 2011, Dortmund, Germany},
series = {LIPIcs},
volume = {9},
pages = {615--626},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.STACS.2011.615},
doi = {10.4230/LIPICS.STACS.2011.615},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KupfermanLVY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pe/EtessamiWY10,
author = {Kousha Etessami and
Dominik Wojtczak and
Mihalis Yannakakis},
title = {Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter
Automata, and Pushdown Systems},
journal = {Perform. Evaluation},
volume = {67},
number = {9},
pages = {837--857},
year = {2010},
url = {https://doi.org/10.1016/j.peva.2009.12.009},
doi = {10.1016/J.PEVA.2009.12.009},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pe/EtessamiWY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pnas/PapadimitriouY10,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {An impossibility theorem for price-adjustment mechanisms},
journal = {Proc. Natl. Acad. Sci. {USA}},
volume = {107},
number = {5},
pages = {1854--1859},
year = {2010},
url = {https://doi.org/10.1073/pnas.0914728107},
doi = {10.1073/PNAS.0914728107},
timestamp = {Thu, 16 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pnas/PapadimitriouY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EtessamiY10,
author = {Kousha Etessami and
Mihalis Yannakakis},
title = {On the Complexity of Nash Equilibria and Other Fixed Points},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {6},
pages = {2531--2597},
year = {2010},
url = {https://doi.org/10.1137/080720826},
doi = {10.1137/080720826},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/EtessamiY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/VaziraniY10,
author = {Vijay V. Vazirani and
Mihalis Yannakakis},
editor = {Andrew Chi{-}Chih Yao},
title = {Market Equilibrium under Separable, Piecewise-Linear, Concave Utilities},
booktitle = {Innovations in Computer Science - {ICS} 2010, Tsinghua University,
Beijing, China, January 5-7, 2010. Proceedings},
pages = {156--165},
publisher = {Tsinghua University Press},
year = {2010},
url = {http://conference.iiis.tsinghua.edu.cn/ICS2010/content/papers/13.html},
timestamp = {Wed, 04 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/VaziraniY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DaskalakisDY10,
author = {Constantinos Daskalakis and
Ilias Diakonikolas and
Mihalis Yannakakis},
editor = {Moses Charikar},
title = {How Good is the Chord Algorithm?},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {978--991},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.79},
doi = {10.1137/1.9781611973075.79},
timestamp = {Tue, 02 Feb 2021 17:07:39 +0100},
biburl = {https://dblp.org/rec/conf/soda/DaskalakisDY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sss/Yannakakis10,
author = {Mihalis Yannakakis},
editor = {Shlomi Dolev and
Jorge Arturo Cobb and
Michael J. Fischer and
Moti Yung},
title = {Computation of Equilibria and Stable Solutions},
booktitle = {Stabilization, Safety, and Security of Distributed Systems - 12th
International Symposium, {SSS} 2010, New York, NY, USA, September
20-22, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6366},
pages = {2},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16023-3\_2},
doi = {10.1007/978-3-642-16023-3\_2},
timestamp = {Sat, 19 Oct 2019 20:07:49 +0200},
biburl = {https://dblp.org/rec/conf/sss/Yannakakis10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csr/Yannakakis09,
author = {Mihalis Yannakakis},
title = {Equilibria, fixed points, and complexity classes},
journal = {Comput. Sci. Rev.},
volume = {3},
number = {2},
pages = {71--85},
year = {2009},
url = {https://doi.org/10.1016/j.cosrev.2009.03.004},
doi = {10.1016/J.COSREV.2009.03.004},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/csr/Yannakakis09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/EtessamiY09,
author = {Kousha Etessami and
Mihalis Yannakakis},
title = {Recursive Markov chains, stochastic grammars, and monotone systems
of nonlinear equations},
journal = {J. {ACM}},
volume = {56},
number = {1},
pages = {1:1--1:66},
year = {2009},
url = {https://doi.org/10.1145/1462153.1462154},
doi = {10.1145/1462153.1462154},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/EtessamiY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DiakonikolasY09,
author = {Ilias Diakonikolas and
Mihalis Yannakakis},
title = {Small Approximate Pareto Sets for Biobjective Shortest Paths and Other
Problems},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {4},
pages = {1340--1371},
year = {2009},
url = {https://doi.org/10.1137/080724514},
doi = {10.1137/080724514},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DiakonikolasY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/Yannakakis09,
author = {Mihalis Yannakakis},
editor = {Marios Mavronicolas and
Vicky G. Papadopoulou},
title = {Computational Aspects of Equilibria},
booktitle = {Algorithmic Game Theory, Second International Symposium, {SAGT} 2009,
Paphos, Cyprus, October 18-20, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5814},
pages = {2--13},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04645-2\_2},
doi = {10.1007/978-3-642-04645-2\_2},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/sagt/Yannakakis09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/EtessamiKVY08,
author = {Kousha Etessami and
Marta Z. Kwiatkowska and
Moshe Y. Vardi and
Mihalis Yannakakis},
title = {Multi-Objective Model Checking of Markov Decision Processes},
journal = {Log. Methods Comput. Sci.},
volume = {4},
number = {4},
year = {2008},
url = {https://doi.org/10.2168/LMCS-4(4:8)2008},
doi = {10.2168/LMCS-4(4:8)2008},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/EtessamiKVY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/EtessamiY08,
author = {Kousha Etessami and
Mihalis Yannakakis},
title = {Recursive Concurrent Stochastic Games},
journal = {Log. Methods Comput. Sci.},
volume = {4},
number = {4},
year = {2008},
url = {https://doi.org/10.2168/LMCS-4(4:7)2008},
doi = {10.2168/LMCS-4(4:7)2008},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/EtessamiY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EtessamiWY08,
author = {Kousha Etessami and
Dominik Wojtczak and
Mihalis Yannakakis},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {Recursive Stochastic Games with Positive Rewards},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {711--723},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_58},
doi = {10.1007/978-3-540-70575-8\_58},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/EtessamiWY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/qest/EtessamiWY08,
author = {Kousha Etessami and
Dominik Wojtczak and
Mihalis Yannakakis},
title = {Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter
Automata, and Pushdown Systems},
booktitle = {Fifth International Conference on the Quantitative Evaluaiton of Systems
{(QEST} 2008), 14-17 September 2008, Saint-Malo, France},
pages = {243--253},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/QEST.2008.35},
doi = {10.1109/QEST.2008.35},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/qest/EtessamiWY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DiakonikolasY08,
author = {Ilias Diakonikolas and
Mihalis Yannakakis},
editor = {Shang{-}Hua Teng},
title = {Succinct approximate convex pareto curves},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {74--83},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347091},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/DiakonikolasY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Yannakakis08,
author = {Mihalis Yannakakis},
editor = {Susanne Albers and
Pascal Weil},
title = {Equilibria, Fixed Points, and Complexity Classes},
booktitle = {{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer
Science, Bordeaux, France, February 21-23, 2008, Proceedings},
series = {LIPIcs},
volume = {1},
pages = {19--38},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.STACS.2008.1311},
doi = {10.4230/LIPICS.STACS.2008.1311},
timestamp = {Tue, 22 Jun 2021 15:44:08 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Yannakakis08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wia/Yannakakis08,
author = {Mihalis Yannakakis},
editor = {Oscar H. Ibarra and
Bala Ravikumar},
title = {Automata, Probability, and Recursion},
booktitle = {Implementation and Applications of Automata, 13th International Conference,
{CIAA} 2008, San Francisco, California, USA, July 21-24, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5148},
pages = {23--32},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70844-5\_3},
doi = {10.1007/978-3-540-70844-5\_3},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/wia/Yannakakis08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-2831,
author = {Mihalis Yannakakis},
title = {Equilibria, Fixed Points, and Complexity Classes},
journal = {CoRR},
volume = {abs/0802.2831},
year = {2008},
url = {http://arxiv.org/abs/0802.2831},
eprinttype = {arXiv},
eprint = {0802.2831},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-2831.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0805-2646,
author = {Ilias Diakonikolas and
Mihalis Yannakakis},
title = {Small Approximate Pareto Sets for Bi-objective Shortest Paths and
Other Problems},
journal = {CoRR},
volume = {abs/0805.2646},
year = {2008},
url = {http://arxiv.org/abs/0805.2646},
eprinttype = {arXiv},
eprint = {0805.2646},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0805-2646.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0810-3581,
author = {Kousha Etessami and
Mihalis Yannakakis},
title = {Recursive Concurrent Stochastic Games},
journal = {CoRR},
volume = {abs/0810.3581},
year = {2008},
url = {http://arxiv.org/abs/0810.3581},
eprinttype = {arXiv},
eprint = {0810.3581},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0810-3581.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0810-5728,
author = {Kousha Etessami and
Marta Z. Kwiatkowska and
Moshe Y. Vardi and
Mihalis Yannakakis},
title = {Multi-Objective Model Checking of Markov Decision Processes},
journal = {CoRR},
volume = {abs/0810.5728},
year = {2008},
url = {http://arxiv.org/abs/0810.5728},
eprinttype = {arXiv},
eprint = {0810.5728},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0810-5728.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DiakonikolasY07,
author = {Ilias Diakonikolas and
Mihalis Yannakakis},
editor = {Moses Charikar and
Klaus Jansen and
Omer Reingold and
Jos{\'{e}} D. P. Rolim},
title = {Small Approximate Pareto Sets for Bi-objective Shortest Paths and
Other Problems},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 10th International Workshop, {APPROX} 2007, and 11th
International Workshop, {RANDOM} 2007, Princeton, NJ, USA, August
20-22, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4627},
pages = {74--88},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74208-1\_6},
doi = {10.1007/978-3-540-74208-1\_6},
timestamp = {Sat, 30 Sep 2023 09:34:32 +0200},
biburl = {https://dblp.org/rec/conf/approx/DiakonikolasY07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/EtessamiY07,
author = {Kousha Etessami and
Mihalis Yannakakis},
title = {On the Complexity of Nash Equilibria and Other Fixed Points (Extended
Abstract)},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
pages = {113--123},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.48},
doi = {10.1109/FOCS.2007.48},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/EtessamiY07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tacas/EtessamiKVY07,
author = {Kousha Etessami and
Marta Z. Kwiatkowska and
Moshe Y. Vardi and
Mihalis Yannakakis},
editor = {Orna Grumberg and
Michael Huth},
title = {Multi-objective Model Checking of Markov Decision Processes},
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems,
13th International Conference, {TACAS} 2007, Held as Part of the Joint
European Conferences on Theory and Practice of Software, {ETAPS} 2007
Braga, Portugal, March 24 - April 1, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4424},
pages = {50--65},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-71209-1\_6},
doi = {10.1007/978-3-540-71209-1\_6},
timestamp = {Mon, 11 Sep 2023 15:43:49 +0200},
biburl = {https://dblp.org/rec/conf/tacas/EtessamiKVY07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/igpl/GrocePY06,
author = {Alex Groce and
Doron A. Peled and
Mihalis Yannakakis},
title = {Adaptive Model Checking},
journal = {Log. J. {IGPL}},
volume = {14},
number = {5},
pages = {729--744},
year = {2006},
url = {https://doi.org/10.1093/jigpal/jzl007},
doi = {10.1093/JIGPAL/JZL007},
timestamp = {Fri, 06 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/igpl/GrocePY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atva/Yannakakis06,
author = {Mihalis Yannakakis},
editor = {Susanne Graf and
Wenhui Zhang},
title = {Analysis of Recursive Probabilistic Models},
booktitle = {Automated Technology for Verification and Analysis, 4th International
Symposium, {ATVA} 2006, Beijing, China, October 23-26, 2006},
series = {Lecture Notes in Computer Science},
volume = {4218},
pages = {1--5},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11901914\_1},
doi = {10.1007/11901914\_1},
timestamp = {Tue, 14 May 2019 10:00:49 +0200},
biburl = {https://dblp.org/rec/conf/atva/Yannakakis06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EtessamiY06,
author = {Kousha Etessami and
Mihalis Yannakakis},
editor = {Michele Bugliesi and
Bart Preneel and
Vladimiro Sassone and
Ingo Wegener},
title = {Recursive Concurrent Stochastic Games},
booktitle = {Automata, Languages and Programming, 33rd International Colloquium,
{ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {4052},
pages = {324--335},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11787006\_28},
doi = {10.1007/11787006\_28},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/EtessamiY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/Yannakakis06,
author = {Mihalis Yannakakis},
editor = {Gonzalo Navarro and
Leopoldo E. Bertossi and
Yoshiharu Kohayakawa},
title = {Recursion and Probability},
booktitle = {Fourth {IFIP} International Conference on Theoretical Computer Science
{(TCS} 2006), {IFIP} 19th World Computer Congress, {TC-1} Foundations
of Computer Science, August 23-24, 2006, Santiago, Chile},
series = {{IFIP}},
volume = {209},
pages = {13},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/978-0-387-34735-6\_6},
doi = {10.1007/978-0-387-34735-6\_6},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/ifipTCS/Yannakakis06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipps/ShuLY06,
author = {Guoqiang Shu and
David Lee and
Mihalis Yannakakis},
title = {A note on broadcast encryption key management with applications to
large scale emergency alert systems},
booktitle = {20th International Parallel and Distributed Processing Symposium {(IPDPS}
2006), Proceedings, 25-29 April 2006, Rhodes Island, Greece},
publisher = {{IEEE}},
year = {2006},
url = {https://doi.org/10.1109/IPDPS.2006.1639680},
doi = {10.1109/IPDPS.2006.1639680},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipps/ShuLY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EtessamiY06,
author = {Kousha Etessami and
Mihalis Yannakakis},
editor = {Bruno Durand and
Wolfgang Thomas},
title = {Efficient Qualitative Analysis of Classes of Recursive Markov Decision
Processes and Simple Stochastic Games},
booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer
Science, Marseille, France, February 23-25, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3884},
pages = {634--645},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11672142\_52},
doi = {10.1007/11672142\_52},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/EtessamiY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/Yannakakis06,
author = {Mihalis Yannakakis},
editor = {Paul G. Spirakis and
Marios Mavronicolas and
Spyros C. Kontogiannis},
title = {Succinct Approximation of Trade-Off Curves},
booktitle = {Internet and Network Economics, Second International Workshop, {WINE}
2006, Patras, Greece, December 15-17, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4286},
pages = {149},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11944874\_14},
doi = {10.1007/11944874\_14},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/wine/Yannakakis06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlurEY05,
author = {Rajeev Alur and
Kousha Etessami and
Mihalis Yannakakis},
title = {Realizability and verification of {MSC} graphs},
journal = {Theor. Comput. Sci.},
volume = {331},
number = {1},
pages = {97--114},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2004.09.034},
doi = {10.1016/J.TCS.2004.09.034},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AlurEY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/VassilvitskiiY05,
author = {Sergei Vassilvitskii and
Mihalis Yannakakis},
title = {Efficiently computing succinct trade-off curves},
journal = {Theor. Comput. Sci.},
volume = {348},
number = {2-3},
pages = {334--356},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.09.022},
doi = {10.1016/J.TCS.2005.09.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/VassilvitskiiY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toplas/AlurBEGRY05,
author = {Rajeev Alur and
Michael Benedikt and
Kousha Etessami and
Patrice Godefroid and
Thomas W. Reps and
Mihalis Yannakakis},
title = {Analysis of recursive state machines},
journal = {{ACM} Trans. Program. Lang. Syst.},
volume = {27},
number = {4},
pages = {786--818},
year = {2005},
url = {https://doi.org/10.1145/1075382.1075387},
doi = {10.1145/1075382.1075387},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toplas/AlurBEGRY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/EtessamiY05,
author = {Kousha Etessami and
Mihalis Yannakakis},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {Recursive Markov Decision Processes and Recursive Stochastic Games},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {891--903},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_72},
doi = {10.1007/11523468\_72},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/EtessamiY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/EtessamiY05,
author = {Kousha Etessami and
Mihalis Yannakakis},
editor = {Xiaotie Deng and
Ding{-}Zhu Du},
title = {Probability and Recursion},
booktitle = {Algorithms and Computation, 16th International Symposium, {ISAAC}
2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3827},
pages = {2--4},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11602613\_2},
doi = {10.1007/11602613\_2},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/EtessamiY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/qest/YannakakisE05,
author = {Mihalis Yannakakis and
Kousha Etessami},
title = {Checking {LTL} Properties of Recursive Markov Chains},
booktitle = {Second International Conference on the Quantitative Evaluaiton of
Systems {(QEST} 2005), 19-22 September 2005, Torino, Italy},
pages = {155--165},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/QEST.2005.8},
doi = {10.1109/QEST.2005.8},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/qest/YannakakisE05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Mosk-AoyamaY05,
author = {Damon Mosk{-}Aoyama and
Mihalis Yannakakis},
title = {Testing hierarchical systems},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {1126--1135},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070593},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/Mosk-AoyamaY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EtessamiY05,
author = {Kousha Etessami and
Mihalis Yannakakis},
editor = {Volker Diekert and
Bruno Durand},
title = {Recursive Markov Chains, Stochastic Grammars, and Monotone Systems
of Nonlinear Equations},
booktitle = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3404},
pages = {340--352},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-31856-9\_28},
doi = {10.1007/978-3-540-31856-9\_28},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/EtessamiY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tacas/EtessamiY05,
author = {Kousha Etessami and
Mihalis Yannakakis},
editor = {Nicolas Halbwachs and
Lenore D. Zuck},
title = {Algorithmic Verification of Recursive Probabilistic State Machines},
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems,
11th International Conference, {TACAS} 2005, Held as Part of the Joint
European Conferences on Theory and Practice of Software, {ETAPS} 2005,
Edinburgh, UK, April 4-8, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3440},
pages = {253--270},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-31980-1\_17},
doi = {10.1007/978-3-540-31980-1\_17},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/tacas/EtessamiY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/GargVY04,
author = {Naveen Garg and
Vijay V. Vazirani and
Mihalis Yannakakis},
title = {Multiway cuts in node weighted graphs},
journal = {J. Algorithms},
volume = {50},
number = {1},
pages = {49--61},
year = {2004},
url = {https://doi.org/10.1016/S0196-6774(03)00111-1},
doi = {10.1016/S0196-6774(03)00111-1},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/GargVY04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/KannanY04,
author = {Sampath Kannan and
Mihalis Yannakakis},
title = {Guest Editors' foreword},
journal = {J. Comput. Syst. Sci.},
volume = {68},
number = {2},
pages = {237},
year = {2004},
url = {https://doi.org/10.1016/j.jcss.2003.07.001},
doi = {10.1016/J.JCSS.2003.07.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/KannanY04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Yannakakis04,
author = {Mihalis Yannakakis},
editor = {Josep D{\'{\i}}az and
Juhani Karhum{\"{a}}ki and
Arto Lepist{\"{o}} and
Donald Sannella},
title = {Testing, Optimizaton, and Games},
booktitle = {Automata, Languages and Programming: 31st International Colloquium,
{ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3142},
pages = {28--45},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27836-8\_6},
doi = {10.1007/978-3-540-27836-8\_6},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Yannakakis04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/VassilvitskiiY04,
author = {Sergei Vassilvitskii and
Mihalis Yannakakis},
editor = {Josep D{\'{\i}}az and
Juhani Karhum{\"{a}}ki and
Arto Lepist{\"{o}} and
Donald Sannella},
title = {Efficiently Computing Succinct Trade-Off Curves},
booktitle = {Automata, Languages and Programming: 31st International Colloquium,
{ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3142},
pages = {1201--1213},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27836-8\_99},
doi = {10.1007/978-3-540-27836-8\_99},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/VassilvitskiiY04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/Yannakakis04,
author = {Mihalis Yannakakis},
title = {Testing, Optimizaton, and Games},
booktitle = {19th {IEEE} Symposium on Logic in Computer Science {(LICS} 2004),
14-17 July 2004, Turku, Finland, Proceedings},
pages = {78--88},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/LICS.2004.1319602},
doi = {10.1109/LICS.2004.1319602},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/Yannakakis04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/opodis/LeeLY04,
author = {David Lee and
Christine Liu and
Mihalis Yannakakis},
editor = {Teruo Higashino},
title = {Protocol System Integration, Interface and Interoperability},
booktitle = {Principles of Distributed Systems, 8th International Conference, {OPODIS}
2004, Grenoble, France, December 15-17, 2004, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3544},
pages = {1--19},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/11516798\_1},
doi = {10.1007/11516798\_1},
timestamp = {Fri, 12 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/opodis/LeeLY04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GuruswamiKRSY03,
author = {Venkatesan Guruswami and
Sanjeev Khanna and
Rajmohan Rajaraman and
F. Bruce Shepherd and
Mihalis Yannakakis},
title = {Near-optimal hardness results and approximation algorithms for edge-disjoint
paths and related problems},
journal = {J. Comput. Syst. Sci.},
volume = {67},
number = {3},
pages = {473--496},
year = {2003},
url = {https://doi.org/10.1016/S0022-0000(03)00066-7},
doi = {10.1016/S0022-0000(03)00066-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GuruswamiKRSY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tse/AlurEY03,
author = {Rajeev Alur and
Kousha Etessami and
Mihalis Yannakakis},
title = {Inference of Message Sequence Charts},
journal = {{IEEE} Trans. Software Eng.},
volume = {29},
number = {7},
pages = {623--633},
year = {2003},
url = {https://doi.org/10.1109/TSE.2003.1214326},
doi = {10.1109/TSE.2003.1214326},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tse/AlurEY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/AlurCEGY03,
author = {Rajeev Alur and
Swarat Chaudhuri and
Kousha Etessami and
Sudipto Guha and
Mihalis Yannakakis},
editor = {Roberto M. Amadio and
Denis Lugiez},
title = {Compression of Partially Ordered Strings},
booktitle = {{CONCUR} 2003 - Concurrency Theory, 14th International Conference,
Marseille, France, September 3-5, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2761},
pages = {42--56},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45187-7\_3},
doi = {10.1007/978-3-540-45187-7\_3},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/concur/AlurCEGY03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jalc/PeledVY02,
author = {Doron A. Peled and
Moshe Y. Vardi and
Mihalis Yannakakis},
title = {Black Box Checking},
journal = {J. Autom. Lang. Comb.},
volume = {7},
number = {2},
pages = {225--246},
year = {2002},
url = {https://doi.org/10.25596/jalc-2002-225},
doi = {10.25596/JALC-2002-225},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jalc/PeledVY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamrev/CoffmanCGJSWY02,
author = {Edward G. Coffman Jr. and
Costas Courcoubetis and
Michael R. Garey and
David S. Johnson and
Peter W. Shor and
Richard R. Weber and
Mihalis Yannakakis},
title = {Perfect Packing Theorems and the Average-Case Behavior of Optimal
and Online Bin Packing},
journal = {{SIAM} Rev.},
volume = {44},
number = {1},
pages = {95--108},
year = {2002},
url = {https://doi.org/10.1137/S0036144501395423},
doi = {10.1137/S0036144501395423},
timestamp = {Tue, 29 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamrev/CoffmanCGJSWY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/LeeY02,
author = {David Lee and
Mihalis Yannakakis},
title = {Closed Partition Lattice and Machine Decomposition},
journal = {{IEEE} Trans. Computers},
volume = {51},
number = {2},
pages = {216--228},
year = {2002},
url = {https://doi.org/10.1109/12.980009},
doi = {10.1109/12.980009},
timestamp = {Fri, 12 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/LeeY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/GrocePY02,
author = {Alex Groce and
Doron A. Peled and
Mihalis Yannakakis},
editor = {Ed Brinksma and
Kim Guldstrand Larsen},
title = {{AMC:} An Adaptive Model Checker},
booktitle = {Computer Aided Verification, 14th International Conference, {CAV}
2002,Copenhagen, Denmark, July 27-31, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2404},
pages = {521--525},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45657-0\_44},
doi = {10.1007/3-540-45657-0\_44},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/cav/GrocePY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/Yannakakis02,
author = {Mihalis Yannakakis},
editor = {Sergio Rajsbaum},
title = {Testing and Checking of Finite State Systems},
booktitle = {{LATIN} 2002: Theoretical Informatics, 5th Latin American Symposium,
Cancun, Mexico, April 3-6, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2286},
pages = {14},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45995-2\_6},
doi = {10.1007/3-540-45995-2\_6},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/Yannakakis02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tacas/GrocePY02,
author = {Alex Groce and
Doron A. Peled and
Mihalis Yannakakis},
editor = {Joost{-}Pieter Katoen and
Perdita Stevens},
title = {Adaptive Model Checking},
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems,
8th International Conference, {TACAS} 2002, Held as Part of the Joint
European Conference on Theory and Practice of Software, {ETAPS} 2002,
Grenoble, France, April 8-12, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2280},
pages = {357--370},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-46002-0\_25},
doi = {10.1007/3-540-46002-0\_25},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/tacas/GrocePY02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toplas/AlurY01,
author = {Rajeev Alur and
Mihalis Yannakakis},
title = {Model checking of hierarchical state machines},
journal = {{ACM} Trans. Program. Lang. Syst.},
volume = {23},
number = {3},
pages = {273--303},
year = {2001},
url = {https://doi.org/10.1145/503502.503503},
doi = {10.1145/503502.503503},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toplas/AlurY01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/AlurEY01,
author = {Rajeev Alur and
Kousha Etessami and
Mihalis Yannakakis},
editor = {G{\'{e}}rard Berry and
Hubert Comon and
Alain Finkel},
title = {Analysis of Recursive State Machines},
booktitle = {Computer Aided Verification, 13th International Conference, {CAV}
2001, Paris, France, July 18-22, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2102},
pages = {207--220},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44585-4\_18},
doi = {10.1007/3-540-44585-4\_18},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/cav/AlurEY01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AlurEY01,
author = {Rajeev Alur and
Kousha Etessami and
Mihalis Yannakakis},
editor = {Fernando Orejas and
Paul G. Spirakis and
Jan van Leeuwen},
title = {Realizability and Verification of {MSC} Graphs},
booktitle = {Automata, Languages and Programming, 28th International Colloquium,
{ICALP} 2001, Crete, Greece, July 8-12, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2076},
pages = {797--808},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-48224-5\_65},
doi = {10.1007/3-540-48224-5\_65},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AlurEY01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/PapadimitriouY01,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
editor = {Peter Buneman},
title = {Multiobjective Query Optimization},
booktitle = {Proceedings of the Twentieth {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, May 21-23, 2001, Santa Barbara,
California, {USA}},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/375551.375560},
doi = {10.1145/375551.375560},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/PapadimitriouY01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Yannakakis01,
author = {Mihalis Yannakakis},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Roberto Tamassia},
title = {Approximation of Multiobjective Optimization Problems},
booktitle = {Algorithms and Data Structures, 7th International Workshop, {WADS}
2001, Providence, RI, USA, August 8-10, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2125},
pages = {1},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44634-6\_1},
doi = {10.1007/3-540-44634-6\_1},
timestamp = {Sun, 02 Jun 2019 21:24:17 +0200},
biburl = {https://dblp.org/rec/conf/wads/Yannakakis01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stoc/2001,
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
publisher = {{ACM}},
year = {2001},
isbn = {1-58113-349-9},
timestamp = {Thu, 16 Feb 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/2001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CoffmanCGJSWY00,
author = {Edward G. Coffman Jr. and
Costas Courcoubetis and
M. R. Garey and
David S. Johnson and
Peter W. Shor and
Richard R. Weber and
Mihalis Yannakakis},
title = {Bin Packing with Discrete Item Sizes, Part {I:} Perfect Packing Theorems
and the Average Case Behavior of Optimal Packings},
journal = {{SIAM} J. Discret. Math.},
volume = {13},
number = {3},
pages = {384--402},
year = {2000},
url = {https://doi.org/10.1137/S0895480197325936},
doi = {10.1137/S0895480197325936},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CoffmanCGJSWY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigmod/RossAKSSY00,
author = {Kenneth A. Ross and
Charu C. Aggarwal and
Alfons Kemper and
Sunita Sarawagi and
S. Sudarshan and
Mihalis Yannakakis},
title = {Reminiscences on Influential Papers},
journal = {{SIGMOD} Rec.},
volume = {29},
number = {3},
pages = {52--54},
year = {2000},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigmod/RossAKSSY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PapadimitriouY00,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {On the Approximability of Trade-offs and Optimal Access of Web Sources},
booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
12-14 November 2000, Redondo Beach, California, {USA}},
pages = {86--92},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/SFCS.2000.892068},
doi = {10.1109/SFCS.2000.892068},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PapadimitriouY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/forte/EtessamiY00,
author = {Kousha Etessami and
Mihalis Yannakakis},
editor = {Tommaso Bolognesi and
Diego Latella},
title = {From Rule-based to Automata-based Testing},
booktitle = {Formal Techniques for Distributed System Development, {FORTE/PSTV}
2000, {IFIP} {TC6} {WG6.1} Joint International Conference on Formal
Description Techniques for Distributed Systems and Communication Protocols
{(FORTE} {XIII)} and Protocol Specification, Testing and Verification
{(PSTV} XX), October 10-13, 2000, Pisa, Italy},
series = {{IFIP} Conference Proceedings},
volume = {183},
pages = {53--68},
publisher = {Kluwer},
year = {2000},
timestamp = {Tue, 19 Feb 2002 10:53:34 +0100},
biburl = {https://dblp.org/rec/conf/forte/EtessamiY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icse/AlurEY00,
author = {Rajeev Alur and
Kousha Etessami and
Mihalis Yannakakis},
editor = {Carlo Ghezzi and
Mehdi Jazayeri and
Alexander L. Wolf},
title = {Inference of message sequence charts},
booktitle = {Proceedings of the 22nd International Conference on on Software Engineering,
{ICSE} 2000, Limerick Ireland, June 4-11, 2000},
pages = {304--313},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/337180.337215},
doi = {10.1145/337180.337215},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icse/AlurEY00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ifipTCS/Yannakakis00,
author = {Mihalis Yannakakis},
editor = {Jan van Leeuwen and
Osamu Watanabe and
Masami Hagiya and
Peter D. Mosses and
Takayasu Ito},
title = {Hierarchical State Machines},
booktitle = {Theoretical Computer Science, Exploring New Frontiers of Theoretical
Informatics, International Conference {IFIP} {TCS} 2000, Sendai, Japan,
August 17-19, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1872},
pages = {315--330},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44929-9\_24},
doi = {10.1007/3-540-44929-9\_24},
timestamp = {Tue, 14 May 2019 10:00:36 +0200},
biburl = {https://dblp.org/rec/conf/ifipTCS/Yannakakis00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/PapadimitriouY99,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {On the Complexity of Database Queries},
journal = {J. Comput. Syst. Sci.},
volume = {58},
number = {3},
pages = {407--427},
year = {1999},
url = {https://doi.org/10.1006/jcss.1999.1626},
doi = {10.1006/JCSS.1999.1626},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/PapadimitriouY99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/AlurY99,
author = {Rajeev Alur and
Mihalis Yannakakis},
editor = {Jos C. M. Baeten and
Sjouke Mauw},
title = {Model Checking of Message Sequence Charts},
booktitle = {{CONCUR} '99: Concurrency Theory, 10th International Conference, Eindhoven,
The Netherlands, August 24-27, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1664},
pages = {114--129},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48320-9\_10},
doi = {10.1007/3-540-48320-9\_10},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/concur/AlurY99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/forte/PeledVY99,
author = {Doron A. Peled and
Moshe Y. Vardi and
Mihalis Yannakakis},
editor = {Jianping Wu and
Samuel T. Chanson and
Qiang Gao},
title = {Black Box Checking},
booktitle = {Formal Methods for Protocol Engineering and Distributed Systems, {FORTE}
{XII} / {PSTV} XIX'99, {IFIP} {TC6} {WG6.1} Joint International Conference
on Formal Description Techniques for Distributed Systems and Communication
Protocols {(FORTE} {XII)} and Protocol Specification, Testing and
Verification {(PSTV} XIX), October 5-8, 1999, Beijing, China},
series = {{IFIP} Conference Proceedings},
volume = {156},
pages = {225--240},
publisher = {Kluwer},
year = {1999},
timestamp = {Fri, 12 Feb 2016 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/forte/PeledVY99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AlurKY99,
author = {Rajeev Alur and
Sampath Kannan and
Mihalis Yannakakis},
editor = {Jir{\'{\i}} Wiedermann and
Peter van Emde Boas and
Mogens Nielsen},
title = {Communicating Hierarchical State Machines},
booktitle = {Automata, Languages and Programming, 26th International Colloquium,
ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1644},
pages = {169--178},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48523-6\_14},
doi = {10.1007/3-540-48523-6\_14},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AlurKY99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/VempalaY99,
author = {Santosh S. Vempala and
Mihalis Yannakakis},
editor = {Robert Endre Tarjan and
Tandy J. Warnow},
title = {A Convex Relaxation for the Asymmetric {TSP}},
booktitle = {Proceedings of the Tenth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
17-19 January 1999, Baltimore, Maryland, {USA}},
pages = {975--976},
publisher = {{ACM/SIAM}},
year = {1999},
url = {http://dl.acm.org/citation.cfm?id=314500.314955},
timestamp = {Thu, 24 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/VempalaY99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GuruswamiKRSY99,
author = {Venkatesan Guruswami and
Sanjeev Khanna and
Rajmohan Rajaraman and
F. Bruce Shepherd and
Mihalis Yannakakis},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint
Paths and Related Problems},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {19--28},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301262},
doi = {10.1145/301250.301262},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GuruswamiKRSY99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/CrescenziGPPY98,
author = {Pierluigi Crescenzi and
Deborah Goldman and
Christos H. Papadimitriou and
Antonio Piccolboni and
Mihalis Yannakakis},
title = {On the Complexity of Protein Folding},
journal = {J. Comput. Biol.},
volume = {5},
number = {3},
pages = {423--465},
year = {1998},
url = {https://doi.org/10.1089/cmb.1998.5.423},
doi = {10.1089/CMB.1998.5.423},
timestamp = {Sun, 12 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/CrescenziGPPY98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tac/CourcoubetisY98,
author = {Costas Courcoubetis and
Mihalis Yannakakis},
title = {Markov decision processes and regular events},
journal = {{IEEE} Trans. Autom. Control.},
volume = {43},
number = {10},
pages = {1399--1418},
year = {1998},
url = {https://doi.org/10.1109/9.720497},
doi = {10.1109/9.720497},
timestamp = {Mon, 03 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tac/CourcoubetisY98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/YannakakisL98,
author = {Mihalis Yannakakis and
David Lee},
editor = {Georg Gottlob and
Etienne Grandjean and
Katrin Seyr},
title = {Testing for Finite State Systems},
booktitle = {Computer Science Logic, 12th International Workshop, {CSL} '98, Annual
Conference of the EACSL, Brno, Czech Republic, August 24-28, 1998,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1584},
pages = {29--44},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/10703163\_3},
doi = {10.1007/10703163\_3},
timestamp = {Fri, 12 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csl/YannakakisL98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/forte/PortaLLY98,
author = {Thomas F. La Porta and
David Lee and
Yow{-}Jian Lin and
Mihalis Yannakakis},
editor = {Stanislaw Budkowski and
Ana R. Cavalli and
Elie Najm},
title = {Protocol Feature Interactions},
booktitle = {Formal Description Techniques and Protocol Specification, Testing
and Verification, {FORTE} {XI} / {PSTV} XVIII'98, {IFIP} {TC6} {WG6.1}
Joint International Conference on Formal Description Techniques for
Distributed Systems and Communication Protocols {(FORTE} {XI)} and
Protocol Specification, Testing and Verification {(PSTV} XVIII), 3-6
November, 1998, Paris, France},
series = {{IFIP} Conference Proceedings},
volume = {135},
pages = {59--74},
publisher = {Kluwer},
year = {1998},
timestamp = {Fri, 12 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/forte/PortaLLY98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/CrescenziGPPY98,
author = {Pierluigi Crescenzi and
Deborah Goldman and
Christos H. Papadimitriou and
Antonio Piccolboni and
Mihalis Yannakakis},
editor = {Sorin Istrail and
Pavel A. Pevzner and
Michael S. Waterman},
title = {On the complexity of protein folding (abstract)},
booktitle = {Proceedings of the Second Annual International Conference on Research
in Computational Molecular Biology, {RECOMB} 1998, New York, NY, USA,
March 22-25, 1998},
pages = {61--62},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/279069.279089},
doi = {10.1145/279069.279089},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/CrescenziGPPY98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigsoft/AlurY98,
author = {Rajeev Alur and
Mihalis Yannakakis},
editor = {Leon J. Osterweil and
William L. Scherlis},
title = {Model Checking of Hierarchical State Machines},
booktitle = {Proceedings of the {ACM} {SIGSOFT} International Symposium on Foundations
of Software Engineering, {SIGSOFT} 1998, Lake Buena Vista, Florida,
USA, November 3-5, 1998},
pages = {175--188},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/288195.288305},
doi = {10.1145/288195.288305},
timestamp = {Tue, 27 Jul 2021 17:16:40 +0200},
biburl = {https://dblp.org/rec/conf/sigsoft/AlurY98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CrescenziGPPY98,
author = {Pierluigi Crescenzi and
Deborah Goldman and
Christos H. Papadimitriou and
Antonio Piccolboni and
Mihalis Yannakakis},
editor = {Jeffrey Scott Vitter},
title = {On the Complexity of Protein Folding (Extended Abstract)},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {597--603},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276875},
doi = {10.1145/276698.276875},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CrescenziGPPY98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GargVY97,
author = {Naveen Garg and
Vijay V. Vazirani and
Mihalis Yannakakis},
title = {Primal-Dual Approximation Algorithms for Integral Flow and Multicut
in Trees},
journal = {Algorithmica},
volume = {18},
number = {1},
pages = {3--20},
year = {1997},
url = {https://doi.org/10.1007/BF02523685},
doi = {10.1007/BF02523685},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GargVY97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fmsd/YannakakisL97,
author = {Mihalis Yannakakis and
David Lee},
title = {An Efficient Algorithm for Minimizing Real-Time Transition Systems},
journal = {Formal Methods Syst. Des.},
volume = {11},
number = {2},
pages = {113--136},
year = {1997},
url = {https://doi.org/10.1023/A:1008621829508},
doi = {10.1023/A:1008621829508},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fmsd/YannakakisL97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/PapadimitriouY97,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {Tie-Breaking Semantics and Structural Totality},
journal = {J. Comput. Syst. Sci.},
volume = {54},
number = {1},
pages = {48--60},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1451},
doi = {10.1006/JCSS.1997.1451},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/PapadimitriouY97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/KupfermanKY97,
author = {Orna Kupferman and
Robert P. Kurshan and
Mihalis Yannakakis},
editor = {Mogens Nielsen and
Wolfgang Thomas},
title = {Existence of Reduction Hierarchies},
booktitle = {Computer Science Logic, 11th International Workshop, {CSL} '97, Annual
Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {1414},
pages = {327--340},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0028023},
doi = {10.1007/BFB0028023},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/KupfermanKY97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/PapadimitriouY97,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
editor = {Alberto O. Mendelzon and
Z. Meral {\"{O}}zsoyoglu},
title = {On the Complexity of Database Queries},
booktitle = {Proceedings of the Sixteenth {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, May 12-14, 1997, Tucson, Arizona,
{USA}},
pages = {12--19},
publisher = {{ACM} Press},
year = {1997},
url = {https://doi.org/10.1145/263661.263664},
doi = {10.1145/263661.263664},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/PapadimitriouY97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/PapadimitriouY96,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {On Limited Nondeterminism and the Complexity of the {V-C} Dimension},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {161--170},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0058},
doi = {10.1006/JCSS.1996.0058},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/PapadimitriouY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pieee/LeeY96,
author = {David Lee and
Mihalis Yannakakis},
title = {Principles and methods of testing finite state machines-a survey},
journal = {Proc. {IEEE}},
volume = {84},
number = {8},
pages = {1090--1123},
year = {1996},
url = {https://doi.org/10.1109/5.533956},
doi = {10.1109/5.533956},
timestamp = {Tue, 05 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pieee/LeeY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GargVY96,
author = {Naveen Garg and
Vijay V. Vazirani and
Mihalis Yannakakis},
title = {Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications},
journal = {{SIAM} J. Comput.},
volume = {25},
number = {2},
pages = {235--251},
year = {1996},
url = {https://doi.org/10.1137/S0097539793243016},
doi = {10.1137/S0097539793243016},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GargVY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Yannakakis96,
author = {Mihalis Yannakakis},
title = {Perspectives on database theory},
journal = {{SIGACT} News},
volume = {27},
number = {3},
pages = {25--49},
year = {1996},
url = {https://doi.org/10.1145/235666.235670},
doi = {10.1145/235666.235670},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Yannakakis96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/HolzmannPY96,
author = {Gerard J. Holzmann and
Doron A. Peled and
Mihalis Yannakakis},
editor = {Jean{-}Charles Gr{\'{e}}goire and
Gerard J. Holzmann and
Doron A. Peled},
title = {On nested depth first search},
booktitle = {The Spin Verification System, Proceedings of a {DIMACS} Workshop,
New Brunswick, New Jersey, USA, August, 1996},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {32},
pages = {23--31},
publisher = {{DIMACS/AMS}},
year = {1996},
url = {https://doi.org/10.1090/dimacs/032/03},
doi = {10.1090/DIMACS/032/03},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/HolzmannPY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/KoutsoupiasPY96,
author = {Elias Koutsoupias and
Christos H. Papadimitriou and
Mihalis Yannakakis},
editor = {Friedhelm Meyer auf der Heide and
Burkhard Monien},
title = {Searching a Fixed Graph},
booktitle = {Automata, Languages and Programming, 23rd International Colloquium,
ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1099},
pages = {280--289},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61440-0\_135},
doi = {10.1007/3-540-61440-0\_135},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/KoutsoupiasPY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icnp/LeeY96,
author = {David Lee and
Mihalis Yannakakis},
title = {Optimization problems from feature testing of communication protocols},
booktitle = {1996 International Conference on Network Protocols, {ICNP} 1996, October
29 - November 1, 1996, Columbus, Ohio, {USA}},
pages = {66--75},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/ICNP.1996.564905},
doi = {10.1109/ICNP.1996.564905},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icnp/LeeY96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/AlurIKY95,
author = {Rajeev Alur and
Alon Itai and
Robert P. Kurshan and
Mihalis Yannakakis},
title = {Timing Verification by Successive Approximation},
journal = {Inf. Comput.},
volume = {118},
number = {1},
pages = {142--157},
year = {1995},
url = {https://doi.org/10.1006/inco.1995.1059},
doi = {10.1006/INCO.1995.1059},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/AlurIKY95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/CourcoubetisY95,
author = {Costas Courcoubetis and
Mihalis Yannakakis},
title = {The Complexity of Probabilistic Verification},
journal = {J. {ACM}},
volume = {42},
number = {4},
pages = {857--907},
year = {1995},
url = {https://doi.org/10.1145/210332.210339},
doi = {10.1145/210332.210339},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/CourcoubetisY95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/YannakakisL95,
author = {Mihalis Yannakakis and
David Lee},
title = {Testing Finite State Machines: Fault Detection},
journal = {J. Comput. Syst. Sci.},
volume = {50},
number = {2},
pages = {209--227},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1019},
doi = {10.1006/JCSS.1995.1019},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/YannakakisL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AfratiCY95,
author = {Foto N. Afrati and
Stavros S. Cosmadakis and
Mihalis Yannakakis},
title = {On Datalog vs. Polynomial Time},
journal = {J. Comput. Syst. Sci.},
volume = {51},
number = {2},
pages = {177--196},
year = {1995},
url = {https://doi.org/10.1006/jcss.1995.1060},
doi = {10.1006/JCSS.1995.1060},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/AfratiCY95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Yannakakis95,
author = {Mihalis Yannakakis},
title = {Perspectives on Database Theory},
booktitle = {36th Annual Symposium on Foundations of Computer Science, Milwaukee,
Wisconsin, USA, 23-25 October 1995},
pages = {224--246},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SFCS.1995.492479},
doi = {10.1109/SFCS.1995.492479},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Yannakakis95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlurCY95,
author = {Rajeev Alur and
Costas Courcoubetis and
Mihalis Yannakakis},
editor = {Frank Thomson Leighton and
Allan Borodin},
title = {Distinguishing tests for nondeterministic and probabilistic machines},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM} Symposium on Theory
of Computing, 29 May-1 June 1995, Las Vegas, Nevada, {USA}},
pages = {363--372},
publisher = {{ACM}},
year = {1995},
url = {https://doi.org/10.1145/225058.225161},
doi = {10.1145/225058.225161},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AlurCY95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/pods/95,
editor = {Mihalis Yannakakis and
Serge Abiteboul},
title = {Proceedings of the Fourteenth {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, May 22-25, 1995, San Jose, California,
{USA}},
publisher = {{ACM} Press},
year = {1995},
url = {http://dl.acm.org/citation.cfm?id=212433},
isbn = {0-89791-730-8},
timestamp = {Sat, 24 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BlumLTY94,
author = {Avrim Blum and
Tao Jiang and
Ming Li and
John Tromp and
Mihalis Yannakakis},
title = {Linear Approximation of Shortest Superstrings},
journal = {J. {ACM}},
volume = {41},
number = {4},
pages = {630--647},
year = {1994},
url = {https://doi.org/10.1145/179812.179818},
doi = {10.1145/179812.179818},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BlumLTY94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/LundY94,
author = {Carsten Lund and
Mihalis Yannakakis},
title = {On the Hardness of Approximating Minimization Problems},
journal = {J. {ACM}},
volume = {41},
number = {5},
pages = {960--981},
year = {1994},
url = {https://doi.org/10.1145/185675.306789},
doi = {10.1145/185675.306789},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/LundY94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Yannakakis94,
author = {Mihalis Yannakakis},
title = {On the Approximation of Maximum Satisfiability},
journal = {J. Algorithms},
volume = {17},
number = {3},
pages = {475--502},
year = {1994},
url = {https://doi.org/10.1006/jagm.1994.1045},
doi = {10.1006/JAGM.1994.1045},
timestamp = {Fri, 25 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/Yannakakis94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DahlhausJPSY94,
author = {Elias Dahlhaus and
David S. Johnson and
Christos H. Papadimitriou and
Paul D. Seymour and
Mihalis Yannakakis},
title = {The Complexity of Multiterminal Cuts},
journal = {{SIAM} J. Comput.},
volume = {23},
number = {4},
pages = {864--894},
year = {1994},
url = {https://doi.org/10.1137/S0097539792225297},
doi = {10.1137/S0097539792225297},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DahlhausJPSY94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tc/LeeY94,
author = {David Lee and
Mihalis Yannakakis},
title = {Testing Finite-State Machines: State Identification and Verification},
journal = {{IEEE} Trans. Computers},
volume = {43},
number = {3},
pages = {306--320},
year = {1994},
url = {https://doi.org/10.1109/12.272431},
doi = {10.1109/12.272431},
timestamp = {Fri, 12 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tc/LeeY94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/Yannakakis94,
author = {Mihalis Yannakakis},
editor = {Maurizio A. Bonuccelli and
Pierluigi Crescenzi and
Rossella Petreschi},
title = {Some Open Problems in Approximation},
booktitle = {Algorithms and Complexity, Second Italian Conference, {CIAC} '94,
Rome, Italy, February 23-25, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {778},
pages = {33--39},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57811-0\_4},
doi = {10.1007/3-540-57811-0\_4},
timestamp = {Fri, 17 Jul 2020 16:12:46 +0200},
biburl = {https://dblp.org/rec/conf/ciac/Yannakakis94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GargVY94,
author = {Naveen Garg and
Vijay V. Vazirani and
Mihalis Yannakakis},
editor = {Serge Abiteboul and
Eli Shamir},
title = {Multiway Cuts in Directed and Node Weighted Graphs},
booktitle = {Automata, Languages and Programming, 21st International Colloquium,
ICALP94, Jerusalem, Israel, July 11-14, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {820},
pages = {487--498},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58201-0\_92},
doi = {10.1007/3-540-58201-0\_92},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GargVY94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PapadimitriouY94,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
editor = {Frank Thomson Leighton and
Michael T. Goodrich},
title = {On complexity as bounded rationality (extended abstract)},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of
Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec,
Canada},
pages = {726--733},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/195058.195445},
doi = {10.1145/195058.195445},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PapadimitriouY94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/PapadimitriouSY93,
author = {Christos H. Papadimitriou and
Paolo Serafini and
Mihalis Yannakakis},
title = {Computing the Throughput of a Network with Dedicated Lines},
journal = {Discret. Appl. Math.},
volume = {42},
number = {2},
pages = {271--278},
year = {1993},
url = {https://doi.org/10.1016/0166-218X(93)90050-X},
doi = {10.1016/0166-218X(93)90050-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/PapadimitriouSY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/PapadimitriouY93,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {The Traveling Salesman Problem with Distances One and Two},
journal = {Math. Oper. Res.},
volume = {18},
number = {1},
pages = {1--11},
year = {1993},
url = {https://doi.org/10.1287/moor.18.1.1},
doi = {10.1287/MOOR.18.1.1},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mor/PapadimitriouY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/YannakakisL93,
author = {Mihalis Yannakakis and
David Lee},
editor = {Costas Courcoubetis},
title = {An Efficient Algorithm for Minimizing Real-time Transition Systems},
booktitle = {Computer Aided Verification, 5th International Conference, {CAV} '93,
Elounda, Greece, June 28 - July 1, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {697},
pages = {210--224},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-56922-7\_18},
doi = {10.1007/3-540-56922-7\_18},
timestamp = {Fri, 12 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cav/YannakakisL93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/PapadimitriouY93,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {On Limited Nondeterminism and the Complexity of the {V.C} Dimension
(Extended Abstract)},
booktitle = {Proceedings of the Eigth Annual Structure in Complexity Theory Conference,
San Diego, CA, USA, May 18-21, 1993},
pages = {12--18},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SCT.1993.336545},
doi = {10.1109/SCT.1993.336545},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/PapadimitriouY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/LundY93,
author = {Carsten Lund and
Mihalis Yannakakis},
editor = {Andrzej Lingas and
Rolf G. Karlsson and
Svante Carlsson},
title = {The Approximation of Maximum Subgraph Problems},
booktitle = {Automata, Languages and Programming, 20nd International Colloquium,
ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {700},
pages = {40--51},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-56939-1\_60},
doi = {10.1007/3-540-56939-1\_60},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/LundY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GargVY93,
author = {Naveen Garg and
Vijay V. Vazirani and
Mihalis Yannakakis},
editor = {Andrzej Lingas and
Rolf G. Karlsson and
Svante Carlsson},
title = {Primal-Dual Approximation Algorithms for Integral Flow and Multicut
in Trees, with Applications to Matching and Set Cover},
booktitle = {Automata, Languages and Programming, 20nd International Colloquium,
ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {700},
pages = {64--75},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-56939-1\_62},
doi = {10.1007/3-540-56939-1\_62},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GargVY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/Yannakakis93,
author = {Mihalis Yannakakis},
editor = {Kam{-}Wing Ng and
Prabhakar Raghavan and
N. V. Balasubramanian and
Francis Y. L. Chin},
title = {Recent Developments on the Approximability of Combinatorial Problems},
booktitle = {Algorithms and Computation, 4th International Symposium, {ISAAC} '93,
Hong Kong, December 15-17, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {762},
pages = {363--368},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57568-5\_267},
doi = {10.1007/3-540-57568-5\_267},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/Yannakakis93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PapadimitriouY93,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
editor = {S. Rao Kosaraju and
David S. Johnson and
Alok Aggarwal},
title = {Linear programming without the matrix},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of
Computing, May 16-18, 1993, San Diego, CA, {USA}},
pages = {121--129},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/167088.167127},
doi = {10.1145/167088.167127},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PapadimitriouY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LundY93,
author = {Carsten Lund and
Mihalis Yannakakis},
editor = {S. Rao Kosaraju and
David S. Johnson and
Alok Aggarwal},
title = {On the hardness of approximating minimization problems},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of
Computing, May 16-18, 1993, San Diego, CA, {USA}},
pages = {286--293},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/167088.167172},
doi = {10.1145/167088.167172},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/LundY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GargVY93,
author = {Naveen Garg and
Vijay V. Vazirani and
Mihalis Yannakakis},
editor = {S. Rao Kosaraju and
David S. Johnson and
Alok Aggarwal},
title = {Approximate max-flow min-(multi)cut theorems and their applications},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of
Computing, May 16-18, 1993, San Diego, CA, {USA}},
pages = {698--707},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/167088.167266},
doi = {10.1145/167088.167266},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GargVY93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fmsd/CourcoubetisVWY92,
author = {Costas Courcoubetis and
Moshe Y. Vardi and
Pierre Wolper and
Mihalis Yannakakis},
title = {Memory-Efficient Algorithms for the Verification of Temporal Properties},
journal = {Formal Methods Syst. Des.},
volume = {1},
number = {2/3},
pages = {275--288},
year = {1992},
url = {https://doi.org/10.1007/BF00121128},
doi = {10.1007/BF00121128},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fmsd/CourcoubetisVWY92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fmsd/CourcoubetisY92,
author = {Costas Courcoubetis and
Mihalis Yannakakis},
title = {Minimum and Maximum Delay Problems in Real-Time Systems},
journal = {Formal Methods Syst. Des.},
volume = {1},
number = {4},
pages = {385--415},
year = {1992},
url = {https://doi.org/10.1007/BF00709157},
doi = {10.1007/BF00709157},
timestamp = {Fri, 13 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/fmsd/CourcoubetisY92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/AlurIKY92,
author = {Rajeev Alur and
Alon Itai and
Robert P. Kurshan and
Mihalis Yannakakis},
editor = {Gregor von Bochmann and
David K. Probst},
title = {Timing Verification by Successive Approximation},
booktitle = {Computer Aided Verification, Fourth International Workshop, {CAV}
'92, Montreal, Canada, June 29 - July 1, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {663},
pages = {137--150},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56496-9\_12},
doi = {10.1007/3-540-56496-9\_12},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/cav/AlurIKY92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/VaziraniY92,
author = {Vijay V. Vazirani and
Mihalis Yannakakis},
editor = {Werner Kuich},
title = {Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract)},
booktitle = {Automata, Languages and Programming, 19th International Colloquium,
ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {623},
pages = {366--377},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55719-9\_88},
doi = {10.1007/3-540-55719-9\_88},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/VaziraniY92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/PapadimitriouY92,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
editor = {Moshe Y. Vardi and
Paris C. Kanellakis},
title = {Tie-Breaking Semantics and Structural Totality},
booktitle = {Proceedings of the Eleventh {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, June 2-4, 1992, San Diego, California,
{USA}},
pages = {16--22},
publisher = {{ACM} Press},
year = {1992},
url = {https://doi.org/10.1145/137097.137103},
doi = {10.1145/137097.137103},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/PapadimitriouY92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Yannakakis92,
author = {Mihalis Yannakakis},
editor = {Greg N. Frederickson},
title = {On the Approximation of Maximum Satisfiability},
booktitle = {Proceedings of the Third Annual {ACM/SIGACT-SIAM} Symposium on Discrete
Algorithms, 27-29 January 1992, Orlando, Florida, {USA}},
pages = {1--9},
publisher = {{ACM/SIAM}},
year = {1992},
url = {http://dl.acm.org/citation.cfm?id=139404.139406},
timestamp = {Thu, 05 Jul 2018 07:29:02 +0200},
biburl = {https://dblp.org/rec/conf/soda/Yannakakis92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DahlhausJPSY92,
author = {Elias Dahlhaus and
David S. Johnson and
Christos H. Papadimitriou and
Paul D. Seymour and
Mihalis Yannakakis},
editor = {S. Rao Kosaraju and
Mike Fellows and
Avi Wigderson and
John A. Ellis},
title = {The Complexity of Multiway Cuts (Extended Abstract)},
booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
May 4-6, 1992, Victoria, British Columbia, Canada},
pages = {241--251},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/129712.129736},
doi = {10.1145/129712.129736},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/DahlhausJPSY92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/LeeY92,
author = {David Lee and
Mihalis Yannakakis},
editor = {S. Rao Kosaraju and
Mike Fellows and
Avi Wigderson and
John A. Ellis},
title = {Online Minimization of Transition Systems (Extended Abstract)},
booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
May 4-6, 1992, Victoria, British Columbia, Canada},
pages = {264--274},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/129712.129738},
doi = {10.1145/129712.129738},
timestamp = {Fri, 12 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/LeeY92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/amai/UllmanY91,
author = {Jeffrey D. Ullman and
Mihalis Yannakakis},
title = {The Input/Output Complexity of Transitive Closure},
journal = {Ann. Math. Artif. Intell.},
volume = {3},
number = {2-4},
pages = {331--360},
year = {1991},
url = {https://doi.org/10.1007/BF01530929},
doi = {10.1007/BF01530929},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/amai/UllmanY91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/ArkinPY91,
author = {Esther M. Arkin and
Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {Modularity of Cycles and Paths in Graphs},
journal = {J. {ACM}},
volume = {38},
number = {2},
pages = {255--274},
year = {1991},
url = {https://doi.org/10.1145/103516.103517},
doi = {10.1145/103516.103517},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/ArkinPY91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/PapadimitriouY91,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {Optimization, Approximation, and Complexity Classes},
journal = {J. Comput. Syst. Sci.},
volume = {43},
number = {3},
pages = {425--440},
year = {1991},
url = {https://doi.org/10.1016/0022-0000(91)90023-X},
doi = {10.1016/0022-0000(91)90023-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/PapadimitriouY91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Yannakakis91,
author = {Mihalis Yannakakis},
title = {Expressing Combinatorial Optimization Problems by Linear Programs},
journal = {J. Comput. Syst. Sci.},
volume = {43},
number = {3},
pages = {441--466},
year = {1991},
url = {https://doi.org/10.1016/0022-0000(91)90024-Y},
doi = {10.1016/0022-0000(91)90024-Y},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Yannakakis91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SchafferY91,
author = {Alejandro A. Sch{\"{a}}ffer and
Mihalis Yannakakis},
title = {Simple Local Search Problems That are Hard to Solve},
journal = {{SIAM} J. Comput.},
volume = {20},
number = {1},
pages = {56--87},
year = {1991},
url = {https://doi.org/10.1137/0220004},
doi = {10.1137/0220004},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SchafferY91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/UllmanY91,
author = {Jeffrey D. Ullman and
Mihalis Yannakakis},
title = {High-Probability Parallel Transitive-Closure Algorithms},
journal = {{SIAM} J. Comput.},
volume = {20},
number = {1},
pages = {100--125},
year = {1991},
url = {https://doi.org/10.1137/0220006},
doi = {10.1137/0220006},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/UllmanY91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PapadimitriouY91,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {Shortest Paths Without a Map},
journal = {Theor. Comput. Sci.},
volume = {84},
number = {1},
pages = {127--150},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90263-2},
doi = {10.1016/0304-3975(91)90263-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PapadimitriouY91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/PapadimitriouY91,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
editor = {Luigi Logrippo},
title = {On the Value of Information in Distributed Decision-Making (Extended
Abstract)},
booktitle = {Proceedings of the Tenth Annual {ACM} Symposium on Principles of Distributed
Computing, Montreal, Quebec, Canada, August 19-21, 1991},
pages = {61--64},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/112600.112606},
doi = {10.1145/112600.112606},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/PapadimitriouY91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/AfratiCY91,
author = {Foto N. Afrati and
Stavros S. Cosmadakis and
Mihalis Yannakakis},
editor = {Daniel J. Rosenkrantz},
title = {On Datalog vs. Polynomial Time},
booktitle = {Proceedings of the Tenth {ACM} {SIGACT-SIGMOD-SIGART} Symposium on
Principles of Database Systems, May 29-31, 1991, Denver, Colorado,
{USA}},
pages = {13--25},
publisher = {{ACM} Press},
year = {1991},
url = {https://doi.org/10.1145/113413.113415},
doi = {10.1145/113413.113415},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/AfratiCY91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CoffmanCGJMSWY91,
author = {Edward G. Coffman Jr. and
Costas Courcoubetis and
M. R. Garey and
David S. Johnson and
Lyle A. McGeoch and
Peter W. Shor and
Richard R. Weber and
Mihalis Yannakakis},
editor = {Cris Koutsougeras and
Jeffrey Scott Vitter},
title = {Fundamental Discrepancies between Average-Case Analyses under Discrete
and Continuous Distributions: {A} Bin Packing Case Study},
booktitle = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing,
May 5-8, 1991, New Orleans, Louisiana, {USA}},
pages = {230--240},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/103418.103446},
doi = {10.1145/103418.103446},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/CoffmanCGJMSWY91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BlumJLTY91,
author = {Avrim Blum and
Tao Jiang and
Ming Li and
John Tromp and
Mihalis Yannakakis},
editor = {Cris Koutsougeras and
Jeffrey Scott Vitter},
title = {Linear Approximation of Shortest Superstrings},
booktitle = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing,
May 5-8, 1991, New Orleans, Louisiana, {USA}},
pages = {328--336},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/103418.103455},
doi = {10.1145/103418.103455},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BlumJLTY91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/YannakakisL91,
author = {Mihalis Yannakakis and
David Lee},
editor = {Cris Koutsougeras and
Jeffrey Scott Vitter},
title = {Testing Finite State Machines (Extended Abstract)},
booktitle = {Proceedings of the 23rd Annual {ACM} Symposium on Theory of Computing,
May 5-8, 1991, New Orleans, Louisiana, {USA}},
pages = {476--485},
publisher = {{ACM}},
year = {1991},
url = {https://doi.org/10.1145/103418.103468},
doi = {10.1145/103418.103468},
timestamp = {Fri, 12 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/YannakakisL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/PapadimitriouY90,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {On recognizing integer polyhedra},
journal = {Comb.},
volume = {10},
number = {1},
pages = {107--109},
year = {1990},
url = {https://doi.org/10.1007/BF02122701},
doi = {10.1007/BF02122701},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/PapadimitriouY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PapadimitriouY90,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {Towards an Architecture-Independent Analysis of Parallel Algorithms},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {2},
pages = {322--328},
year = {1990},
url = {https://doi.org/10.1137/0219021},
doi = {10.1137/0219021},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PapadimitriouY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cav/CourcoubetisVWY90,
author = {Costas Courcoubetis and
Moshe Y. Vardi and
Pierre Wolper and
Mihalis Yannakakis},
editor = {Edmund M. Clarke and
Robert P. Kurshan},
title = {Memory Efficient Algorithms for the Verification of Temporal Properties},
booktitle = {Computer Aided Verification, 2nd International Workshop, {CAV} '90,
New Brunswick, NJ, USA, June 18-21, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {531},
pages = {233--242},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/BFb0023737},
doi = {10.1007/BFB0023737},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cav/CourcoubetisVWY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/CourcoubetisVWY90,
author = {Costas Courcoubetis and
Moshe Y. Vardi and
Pierre Wolper and
Mihalis Yannakakis},
editor = {Edmund M. Clarke and
Robert P. Kurshan},
title = {Memory Efficient Algorithms for the Verification of Temporal Properties},
booktitle = {Computer-Aided Verification, Proceedings of a {DIMACS} Workshop 1990,
New Brunswick, New Jersey, USA, June 18-21, 1990},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {3},
pages = {207--218},
publisher = {{DIMACS/AMS}},
year = {1990},
url = {https://doi.org/10.1090/dimacs/003/15},
doi = {10.1090/DIMACS/003/15},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/CourcoubetisVWY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/CourcoubetisY90,
author = {Costas Courcoubetis and
Mihalis Yannakakis},
editor = {Mike Paterson},
title = {Markov Decision Processes and Regular Events (Extended Abstract)},
booktitle = {Automata, Languages and Programming, 17th International Colloquium,
ICALP90, Warwick University, England, UK, July 16-20, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {443},
pages = {336--349},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/BFb0032043},
doi = {10.1007/BFB0032043},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/CourcoubetisY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/Yannakakis90,
author = {Mihalis Yannakakis},
editor = {Daniel J. Rosenkrantz and
Yehoshua Sagiv},
title = {Graph-Theoretic Methods in Database Theory},
booktitle = {Proceedings of the Ninth {ACM} {SIGACT-SIGMOD-SIGART} Symposium on
Principles of Database Systems, April 2-4, 1990, Nashville, Tennessee,
{USA}},
pages = {230--242},
publisher = {{ACM} Press},
year = {1990},
url = {https://doi.org/10.1145/298514.298576},
doi = {10.1145/298514.298576},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/Yannakakis90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigmod/UllmanY90,
author = {Jeffrey D. Ullman and
Mihalis Yannakakis},
editor = {Hector Garcia{-}Molina and
H. V. Jagadish},
title = {The Input/Output Complexity of Transitive Closure},
booktitle = {Proceedings of the 1990 {ACM} {SIGMOD} International Conference on
Management of Data, Atlantic City, NJ, USA, May 23-25, 1990},
pages = {44--53},
publisher = {{ACM} Press},
year = {1990},
url = {https://doi.org/10.1145/93597.93620},
doi = {10.1145/93597.93620},
timestamp = {Tue, 16 Aug 2022 23:04:20 +0200},
biburl = {https://dblp.org/rec/conf/sigmod/UllmanY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/UllmanY90,
author = {Jeffrey D. Ullman and
Mihalis Yannakakis},
editor = {Frank Thomson Leighton},
title = {High-Probability Parallel Transitive Closure Algorithms},
booktitle = {Proceedings of the 2nd Annual {ACM} Symposium on Parallel Algorithms
and Architectures, {SPAA} '90, Island of Crete, Greece, July 2-6,
1990},
pages = {200--209},
publisher = {{ACM}},
year = {1990},
url = {https://doi.org/10.1145/97444.97686},
doi = {10.1145/97444.97686},
timestamp = {Wed, 21 Nov 2018 12:27:44 +0100},
biburl = {https://dblp.org/rec/conf/spaa/UllmanY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Yannakakis90,
author = {Mihalis Yannakakis},
editor = {Christian Choffrut and
Thomas Lengauer},
title = {The Analysis of Local Search Problems and Their Heuristics},
booktitle = {{STACS} 90, 7th Annual Symposium on Theoretical Aspects of Computer
Science, Rouen, France, February 22-24, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {415},
pages = {298--311},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52282-4\_52},
doi = {10.1007/3-540-52282-4\_52},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Yannakakis90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PapadimitriouSY90,
author = {Christos H. Papadimitriou and
Alejandro A. Sch{\"{a}}ffer and
Mihalis Yannakakis},
editor = {Harriet Ortiz},
title = {On the Complexity of Local Search (Extended Abstract)},
booktitle = {Proceedings of the 22nd Annual {ACM} Symposium on Theory of Computing,
May 13-17, 1990, Baltimore, Maryland, {USA}},
pages = {438--445},
publisher = {{ACM}},
year = {1990},
url = {https://doi.org/10.1145/100216.100274},
doi = {10.1145/100216.100274},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PapadimitriouSY90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/VaziraniY89,
author = {Vijay V. Vazirani and
Mihalis Yannakakis},
title = {Pfaffian orientations, 0-1 permanents, and even cycles in directed
graphs},
journal = {Discret. Appl. Math.},
volume = {25},
number = {1-2},
pages = {179--190},
year = {1989},
url = {https://doi.org/10.1016/0166-218X(89)90053-X},
doi = {10.1016/0166-218X(89)90053-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/VaziraniY89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/CoffmanNY89,
author = {Edward G. Coffman Jr. and
Ardavan Nozari and
Mihalis Yannakakis},
title = {Optimal Scheduling of Products with Two Subassemblies on a Single
Machine},
journal = {Oper. Res.},
volume = {37},
number = {3},
pages = {426--436},
year = {1989},
url = {https://doi.org/10.1287/opre.37.3.426},
doi = {10.1287/OPRE.37.3.426},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/CoffmanNY89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Yannakakis89,
author = {Mihalis Yannakakis},
title = {Embedding Planar Graphs in Four Pages},
journal = {J. Comput. Syst. Sci.},
volume = {38},
number = {1},
pages = {36--67},
year = {1989},
url = {https://doi.org/10.1016/0022-0000(89)90032-9},
doi = {10.1016/0022-0000(89)90032-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Yannakakis89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HadzilacosY89,
author = {Thanasis Hadzilacos and
Mihalis Yannakakis},
title = {Deleting Completed Transactions},
journal = {J. Comput. Syst. Sci.},
volume = {38},
number = {2},
pages = {360--379},
year = {1989},
url = {https://doi.org/10.1016/0022-0000(89)90007-X},
doi = {10.1016/0022-0000(89)90007-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HadzilacosY89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/PapadimitriouY89,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
editor = {Giorgio Ausiello and
Mariangiola Dezani{-}Ciancaglini and
Simona Ronchi Della Rocca},
title = {Shortest Paths Without a Map},
booktitle = {Automata, Languages and Programming, 16th International Colloquium,
ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {372},
pages = {610--620},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/BFb0035787},
doi = {10.1007/BFB0035787},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/PapadimitriouY89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/JohnsonP88,
author = {David S. Johnson and
Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {On Generating All Maximal Independent Sets},
journal = {Inf. Process. Lett.},
volume = {27},
number = {3},
pages = {119--123},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90065-8},
doi = {10.1016/0020-0190(88)90065-8},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/JohnsonP88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/JohnsonPY88,
author = {David S. Johnson and
Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {How Easy is Local Search?},
journal = {J. Comput. Syst. Sci.},
volume = {37},
number = {1},
pages = {79--100},
year = {1988},
url = {https://doi.org/10.1016/0022-0000(88)90046-3},
doi = {10.1016/0022-0000(88)90046-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/JohnsonPY88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/CourcoubetisY88,
author = {Costas Courcoubetis and
Mihalis Yannakakis},
title = {Verifying Temporal Properties of Finite-State Probabilistic Programs},
booktitle = {29th Annual Symposium on Foundations of Computer Science, White Plains,
New York, USA, 24-26 October 1988},
pages = {338--345},
publisher = {{IEEE} Computer Society},
year = {1988},
url = {https://doi.org/10.1109/SFCS.1988.21950},
doi = {10.1109/SFCS.1988.21950},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/CourcoubetisY88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/VaziraniY88,
author = {Vijay V. Vazirani and
Mihalis Yannakakis},
editor = {Timo Lepist{\"{o}} and
Arto Salomaa},
title = {Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed
Graphs},
booktitle = {Automata, Languages and Programming, 15th International Colloquium,
ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {317},
pages = {667--681},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19488-6\_149},
doi = {10.1007/3-540-19488-6\_149},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/VaziraniY88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Yannakakis88,
author = {Mihalis Yannakakis},
editor = {Janos Simon},
title = {Expressing Combinatorial Optimization Problems by Linear Programs
(Extended Abstract)},
booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing,
May 2-4, 1988, Chicago, Illinois, {USA}},
pages = {223--228},
publisher = {{ACM}},
year = {1988},
url = {https://doi.org/10.1145/62212.62232},
doi = {10.1145/62212.62232},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Yannakakis88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PapadimitriouY88a,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
editor = {Janos Simon},
title = {Optimization, Approximation, and Complexity Classes (Extended Abstract)},
booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing,
May 2-4, 1988, Chicago, Illinois, {USA}},
pages = {229--234},
publisher = {{ACM}},
year = {1988},
url = {https://doi.org/10.1145/62212.62233},
doi = {10.1145/62212.62233},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PapadimitriouY88a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PapadimitriouY88b,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
editor = {Janos Simon},
title = {Towards an Architecture-Independent Analysis of Parallel Algorithms
(Extended Abstract)},
booktitle = {Proceedings of the 20th Annual {ACM} Symposium on Theory of Computing,
May 2-4, 1988, Chicago, Illinois, {USA}},
pages = {510--513},
publisher = {{ACM}},
year = {1988},
url = {https://doi.org/10.1145/62212.62262},
doi = {10.1145/62212.62262},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PapadimitriouY88b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/pods/88,
editor = {Chris Edmondson{-}Yurkanan and
Mihalis Yannakakis},
title = {Proceedings of the Seventh {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, March 21-23, 1988, Austin, Texas,
{USA}},
publisher = {{ACM}},
year = {1988},
url = {http://dl.acm.org/citation.cfm?id=308386},
isbn = {0-89791-263-2},
timestamp = {Wed, 29 Mar 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/YannakakisG87,
author = {Mihalis Yannakakis and
Fanica Gavril},
title = {The Maximum k-Colorable Subgraph Problem for Chordal Graphs},
journal = {Inf. Process. Lett.},
volume = {24},
number = {2},
pages = {133--137},
year = {1987},
url = {https://doi.org/10.1016/0020-0190(87)90107-4},
doi = {10.1016/0020-0190(87)90107-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/YannakakisG87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PapadimitriouY87,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {The Complexity of Reliable Concurrency Control},
journal = {{SIAM} J. Comput.},
volume = {16},
number = {3},
pages = {538--553},
year = {1987},
url = {https://doi.org/10.1137/0216036},
doi = {10.1137/0216036},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PapadimitriouY87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acr/Yannakakis86,
author = {Mihalis Yannakakis},
title = {Querying Weak Instances},
journal = {Adv. Comput. Res.},
volume = {3},
pages = {185--211},
year = {1986},
timestamp = {Tue, 25 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acr/Yannakakis86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/PapadimitriouY86,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {A Note on Succinct Representations of Graphs},
journal = {Inf. Control.},
volume = {71},
number = {3},
pages = {181--185},
year = {1986},
url = {https://doi.org/10.1016/S0019-9958(86)80009-2},
doi = {10.1016/S0019-9958(86)80009-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/PapadimitriouY86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/WolfsonY86,
author = {Ouri Wolfson and
Mihalis Yannakakis},
title = {Deadlock-Freedom (and Safety) of Transactions in a Distributed Database},
journal = {J. Comput. Syst. Sci.},
volume = {33},
number = {2},
pages = {161--178},
year = {1986},
url = {https://doi.org/10.1016/0022-0000(86)90017-6},
doi = {10.1016/0022-0000(86)90017-6},
timestamp = {Sat, 19 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/WolfsonY86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/awoc/Yannakakis86,
author = {Mihalis Yannakakis},
editor = {Fillia Makedon and
Kurt Mehlhorn and
Theodore S. Papatheodorou and
Paul G. Spirakis},
title = {Linear and Book Embeddings of Graphs},
booktitle = {{VLSI} Algorithms and Architectures, Aegean Workshop on Computing,
Loutraki, Greece, July 8-11, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {227},
pages = {226--235},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-16766-8\_20},
doi = {10.1007/3-540-16766-8\_20},
timestamp = {Tue, 14 May 2019 10:00:47 +0200},
biburl = {https://dblp.org/rec/conf/awoc/Yannakakis86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/Hadzilacos86,
author = {Thanasis Hadzilacos and
Mihalis Yannakakis},
editor = {Avi Silberschatz},
title = {Deleting Completed Transactions},
booktitle = {Proceedings of the Fifth {ACM} {SIGACT-SIGMOD} Symposium on Principles
of Database Systems, March 24-26, 1986, Cambridge, Massachusetts,
{USA}},
pages = {43--46},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/6012.15402},
doi = {10.1145/6012.15402},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/Hadzilacos86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Yannakakis86,
author = {Mihalis Yannakakis},
editor = {Juris Hartmanis},
title = {Four Pages are Necessary and Sufficient for Planar Graphs (Extended
Abstract)},
booktitle = {Proceedings of the 18th Annual {ACM} Symposium on Theory of Computing,
May 28-30, 1986, Berkeley, California, {USA}},
pages = {104--108},
publisher = {{ACM}},
year = {1986},
url = {https://doi.org/10.1145/12130.12141},
doi = {10.1145/12130.12141},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Yannakakis86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Yannakakis85,
author = {Mihalis Yannakakis},
title = {A Polynomial Algorithm for the Min-Cut Linear Arrangement of Trees},
journal = {J. {ACM}},
volume = {32},
number = {4},
pages = {950--988},
year = {1985},
url = {https://doi.org/10.1145/4221.4228},
doi = {10.1145/4221.4228},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Yannakakis85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/Yannakakis85,
author = {Mihalis Yannakakis},
title = {On a Class of Totally Unimodular Matrices},
journal = {Math. Oper. Res.},
volume = {10},
number = {2},
pages = {280--304},
year = {1985},
url = {https://doi.org/10.1287/moor.10.2.280},
doi = {10.1287/MOOR.10.2.280},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/Yannakakis85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TarjanY85,
author = {Robert Endre Tarjan and
Mihalis Yannakakis},
title = {Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs,
Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs},
journal = {{SIAM} J. Comput.},
volume = {14},
number = {1},
pages = {254--255},
year = {1985},
url = {https://doi.org/10.1137/0214020},
doi = {10.1137/0214020},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/TarjanY85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JohnsonPY85,
author = {David S. Johnson and
Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {How Easy Is Local Search? (Extended Abstract)},
booktitle = {26th Annual Symposium on Foundations of Computer Science, Portland,
Oregon, USA, 21-23 October 1985},
pages = {39--42},
publisher = {{IEEE} Computer Society},
year = {1985},
url = {https://doi.org/10.1109/SFCS.1985.31},
doi = {10.1109/SFCS.1985.31},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JohnsonPY85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/WolfsonY85,
author = {Ouri Wolfson and
Mihalis Yannakakis},
title = {Deadlock-Freedom (and Safety) of Transactions in a Distributed Database},
booktitle = {Proceedings of the Fourth {ACM} {SIGACT-SIGMOD} Symposium on Principles
of Database Systems, March 25-27, 1985, Portland, Oregon, {USA}},
pages = {105--112},
publisher = {{ACM}},
year = {1985},
url = {https://doi.org/10.1145/325405.325418},
doi = {10.1145/325405.325418},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/WolfsonY85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/PapadimitriouY85,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {The Complexity of Reliable Concurrency Control},
booktitle = {Proceedings of the Fourth {ACM} {SIGACT-SIGMOD} Symposium on Principles
of Database Systems, March 25-27, 1985, Portland, Oregon, {USA}},
pages = {230--234},
publisher = {{ACM}},
year = {1985},
url = {https://doi.org/10.1145/325405.325445},
doi = {10.1145/325405.325445},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/PapadimitriouY85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Yannakakis84,
author = {Mihalis Yannakakis},
title = {Serializability by Locking},
journal = {J. {ACM}},
volume = {31},
number = {2},
pages = {227--244},
year = {1984},
url = {https://doi.org/10.1145/62.322425},
doi = {10.1145/62.322425},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Yannakakis84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GrahamY84,
author = {Marc H. Graham and
Mihalis Yannakakis},
title = {Independent Database Schemas},
journal = {J. Comput. Syst. Sci.},
volume = {28},
number = {1},
pages = {121--141},
year = {1984},
url = {https://doi.org/10.1016/0022-0000(84)90079-5},
doi = {10.1016/0022-0000(84)90079-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GrahamY84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/PapadimitriouY84,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {The Complexity of Facets (and Some Facets of Complexity)},
journal = {J. Comput. Syst. Sci.},
volume = {28},
number = {2},
pages = {244--259},
year = {1984},
url = {https://doi.org/10.1016/0022-0000(84)90068-0},
doi = {10.1016/0022-0000(84)90068-0},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/PapadimitriouY84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/CoffmanY84,
author = {Edward G. Coffman Jr. and
Mihalis Yannakakis},
title = {Permuting Elements Within Columns of a Matrix in Order to Minimize
Maximum Row Sum},
journal = {Math. Oper. Res.},
volume = {9},
number = {3},
pages = {384--390},
year = {1984},
url = {https://doi.org/10.1287/moor.9.3.384},
doi = {10.1287/MOOR.9.3.384},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mor/CoffmanY84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/TarjanY84,
author = {Robert Endre Tarjan and
Mihalis Yannakakis},
title = {Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity
of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs},
journal = {{SIAM} J. Comput.},
volume = {13},
number = {3},
pages = {566--579},
year = {1984},
url = {https://doi.org/10.1137/0213035},
doi = {10.1137/0213035},
timestamp = {Sat, 30 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/TarjanY84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/Yannakakis84,
author = {Mihalis Yannakakis},
editor = {Daniel J. Rosenkrantz and
Ronald Fagin},
title = {Querying Weak Instances},
booktitle = {Proceedings of the Third {ACM} {SIGACT-SIGMOD} Symposium on Principles
of Database Systems, April 2-4, 1984, Waterloo, Ontario, Canada},
pages = {275--280},
publisher = {{ACM}},
year = {1984},
url = {https://doi.org/10.1145/588011.588051},
doi = {10.1145/588011.588051},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/Yannakakis84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KlawePPY84,
author = {Maria M. Klawe and
Wolfgang J. Paul and
Nicholas Pippenger and
Mihalis Yannakakis},
editor = {Richard A. DeMillo},
title = {On Monotone Formulae with Restricted Depth (Preliminary Version)},
booktitle = {Proceedings of the 16th Annual {ACM} Symposium on Theory of Computing,
April 30 - May 2, 1984, Washington, DC, {USA}},
pages = {480--487},
publisher = {{ACM}},
year = {1984},
url = {https://doi.org/10.1145/800057.808717},
doi = {10.1145/800057.808717},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KlawePPY84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BeeriFMY83,
author = {Catriel Beeri and
Ronald Fagin and
David Maier and
Mihalis Yannakakis},
title = {On the Desirability of Acyclic Database Schemes},
journal = {J. {ACM}},
volume = {30},
number = {3},
pages = {479--513},
year = {1983},
url = {https://doi.org/10.1145/2402.322389},
doi = {10.1145/2402.322389},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BeeriFMY83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FaginMUY83,
author = {Ronald Fagin and
David Maier and
Jeffrey D. Ullman and
Mihalis Yannakakis},
title = {Tools for Template Dependencies},
journal = {{SIAM} J. Comput.},
volume = {12},
number = {1},
pages = {36--59},
year = {1983},
url = {https://doi.org/10.1137/0212003},
doi = {10.1137/0212003},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FaginMUY83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Yannakakis83,
author = {Mihalis Yannakakis},
title = {A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees
(Extended Abstract)},
booktitle = {24th Annual Symposium on Foundations of Computer Science, Tucson,
Arizona, USA, 7-9 November 1983},
pages = {274--281},
publisher = {{IEEE} Computer Society},
year = {1983},
url = {https://doi.org/10.1109/SFCS.1983.2},
doi = {10.1109/SFCS.1983.2},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Yannakakis83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/YannakakisKCP83,
author = {Mihalis Yannakakis and
Paris C. Kanellakis and
Stavros S. Cosmadakis and
Christos H. Papadimitriou},
editor = {Josep D{\'{\i}}az},
title = {Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended
Abstract)},
booktitle = {Automata, Languages and Programming, 10th Colloquium, Barcelona, Spain,
July 18-22, 1983, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {154},
pages = {712--722},
publisher = {Springer},
year = {1983},
url = {https://doi.org/10.1007/BFb0036950},
doi = {10.1007/BFB0036950},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/YannakakisKCP83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AhoUY83,
author = {Alfred V. Aho and
Jeffrey D. Ullman and
Mihalis Yannakakis},
editor = {David S. Johnson and
Ronald Fagin and
Michael L. Fredman and
David Harel and
Richard M. Karp and
Nancy A. Lynch and
Christos H. Papadimitriou and
Ronald L. Rivest and
Walter L. Ruzzo and
Joel I. Seiferas},
title = {On Notions of Information Transfer in {VLSI} Circuits},
booktitle = {Proceedings of the 15th Annual {ACM} Symposium on Theory of Computing,
25-27 April, 1983, Boston, Massachusetts, {USA}},
pages = {133--139},
publisher = {{ACM}},
year = {1983},
url = {https://doi.org/10.1145/800061.808742},
doi = {10.1145/800061.808742},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AhoUY83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/PapadimitriouY82,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {The complexity of restricted spanning tree problems},
journal = {J. {ACM}},
volume = {29},
number = {2},
pages = {285--309},
year = {1982},
url = {https://doi.org/10.1145/322307.322309},
doi = {10.1145/322307.322309},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/PapadimitriouY82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Yannakakis82,
author = {Mihalis Yannakakis},
title = {A Theory of Safe Locking Policies in Database Systems},
journal = {J. {ACM}},
volume = {29},
number = {3},
pages = {718--740},
year = {1982},
url = {https://doi.org/10.1145/322326.322333},
doi = {10.1145/322326.322333},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Yannakakis82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/YannakakisP82,
author = {Mihalis Yannakakis and
Christos H. Papadimitriou},
title = {Algebraic Dependencies},
journal = {J. Comput. Syst. Sci.},
volume = {25},
number = {1},
pages = {2--41},
year = {1982},
url = {https://doi.org/10.1016/0022-0000(82)90008-3},
doi = {10.1016/0022-0000(82)90008-3},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/YannakakisP82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Yannakakis82,
author = {Mihalis Yannakakis},
title = {Freedom from Deadlock of Safe Locking Policies},
journal = {{SIAM} J. Comput.},
volume = {11},
number = {2},
pages = {391--408},
year = {1982},
url = {https://doi.org/10.1137/0211031},
doi = {10.1137/0211031},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Yannakakis82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/GrahamY82,
author = {Marc H. Graham and
Mihalis Yannakakis},
editor = {Jeffrey D. Ullman and
Alfred V. Aho},
title = {Independent Database Schemas},
booktitle = {Proceedings of the {ACM} Symposium on Principles of Database Systems,
March 29-31, 1982, Los Angeles, California, {USA}},
pages = {199--204},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/588111.588144},
doi = {10.1145/588111.588144},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/GrahamY82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PapadimitriouY82,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
editor = {Harry R. Lewis and
Barbara B. Simons and
Walter A. Burkhard and
Lawrence H. Landweber},
title = {The Complexity of Facets (and Some Facets of Complexity)},
booktitle = {Proceedings of the 14th Annual {ACM} Symposium on Theory of Computing,
May 5-7, 1982, San Francisco, California, {USA}},
pages = {255--260},
publisher = {{ACM}},
year = {1982},
url = {https://doi.org/10.1145/800070.802199},
doi = {10.1145/800070.802199},
timestamp = {Wed, 14 Nov 2018 10:51:38 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PapadimitriouY82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PapadimitriouY81,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {On Minimal Eulerian Graphs},
journal = {Inf. Process. Lett.},
volume = {12},
number = {4},
pages = {203--205},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90102-2},
doi = {10.1016/0020-0190(81)90102-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PapadimitriouY81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PapadimitriouY81a,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {The Clique Problem for Planar Graphs},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {131--133},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90041-7},
doi = {10.1016/0020-0190(81)90041-7},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/PapadimitriouY81a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BlumKVPY81,
author = {Manuel Blum and
Richard M. Karp and
Oliver Vornberger and
Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {The Complexity of Testing Whether a Graph is a Superconcentrator},
journal = {Inf. Process. Lett.},
volume = {13},
number = {4/5},
pages = {164--167},
year = {1981},
url = {https://doi.org/10.1016/0020-0190(81)90050-8},
doi = {10.1016/0020-0190(81)90050-8},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BlumKVPY81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/MaierSY81,
author = {David Maier and
Yehoshua Sagiv and
Mihalis Yannakakis},
title = {On the Complexity of Testing Implications of Functional and Join Dependencies},
journal = {J. {ACM}},
volume = {28},
number = {4},
pages = {680--695},
year = {1981},
url = {https://doi.org/10.1145/322276.322280},
doi = {10.1145/322276.322280},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/MaierSY81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Yannakakis81,
author = {Mihalis Yannakakis},
title = {Edge-Deletion Problems},
journal = {{SIAM} J. Comput.},
volume = {10},
number = {2},
pages = {297--309},
year = {1981},
url = {https://doi.org/10.1137/0210021},
doi = {10.1137/0210021},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Yannakakis81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Yannakakis81a,
author = {Mihalis Yannakakis},
title = {Node-Deletion Problems on Bipartite Graphs},
journal = {{SIAM} J. Comput.},
volume = {10},
number = {2},
pages = {310--327},
year = {1981},
url = {https://doi.org/10.1137/0210022},
doi = {10.1137/0210022},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Yannakakis81a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/PapadimitriouY81,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {Worst-Case Ratios for Planar Graphs and the Method of Induction on
Faces (Extended Abstract)},
booktitle = {22nd Annual Symposium on Foundations of Computer Science, Nashville,
Tennessee, USA, 28-30 October 1981},
pages = {358--363},
publisher = {{IEEE} Computer Society},
year = {1981},
url = {https://doi.org/10.1109/SFCS.1981.55},
doi = {10.1109/SFCS.1981.55},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/PapadimitriouY81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BeeriFMMUY81,
author = {Catriel Beeri and
Ronald Fagin and
David Maier and
Alberto O. Mendelzon and
Jeffrey D. Ullman and
Mihalis Yannakakis},
title = {Properties of Acyclic Database Schemes},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {355--362},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802489},
doi = {10.1145/800076.802489},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BeeriFMMUY81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Yannakakis81,
author = {Mihalis Yannakakis},
title = {Issues of Correctness in Database Concurrency Control by Locking},
booktitle = {Proceedings of the 13th Annual {ACM} Symposium on Theory of Computing,
May 11-13, 1981, Milwaukee, Wisconsin, {USA}},
pages = {363--367},
publisher = {{ACM}},
year = {1981},
url = {https://doi.org/10.1145/800076.802490},
doi = {10.1145/800076.802490},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Yannakakis81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/vldb/Yannakakis81,
author = {Mihalis Yannakakis},
title = {Algorithms for Acyclic Database Schemes},
booktitle = {Very Large Data Bases, 7th International Conference, September 9-11,
1981, Cannes, France, Proceedings},
pages = {82--94},
publisher = {{IEEE} Computer Society},
year = {1981},
timestamp = {Wed, 29 Mar 2017 16:45:22 +0200},
biburl = {https://dblp.org/rec/conf/vldb/Yannakakis81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HoneymanLY80,
author = {Peter Honeyman and
Richard E. Ladner and
Mihalis Yannakakis},
title = {Testing the Universal Instance Assumption},
journal = {Inf. Process. Lett.},
volume = {10},
number = {1},
pages = {14--19},
year = {1980},
url = {https://doi.org/10.1016/0020-0190(80)90114-3},
doi = {10.1016/0020-0190(80)90114-3},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/HoneymanLY80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/SagivY80,
author = {Yehoshua Sagiv and
Mihalis Yannakakis},
title = {Equivalences Among Relational Expressions with the Union and Difference
Operators},
journal = {J. {ACM}},
volume = {27},
number = {4},
pages = {633--655},
year = {1980},
url = {https://doi.org/10.1145/322217.322221},
doi = {10.1145/322217.322221},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/SagivY80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/LewisY80,
author = {John M. Lewis and
Mihalis Yannakakis},
title = {The Node-Deletion Problem for Hereditary Properties is NP-Complete},
journal = {J. Comput. Syst. Sci.},
volume = {20},
number = {2},
pages = {219--230},
year = {1980},
url = {https://doi.org/10.1016/0022-0000(80)90060-4},
doi = {10.1016/0022-0000(80)90060-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/LewisY80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Yannakakis80,
author = {Mihalis Yannakakis},
title = {On a Class of Totally Unimodular Matrices},
booktitle = {21st Annual Symposium on Foundations of Computer Science, Syracuse,
New York, USA, 13-15 October 1980},
pages = {10--16},
publisher = {{IEEE} Computer Society},
year = {1980},
url = {https://doi.org/10.1109/SFCS.1980.27},
doi = {10.1109/SFCS.1980.27},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Yannakakis80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/YannakakisP80,
author = {Mihalis Yannakakis and
Christos H. Papadimitriou},
title = {Algebraic Dependencies (Extended Abstract)},
booktitle = {21st Annual Symposium on Foundations of Computer Science, Syracuse,
New York, USA, 13-15 October 1980},
pages = {328--332},
publisher = {{IEEE} Computer Society},
year = {1980},
url = {https://doi.org/10.1109/SFCS.1980.10},
doi = {10.1109/SFCS.1980.10},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/YannakakisP80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/YannakakisP79,
author = {Mihalis Yannakakis and
Theodosios Pavlidis},
title = {Topological Characterization of Families of Graphs Generated by Certain
Types of Graph Grammars},
journal = {Inf. Control.},
volume = {42},
number = {1},
pages = {72--86},
year = {1979},
url = {https://doi.org/10.1016/S0019-9958(79)90173-6},
doi = {10.1016/S0019-9958(79)90173-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/YannakakisP79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Yannakakis79,
author = {Mihalis Yannakakis},
title = {The Effect of a Connectivity Requirement on the Complexity of Maximum
Subgraph Problems},
journal = {J. {ACM}},
volume = {26},
number = {4},
pages = {618--630},
year = {1979},
url = {https://doi.org/10.1145/322154.322157},
doi = {10.1145/322154.322157},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Yannakakis79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PapadimitriouY79,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
title = {Scheduling Interval-Ordered Tasks},
journal = {{SIAM} J. Comput.},
volume = {8},
number = {3},
pages = {405--409},
year = {1979},
url = {https://doi.org/10.1137/0208031},
doi = {10.1137/0208031},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PapadimitriouY79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AhoUY79,
author = {Alfred V. Aho and
Jeffrey D. Ullman and
Mihalis Yannakakis},
title = {Modeling Communications Protocols by Automata},
booktitle = {20th Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 29-31 October 1979},
pages = {267--273},
publisher = {{IEEE} Computer Society},
year = {1979},
url = {https://doi.org/10.1109/SFCS.1979.23},
doi = {10.1109/SFCS.1979.23},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AhoUY79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/YannakakisPK79,
author = {Mihalis Yannakakis and
Christos H. Papadimitriou and
H. T. Kung},
title = {Locking Policies: Safety and Freedom from Deadlock},
booktitle = {20th Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 29-31 October 1979},
pages = {286--297},
publisher = {{IEEE} Computer Society},
year = {1979},
url = {https://doi.org/10.1109/SFCS.1979.22},
doi = {10.1109/SFCS.1979.22},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/YannakakisPK79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/PapadimitriouY79,
author = {Christos H. Papadimitriou and
Mihalis Yannakakis},
editor = {Hermann A. Maurer},
title = {The Complexity of Restricted Minimum Spanning Tree Problems (Extended
Abstract)},
booktitle = {Automata, Languages and Programming, 6th Colloquium, Graz, Austria,
July 16-20, 1979, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {71},
pages = {460--470},
publisher = {Springer},
year = {1979},
url = {https://doi.org/10.1007/3-540-09510-1\_36},
doi = {10.1007/3-540-09510-1\_36},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/PapadimitriouY79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Yannakakis78,
author = {Mihalis Yannakakis},
editor = {Richard J. Lipton and
Walter A. Burkhard and
Walter J. Savitch and
Emily P. Friedman and
Alfred V. Aho},
title = {Node- and Edge-Deletion NP-Complete Problems},
booktitle = {Proceedings of the 10th Annual {ACM} Symposium on Theory of Computing,
May 1-3, 1978, San Diego, California, {USA}},
pages = {253--264},
publisher = {{ACM}},
year = {1978},
url = {https://doi.org/10.1145/800133.804355},
doi = {10.1145/800133.804355},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Yannakakis78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/vldb/SagivY78,
author = {Yehoshua Sagiv and
Mihalis Yannakakis},
editor = {S. Bing Yao},
title = {Equivalence among Relational Expressions with the Union and Difference
Operation},
booktitle = {Fourth International Conference on Very Large Data Bases, September
13-15, 1978, West Berlin, Germany},
pages = {535--548},
publisher = {{IEEE} Computer Society},
year = {1978},
timestamp = {Wed, 29 Mar 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/vldb/SagivY78.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.
last updated on 2024-04-11 22:51 CEST 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:
