E
[vEB97] Peter van Emde Boas. The convenience of tiling. In Andrea Sorbi (eds.), Complexity, Logic and Recursion Theory, Lecture Notes in Pure and Applied Mathematics 187, pages 331-363. Marcel Dekker Inc., February 1997. 
@incollection{lnpam187-Emd,
  author =              {van Emde Boas, Peter},
  title =               {The convenience of tiling},
  editor =              {Sorbi, Andrea},
  booktitle =           {Complexity, Logic and Recursion Theory},
  publisher =           {Marcel Dekker Inc.},
  series =              {Lecture Notes in Pure and Applied Mathematics},
  volume =              {187},
  pages =               {331-363},
  year =                {1997},
  month =               feb,
}
[EC80] E. Allen Emerson and Edmund M. Clarke. Characterizing Correctness Properties of Parallel Programs Using Fixpoints. In ICALP'80, Lecture Notes in Computer Science 85, pages 169-181. Springer-Verlag, July 1980. 
@inproceedings{icalp1980-EC,
  author =              {Emerson, E. Allen and Clarke, Edmund M.},
  title =               {Characterizing Correctness Properties of Parallel
                         Programs Using Fixpoints},
  editor =              {de~Bakker, Jaco W. and van Leeuwen, Jan},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'80)},
  acronym =             {{ICALP}'80},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {85},
  pages =               {169-181},
  year =                {1980},
  month =               jul,
}
[EC82] E. Allen Emerson and Edmund M. Clarke. Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons. Science of Computer Programming 2(3):241-266. North-Holland, December 1982. 
@article{scp2(3)-EC,
  author =              {Emerson, E. Allen and Clarke, Edmund M.},
  title =               {Using Branching Time Temporal Logic to Synthesize
                         Synchronization Skeletons},
  publisher =           {North-Holland},
  journal =             {Science of Computer Programming},
  volume =              {2},
  number =              {3},
  pages =               {241-266},
  year =                {1982},
  month =               dec,
}
[EF95] Heinz-Dieter Ebbinghaus and Jörg Flum. Finite Model Theory. Springer-Verlag, 1995. 
@book{fmt1999-EF,
  author =              {Ebbinghaus, Heinz-Dieter and Flum, J{\"o}rg},
  title =               {Finite Model Theory},
  publisher =           {Springer-Verlag},
  year =                {1995},
}
[EF13] Daniel Ejsing-Dunn and Lisa Fontani. Infinite Runs in Recharge Automata. Master's thesis, Computer Science Department, Aalborg University, Denmark, June 2013. 
@mastersthesis{master13-EF,
  author =              {Ejsing{-}Dunn, Daniel and Fontani, Lisa},
  title =               {Infinite Runs in Recharge Automata},
  year =                {2013},
  month =               jun,
  school =              {Computer Science Department, Aalborg University,
                         Denmark},
}
[EFG+10] Rüdiger Ehlers, Daniel Fass, Michael Gerke, and Hans-Jörg Peter. Fully Symbolic Timed Model Checking Using Constraint Matrix Diagrams. In RTSS'10, pages 360-371. IEEE Comp. Soc. Press, November 2010. 
@inproceedings{rtss2010-EFGP,
  author =              {Ehlers, R{\"u}diger and Fass, Daniel and Gerke,
                         Michael and Peter, Hans-J{\"o}rg},
  title =               {Fully Symbolic Timed Model Checking Using Constraint
                         Matrix Diagrams},
  booktitle =           {{P}roceedings of the 31st {IEEE} {S}ymposium on
                         {R}eal-Time {S}ystems ({RTSS}'10)},
  acronym =             {{RTSS}'10},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {360-371},
  year =                {2010},
  month =               nov,
  doi =                 {10.1109/RTSS.2010.36},
}
[EFM99] Javier Esparza, Alain Finkel, and Richard Mayr. On the verification of broadcast protocols. In LICS'99, pages 352-359. IEEE Comp. Soc. Press, July 1999. 
@inproceedings{lics1999-EFM,
  author =              {Esparza, Javier and Finkel, Alain and Mayr, Richard},
  title =               {On the verification of broadcast protocols},
  booktitle =           {{P}roceedings of the 14th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'99)},
  acronym =             {{LICS}'99},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {352-359},
  year =                {1999},
  month =               jul,
  doi =                 {10.1109/LICS.1999.782630},
}
[EGL+15] Javier Esparza, Pierre Ganty, Jérôme Leroux, and Rupak Majumdar. Verification of Population Protocols. In CONCUR'15, Leibniz International Proceedings in Informatics 42, pages 470-482. Leibniz-Zentrum für Informatik, September 2015. 
@inproceedings{concur2015-EGLM,
  author =              {Esparza, Javier and Ganty, Pierre and Leroux,
                         J{\'e}r{\^o}me and Majumdar, Rupak},
  title =               {Verification of Population Protocols},
  editor =              {Aceto, Luca and de Frutos{-}Escrig, David},
  booktitle =           {{P}roceedings of the 26th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'15)},
  acronym =             {{CONCUR}'15},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {42},
  pages =               {470-482},
  year =                {2015},
  month =               sep,
  doi =                 {10.4230/LIPIcs.CONCUR.2015.470},
}
[EGL+16] Javier Esparza, Pierre Ganty, Jérôme Leroux, and Rupak Majumdar. Model checking Population Protocols. In FSTTCS'16, Leibniz International Proceedings in Informatics, pages 27:1-27:14. Leibniz-Zentrum für Informatik, December 2016. 
@inproceedings{fsttcs2016-EGLM,
  author =              {Esparza, Javier and Ganty, Pierre and Leroux,
                         J{\'e}r{\^o}me and Majumdar, Rupak},
  title =               {Model checking Population Protocols},
  editor =              {Akshay, S. and Lal, Akash and Saurabh, Saket and
                         Sen, Sandeep},
  booktitle =           {{P}roceedings of the 36th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'16)},
  acronym =             {{FSTTCS}'16},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  pages =               {27:1-27:14},
  year =                {2016},
  month =               dec,
  doi =                 {10.4230/LIPIcs.FSTTCS.2016.27},
}
[EGL+17] Javier Esparza, Pierre Ganty, Jérôme Leroux, and Rupak Majumdar. Verification of Population Protocols. Acta Informatica 54(2):191-215. Springer-Verlag, March 2017. 
@article{atca54(2)-EGLM,
  author =              {Esparza, Javier and Ganty, Pierre and Leroux,
                         J{\'e}r{\^o}me and Majumdar, Rupak},
  title =               {Verification of Population Protocols},
  publisher =           {Springer-Verlag},
  journal =             {Acta Informatica},
  volume =              {54},
  number =              {2},
  pages =               {191-215},
  year =                {2017},
  month =               mar,
  doi =                 {10.1007/s00236-016-0272-3},
}
[EGM13] Javier Esparza, Pierre Ganty, and Rupak Majumdar. Parameterized verification of asynchronous shared-memory systems. In CAV'13, Lecture Notes in Computer Science 8044, pages 124-140. Springer-Verlag, July 2013. 
@inproceedings{cav2013-EGM,
  author =              {Esparza, Javier and Ganty, Pierre and Majumdar,
                         Rupak},
  title =               {Parameterized verification of asynchronous
                         shared-memory systems},
  editor =              {Sharygina, Natasha and Veith, Helmut},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'13)},
  acronym =             {{CAV}'13},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {8044},
  pages =               {124-140},
  year =                {2013},
  month =               jul,
  doi =                 {10.1007/978-3-642-39799-8_8},
}
[EH83] E. Allen Emerson and Joseph Y. Halpern. "Sometimes" and "Not Never" Revisited: On Branching versus Linear Time. In POPL'83, pages 127-140. ACM Press, January 1983. 
@inproceedings{popl1983-EH,
  author =              {Emerson, E. Allen and Halpern, Joseph Y.},
  title =               {{"}{S}ometimes{"} and {"}Not Never{"} Revisited:
                         On~Branching versus Linear Time},
  booktitle =           {Conference Record of the 10th {ACM} {S}ymposium on
                         {P}rinciples of {P}rogramming {L}anguages
                         ({POPL}'83)},
  acronym =             {{POPL}'83},
  publisher =           {ACM Press},
  pages =               {127-140},
  year =                {1983},
  month =               jan,
}
[EH85] E. Allen Emerson and Joseph Y. Halpern. Decision Procedures and Expressiveness in the Temporal Logic of Branching Time. Journal of Computer and System Sciences 30(1):1-24. Academic Press, February 1985. 
@article{jcss30(1)-EH,
  author =              {Emerson, E. Allen and Halpern, Joseph Y.},
  title =               {Decision Procedures and Expressiveness in the
                         Temporal Logic of Branching Time},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {30},
  number =              {1},
  pages =               {1-24},
  year =                {1985},
  month =               feb,
}
[EH86] E. Allen Emerson and Joseph Y. Halpern. "Sometimes" and "Not Never" Revisited: On Branching versus Linear Time Temporal Logic. Journal of the ACM 33(1):151-178. ACM Press, January 1986. 
@article{jacm33(1)-EH,
  author =              {Emerson, E. Allen and Halpern, Joseph Y.},
  title =               {{"}{S}ometimes{"} and {"}Not Never{"} Revisited:
                         On~Branching versus Linear Time Temporal Logic},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {33},
  number =              {1},
  pages =               {151-178},
  year =                {1986},
  month =               jan,
}
[Ehl13] Rüdiger Ehlers. Symmetric and Efficient Synthesis. PhD thesis, Saarland University, Germany, October 2013. 
@phdthesis{phd-ehlers,
  author =              {Ehlers, R{\"u}diger},
  title =               {Symmetric and Efficient Synthesis},
  year =                {2013},
  month =               oct,
  school =              {Saarland University, Germany},
}
[Ehr61] Andrzej Ehrenfeucht. An Application of Games to the Completeness Problem for Formalized Theories. Fundamenta Mathematicae 49:129-141. Institute of Mathematics, Polish Academy of Science, 1961. 
@article{fundm49-Ehr,
  author =              {Ehrenfeucht, Andrzej},
  title =               {An Application of Games to the Completeness Problem
                         for Formalized Theories},
  publisher =           {Institute of Mathematics, Polish Academy of Science},
  journal =             {Fundamenta Mathematicae},
  volume =              {49},
  pages =               {129-141},
  year =                {1961},
}
[EJ88] E. Allen Emerson and Charanjit S. Jutla. The Complexity of Tree Automata and Logics of Programs. In FOCS'88, pages 328-337. IEEE Comp. Soc. Press, October 1988. 
@inproceedings{focs1988-EJ,
  author =              {Emerson, E. Allen and Jutla, Charanjit S.},
  title =               {The Complexity of Tree Automata and Logics of
                         Programs},
  booktitle =           {{P}roceedings of the 29th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'88)},
  acronym =             {{FOCS}'88},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {328-337},
  year =                {1988},
  month =               oct,
}
[EJ91] E. Allen Emerson and Charanjit S. Jutla. Tree Automata, Mu-Calculus and Determinacy. In FOCS'91, pages 368-377. IEEE Comp. Soc. Press, October 1991. 
@inproceedings{focs1991-EJ,
  author =              {Emerson, E. Allen and Jutla, Charanjit S.},
  title =               {Tree Automata, Mu-Calculus and Determinacy},
  booktitle =           {{P}roceedings of the 32nd {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'91)},
  acronym =             {{FOCS}'91},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {368-377},
  year =                {1991},
  month =               oct,
  doi =                 {10.1109/SFCS.1991.185392},
}
[EJ99] E. Allen Emerson and Charanjit S. Jutla. The Complexity of Tree Automata and Logics of Programs. SIAM Journal on Computing 29(1):132-158. Society for Industrial and Applied Math., September 1999. 
@article{siamcomp29(1)-EJ,
  author =              {Emerson, E. Allen and Jutla, Charanjit S.},
  title =               {The Complexity of Tree Automata and Logics of
                         Programs},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Computing},
  volume =              {29},
  number =              {1},
  pages =               {132-158},
  year =                {1999},
  month =               sep,
}
[EJS01] E. Allen Emerson, Charanjit S. Jutla, and A. Prasad Sistla. On model checking for the Mu-calculus and its fragments. Theoretical Computer Science 258(1-2):491-522. Elsevier, May 2001. 
@article{tcs258(1-2)-EJS,
  author =              {Emerson, E. Allen and Jutla, Charanjit S. and
                         Sistla, A. Prasad},
  title =               {On model checking for the Mu-calculus and its
                         fragments},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {258},
  number =              {1-2},
  pages =               {491-522},
  year =                {2001},
  month =               may,
}
[EJT10] Michael Elberfeld, Andreas Jakoby, and Till Tantau. Logspace Versions of the Theorems of Bodlaender and Courcelle. In FOCS'10, pages 143-152. IEEE Comp. Soc. Press, October 2010. 
@inproceedings{focs2010-EJT,
  author =              {Elberfeld, Michael and Jakoby, Andreas and Tantau,
                         Till},
  title =               {Logspace Versions of the Theorems of {B}odlaender
                         and {C}ourcelle},
  booktitle =           {{P}roceedings of the 51st {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'10)},
  acronym =             {{FOCS}'10},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {143-152},
  year =                {2010},
  month =               oct,
  doi =                 {10.1109/FOCS.2010.21},
}
[EK00] E. Allen Emerson and Vineet Kahlon. Reducing Model Checking of the Many to the Few. In CADE'00, Lecture Notes in Artificial Intelligence 1831, pages 236-254. Springer-Verlag, June 2000. 
@inproceedings{cade2000-EK,
  author =              {Emerson, E. Allen and Kahlon, Vineet},
  title =               {Reducing Model Checking of the Many to the~Few},
  editor =              {McAllester, David},
  booktitle =           {{P}roceedings of the 17th {I}nternational
                         {C}onference on {A}utomated {D}eduction ({CADE}'00)},
  acronym =             {{CADE}'00},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Artificial Intelligence},
  volume =              {1831},
  pages =               {236-254},
  year =                {2000},
  month =               jun,
  doi =                 {10.1007/10721959_19},
}
[EL86] E. Allen Emerson and Chin-Laung Lei. Efficient Model Checking in Fragments of the Propositional Mu-Calculus. In LICS'86, pages 267-278. IEEE Comp. Soc. Press, June 1986. 
@inproceedings{lics1986-EL,
  author =              {Emerson, E. Allen and Lei, Chin-Laung},
  title =               {Efficient Model Checking in Fragments of the
                         Propositional Mu-Calculus},
  booktitle =           {{P}roceedings of the 1st {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'86)},
  acronym =             {{LICS}'86},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {267-278},
  year =                {1986},
  month =               jun,
}
[EL87] E. Allen Emerson and Chin-Laung Lei. Modalities for Model Checking: Branching Time Logic Strikes Back. Science of Computer Programming 8(3):275-306. Elsevier, June 1987. 
@article{scp8(3)-EL,
  author =              {Emerson, E. Allen and Lei, Chin-Laung},
  title =               {Modalities for Model Checking: Branching Time Logic
                         Strikes Back},
  publisher =           {Elsevier},
  journal =             {Science of Computer Programming},
  volume =              {8},
  number =              {3},
  pages =               {275-306},
  year =                {1987},
  month =               jun,
}
[EM79] Andrzej Ehrenfeucht and Jan Mycielski. Positional strategies for mean payoff games. International Journal of Game Theory 8(2):109-113. Springer-Verlag, June 1979. 
@article{ijgt49-EM,
  author =              {Ehrenfeucht, Andrzej and Mycielski, Jan},
  title =               {Positional strategies for mean payoff games},
  publisher =           {Springer-Verlag},
  journal =             {International Journal of Game Theory},
  volume =              {8},
  number =              {2},
  pages =               {109-113},
  year =                {1979},
  month =               jun,
  doi =                 {10.1007/BF01768705},
}
[Eme90] E. Allen Emerson. Temporal and Modal Logic. In Jan van Leeuwen (eds.), Handbook of Theoretical Computer Science. Elsevier, 1990. 
@incollection{HTCSb1990-Eme,
  author =              {Emerson, E. Allen},
  title =               {Temporal and Modal Logic},
  editor =              {van Leeuwen, Jan},
  booktitle =           {Handbook of Theoretical Computer Science},
  publisher =           {Elsevier},
  volume =              {B},
  pages =               {995-1072},
  chapter =             {16},
  year =                {1990},
}
[Eme96] E. Allen Emerson. Automated Temporal Reasoning about Reactive Systems. In Banff'94, Lecture Notes in Computer Science 1043, pages 41-101. Springer-Verlag, 1996. 
@inproceedings{banff1994-Eme,
  author =              {Emerson, E. Allen},
  title =               {Automated Temporal Reasoning about Reactive Systems},
  editor =              {Moller, Faron and Birtwistle, Graham M.},
  booktitle =           {{L}ogics for {C}oncurrency, {S}tructure versus
                         {A}utomata: {P}roceedings of the 8th {B}anff
                         {H}igher {O}rder {W}orkshop ({B}anff'94)},
  acronym =             {{B}anff'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1043},
  pages =               {41-101},
  year =                {1996},
  confyear =            {1994},
  confmonth =           {8-9},
}
[Eme96] E. Allen Emerson. Model Checking and the Mu-calculus. In Neil Immerman and Phokion G. Kolaitis (eds.), Descriptive Complexity and Finite Models, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 31, pages 185-214. American Mathematical Society, 1996. 
@incollection{dimacs31-Eme,
  author =              {Emerson, E. Allen},
  title =               {Model Checking and the Mu-calculus},
  editor =              {Immerman, Neil and Kolaitis, Phokion G.},
  booktitle =           {Descriptive Complexity and Finite Models},
  publisher =           {American Mathematical Society},
  series =              {DIMACS Series in Discrete Mathematics and
                         Theoretical Computer Science},
  volume =              {31},
  pages =               {185-214},
  year =                {1996},
}
[EMP10] Rüdiger Ehlers, Robert Mattmüller, and Hans-Jörg Peter. Combining Symbolic Representations for Solving Timed Games. In FORMATS'10, Lecture Notes in Computer Science 6246, pages 107-212. Springer-Verlag, September 2010. 
@inproceedings{formats2010-EMP,
  author =              {Ehlers, R{\"u}diger and Mattm{\"u}ller, Robert and
                         Peter, Hans-J{\"o}rg},
  title =               {Combining Symbolic Representations for Solving Timed
                         Games},
  editor =              {Chatterjee, Krishnendu and Henzinger, Thomas A.},
  booktitle =           {{P}roceedings of the 8th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'10)},
  acronym =             {{FORMATS}'10},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {6246},
  pages =               {107-212},
  year =                {2010},
  month =               sep,
  doi =                 {10.1007/978-3-642-15297-9_10},
}
[EMS+92] E. Allen Emerson, Aloysius Ka-Lau Mok, A. Prasad Sistla, and Jayashankar Srinivasan. Quantitative Temporal Reasoning. Real-Time Systems 4:331-352. Kluwer Academic, 1992. 
@article{rts4()-EMSS,
  author =              {Emerson, E. Allen and Mok, Aloysius Ka-Lau and
                         Sistla, A. Prasad and Srinivasan, Jayashankar},
  title =               {Quantitative Temporal Reasoning},
  publisher =           {Kluwer Academic},
  journal =             {Real-Time Systems},
  volume =              {4},
  pages =               {331-352},
  year =                {1992},
}
[EN94] Javier Esparza and Mogens Nielsen. Decidability Issues for Petri Nets – A survey. EATCS Bulletin 52:244-262. EATCS, February 1994. 
@article{EN94,
  author =              {Esparza, Javier and Nielsen, Mogens},
  title =               {Decidability Issues for {P}etri Nets~-- A~survey},
  publisher =           {EATCS},
  journal =             {EATCS Bulletin},
  volume =              {52},
  pages =               {244-262},
  year =                {1994},
  month =               feb,
}
[EN03] E. Allen Emerson and Kedar Namjoshi. On Reasoning About Rings. International Journal of Foundations of Computer Science 14(4):527-550. August 2003. 
@article{ijfcs14(4)-EN,
  author =              {Emerson, E. Allen and Namjoshi, Kedar},
  title =               {On~Reasoning About Rings},
  journal =             {International Journal of Foundations of Computer
                         Science},
  volume =              {14},
  number =              {4},
  pages =               {527-550},
  year =                {2003},
  month =               aug,
  doi =                 {10.1142/S0129054103001881},
}
[END+02] Abdeslam En-Nouaary, Radhida Dssouli, and Ferhat Khendek. Timed Wp-Method: Testing Real-Time Systems. IEEE Transactions on Software Engineering 28(11):1023-1038. IEEE Comp. Soc. Press, November 2002. 
@article{tse28(11)-EDK,
  author =              {En-Nouaary, Abdeslam and Dssouli, Radhida and
                         Khendek, Ferhat},
  title =               {Timed Wp-Method: Testing Real-Time Systems},
  publisher =           {IEEE Comp. Soc. Press},
  journal =             {IEEE Transactions on Software Engineering},
  volume =              {28},
  number =              {11},
  pages =               {1023-1038},
  year =                {2002},
  month =               nov,
  doi =                 {10.1109/TSE.2002.1049402},
}
[ER09] Andrzej Ehrenfeucht and Grzegorz Rozenberg. Introducing Time in Reaction Systems. Theoretical Computer Science 410(4-5). Elsevier, February 2009. 
@article{tcs410(4-5)-ER,
  author =              {Ehrenfeucht, Andrzej and Rozenberg, Grzegorz},
  title =               {Introducing Time in Reaction Systems},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {410},
  number =              {4-5},
  year =                {2009},
  month =               feb,
  doi =                 {10.1016/j.tcs.2008.09.043},
}
[ES84] E. Allen Emerson and A. Prasad Sistla. Deciding Full Branching Time Logic. Information and Control 61(3):175-201. Academic Press, June 1984. 
@article{icont61(3)-ES,
  author =              {Emerson, E. Allen and Sistla, A. Prasad},
  title =               {Deciding Full Branching Time Logic},
  publisher =           {Academic Press},
  journal =             {Information and Control},
  volume =              {61},
  number =              {3},
  pages =               {175-201},
  year =                {1984},
  month =               jun,
}
[ES84] E. Allen Emerson and A. Prasad Sistla. Deciding Full Branching Time Logic: A Triple Exponential Decision Procedure for CTL*. In LOP'83, Lecture Notes in Computer Science 164, pages 176-192. Springer-Verlag, 1984. 
@inproceedings{lop1983-ES,
  author =              {Emerson, E. Allen and Sistla, A. Prasad},
  title =               {Deciding Full Branching Time Logic: A Triple
                         Exponential Decision Procedure for CTL{\(^*\)}},
  editor =              {Clarke, Edmund M. and Kozen, Dexter C.},
  booktitle =           {{P}roceedings of the 4th {W}orkshop on {L}ogics of
                         {P}rograms ({LOP}'83)},
  acronym =             {{LOP}'83},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {164},
  pages =               {176-192},
  year =                {1984},
  confyear =            {1983},
  confmonth =           {6},
}
[ES84] E. Allen Emerson and A. Prasad Sistla. Deciding Branching Time Logic. In STOC'84, pages 14-24. ACM Press, April 1984. 
@inproceedings{stoc1984-ES,
  author =              {Emerson, E. Allen and Sistla, A. Prasad},
  title =               {Deciding Branching Time Logic},
  booktitle =           {{P}roceedings of the 16th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'84)},
  acronym =             {{STOC}'84},
  publisher =           {ACM Press},
  pages =               {14-24},
  year =                {1984},
  month =               apr,
}
[ES88] E. Allen Emerson and Jayashankar Srinivasan. Branching Time Temporal Logic. In REX'88, Lecture Notes in Computer Science 354, pages 123-172. Springer-Verlag, May 1988. 
@inproceedings{rex1988-ES,
  author =              {Emerson, E. Allen and Srinivasan, Jayashankar},
  title =               {Branching Time Temporal Logic},
  editor =              {de~Bakker, Jaco W. and de Roever, Willem-Paul and
                         Rozenberg, Grzegorz},
  booktitle =           {{L}inear {T}ime, {B}ranching {T}ime and {P}artial
                         {O}rder in {L}ogics and {M}odels for
                         {C}oncurrency~--- {P}roceedings of {REX}
                         {S}chool{\slash}{W}orkshop~1988 ({REX}'88)},
  acronym =             {{REX}'88},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {354},
  pages =               {123-172},
  year =                {1988},
  month =               may,
}
[ES96] E. Allen Emerson and A. Prasad Sistla. Symmetry and model checking. Formal Methods in System Design 9(1-2):105-131. Kluwer Academic, August 1996. 
@article{fmsd9(1-2)-ES,
  author =              {Emerson, E. Allen and Sistla, A. Prasad},
  title =               {Symmetry and model checking},
  publisher =           {Kluwer Academic},
  journal =             {Formal Methods in System Design},
  volume =              {9},
  number =              {1-2},
  pages =               {105-131},
  year =                {1996},
  month =               aug,
  doi =                 {10.1007/BF00625970},
}
[Esp98] Javier Esparza. Decidability and Complexity of Petri Net Problems: An Introduction. In Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, Lecture Notes in Computer Science 1491, pages 374-428. Springer-Verlag, 1998. 
@inproceedings{acpn1-Esp,
  author =              {Esparza, Javier},
  title =               {Decidability and Complexity of {P}etri Net Problems:
                         An Introduction},
  editor =              {Reisig, Wolfgang and Rozenberg, Grzegorz},
  booktitle =           {Lectures on {P}etri Nets~{I}: Basic Models, Advances
                         in {P}etri Nets},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1491},
  pages =               {374-428},
  year =                {1998},
  confyear =            {1996},
  confmonth =           {9},
}
[Esp14] Javier Esparza. Keeping a Crowd Safe: On the Complexity of Parameterized Verification (Invited Talk). In STACS'14, Leibniz International Proceedings in Informatics 25, pages 1-10. Leibniz-Zentrum für Informatik, March 2014. 
@inproceedings{stacs2014-Esp,
  author =              {Esparza, Javier},
  title =               {Keeping a Crowd Safe: On the Complexity of
                         Parameterized Verification (Invited Talk)},
  editor =              {Mayr, Ernst W. and Portier, Natacha},
  booktitle =           {{P}roceedings of the 31st {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'14)},
  acronym =             {{STACS}'14},
  publisher =           {Leibniz-Zentrum f{\"u}r Informatik},
  series =              {Leibniz International Proceedings in Informatics},
  volume =              {25},
  pages =               {1-10},
  year =                {2014},
  month =               mar,
  doi =                 {10.4230/LIPIcs.STACS.2014.1},
}
[ESY84] Shimon Even, Alan L. Selman, and Yacov Yacobi. The complexity of promise problems with applications to public-key cryptography. Information and Control 61(2):159-173. Academic Press, May 1984. 
@article{icont61(2)-ESY,
  author =              {Even, Shimon and Selman, Alan L. and Yacobi, Yacov},
  title =               {The complexity of promise problems with applications
                         to public-key cryptography},
  publisher =           {Academic Press},
  journal =             {Information and Control},
  volume =              {61},
  number =              {2},
  pages =               {159-173},
  year =                {1984},
  month =               may,
  doi =                 {10.1016/S0019-9958(84)80056-X},
}
[ET96] E. Allen Emerson and Richard J. Trefler. Generalized Quantitative Temporal Reasoning. Technical Report 96-20, Department of Computer Science, University of Texas at Austin, USA, 1996. 
@techreport{TR-96-20-ET,
  author =              {Emerson, E. Allen and Trefler, Richard J.},
  title =               {Generalized Quantitative Temporal Reasoning},
  number =              {96-20},
  year =                {1996},
  institution =         {Department of Computer Science, University of Texas
                         at Austin, USA},
  type =                {Technical Report},
}
[ET97] E. Allen Emerson and Richard J. Trefler. Generalized Quantitative Temporal Reasoning. In TAPSOFT'97, Lecture Notes in Computer Science 1214, pages 189-200. Springer-Verlag, April 1997. 
@inproceedings{tapsoft1997-ET,
  author =              {Emerson, E. Allen and Trefler, Richard J.},
  title =               {Generalized Quantitative Temporal Reasoning},
  editor =              {Bidoit, Michel and Dauchet, Max},
  booktitle =           {{P}roceedings of the 7th {I}nternational {J}oint
                         {C}onference {CAAP}{\slash}{FASE} on {T}heory and
                         {P}ractice of {S}oftware {D}evelopment
                         ({TAPSOFT}'97)},
  acronym =             {{TAPSOFT}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1214},
  pages =               {189-200},
  year =                {1997},
  month =               apr,
}
[ET99] E. Allen Emerson and Richard J. Trefler. Parametric Quantitative Temporal Reasoning. In LICS'99, pages 336-343. IEEE Comp. Soc. Press, July 1999. 
@inproceedings{lics1999-ET,
  author =              {Emerson, E. Allen and Trefler, Richard J.},
  title =               {Parametric Quantitative Temporal Reasoning},
  booktitle =           {{P}roceedings of the 14th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'99)},
  acronym =             {{LICS}'99},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {336-343},
  year =                {1999},
  month =               jul,
}
[Ete99] Kousha Etessami. Stutter-Invariant Languages, ω-Automata, and Temporal Logic. In CAV'99, Lecture Notes in Computer Science 1633, pages 236-248. Springer-Verlag, July 1999. 
@inproceedings{cav1999-Ete,
  author =              {Etessami, Kousha},
  title =               {Stutter-Invariant Languages, {\(\omega\)}-Automata,
                         and Temporal Logic},
  editor =              {Halbwachs, Nicolas and Peled, Doron A.},
  booktitle =           {{P}roceedings of the 11th {I}nternational
                         {C}onference on {C}omputer {A}ided {V}erification
                         ({CAV}'99)},
  acronym =             {{CAV}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1633},
  pages =               {236-248},
  year =                {1999},
  month =               jul,
}
[Ete00] Kousha Etessami. A Note on a Question of Peled and Wilke Regarding Stutter-Invariant LTL. Information Processing Letters 75(6):261-263. Elsevier, November 2000. 
@article{ipl75(6)-Ete,
  author =              {Etessami, Kousha},
  title =               {A Note on a Question of {P}eled and {W}ilke
                         Regarding Stutter-Invariant {LTL}},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {75},
  number =              {6},
  pages =               {261-263},
  year =                {2000},
  month =               nov,
}
[Ete02] Kousha Etessami. A Hierarchy of Polynomial-Time Computable Simulations for Automata. In CONCUR'02, Lecture Notes in Computer Science 2421, pages 131-144. Springer-Verlag, August 2002. 
@inproceedings{concur2002-Ete,
  author =              {Etessami, Kousha},
  title =               {A Hierarchy of Polynomial-Time Computable
                         Simulations for Automata},
  editor =              {Brim, Lubo{\v s} and Jan{\v c}ar, Petr and K{\v
                         r}et{\'\i}nsk{\'y}, Mojm{\'\i}r and Ku{\v c}era,
                         Anton{\'\i}n},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'02)},
  acronym =             {{CONCUR}'02},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2421},
  pages =               {131-144},
  year =                {2002},
  month =               aug,
}
[EVW97] Kousha Etessami, Moshe Y. Vardi, and Thomas Wilke. First-Order Logic with Two Variables and Unary Temporal Logic. In LICS'97, pages 228-235. IEEE Comp. Soc. Press, June 1997. 
@inproceedings{lics1997-EVW,
  author =              {Etessami, Kousha and Vardi, Moshe Y. and Wilke,
                         Thomas},
  title =               {First-Order Logic with Two Variables and Unary
                         Temporal Logic},
  booktitle =           {{P}roceedings of the 12th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'97)},
  acronym =             {{LICS}'97},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {228-235},
  year =                {1997},
  month =               jun,
}
[EVW02] Kousha Etessami, Moshe Y. Vardi, and Thomas Wilke. First-Order Logic with Two Variables and Unary Temporal Logic. Information and Computation 179(2):279-295. Academic Press, December 2002. 
@article{icomp179(2)-EVW,
  author =              {Etessami, Kousha and Vardi, Moshe Y. and Wilke,
                         Thomas},
  title =               {First-Order Logic with Two Variables and Unary
                         Temporal Logic},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {179},
  number =              {2},
  pages =               {279-295},
  year =                {2002},
  month =               dec,
}
[EW96] Kousha Etessami and Thomas Wilke. An Until Hierarchy for Temporal Logic. In LICS'96, pages 108-117. IEEE Comp. Soc. Press, July 1996. 
@inproceedings{lics1996-EW,
  author =              {Etessami, Kousha and Wilke, Thomas},
  title =               {An Until Hierarchy for Temporal Logic},
  booktitle =           {{P}roceedings of the 11th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'96)},
  acronym =             {{LICS}'96},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {108-117},
  year =                {1996},
  month =               jul,
}
[EW00] Kousha Etessami and Thomas Wilke. An Until Hierarchy and Other Applications of an Ehrenfeucht-Fraïssé Game for Temporal Logic. Information and Computation 160(1-2):88-108. Academic Press, July 2000. 
@article{icomp160(1-2)-EW,
  author =              {Etessami, Kousha and Wilke, Thomas},
  title =               {An Until Hierarchy and Other Applications of an
                         Ehrenfeucht-Fra{\"i}ss{\'e} Game for Temporal Logic},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {160},
  number =              {1-2},
  pages =               {88-108},
  year =                {2000},
  month =               jul,
}
[EY05] Kousha Etessami and Mihalis Yannakakis. Recursive Markov Decision Processes and Recursive Stochastic Games. In ICALP'05, Lecture Notes in Computer Science 3580, pages 891-903. Springer-Verlag, July 2005. 
@inproceedings{icalp2005-EY,
  author =              {Etessami, Kousha and Yannakakis, Mihalis},
  title =               {Recursive {M}arkov Decision Processes and Recursive
                         Stochastic Games},
  editor =              {Caires, Lu{\'\i}s and Italiano, Giuseppe F. and
                         Monteiro, Lu{\'\i}s and Palamidessi, Catuscia and
                         Yung, Moti},
  booktitle =           {{P}roceedings of the 32nd {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'05)},
  acronym =             {{ICALP}'05},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {3580},
  pages =               {891-903},
  year =                {2005},
  month =               jul,
}
[EY07] Kousha Etessami and Mihalis Yannakakis. On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract). In FOCS'07, pages 113-123. IEEE Comp. Soc. Press, October 2007. 
@inproceedings{focs2007-EY,
  author =              {Etessami, Kousha and Yannakakis, Mihalis},
  title =               {On the Complexity of {N}ash Equilibria and Other
                         Fixed Points (Extended Abstract)},
  booktitle =           {{P}roceedings of the 48th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'07)},
  acronym =             {{FOCS}'07},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {113-123},
  year =                {2007},
  month =               oct,
}
List of authors