V
[Vaa07] Jouko Väänänen. Dependence Logic: A New Approach to Independence-Friendly Logic. London Mathematical Society Student Texts 70. Cambridge University Press, 2007. 
@book{DL07-Vaa,
  author =              {V{\"a}{\"a}n{\"a}nen, Jouko},
  title =               {Dependence Logic: A~New Approach to
                         Independence-Friendly Logic},
  publisher =           {Cambridge University Press},
  series =              {London Mathematical Society Student Texts},
  volume =              {70},
  year =                {2007},
  doi =                 {10.1017/CBO9780511611193},
}
[Val79] Leslie G. Valiant. The Complexity of Computing the Permanent. Theoretical Computer Science 8:189-201. Elsevier, 1979. 
@article{tcs8()-Val,
  author =              {Valiant, Leslie G.},
  title =               {The Complexity of Computing the Permanent},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {8},
  pages =               {189-201},
  year =                {1979},
}
[Val06] Antti Valmari. What the Small Rubik's Cube Taught Me on Data Structures, Information Theory and Randomization. International Journal on Software Tools for Technology Transfer 8(3):180-194. Springer-Verlag, June 2006. 
@article{sttt8(3)-Val,
  author =              {Valmari, Antti},
  title =               {What the Small {R}ubik's Cube Taught Me on Data
                         Structures, Information Theory and Randomization},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {8},
  number =              {3},
  pages =               {180-194},
  year =                {2006},
  month =               jun,
}
[Van16] Marie Van den Bogaard. Motifs de flot d'information dans les jeux à information imparfaite. Thèse de doctorat, Lab. Spécification & Vérification, ENS Cachan, France, December 2016. 
@phdthesis{phd-vdb2016,
  author =              {Van{~}den{ }Bogaard, Marie},
  title =               {Motifs de flot d'information dans les jeux {\`a}
                         information imparfaite},
  year =                {2016},
  month =               dec,
  school =              {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {Th\`ese de doctorat},
}
[Var82] Moshe Y. Vardi. The Complexity of Relational Query Languages. In STOC'82, pages 137-146. ACM Press, May 1982. 
@inproceedings{stoc1982-Var,
  author =              {Vardi, Moshe Y.},
  title =               {The Complexity of Relational Query Languages},
  booktitle =           {{P}roceedings of the 14th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'82)},
  acronym =             {{STOC}'82},
  publisher =           {ACM Press},
  pages =               {137-146},
  year =                {1982},
  month =               may,
}
[Var85] Moshe Y. Vardi. Automatic Verification of Probabilistic Concurrent Finite-State Programs. In FOCS'85, pages 327-338. IEEE Comp. Soc. Press, October 1985. 
@inproceedings{focs1985-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Automatic Verification of Probabilistic Concurrent
                         Finite-State Programs},
  booktitle =           {{P}roceedings of the 26th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'85)},
  acronym =             {{FOCS}'85},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {327-338},
  year =                {1985},
  month =               oct,
  doi =                 {10.1109/SFCS.1985.12},
}
[Var88] Moshe Y. Vardi. A Temporal Fixpoint Calculus. In POPL'88, pages 250-259. ACM Press, January 1988. 
@inproceedings{popl1988-Var,
  author =              {Vardi, Moshe Y.},
  title =               {A Temporal Fixpoint Calculus},
  booktitle =           {Conference Record of the 15th {ACM} {S}ymposium on
                         {P}rinciples of {P}rogramming {L}anguages
                         ({POPL}'88)},
  acronym =             {{POPL}'88},
  publisher =           {ACM Press},
  pages =               {250-259},
  year =                {1988},
  month =               jan,
}
[Var89] Moshe Y. Vardi. A Note on the Reduction of Two-Way Automata to One-Way Automata. Information Processing Letters 30(5):261-264. Elsevier, March 1989. 
@article{ipl30(5)-var,
  author =              {Vardi, Moshe Y.},
  title =               {A Note on the Reduction of Two-Way Automata to
                         One-Way Automata},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {30},
  number =              {5},
  pages =               {261-264},
  year =                {1989},
  month =               mar,
}
[Var94] Moshe Y. Vardi. Nontraditional Applications of Automata Theory. In TACS'94, Lecture Notes in Computer Science 789, pages 575-597. Springer-Verlag, April 1994. 
@inproceedings{tacs1994-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Nontraditional Applications of Automata Theory},
  editor =              {Hagiya, Masami and Mitchell, John C.},
  booktitle =           {{P}roceedings of the 2nd {I}nternational {S}ymposium
                         on {T}heoretical {A}spects of {C}omputer {S}oftware
                         ({TACS}'94)},
  acronym =             {{TACS}'94},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {789},
  pages =               {575-597},
  year =                {1994},
  month =               apr,
}
[Var95] Moshe Y. Vardi. Alternating Automata and Program Verification. In Jan van Leeuwen (eds.), Computer Science Today: Recent Trends and Developments, Lecture Notes in Computer Science 1000, pages 471-485. Springer-Verlag, 1995. 
@incollection{lncs1000-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Alternating Automata and Program Verification},
  editor =              {van Leeuwen, Jan},
  booktitle =           {Computer Science Today: Recent Trends and
                         Developments},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1000},
  pages =               {471-485},
  year =                {1995},
}
[Var96] Moshe Y. Vardi. An Automata-Theoretic Approach to Linear Temporal Logic. In Banff'94, Lecture Notes in Computer Science 1043, pages 238-266. Springer-Verlag, 1996. 
@inproceedings{banff1994-Var,
  author =              {Vardi, Moshe Y.},
  title =               {An Automata-Theoretic Approach to Linear Temporal
                         Logic},
  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 =               {238-266},
  year =                {1996},
  confyear =            {1994},
  confmonth =           {8-9},
}
[Var97] Moshe Y. Vardi. Alternating Automata: Checking Truth and Validity for Temporal Logics. In CADE'97, Lecture Notes in Artificial Intelligence 1249, pages 191-206. Springer-Verlag, July 1997. 
@inproceedings{cade1997-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Alternating Automata: Checking Truth and Validity
                         for Temporal Logics},
  editor =              {McCune, William},
  booktitle =           {{P}roceedings of the 14th {I}nternational
                         {C}onference on {A}utomated {D}eduction ({CADE}'97)},
  acronym =             {{CADE}'97},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Artificial Intelligence},
  volume =              {1249},
  pages =               {191-206},
  year =                {1997},
  month =               jul,
}
[Var98] Moshe Y. Vardi. Sometimes and Not Never Revisited: on Branching versus Linear Time. In CONCUR'98, Lecture Notes in Computer Science 1466, pages 1-17. Springer-Verlag, September 1998. 
@inproceedings{concur1998-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Sometimes and Not Never Revisited: on Branching
                         versus Linear Time},
  editor =              {Sangiorgi, Davide and de Simone, Robert},
  booktitle =           {{P}roceedings of the 9th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'98)},
  acronym =             {{CONCUR}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1466},
  pages =               {1-17},
  year =                {1998},
  month =               sep,
}
[Var98] Moshe Y. Vardi. Reasoning about the Past with Two-Way Automata. In ICALP'98, Lecture Notes in Computer Science 1443, pages 628-641. Springer-Verlag, July 1998. 
@inproceedings{icalp1998-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Reasoning about the Past with Two-Way Automata},
  editor =              {Larsen, Kim Guldstrand and Skyum, Sven and Winskel,
                         Glynn},
  booktitle =           {{P}roceedings of the 25th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'98)},
  acronym =             {{ICALP}'98},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1443},
  pages =               {628-641},
  year =                {1998},
  month =               jul,
}
[Var98] Moshe Y. Vardi. Linear versus Branching Time: a Complexity-Theoretic Approach. In LICS'98, pages 394-405. IEEE Comp. Soc. Press, June 1998. 
@inproceedings{lics1998-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Linear versus Branching Time: a Complexity-Theoretic
                         Approach},
  booktitle =           {{P}roceedings of the 13th {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'98)},
  acronym =             {{LICS}'98},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {394-405},
  year =                {1998},
  month =               jun,
}
[Var99] Moshe Y. Vardi. Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach. In ARTS'99, Lecture Notes in Computer Science 1601, pages 265-276. Springer-Verlag, May 1999. 
@inproceedings{arts1999-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Probabilistic Linear-Time Model Checking: An
                         Overview of the Automata-Theoretic Approach},
  editor =              {Katoen, Joost-Pieter},
  booktitle =           {{P}roceedings of the 5th {I}nternational {AMAST}
                         {W}orkshop on {F}ormal {M}ethods for {R}eal-{T}ime
                         and {P}robabilistic {S}ystems ({ARTS}'99)},
  acronym =             {{ARTS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1601},
  pages =               {265-276},
  year =                {1999},
  month =               may,
}
[Var01] Moshe Y. Vardi. Branching versus Linear Time: the Final Showdown. In TACAS'01, Lecture Notes in Computer Science 2031, pages 1-22. Springer-Verlag, April 2001. 
@inproceedings{tacas2001-Var,
  author =              {Vardi, Moshe Y.},
  title =               {Branching versus Linear Time: the Final Showdown},
  editor =              {Margaria, Tiziana and Yi, Wang},
  booktitle =           {{P}roceedings of the 7th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'01)},
  acronym =             {{TACAS}'01},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {2031},
  pages =               {1-22},
  year =                {2001},
  month =               apr,
}
[Var07] Moshe Y. Vardi. The Büchi Complementation Saga. In STACS'07, Lecture Notes in Computer Science 4393, pages 12-22. Springer-Verlag, February 2007. 
@inproceedings{stacs2007-Var,
  author =              {Vardi, Moshe Y.},
  title =               {The {B}{\"u}chi Complementation Saga},
  editor =              {Thomas, Wolfgang and Weil, Pascal},
  booktitle =           {{P}roceedings of the 24th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'07)},
  acronym =             {{STACS}'07},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {4393},
  pages =               {12-22},
  year =                {2007},
  month =               feb,
}
[VCD+15] Yaron Velner, Krishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger, Alexander Rabinovich, and Jean-François Raskin. The complexity of multi-mean-payoff and multi-energy games. Information and Computation 241:177-196. Elsevier, April 2015. 
@article{icomp241()-VCDHRR,
  author =              {Velner, Yaron and Chatterjee, Krishnendu and Doyen,
                         Laurent and Henzinger, Thomas A. and Rabinovich,
                         Alexander and Raskin, Jean-Fran{\c c}ois},
  title =               {The complexity of multi-mean-payoff and multi-energy
                         games},
  publisher =           {Elsevier},
  journal =             {Information and Computation},
  volume =              {241},
  pages =               {177-196},
  year =                {2015},
  month =               apr,
  doi =                 {10.1016/j.ic.2015.03.001},
}
[Vea97] Margus Veanes. On Computational Complexity of Basic Decision Problems of Finite Tree Automata. Technical Report 133, Uppsala Programming Methodology and Artificial Intelligence Laboratory, Sweden, January 1997. 
@techreport{upmail-133-Vea,
  author =              {Veanes, Margus},
  title =               {On Computational Complexity of Basic Decision
                         Problems of Finite Tree Automata},
  number =              {133},
  year =                {1997},
  month =               jan,
  institution =         {Uppsala Programming Methodology and Artificial
                         Intelligence Laboratory, Sweden},
  type =                {Technical Report},
}
[Ven98] Yde Venema. Rectangular games. Journal of Symbolic Logic 63(4):1549-1564. Association for Symbolic Logic, December 1998. 
@article{jsl63(4)-Ven,
  author =              {Venema, Yde},
  title =               {Rectangular games},
  publisher =           {Association for Symbolic Logic},
  journal =             {Journal of Symbolic Logic},
  volume =              {63},
  number =              {4},
  pages =               {1549-1564},
  year =                {1998},
  month =               dec,
}
[Ves15] Steen Vester. On the Complexity of Model-checking Branching and Alternating-time Temporal Logics in One-counter systems. In ATVA'15, Lecture Notes in Computer Science 9364, pages 361-377. Springer-Verlag, October 2015. 
@inproceedings{atva2015-Ves,
  author =              {Vester, Steen},
  title =               {On the Complexity of Model-checking Branching and
                         Alternating-time Temporal Logics in One-counter
                         systems},
  editor =              {Finkbeiner, Bernd and Pu, Geguang and Zhang, Lijun},
  booktitle =           {{P}roceedings of the 13th {I}nternational
                         {S}ymposium on {A}utomated {T}echnology for
                         {V}erification and {A}nalysis ({ATVA}'15)},
  acronym =             {{ATVA}'15},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {9364},
  pages =               {361-377},
  year =                {2015},
  month =               oct,
  doi =                 {10.1007/978-3-319-24953-7_27},
}
[Vin01] Aymeric Vincent. Synthèse de contrôleurs et stratégies gagnantes dans les jeux de parité. In MSR'01, pages 87-98. Hermès, October 2001. 
@inproceedings{msr2001-Vin,
  author =              {Vincent, Aymeric},
  title =               {Synth{\`e}se de contr{\^o}leurs et strat{\'e}gies
                         gagnantes dans les jeux de parit{\'e}},
  booktitle =           {{A}ctes du 3{\`e}me {C}olloque {F}rancophone sur la
                         {M}od{\'e}lisation des {S}yst{\`e}mes r{\'e}actifs
                         ({MSR}'01)},
  acronym =             {{MSR}'01},
  publisher =           {Herm{\`e}s},
  pages =               {87-98},
  year =                {2001},
  month =               oct,
}
[Vin05] N. V. Vinodchandran. A Note on the Circuit Complexity of PP. Theoretical Computer Science 347(1-2):415-418. Elsevier, November 2005. 
@article{tcs347(1-2)-Vin,
  author =              {Vinodchandran, N. V.},
  title =               {A Note on the Circuit Complexity of~{PP}},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {347},
  number =              {1-2},
  pages =               {415-418},
  year =                {2005},
  month =               nov,
}
[Vol99] Heribert Vollmer. Introduction to circuit complexity. Springer-Verlag, 1999. 
@book{circuit-vol99,
  author =              {Vollmer, Heribert},
  title =               {Introduction to circuit complexity},
  publisher =           {Springer-Verlag},
  year =                {1999},
}
[Vol08] Mikhail V. Volkov. Synchronizing Automata and the Černý Conjecture. In LATA'08, Lecture Notes in Computer Science 5196, pages 11-27. Springer-Verlag, March 2008. 
@inproceedings{lata2008-Vol,
  author =              {Volkov, Mikhail V.},
  title =               {Synchronizing Automata and the {{\v{C}}}ern{\'y}
                         Conjecture},
  editor =              {Mart{\'\i}n-Vide, Carlos and Otto, Friedrich and
                         Fernau, Henning},
  booktitle =           {{R}evised {P}apers of the 2nd {I}nternational
                         {C}onference on {L}anguage and {A}utomata {T}heory
                         and {A}pplications ({LATA}'08)},
  acronym =             {{LATA}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5196},
  pages =               {11-27},
  year =                {2008},
  month =               mar,
}
[VPK+08] P. Vijay Suman, Paritosh K. Pandya, Shankara Narayanan Krishna, and Lakshmi Manasa. Timed Automata with Integer Resets: Language Inclusion and Expressiveness. In FORMATS'08, Lecture Notes in Computer Science 5215, pages 78-92. Springer-Verlag, September 2008. 
@inproceedings{formats2008-VPKM,
  author =              {Vijay{ }Suman, P. and Pandya, Paritosh K. and
                         Krishna, Shankara Narayanan and Manasa, Lakshmi},
  title =               {Timed Automata with Integer Resets: Language
                         Inclusion and Expressiveness},
  editor =              {Cassez, Franck and Jard, Claude},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onferences on {F}ormal {M}odelling and {A}nalysis
                         of {T}imed {S}ystems ({FORMATS}'08)},
  acronym =             {{FORMATS}'08},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {5215},
  pages =               {78-92},
  year =                {2008},
  month =               sep,
  doi =                 {10.1007/978-3-540-85778-5_7},
}
[VS85] Moshe Y. Vardi and Larry J. Stockmeyer. Improved Upper and Lower Bounds for Modal Logics of Programs. In STOC'85, pages 240-251. ACM Press, May 1985. 
@inproceedings{stoc1985-VS,
  author =              {Vardi, Moshe Y. and Stockmeyer, Larry J.},
  title =               {Improved Upper and Lower Bounds for Modal Logics of
                         Programs},
  booktitle =           {{P}roceedings of the 17th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'85)},
  acronym =             {{STOC}'85},
  publisher =           {ACM Press},
  pages =               {240-251},
  year =                {1985},
  month =               may,
}
[VTL79] Jacobo Valdes, Robert Endre Tarjan, and Eugene L. Lawler. The recognition of series-parallel digraphs. In STOC'79, pages 1-12. ACM Press, April 1979. 
@inproceedings{stoc1979-VTL,
  author =              {Valdes, Jacobo and Tarjan, Robert Endre and Lawler,
                         Eugene L.},
  title =               {The recognition of series-parallel digraphs},
  booktitle =           {{P}roceedings of the 11th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'79)},
  acronym =             {{STOC}'79},
  publisher =           {ACM Press},
  pages =               {1-12},
  year =                {1979},
  month =               apr,
  doi =                 {10.1145/800135.804393},
}
[VV06] Daniele Varacca and Hagen Völzer. Temporal Logics and Model Checking for Fairly Correct Systems. In LICS'06, pages 389-398. IEEE Comp. Soc. Press, July 2006. 
@inproceedings{lics2006-VV,
  author =              {Varacca, Daniele and V{\"o}lzer, Hagen},
  title =               {Temporal Logics and Model Checking for Fairly
                         Correct Systems},
  booktitle =           {{P}roceedings of the 21st {A}nnual {S}ymposium on
                         {L}ogic in {C}omputer {S}cience ({LICS}'06)},
  acronym =             {{LICS}'06},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {389-398},
  year =                {2006},
  month =               jul,
  doi =                 {10.1109/LICS.2006.49},
}
[VW86] Moshe Y. Vardi and Pierre Wolper. An Automata-Theoretic Approach to Automatic Program Verification. In LICS'86, pages 332-344. IEEE Comp. Soc. Press, June 1986. 
@inproceedings{lics1986-VW,
  author =              {Vardi, Moshe Y. and Wolper, Pierre},
  title =               {An Automata-Theoretic Approach to Automatic Program
                         Verification},
  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 =               {332-344},
  year =                {1986},
  month =               jun,
}
[VW86] Moshe Y. Vardi and Pierre Wolper. Automata Theoretic Techniques for Modal Logics of Programs. Journal of Computer and System Sciences 32(2):183-221. Academic Press, April 1986. 
@article{jcss32(2)-VW,
  author =              {Vardi, Moshe Y. and Wolper, Pierre},
  title =               {Automata Theoretic Techniques for Modal Logics of
                         Programs},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {32},
  number =              {2},
  pages =               {183-221},
  year =                {1986},
  month =               apr,
}
[VW94] Moshe Y. Vardi and Pierre Wolper. Reasoning about Infinite Computations. Information and Computation 115(1):1-37. Academic Press, November 1994. 
@article{icomp115(1)-VW,
  author =              {Vardi, Moshe Y. and Wolper, Pierre},
  title =               {Reasoning about Infinite Computations},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {115},
  number =              {1},
  pages =               {1-37},
  year =                {1994},
  month =               nov,
}
[VW08] Moshe Y. Vardi and Thomas Wilke. Automata: from logics to algorithms. In Jörg Flum, Erich Grädel, and Thomas Wilke (eds.), Logic and Automata: History and Perspectives, Texts in Logic and Games 2, pages 629-736. Amsterdam University Press, 2008. 
@incollection{la2008-ala-VW,
  author =              {Vardi, Moshe Y. and Wilke, Thomas},
  title =               {Automata: from logics to algorithms},
  editor =              {Flum, J{\"o}rg and Gr{\"a}del, Erich and Wilke,
                         Thomas},
  booktitle =           {Logic and Automata: History and Perspectives},
  publisher =           {Amsterdam University Press},
  series =              {Texts in Logic and Games},
  volume =              {2},
  pages =               {629-736},
  year =                {2008},
}
List of authors