Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Kousha Etessami
@proceedings{DBLP:conf/icalp/2023,
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-278-5},
isbn = {978-3-95977-278-5},
timestamp = {Wed, 05 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/2023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/AtseriasBEO22,
author = {Albert Atserias and
Christoph Berkholz and
Kousha Etessami and
Joanna Ochremiak},
title = {Finite and Algorithmic Model Theory (Dagstuhl Seminar 22051)},
journal = {Dagstuhl Reports},
volume = {12},
number = {1},
pages = {101--118},
year = {2022},
url = {https://doi.org/10.4230/DagRep.12.1.101},
doi = {10.4230/DAGREP.12.1.101},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/AtseriasBEO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/geb/Etessami21,
author = {Kousha Etessami},
title = {The complexity of computing a (quasi-)perfect equilibrium for an \emph{n}-player
extensive form game},
journal = {Games Econ. Behav.},
volume = {125},
pages = {107--140},
year = {2021},
url = {https://doi.org/10.1016/j.geb.2019.03.006},
doi = {10.1016/J.GEB.2019.03.006},
timestamp = {Thu, 28 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/geb/Etessami21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/ems/21/Etessami21,
author = {Kousha Etessami},
editor = {Jean{-}{\'{E}}ric Pin},
title = {Analysis of probabilistic processes and automata theory},
booktitle = {Handbook of Automata Theory},
pages = {1343--1382},
publisher = {European Mathematical Society Publishing House, Z{\"{u}}rich,
Switzerland},
year = {2021},
url = {https://doi.org/10.4171/Automata-2/14},
doi = {10.4171/AUTOMATA-2/14},
timestamp = {Mon, 11 Apr 2022 14:12:30 +0200},
biburl = {https://dblp.org/rec/books/ems/21/Etessami21.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}
}
@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/rp/EtessamiM20,
author = {Kousha Etessami and
Emanuel Martinov},
editor = {Sylvain Schmitz and
Igor Potapov},
title = {Qualitative Multi-objective Reachability for Ordered Branching MDPs},
booktitle = {Reachability Problems - 14th International Conference, {RP} 2020,
Paris, France, October 19-21, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12448},
pages = {67--82},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-61739-4\_5},
doi = {10.1007/978-3-030-61739-4\_5},
timestamp = {Thu, 22 Oct 2020 11:34:52 +0200},
biburl = {https://dblp.org/rec/conf/rp/EtessamiM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2008-10591,
author = {Kousha Etessami and
Emanuel Martinov},
title = {Qualitative Multi-Objective Reachability for Ordered Branching MDPs},
journal = {CoRR},
volume = {abs/2008.10591},
year = {2020},
url = {https://arxiv.org/abs/2008.10591},
eprinttype = {arXiv},
eprint = {2008.10591},
timestamp = {Fri, 28 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2008-10591.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}
}
@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 = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/icalp/EtessamiMSY19.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/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/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/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/lics/Etessami17,
author = {Kousha Etessami},
title = {Algorithms for some infinite-state MDPs and stochastic games},
booktitle = {32nd Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
2017, Reykjavik, Iceland, June 20-23, 2017},
pages = {1},
publisher = {{IEEE} Computer Society},
year = {2017},
url = {https://doi.org/10.1109/LICS.2017.8005063},
doi = {10.1109/LICS.2017.8005063},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/Etessami17.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/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}
}
@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/sagt/EtessamiHMS14,
author = {Kousha Etessami and
Kristoffer Arnsfelt Hansen and
Peter Bro Miltersen and
Troels Bjerre S{\o}rensen},
editor = {Ron Lavi},
title = {The Complexity of Approximating a Trembling Hand Perfect Equilibrium
of a Multi-player Game in Strategic Form},
booktitle = {Algorithmic Game Theory - 7th International Symposium, {SAGT} 2014,
Haifa, Israel, September 30 - October 2, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8768},
pages = {231--243},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44803-8\_20},
doi = {10.1007/978-3-662-44803-8\_20},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/sagt/EtessamiHMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EtessamiHMS14,
author = {Kousha Etessami and
Kristoffer Arnsfelt Hansen and
Peter Bro Miltersen and
Troels Bjerre S{\o}rensen},
title = {The complexity of approximating a trembling hand perfect equilibrium
of a multi-player game in strategic form},
journal = {CoRR},
volume = {abs/1408.1017},
year = {2014},
url = {http://arxiv.org/abs/1408.1017},
eprinttype = {arXiv},
eprint = {1408.1017},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EtessamiHMS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Etessami14,
author = {Kousha Etessami},
title = {The complexity of computing a (perfect) equilibrium for an n-player
extensive form game of perfect recall},
journal = {CoRR},
volume = {abs/1408.1233},
year = {2014},
url = {http://arxiv.org/abs/1408.1233},
eprinttype = {arXiv},
eprint = {1408.1233},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Etessami14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BrazdilBEK13,
author = {Tom{\'{a}}s Br{\'{a}}zdil and
V{\'{a}}clav Brozek and
Kousha Etessami and
Anton{\'{\i}}n Kucera},
title = {Approximating the termination value of one-counter MDPs and stochastic
games},
journal = {Inf. Comput.},
volume = {222},
pages = {121--138},
year = {2013},
url = {https://doi.org/10.1016/j.ic.2012.01.008},
doi = {10.1016/J.IC.2012.01.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BrazdilBEK13.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/lata/Etessami13,
author = {Kousha Etessami},
editor = {Adrian{-}Horia Dediu and
Carlos Mart{\'{\i}}n{-}Vide and
Bianca Truthe},
title = {Algorithms for Analyzing and Verifying Infinite-State Recursive Probabilistic
Systems},
booktitle = {Language and Automata Theory and Applications - 7th International
Conference, {LATA} 2013, Bilbao, Spain, April 2-5, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7810},
pages = {12},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-37064-9\_2},
doi = {10.1007/978-3-642-37064-9\_2},
timestamp = {Mon, 16 Sep 2019 15:27:03 +0200},
biburl = {https://dblp.org/rec/conf/lata/Etessami13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Etessami13,
author = {Kousha Etessami},
editor = {Natacha Portier and
Thomas Wilke},
title = {The complexity of analyzing infinite-state Markov chains, Markov decision
processes, and stochastic games (Invited talk)},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
series = {LIPIcs},
volume = {20},
pages = {1--2},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.STACS.2013.1},
doi = {10.4230/LIPICS.STACS.2013.1},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/Etessami13.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/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/siamcomp/EtessamiMPWV12,
author = {Kousha Etessami and
Dieter van Melkebeek and
Seth Pettie and
John Watrous and
Salil P. Vadhan},
title = {Special Section on the Forty-Third Annual {ACM} Symposium on Theory
of Computing {(STOC} 2011)},
journal = {{SIAM} J. Comput.},
volume = {41},
number = {5},
pages = {1233--1234},
year = {2012},
url = {https://doi.org/10.1137/12097324X},
doi = {10.1137/12097324X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/EtessamiMPWV12.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/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/sttt/EtessamiG11,
author = {Kousha Etessami and
Patrice Godefroid},
title = {An abort-aware model of transactional programming},
journal = {Int. J. Softw. Tools Technol. Transf.},
volume = {13},
number = {6},
pages = {537--551},
year = {2011},
url = {https://doi.org/10.1007/s10009-011-0203-0},
doi = {10.1007/S10009-011-0203-0},
timestamp = {Thu, 02 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sttt/EtessamiG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BrazdilBEK11,
author = {Tom{\'{a}}s Br{\'{a}}zdil and
V{\'{a}}clav Brozek and
Kousha Etessami and
Anton{\'{\i}}n Kucera},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Approximating the Termination Value of One-Counter MDPs and Stochastic
Games},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6756},
pages = {332--343},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22012-8\_26},
doi = {10.1007/978-3-642-22012-8\_26},
timestamp = {Fri, 30 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BrazdilBEK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-4978,
author = {Tom{\'{a}}s Br{\'{a}}zdil and
V{\'{a}}clav Brozek and
Kousha Etessami and
Anton{\'{\i}}n Kucera},
title = {Approximating the Termination Value of One-Counter MDPs and Stochastic
Games},
journal = {CoRR},
volume = {abs/1104.4978},
year = {2011},
url = {http://arxiv.org/abs/1104.4978},
eprinttype = {arXiv},
eprint = {1104.4978},
timestamp = {Fri, 30 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-4978.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/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/fsttcs/BrazdilBE10,
author = {Tom{\'{a}}s Br{\'{a}}zdil and
V{\'{a}}clav Brozek and
Kousha Etessami},
editor = {Kamal Lodaya and
Meena Mahajan},
title = {One-Counter Stochastic Games},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2010, December 15-18, 2010,
Chennai, India},
series = {LIPIcs},
volume = {8},
pages = {108--119},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2010.108},
doi = {10.4230/LIPICS.FSTTCS.2010.108},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/BrazdilBE10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BrazdilBEKW10,
author = {Tom{\'{a}}s Br{\'{a}}zdil and
V{\'{a}}clav Brozek and
Kousha Etessami and
Anton{\'{\i}}n Kucera and
Dominik Wojtczak},
editor = {Moses Charikar},
title = {One-Counter Markov Decision Processes},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {863--874},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.70},
doi = {10.1137/1.9781611973075.70},
timestamp = {Tue, 02 Feb 2021 17:07:39 +0100},
biburl = {https://dblp.org/rec/conf/soda/BrazdilBEKW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-5636,
author = {Tom{\'{a}}s Br{\'{a}}zdil and
V{\'{a}}clav Brozek and
Kousha Etessami},
title = {One-Counter Stochastic Games},
journal = {CoRR},
volume = {abs/1009.5636},
year = {2010},
url = {http://arxiv.org/abs/1009.5636},
eprinttype = {arXiv},
eprint = {1009.5636},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-5636.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}
}
@inproceedings{DBLP:conf/vmcai/EtessamiG09,
author = {Kousha Etessami and
Patrice Godefroid},
editor = {Neil D. Jones and
Markus M{\"{u}}ller{-}Olm},
title = {An Abort-Aware Model of Transactional Programming},
booktitle = {Verification, Model Checking, and Abstract Interpretation, 10th International
Conference, {VMCAI} 2009, Savannah, GA, USA, January 18-20, 2009.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5403},
pages = {59--73},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-540-93900-9\_9},
doi = {10.1007/978-3-540-93900-9\_9},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/vmcai/EtessamiG09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0904-2511,
author = {Tom{\'{a}}s Br{\'{a}}zdil and
V{\'{a}}clav Brozek and
Kousha Etessami and
Anton{\'{\i}}n Kucera and
Dominik Wojtczak},
title = {One-Counter Markov Decision Processes},
journal = {CoRR},
volume = {abs/0904.2511},
year = {2009},
url = {http://arxiv.org/abs/0904.2511},
eprinttype = {arXiv},
eprint = {0904.2511},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0904-2511.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijgt/EtessamiL08,
author = {Kousha Etessami and
Andreas Lochbihler},
title = {The computational complexity of evolutionarily stable strategies},
journal = {Int. J. Game Theory},
volume = {37},
number = {1},
pages = {93--113},
year = {2008},
url = {https://doi.org/10.1007/s00182-007-0095-0},
doi = {10.1007/S00182-007-0095-0},
timestamp = {Sat, 16 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijgt/EtessamiL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/AlurABEIL08,
author = {Rajeev Alur and
Marcelo Arenas and
Pablo Barcel{\'{o}} and
Kousha Etessami and
Neil Immerman and
Leonid Libkin},
title = {First-Order and Temporal Logics for Nested Words},
journal = {Log. Methods Comput. Sci.},
volume = {4},
number = {4},
year = {2008},
url = {https://doi.org/10.2168/LMCS-4(4:11)2008},
doi = {10.2168/LMCS-4(4:11)2008},
timestamp = {Thu, 25 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/AlurABEIL08.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}
}
@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}
}
@article{DBLP:journals/corr/abs-0811-0537,
author = {Rajeev Alur and
Marcelo Arenas and
Pablo Barcel{\'{o}} and
Kousha Etessami and
Neil Immerman and
Leonid Libkin},
title = {First-Order and Temporal Logics for Nested Words},
journal = {CoRR},
volume = {abs/0811.0537},
year = {2008},
url = {http://arxiv.org/abs/0811.0537},
eprinttype = {arXiv},
eprint = {0811.0537},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0811-0537.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/lics/AlurABEIL07,
author = {Rajeev Alur and
Marcelo Arenas and
Pablo Barcel{\'{o}} and
Kousha Etessami and
Neil Immerman and
Leonid Libkin},
title = {First-Order and Temporal Logics for Nested Words},
booktitle = {22nd {IEEE} Symposium on Logic in Computer Science {(LICS} 2007),
10-12 July 2007, Wroclaw, Poland, Proceedings},
pages = {151--160},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/LICS.2007.19},
doi = {10.1109/LICS.2007.19},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/AlurABEIL07.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}
}
@inproceedings{DBLP:conf/tacas/WojtczakE07,
author = {Dominik Wojtczak and
Kousha Etessami},
editor = {Orna Grumberg and
Michael Huth},
title = {PReMo : An Analyzer for {P} robabilistic Re cursive Mo dels},
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 = {66--71},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-71209-1\_7},
doi = {10.1007/978-3-540-71209-1\_7},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tacas/WojtczakE07.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/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}
}
@article{DBLP:journals/siamcomp/EtessamiWS05,
author = {Kousha Etessami and
Thomas Wilke and
Rebecca A. Schuller},
title = {Fair Simulation Relations, Parity Games, and State Space Reduction
for Bu"chi Automata},
journal = {{SIAM} J. Comput.},
volume = {34},
number = {5},
pages = {1159--1175},
year = {2005},
url = {https://doi.org/10.1137/S0097539703420675},
doi = {10.1137/S0097539703420675},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/EtessamiWS05.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/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/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/AlurCEM05,
author = {Rajeev Alur and
Swarat Chaudhuri and
Kousha Etessami and
P. Madhusudan},
editor = {Nicolas Halbwachs and
Lenore D. Zuck},
title = {On-the-Fly Reachability and Cycle Detection for Recursive 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 = {61--76},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-31980-1\_5},
doi = {10.1007/978-3-540-31980-1\_5},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/tacas/AlurCEM05.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, 26 Jun 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tacas/EtessamiY05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/cav/2005,
editor = {Kousha Etessami and
Sriram K. Rajamani},
title = {Computer Aided Verification, 17th International Conference, {CAV}
2005, Edinburgh, Scotland, UK, July 6-10, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3576},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/b138445},
doi = {10.1007/B138445},
isbn = {3-540-27231-3},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cav/2005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/EsparzaE04,
author = {Javier Esparza and
Kousha Etessami},
editor = {Kamal Lodaya and
Meena Mahajan},
title = {Verifying Probabilistic Procedural Programs},
booktitle = {{FSTTCS} 2004: Foundations of Software Technology and Theoretical
Computer Science, 24th International Conference, Chennai, India, December
16-18, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3328},
pages = {16--31},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30538-5\_2},
doi = {10.1007/978-3-540-30538-5\_2},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/EsparzaE04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tacas/AlurEM04,
author = {Rajeev Alur and
Kousha Etessami and
P. Madhusudan},
editor = {Kurt Jensen and
Andreas Podelski},
title = {A Temporal Logic of Nested Calls and Returns},
booktitle = {Tools and Algorithms for the Construction and Analysis of Systems,
10th International Conference, {TACAS} 2004, Held as Part of the Joint
European Conferences on Theory and Practice of Software, {ETAPS} 2004,
Barcelona, Spain, March 29 - April 2, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2988},
pages = {467--481},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24730-2\_35},
doi = {10.1007/978-3-540-24730-2\_35},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/tacas/AlurEM04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/vmcai/Etessami04,
author = {Kousha Etessami},
editor = {Bernhard Steffen and
Giorgio Levi},
title = {Analysis of Recursive Game Graphs Using Data Flow Equations},
booktitle = {Verification, Model Checking, and Abstract Interpretation, 5th International
Conference, {VMCAI} 2004, Venice, Italy, January 11-13, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2937},
pages = {282--296},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24622-0\_23},
doi = {10.1007/978-3-540-24622-0\_23},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/vmcai/Etessami04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-055,
author = {Kousha Etessami and
Andreas Lochbihler},
title = {The computational complexity of Evolutionarily Stable Strategies},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-055}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-055/index.html},
eprinttype = {ECCC},
eprint = {TR04-055},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-055.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/iandc/EtessamiVW02,
author = {Kousha Etessami and
Moshe Y. Vardi and
Thomas Wilke},
title = {First-Order Logic with Two Variables and Unary Temporal Logic},
journal = {Inf. Comput.},
volume = {179},
number = {2},
pages = {279--295},
year = {2002},
url = {https://doi.org/10.1006/inco.2001.2953},
doi = {10.1006/INCO.2001.2953},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/EtessamiVW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/Etessami02,
author = {Kousha Etessami},
editor = {Lubos Brim and
Petr Jancar and
Mojm{\'{\i}}r Kret{\'{\i}}nsk{\'{y}} and
Anton{\'{\i}}n Kucera},
title = {A Hierarchy of Polynomial-Time Computable Simulations for Automata},
booktitle = {{CONCUR} 2002 - Concurrency Theory, 13th International Conference,
Brno, Czech Republic, August 20-23, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2421},
pages = {131--144},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45694-5\_10},
doi = {10.1007/3-540-45694-5\_10},
timestamp = {Fri, 30 Aug 2019 10:02:28 +0200},
biburl = {https://dblp.org/rec/conf/concur/Etessami02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/AlurETP01,
author = {Rajeev Alur and
Kousha Etessami and
Salvatore La Torre and
Doron A. Peled},
title = {Parametric temporal logic for "model measuring"},
journal = {{ACM} Trans. Comput. Log.},
volume = {2},
number = {3},
pages = {388--407},
year = {2001},
url = {https://doi.org/10.1145/377978.377990},
doi = {10.1145/377978.377990},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/AlurETP01.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/EtessamiWS01,
author = {Kousha Etessami and
Thomas Wilke and
Rebecca A. Schuller},
editor = {Fernando Orejas and
Paul G. Spirakis and
Jan van Leeuwen},
title = {Fair Simulation Relations, Parity Games, and State Space Reduction
for B{\"{u}}chi Automata},
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 = {694--707},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-48224-5\_57},
doi = {10.1007/3-540-48224-5\_57},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/EtessamiWS01.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, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AlurEY01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/re/SmithHE01,
author = {Margaret H. Smith and
Gerard J. Holzmann and
Kousha Etessami},
title = {Events and Constraints: {A} Graphical Editor for Capturing Logic Requirements
of Programs},
booktitle = {5th {IEEE} International Symposium on Requirements Engineering {(RE}
2001), 27-31 August 2001, Toronto, Canada},
pages = {14--22},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/ISRE.2001.948539},
doi = {10.1109/ISRE.2001.948539},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/re/SmithHE01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/EtessamiI00,
author = {Kousha Etessami and
Neil Immerman},
title = {Tree Canonization and Transitive Closure},
journal = {Inf. Comput.},
volume = {157},
number = {1-2},
pages = {2--24},
year = {2000},
url = {https://doi.org/10.1006/inco.1999.2835},
doi = {10.1006/INCO.1999.2835},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/EtessamiI00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/EtessamiW00,
author = {Kousha Etessami and
Thomas Wilke},
title = {An Until Hierarchy and Other Applications of an Ehrenfeucht-Fra{\"{\i}}ss{\'{e}}
Game for Temporal Logic},
journal = {Inf. Comput.},
volume = {160},
number = {1-2},
pages = {88--108},
year = {2000},
url = {https://doi.org/10.1006/inco.1999.2846},
doi = {10.1006/INCO.1999.2846},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/EtessamiW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Etessami00,
author = {Kousha Etessami},
title = {A note on a question of Peled and Wilke regarding stutter-invariant
{LTL}},
journal = {Inf. Process. Lett.},
volume = {75},
number = {6},
pages = {261--263},
year = {2000},
url = {https://doi.org/10.1016/S0020-0190(00)00113-7},
doi = {10.1016/S0020-0190(00)00113-7},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Etessami00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/concur/EtessamiH00,
author = {Kousha Etessami and
Gerard J. Holzmann},
editor = {Catuscia Palamidessi},
title = {Optimizing B{\"{u}}chi Automata},
booktitle = {{CONCUR} 2000 - Concurrency Theory, 11th International Conference,
University Park, PA, USA, August 22-25, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1877},
pages = {153--167},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44618-4\_13},
doi = {10.1007/3-540-44618-4\_13},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/concur/EtessamiH00.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/cav/Etessami99,
author = {Kousha Etessami},
editor = {Nicolas Halbwachs and
Doron A. Peled},
title = {Stutter-Invariant Languages, omega-Automata, and Temporal Logic},
booktitle = {Computer Aided Verification, 11th International Conference, {CAV}
'99, Trento, Italy, July 6-10, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1633},
pages = {236--248},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48683-6\_22},
doi = {10.1007/3-540-48683-6\_22},
timestamp = {Tue, 14 May 2019 10:00:43 +0200},
biburl = {https://dblp.org/rec/conf/cav/Etessami99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AlurTEP99,
author = {Rajeev Alur and
Kousha Etessami and
Salvatore La Torre and
Doron A. Peled},
editor = {Jir{\'{\i}} Wiedermann and
Peter van Emde Boas and
Mogens Nielsen},
title = {Parametric Temporal Logic for "Model Measuring"},
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 = {159--168},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48523-6\_13},
doi = {10.1007/3-540-48523-6\_13},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AlurTEP99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/Etessami98,
author = {Kousha Etessami},
editor = {Alberto O. Mendelzon and
Jan Paredaens},
title = {Dynamic Tree Isomorphism via First-Order Updates},
booktitle = {Proceedings of the Seventeenth {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, June 1-3, 1998, Seattle, Washington,
{USA}},
pages = {235--243},
publisher = {{ACM} Press},
year = {1998},
url = {https://doi.org/10.1145/275487.275514},
doi = {10.1145/275487.275514},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/Etessami98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Etessami97,
author = {Kousha Etessami},
title = {Counting Quantifiers, Successor Relations, and Logarithmic Space},
journal = {J. Comput. Syst. Sci.},
volume = {54},
number = {3},
pages = {400--411},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1485},
doi = {10.1006/JCSS.1997.1485},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Etessami97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/EtessamiVW97,
author = {Kousha Etessami and
Moshe Y. Vardi and
Thomas Wilke},
title = {First-Order Logic with Two Variables and Unary Temporal Logic},
booktitle = {Proceedings, 12th Annual {IEEE} Symposium on Logic in Computer Science,
Warsaw, Poland, June 29 - July 2, 1997},
pages = {228--235},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/LICS.1997.614950},
doi = {10.1109/LICS.1997.614950},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/EtessamiVW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/EtessamiW96,
author = {Kousha Etessami and
Thomas Wilke},
title = {An Until Hierarchy for Temporal Logic},
booktitle = {Proceedings, 11th Annual {IEEE} Symposium on Logic in Computer Science,
New Brunswick, New Jersey, USA, July 27-30, 1996},
pages = {108--117},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/LICS.1996.561310},
doi = {10.1109/LICS.1996.561310},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/EtessamiW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/EtessamiI95,
author = {Kousha Etessami and
Neil Immerman},
title = {Reachability and the Power of Local Ordering},
journal = {Theor. Comput. Sci.},
volume = {148},
number = {2},
pages = {261--279},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)00034-T},
doi = {10.1016/0304-3975(95)00034-T},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/EtessamiI95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Etessami95,
author = {Kousha Etessami},
title = {Counting Quantifiers, Successor Relations, and Logarithmic Space},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {2--11},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514723},
doi = {10.1109/SCT.1995.514723},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Etessami95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/EtessamiI95,
author = {Kousha Etessami and
Neil Immerman},
title = {Tree Canonization and Transitive Closure},
booktitle = {Proceedings, 10th Annual {IEEE} Symposium on Logic in Computer Science,
San Diego, California, USA, June 26-29, 1995},
pages = {331--341},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/LICS.1995.523268},
doi = {10.1109/LICS.1995.523268},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/EtessamiI95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/EtessamiI94,
author = {Kousha Etessami and
Neil Immerman},
editor = {Patrice Enjalbert and
Ernst W. Mayr and
Klaus W. Wagner},
title = {Reachability and the Power of Local Ordering},
booktitle = {{STACS} 94, 11th Annual Symposium on Theoretical Aspects of Computer
Science, Caen, France, February 24-26, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {775},
pages = {123--135},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57785-8\_136},
doi = {10.1007/3-540-57785-8\_136},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/EtessamiI94.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 2023-09-27 22:49 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:
