1999
[dA99] Luca de Alfaro. Computing minimum and maximum reachability times in probabilistic systems. In CONCUR'99, Lecture Notes in Computer Science 1664, pages 66-81. Springer-Verlag, August 1999. 
@inproceedings{concur1999-Alf,
  author =              {de Alfaro, Luca},
  title =               {Computing minimum and maximum reachability times in
                         probabilistic systems},
  editor =              {Baeten, Jos C. M. and Mauw, Sjouke},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'99)},
  acronym =             {{CONCUR}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1664},
  pages =               {66-81},
  year =                {1999},
  month =               aug,
}
[ABM99] Carlos Areces, Patrick Blackburn, and Maarten Marx. A Road-Map on Complexity for Hybrid Logics. In CSL'99, Lecture Notes in Computer Science 1862, pages 307-321. Springer-Verlag, September 1999. 
@inproceedings{csl1999-ABM,
  author =              {Areces, Carlos and Blackburn, Patrick and Marx,
                         Maarten},
  title =               {A Road-Map on Complexity for Hybrid Logics},
  editor =              {Flum, J{\"o}rg and Rodr{\'\i}guez{-}Artalejo, Mario},
  booktitle =           {{P}roceedings of the 13th {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'99)},
  acronym =             {{CSL}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1862},
  pages =               {307-321},
  year =                {1999},
  month =               sep,
}
[AFH99] Rajeev Alur, Limor Fix, and Thomas A. Henzinger. Event-Clock Automata: A Determinizable Class of Timed Automata. Theoretical Computer Science 211(1-2):253-273. Elsevier, January 1999. 
@article{tcs211(1-2)-AFH,
  author =              {Alur, Rajeev and Fix, Limor and Henzinger, Thomas
                         A.},
  title =               {Event-Clock Automata: A Determinizable Class of
                         Timed Automata},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {211},
  number =              {1-2},
  pages =               {253-273},
  year =                {1999},
  month =               jan,
  doi =                 {10.1016/S0304-3975(97)00173-4},
}
[AGP+99] Karine Altisen, Gregor Gößler, Amir Pnueli, Joseph Sifakis, Stavros Tripakis, and Sergio Yovine. A Framework for Scheduler Synthesis. In RTSS'99, pages 154-163. IEEE Comp. Soc. Press, December 1999. 
@inproceedings{rts1999-AGPSTY,
  author =              {Altisen, Karine and G{\"o}{\ss}ler, Gregor and
                         Pnueli, Amir and Sifakis, Joseph and Tripakis,
                         Stavros and Yovine, Sergio},
  title =               {A Framework for Scheduler Synthesis},
  booktitle =           {{P}roceedings of the 20th {S}ymposium on {R}eal-Time
                         {S}ystems ({RTSS}'99)},
  acronym =             {{RTSS}'99},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {154-163},
  year =                {1999},
  month =               dec,
}
[AJ99] Parosh Aziz Abdulla and Bengt Jonsson. On the Existence of Network Invariants for Verifying Parameterized Systems. In Correct System Design, Recent Insight and Advances, Lecture Notes in Computer Science 1710, pages 180-197. Springer-Verlag, 1999. 
@inproceedings{lncs1710-AJ,
  author =              {Abdulla, Parosh Aziz and Jonsson, Bengt},
  title =               {On the Existence of Network Invariants for Verifying
                         Parameterized Systems},
  editor =              {Olderog, Ernst R{\"u}diger and Steffen, Bernhard},
  booktitle =           {Correct System Design, Recent Insight and Advances},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1710},
  pages =               {180-197},
  year =                {1999},
}
[Alu99] Rajeev Alur. Timed Automata. In CAV'99, Lecture Notes in Computer Science 1633, pages 8-22. Springer-Verlag, July 1999. 
@inproceedings{cav1999-Alu,
  author =              {Alur, Rajeev},
  title =               {Timed Automata},
  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 =               {8-22},
  year =                {1999},
  month =               jul,
}
[AM99] Eugene Asarin and Oded Maler. As Soon as Possible: Time Optimal Control for Timed Automata. In HSCC'99, Lecture Notes in Computer Science 1569, pages 19-30. Springer-Verlag, March 1999. 
@inproceedings{hscc1999-AM,
  author =              {Asarin, Eugene and Maler, Oded},
  title =               {As~Soon as Possible: Time Optimal Control for Timed
                         Automata},
  editor =              {Vaandrager, Frits and van Schuppen, Jan H.},
  booktitle =           {{P}roceedings of the 2nd {I}nternational {W}orkshop
                         on {H}ybrid {S}ystems: {C}omputation and {C}ontrol
                         ({HSCC}'99)},
  acronym =             {{HSCC}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1569},
  pages =               {19-30},
  year =                {1999},
  month =               mar,
}
[BCC+99] Armin Biere, Alessandro Cimatti, Edmund M. Clarke, and Yunshan Zhu. Symbolic Model Checking without BDDs. In TACAS'99, Lecture Notes in Computer Science 1579, pages 193-207. Springer-Verlag, March 1999. 
@inproceedings{tacas1999-BCCZ,
  author =              {Biere, Armin and Cimatti, Alessandro and Clarke,
                         Edmund M. and Zhu, Yunshan},
  title =               {Symbolic Model Checking without {BDD}s},
  editor =              {Cleaveland, Rance},
  booktitle =           {{P}roceedings of the 5th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'99)},
  acronym =             {{TACAS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1579},
  pages =               {193-207},
  year =                {1999},
  month =               mar,
}
[BCZ99] Armin Biere, Edmund M. Clarke, and Yunshan Zhu. Combining Local and Global Model Checking. In SMC'99, Electronic Notes in Theoretical Computer Science 23(2). Elsevier, July 1999. 
@inproceedings{smc1999-BCZ,
  author =              {Biere, Armin and Clarke, Edmund M. and Zhu, Yunshan},
  title =               {Combining Local and Global Model Checking},
  editor =              {Cimatti, Alessandro and Grumberg, Orna},
  booktitle =           {{P}roceedings of the 1st {I}nternational {W}orkshop
                         on {S}ymbolic {M}odel {C}hecking ({SMC}'99)},
  acronym =             {{SMC}'99},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {23},
  number =              {2},
  year =                {1999},
  month =               jul,
}
[BG99] Glenn Bruns and Patrice Godefroid. Model Checking Partial State Spaces with 3-Valued Temporal Logics. In CAV'99, Lecture Notes in Computer Science 1633, pages 274-287. Springer-Verlag, July 1999. 
@inproceedings{cav1999-BG,
  author =              {Bruns, Glenn and Godefroid, Patrice},
  title =               {Model Checking Partial State Spaces with
                         {\(3\)}-Valued Temporal Logics},
  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 =               {274-287},
  year =                {1999},
  month =               jul,
}
[BLP+99] Gerd Behrmann, Kim Guldstrand Larsen, Justin Pearson, Carsten Weise, and Wang Yi. Efficient Timed Reachability Analysis using Clock Difference Diagrams. In CAV'99, Lecture Notes in Computer Science 1633, pages 341-353. Springer-Verlag, July 1999. 
@inproceedings{cav1999-BLPWY,
  author =              {Behrmann, Gerd and Larsen, Kim Guldstrand and
                         Pearson, Justin and Weise, Carsten and Yi, Wang},
  title =               {Efficient Timed Reachability Analysis using Clock
                         Difference Diagrams},
  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 =               {341-353},
  year =                {1999},
  month =               jul,
}
[BMT99] Augustin Baziramwabo, Pierre McKenzie, and Denis Thérien. Modular Temporal Logic. In LICS'99, pages 344-351. IEEE Comp. Soc. Press, July 1999. 
@inproceedings{lics1999-BMT,
  author =              {Baziramwabo, Augustin and McKenzie, Pierre and
                         Th{\'e}rien, Denis},
  title =               {Modular Temporal Logic},
  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 =               {344-351},
  year =                {1999},
  month =               jul,
}
[BT99] Patrick Blackburn and Miroslava Tzakova. Hybrid Languages and Temporal Logic. Logic Journal of the IGPL 7(1):27-54. Oxford University Press, January 1999. 
@article{jigpl7(1)-BT,
  author =              {Blackburn, Patrick and Tzakova, Miroslava},
  title =               {Hybrid Languages and Temporal Logic},
  publisher =           {Oxford University Press},
  journal =             {Logic Journal of the IGPL},
  volume =              {7},
  number =              {1},
  pages =               {27-54},
  year =                {1999},
  month =               jan,
}
[CC99] Sérgio Vale Aguiar Campos and Edmund M. Clarke. Analysis and verification of real-time systems using quantitative symbolic algorithms. International Journal on Software Tools for Technology Transfer 2(3):260-269. Springer-Verlag, November 1999. 
@article{sttt2(3)-CC,
  author =              {Campos, S{\'e}rgio Vale Aguiar and Clarke, Edmund
                         M.},
  title =               {Analysis and verification of real-time systems using
                         quantitative symbolic algorithms},
  publisher =           {Springer-Verlag},
  journal =             {International Journal on Software Tools for
                         Technology Transfer},
  volume =              {2},
  number =              {3},
  pages =               {260-269},
  year =                {1999},
  month =               nov,
  doi =                 {10.1007/s100090050033},
}
[CCG+99] Alessandro Cimatti, Edmund M. Clarke, Fausto Giunchiglia, and Marco Roveri. NuSMV: A New Symbolic Model Verifier. In CAV'99, Lecture Notes in Computer Science 1633, pages 495-499. Springer-Verlag, July 1999. 
@inproceedings{cav1999-CCGR,
  author =              {Cimatti, Alessandro and Clarke, Edmund M. and
                         Giunchiglia, Fausto and Roveri, Marco},
  title =               {{NuSMV}: A New Symbolic Model Verifier},
  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 =               {495-499},
  year =                {1999},
  month =               jul,
}
[CJ99] Hubert Comon and Yan Jurski. Timed Automata and the Theory of Real Numbers. Research Report LSV-99-6, Lab. Spécification & Vérification, ENS Cachan, France, July 1999. 
@techreport{lsv-99-6,
  author =              {Comon, Hubert and Jurski, Yan},
  title =               {Timed Automata and the Theory of Real Numbers},
  number =              {LSV-99-6},
  year =                {1999},
  month =               jul,
  institution =         {Lab.~Sp\'ecification \& V\'erification, ENS Cachan,
                         France},
  type =                {Research Report},
}
[CJ99] Hubert Comon and Yan Jurski. Timed Automata and the Theory of Real Numbers. In CONCUR'99, Lecture Notes in Computer Science 1664, pages 242-257. Springer-Verlag, August 1999. 
@inproceedings{concur1999-CJ,
  author =              {Comon, Hubert and Jurski, Yan},
  title =               {Timed Automata and the Theory of Real Numbers},
  editor =              {Baeten, Jos C. M. and Mauw, Sjouke},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'99)},
  acronym =             {{CONCUR}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1664},
  pages =               {242-257},
  year =                {1999},
  month =               aug,
  doi =                 {10.1007/3-540-48320-9_18},
}
[CTM+99] Sérgio Vale Aguiar Campos, Márcio Teixeira, Marius Minea, Andreas Kuehlmann, and Edmund M. Clarke. Model Checking Semi-Continuous Time Models Using BDDs. In SMC'99, Electronic Notes in Theoretical Computer Science 23(2). Elsevier, July 1999. 
@inproceedings{smc1999-CTMKC,
  author =              {Campos, S{\'e}rgio Vale Aguiar and Teixeira,
                         M{\'a}rcio and Minea, Marius and Kuehlmann, Andreas
                         and Clarke, Edmund M.},
  title =               {Model Checking Semi-Continuous Time Models Using
                         {BDD}s},
  editor =              {Cimatti, Alessandro and Grumberg, Orna},
  booktitle =           {{P}roceedings of the 1st {I}nternational {W}orkshop
                         on {S}ymbolic {M}odel {C}hecking ({SMC}'99)},
  acronym =             {{SMC}'99},
  publisher =           {Elsevier},
  series =              {Electronic Notes in Theoretical Computer Science},
  volume =              {23},
  number =              {2},
  year =                {1999},
  month =               jul,
}
[Dam99] Dennis René Dams. Flat Fragments of CTL and CTL*: Separating the Expressive and Distinguishing Powers. Logic Journal of the IGPL 7(1):55-78. Oxford University Press, January 1999. 
@article{jigpl7(1)-Dam,
  author =              {Dams, Dennis Ren{\'e}},
  title =               {Flat Fragments of {CTL} and {CTL}{\(^*\)}:
                         Separating the Expressive and Distinguishing Powers},
  publisher =           {Oxford University Press},
  journal =             {Logic Journal of the IGPL},
  volume =              {7},
  number =              {1},
  pages =               {55-78},
  year =                {1999},
  month =               jan,
}
[DGV99] Marco Daniele, Fausto Giunchiglia, and Moshe Y. Vardi. Improved Automata Generation for Linear Temporal Logic. In CAV'99, Lecture Notes in Computer Science 1633, pages 249-260. Springer-Verlag, July 1999. 
@inproceedings{cav1999-DGV,
  author =              {Daniele, Marco and Giunchiglia, Fausto and Vardi,
                         Moshe Y.},
  title =               {Improved Automata Generation for Linear 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 =               {249-260},
  year =                {1999},
  month =               jul,
}
[DW99] Martin Dickhöfer and Thomas Wilke. Timed Alternating Tree Automata: The Automata Theoretic Solution to the TCTL Model Checking Problem. In ICALP'99, Lecture Notes in Computer Science 1644, pages 281-290. Springer-Verlag, July 1999. 
@inproceedings{icalp1999-DW,
  author =              {Dickh{\"o}fer, Martin and Wilke, Thomas},
  title =               {Timed Alternating Tree Automata: The Automata
                         Theoretic Solution to the {TCTL} Model Checking
                         Problem},
  editor =              {Wiedermann, Jir{\'\i} and van Emde Boas, Peter and
                         Nielsen, Mogens},
  booktitle =           {{P}roceedings of the 26th {I}nternational
                         {C}olloquium on {A}utomata, {L}anguages and
                         {P}rogramming ({ICALP}'99)},
  acronym =             {{ICALP}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1644},
  pages =               {281-290},
  year =                {1999},
  month =               jul,
}
[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},
}
[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,
}
[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,
}
[Feh99] Ansgar Fehnker. Scheduling a Steel Plant with Timed Automata. In RTCSA'99, pages 280-286. IEEE Comp. Soc. Press, December 1999. 
@inproceedings{rtcsa1999-Feh,
  author =              {Fehnker, Ansgar},
  title =               {Scheduling a Steel Plant with Timed Automata},
  booktitle =           {{P}roceedings of the 6th {I}nternational
                         {C}onference on {R}eal-{T}ime {C}omputing {S}ystems
                         and {A}pplications ({RTCSA}'99)},
  acronym =             {{RTCSA}'99},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {280-286},
  year =                {1999},
  month =               dec,
  doi =                 {10.1109/RTCSA.1999.811256},
}
[Fra99] Martin Fränzle. Analysis of hybrid systems: an ounce of realism can save an infinity of states. In CSL'99, Lecture Notes in Computer Science 1862, pages 126-139. Springer-Verlag, September 1999. 
@inproceedings{csl1999-Fra,
  author =              {Fr{\"a}nzle, Martin},
  title =               {Analysis of hybrid systems: an~ounce of realism can
                         save an infinity of states},
  editor =              {Flum, J{\"o}rg and Rodr{\'\i}guez{-}Artalejo, Mario},
  booktitle =           {{P}roceedings of the 13th {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'99)},
  acronym =             {{CSL}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1862},
  pages =               {126-139},
  year =                {1999},
  month =               sep,
}
[GGR99] Leszek Gąsieniec, Alan Gibbons, and Wojciech Rytter. Efficiency of Fast Parallel Pattern-Searching in Highly Compressed Texts. In MFCS'99, Lecture Notes in Computer Science 1672, pages 48-58. Springer-Verlag, September 1999. 
@inproceedings{mfcs1999-GGR,
  author =              {G{\k a}sieniec, Leszek and Gibbons, Alan and Rytter,
                         Wojciech},
  title =               {Efficiency of Fast Parallel Pattern-Searching in
                         Highly Compressed Texts},
  editor =              {Kutylowski, Miroslaw and Pacholski, Leszek and
                         Wierzbicki, Tomasz},
  booktitle =           {{P}roceedings of the 24th {I}nternational
                         {S}ymposium on {M}athematical {F}oundations of
                         {C}omputer {S}cience ({MFCS}'99)},
  acronym =             {{MFCS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1672},
  pages =               {48-58},
  year =                {1999},
  month =               sep,
}
[GR99] Leszek Gąsieniec and Wojciech Rytter. Almost Optimal Fully LZW-Compressed Pattern Matching. In DCC'99, pages 316-325. IEEE Comp. Soc. Press, March 1999. 
@inproceedings{dcc1999-GR,
  author =              {G{\k a}sieniec, Leszek and Rytter, Wojciech},
  title =               {Almost Optimal Fully {LZW}-Compressed Pattern
                         Matching},
  booktitle =           {{P}roceedings of the 9th {D}ata {C}ompression
                         {C}onference ({DCC}'99)},
  acronym =             {{DCC}'99},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {316-325},
  year =                {1999},
  month =               mar,
}
[HHM99] Thomas A. Henzinger, Benjamin Horowitz, and Rupak Majumdar. Rectangular Hybrid Games. In CONCUR'99, Lecture Notes in Computer Science 1664, pages 320-335. Springer-Verlag, August 1999. 
@inproceedings{concur1999-HHM,
  author =              {Henzinger, Thomas A. and Horowitz, Benjamin and
                         Majumdar, Rupak},
  title =               {Rectangular Hybrid Games},
  editor =              {Baeten, Jos C. M. and Mauw, Sjouke},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'99)},
  acronym =             {{CONCUR}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1664},
  pages =               {320-335},
  year =                {1999},
  month =               aug,
}
[HK99] Thomas A. Henzinger and Peter W. Kopke. Discrete-Time Control for Rectangular Hybrid Systems. Theoretical Computer Science 221(1-2):369-392. Elsevier, June 1999. 
@article{tcs221(1-2)-HK,
  author =              {Henzinger, Thomas A. and Kopke, Peter W.},
  title =               {Discrete-Time Control for Rectangular Hybrid
                         Systems},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {221},
  number =              {1-2},
  pages =               {369-392},
  year =                {1999},
  month =               jun,
}
[HPV99] Michel Habib, Christophe Paul, and Laurent Viennot. Partition Refinement Techniques: An Interesting Algorithmic Tool Kit. International Journal of Foundations of Computer Science 10(2):147,170. June 1999. 
@article{ijfcs10(2)-HPV,
  author =              {Habib, Michel and Paul, {\relax Ch}ristophe and
                         Viennot, Laurent},
  title =               {Partition Refinement Techniques: An Interesting
                         Algorithmic Tool Kit},
  journal =             {International Journal of Foundations of Computer
                         Science},
  volume =              {10},
  number =              {2},
  pages =               {147,170},
  year =                {1999},
  month =               jun,
}
[HR99] Yoram Hirshfeld and Alexander Rabinovich. Quantitative Temporal Logic. In CSL'99, Lecture Notes in Computer Science 1862, pages 172-187. Springer-Verlag, September 1999. 
@inproceedings{csl1999-HR,
  author =              {Hirshfeld, Yoram and Rabinovich, Alexander},
  title =               {Quantitative Temporal Logic},
  editor =              {Flum, J{\"o}rg and Rodr{\'\i}guez{-}Artalejo, Mario},
  booktitle =           {{P}roceedings of the 13th {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'99)},
  acronym =             {{CSL}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1862},
  pages =               {172-187},
  year =                {1999},
  month =               sep,
}
[Imm99] Neil Immerman. Descriptive complexity. Graduate texts in computer science. Springer-Verlag, 1999. 
@book{Imm-descrcompl,
  author =              {Immerman, Neil},
  title =               {Descriptive complexity},
  publisher =           {Springer-Verlag},
  series =              {Graduate texts in computer science},
  year =                {1999},
  doi =                 {10.1007/978-1-4612-0539-5},
}
[IS99] Balász Imreh and Magnus Steinby. Directable nondeterministic automata. Acta Cybernetica 14(1):105-115. Institute of Informatics, University of Szeged, 1999. 
@article{actacyb14(1)-IS,
  author =              {Imreh, Bal{\'a}sz and Steinby, Magnus},
  title =               {Directable nondeterministic automata},
  publisher =           {Institute of Informatics, University of Szeged},
  journal =             {Acta Cybernetica},
  volume =              {14},
  number =              {1},
  pages =               {105-115},
  year =                {1999},
}
[KP99] Elias Koutsoupias and Christos H. Papadimitriou. Worst-case equilibria. In STACS'99, Lecture Notes in Computer Science 1563, pages 404-413. Springer-Verlag, March 1999. 
@inproceedings{stacs1999-KP,
  author =              {Koutsoupias, Elias and Papadimitriou, {\relax
                         Ch}ristos H.},
  title =               {Worst-case equilibria},
  editor =              {Meinel, {\relax Ch}ristoph and Tison, Sophie},
  booktitle =           {{P}roceedings of the 16th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'99)},
  acronym =             {{STACS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1563},
  pages =               {404-413},
  year =                {1999},
  month =               mar,
  doi =                 {10.1007/3-540-49116-3_38},
}
[KPS+99] Yonit Kesten, Amir Pnueli, Joseph Sifakis, and Sergio Yovine. Decidable Integration Graphs. Information and Computation 150(2):209-243. Academic Press, May 1999. 
@article{icomp150(2)-KPSY,
  author =              {Kesten, Yonit and Pnueli, Amir and Sifakis, Joseph
                         and Yovine, Sergio},
  title =               {Decidable Integration Graphs},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {150},
  number =              {2},
  pages =               {209-243},
  year =                {1999},
  month =               may,
  doi =                 {10.1006/inco.1998.2774},
}
[KST+99] Takuya Kida, Yusuke Shibata, Masayuki Takeda, Ayumi Shinohara, and Setsuo Arikawa. A Unifying Framework for Compressed Pattern Matching. In SPIRE/CRIWG'99, pages 89-96. IEEE Comp. Soc. Press, September 1999. 
@inproceedings{spire1999-KSTSA,
  author =              {Kida, Takuya and Shibata, Yusuke and Takeda,
                         Masayuki and Shinohara, Ayumi and Arikawa, Setsuo},
  title =               {A Unifying Framework for Compressed Pattern
                         Matching},
  booktitle =           {{P}roceedings of the 6th {S}tring {P}rocessing and
                         {I}nformation {R}etrieval {S}ymposium \&
                         {I}nternational {W}orkshop on {G}roupware
                         ({SPIRE/CRIWG}'99)},
  acronym =             {{SPIRE/CRIWG}'99},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {89-96},
  year =                {1999},
  month =               sep,
}
[Kup99] Orna Kupferman. Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions. Journal of Logic and Computation 9(2):135-147. Oxford University Press, April 1999. 
@article{jlc9(2)-Kup,
  author =              {Kupferman, Orna},
  title =               {Augmenting Branching Temporal Logics with
                         Existential Quantification over Atomic Propositions},
  publisher =           {Oxford University Press},
  journal =             {Journal of Logic and Computation},
  volume =              {9},
  number =              {2},
  pages =               {135-147},
  year =                {1999},
  month =               apr,
}
[KV99] Orna Kupferman and Moshe Y. Vardi. Model Checking of Safety Properties. In CAV'99, Lecture Notes in Computer Science 1633, pages 172-183. Springer-Verlag, July 1999. 
@inproceedings{cav1999-KV,
  author =              {Kupferman, Orna and Vardi, Moshe Y.},
  title =               {Model Checking of Safety Properties},
  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 =               {172-183},
  year =                {1999},
  month =               jul,
}
[KV99] Orna Kupferman and Moshe Y. Vardi. Robust Satisfaction. In CONCUR'99, Lecture Notes in Computer Science 1664, pages 383-398. Springer-Verlag, August 1999. 
@inproceedings{concur1999-KV,
  author =              {Kupferman, Orna and Vardi, Moshe Y.},
  title =               {Robust Satisfaction},
  editor =              {Baeten, Jos C. M. and Mauw, Sjouke},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'99)},
  acronym =             {{CONCUR}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1664},
  pages =               {383-398},
  year =                {1999},
  month =               aug,
}
[LMS+99] Clemens Lautermann, Pierre McKenzie, Thomas Schwentick, and Heribert Vollmer. The Descriptive Complexity Approach to LOGCFL. In STACS'99, Lecture Notes in Computer Science 1563, pages 444-454. Springer-Verlag, March 1999. 
@inproceedings{stacs1999-LMSV,
  author =              {Lautermann, Clemens and McKenzie, Pierre and
                         Schwentick, Thomas and Vollmer, Heribert},
  title =               {The Descriptive Complexity Approach to {LOGCFL}},
  editor =              {Meinel, {\relax Ch}ristoph and Tison, Sophie},
  booktitle =           {{P}roceedings of the 16th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'99)},
  acronym =             {{STACS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1563},
  pages =               {444-454},
  year =                {1999},
  month =               mar,
}
[LPW+99] Kim Guldstrand Larsen, Justin Pearson, Carsten Weise, and Wang Yi. Clock Difference Diagrams. Nordic Journal of Computing 6(3):271-298. Publishing Association Nordic Journal of Computing, 1999. 
@article{njc6(3)-LPWY,
  author =              {Larsen, Kim Guldstrand and Pearson, Justin and
                         Weise, Carsten and Yi, Wang},
  title =               {Clock Difference Diagrams},
  publisher =           {Publishing Association Nordic Journal of Computing},
  journal =             {Nordic Journal of Computing},
  volume =              {6},
  number =              {3},
  pages =               {271-298},
  year =                {1999},
}
[LV99] Richard J. Lipton and Anastasios Viglas. On the Complexity of SAT. In FOCS'99, pages 459-464. IEEE Comp. Soc. Press, November 1999. 
@inproceedings{focs1999-LV,
  author =              {Lipton, Richard J. and Viglas, Anastasios},
  title =               {On the Complexity of {SAT}},
  booktitle =           {{P}roceedings of the 40th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'99)},
  acronym =             {{FOCS}'99},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {459-464},
  year =                {1999},
  month =               nov,
}
[McM99] Kenneth L. McMillan. Verification of infinite state systems by compositional model checking. In CHARME'99, Lecture Notes in Computer Science 1703, pages 219-237. Springer-Verlag, September 1999. 
@inproceedings{charme1999-McM,
  author =              {McMillan, Kenneth L.},
  title =               {Verification of infinite state systems by
                         compositional model checking},
  editor =              {Pierre, Laurence and Kropf, {\relax Th}omas},
  booktitle =           {{P}roceedings of the 10th {C}orrect {H}ardware
                         {D}esign and {V}erification {M}ethods ({CHARME}'99)},
  acronym =             {{CHARME}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1703},
  pages =               {219-237},
  year =                {1999},
  month =               sep,
  doi =                 {10.1007/3-540-48153-2_17},
}
[Min99] Marius Minea. Partial Order Reduction for Model Checking of Timed Automata. In CONCUR'99, Lecture Notes in Computer Science 1664, pages 431-446. Springer-Verlag, August 1999. 
@inproceedings{concur1999-Min,
  author =              {Minea, Marius},
  title =               {Partial Order Reduction for Model Checking of Timed
                         Automata},
  editor =              {Baeten, Jos C. M. and Mauw, Sjouke},
  booktitle =           {{P}roceedings of the 10th {I}nternational
                         {C}onference on {C}oncurrency {T}heory
                         ({CONCUR}'99)},
  acronym =             {{CONCUR}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1664},
  pages =               {431-446},
  year =                {1999},
  month =               aug,
}
[Min99] Marius Minea. Partial-order reduction for verification of timed systems. PhD thesis, Computer Science Deparment, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, December 1999. 
@phdthesis{phd-minea,
  author =              {Minea, Marius},
  title =               {Partial-order reduction for verification of timed
                         systems},
  year =                {1999},
  month =               dec,
  school =              {Computer Science Deparment, Carnegie Mellon
                         University, Pittsburgh, Pennsylvania, USA},
}
[MLA+99] Jesper B. Møller, Jakob Lichtenberg, Henrik Reif Andersen, and Henrik Hulgaard. Difference Decision Diagrams. In CSL'99, Lecture Notes in Computer Science 1862, pages 111-125. Springer-Verlag, September 1999. 
@inproceedings{csl1999-MLAH,
  author =              {M{\o}ller, Jesper B. and Lichtenberg, Jakob and
                         Andersen, Henrik Reif and Hulgaard, Henrik},
  title =               {Difference Decision Diagrams},
  editor =              {Flum, J{\"o}rg and Rodr{\'\i}guez{-}Artalejo, Mario},
  booktitle =           {{P}roceedings of the 13th {I}nternational {W}orkshop
                         on {C}omputer {S}cience {L}ogic ({CSL}'99)},
  acronym =             {{CSL}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1862},
  pages =               {111-125},
  year =                {1999},
  month =               sep,
}
[MR99] Faron Moller and Alexander Rabinovich. On the expressive power of CTL*. In LICS'99, pages 360-368. IEEE Comp. Soc. Press, July 1999. 
@inproceedings{lics1999-MR,
  author =              {Moller, Faron and Rabinovich, Alexander},
  title =               {On the expressive power of
                         {CTL}{\textsuperscript{*}}},
  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 =               {360-368},
  year =                {1999},
  month =               jul,
  doi =                 {10.1109/LICS.1999.782631},
}
[MRV99] Pierre McKenzie, Klaus Reinhardt, and V. Vinay. Circuits and Context-free Languages. In COCOON'99, Lecture Notes in Computer Science 1627, pages 194-203. Springer-Verlag, July 1999. 
@inproceedings{cocoon1999-MRV,
  author =              {McKenzie, Pierre and Reinhardt, Klaus and Vinay, V.},
  title =               {Circuits and Context-free Languages},
  editor =              {Asano, Takao and Imai, Hiroshi and Lee, D. T. and
                         Nakano, Shin-Ichi and Tokuyama, Takeshi},
  booktitle =           {{P}roceedings of the 5th {C}omputing and
                         {C}ombinatorics ({COCOON}'99)},
  acronym =             {{COCOON}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1627},
  pages =               {194-203},
  year =                {1999},
  month =               jul,
}
[MT99] Alexis Maciel and Denis Thérien. Efficient Threshold Circuits for Power Series. Information and Computation 152(1):62-73. Academic Press, June 1999. 
@article{icomp152(1)-MT,
  author =              {Maciel, Alexis and Th{\'e}rien, Denis},
  title =               {Efficient Threshold Circuits for Power Series},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {152},
  number =              {1},
  pages =               {62-73},
  year =                {1999},
  month =               jun,
}
[Mul99] Markus Müller-Olm. A Modal Fixpoint Logic with Chop. In STACS'99, Lecture Notes in Computer Science 1563, pages 510-520. Springer-Verlag, March 1999. 
@inproceedings{stacs1999-Mul,
  author =              {M{\"u}ller{-}Olm, Markus},
  title =               {A Modal Fixpoint Logic with Chop},
  editor =              {Meinel, {\relax Ch}ristoph and Tison, Sophie},
  booktitle =           {{P}roceedings of the 16th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'99)},
  acronym =             {{STACS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1563},
  pages =               {510-520},
  year =                {1999},
  month =               mar,
}
[MW99] Angelika Mader and Hanno Wupper. Timed automaton models for simple programmable logic controllers. In ECRTS'99, pages 106-113. IEEE Comp. Soc. Press, June 1999. 
@inproceedings{ecrta1999-MW,
  author =              {Mader, Angelika and Wupper, Hanno},
  title =               {Timed automaton models for simple programmable logic
                         controllers},
  booktitle =           {{P}roceedings of the 11th {E}uromicro {C}onference
                         on {R}eal-{T}ime {S}ystems ({ECRTS}'99)},
  acronym =             {{ECRTS}'99},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {106-113},
  year =                {1999},
  month =               jun,
}
[PR99] Wojciech Plandowski and Wojciech Rytter. Complexity of Language Recognition Problems for Compressed Words. In Juhani Karhumäki, Hermann Maurer, Gheorghe Păun, and Grzegorz Rozenberg (eds.), Jewels are Forever – Contributions on Theoretical Computer Science in Honor of Arto Salomaa. Springer-Verlag, 1999. 
@incollection{jaf1999-PR,
  author =              {Plandowski, Wojciech and Rytter, Wojciech},
  title =               {Complexity of Language Recognition Problems for
                         Compressed Words},
  editor =              {Karhum{\"a}ki, Juhani and Maurer, Hermann and P{\u
                         a}un, Gheorghe and Rozenberg, Grzegorz},
  booktitle =           {Jewels are Forever~-- Contributions on Theoretical
                         Computer Science in Honor of {A}rto {S}alomaa},
  publisher =           {Springer-Verlag},
  pages =               {262-272},
  year =                {1999},
}
[Pur99] Anuj Puri. An Undecidable Problem for Timed Automata. Discrete Event Dynamic Systems 9(2):135-146. Kluwer Academic, May 1999. 
@article{deds9(2)-Pur,
  author =              {Puri, Anuj},
  title =               {An Undecidable Problem for Timed Automata},
  publisher =           {Kluwer Academic},
  journal =             {Discrete Event Dynamic Systems},
  volume =              {9},
  number =              {2},
  pages =               {135-146},
  year =                {1999},
  month =               may,
}
[Ras99] Jean-François Raskin. Logics, Automata and Classical theories for Deciding Real Time. Thèse de doctorat, FUNDP, Namur, Belgium, June 1999. 
@phdthesis{phd-raskin,
  author =              {Raskin, Jean-Fran{\c c}ois},
  title =               {Logics, Automata and Classical theories for Deciding
                         Real Time},
  year =                {1999},
  month =               jun,
  school =              {FUNDP, Namur, Belgium},
  type =                {Th\`ese de doctorat},
}
[Rey99] Mark Reynolds. The Complexity of Temporal Logic over the Reals. Research Report cs.LO/9910012, arXiv, October 1999. 
@techreport{arxiv-cs.LO/9910012,
  author =              {Reynolds, Mark},
  title =               {The Complexity of Temporal Logic over the Reals},
  number =              {cs.LO/9910012},
  year =                {1999},
  month =               oct,
  institution =         {arXiv},
  type =                {Research Report},
}
[RS99] Jean-François Raskin and Pierre-Yves Schobbens. The Logic of Event-Clocks: Decidability, Complexity and Expressiveness. Journal of Automata, Languages and Combinatorics 4(3):247-286. 1999. 
@article{jalc4(3)-RS,
  author =              {Raskin, Jean-Fran{\c c}ois and Schobbens,
                         Pierre-Yves},
  title =               {The Logic of Event-Clocks: Decidability, Complexity
                         and Expressiveness},
  journal =             {Journal of Automata, Languages and Combinatorics},
  volume =              {4},
  number =              {3},
  pages =               {247-286},
  year =                {1999},
}
[Ryt99] Wojciech Rytter. Algorithms on Compressed Strings and Arrays. In SOFSEM'99, Lecture Notes in Computer Science 1725, pages 48-65. Springer-Verlag, November 1999. 
@inproceedings{sofsem1999-Ryt,
  author =              {Rytter, Wojciech},
  title =               {Algorithms on Compressed Strings and Arrays},
  editor =              {Pavelka, Jan and Tel, Gerard and Bartosek, Miroslav},
  booktitle =           {{P}roceedings of the 26th {C}onference on {C}urrent
                         {T}rends in {T}heory and {P}ractice of {I}nformatics
                         ({SOFSEM}'99)},
  acronym =             {{SOFSEM}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1725},
  pages =               {48-65},
  year =                {1999},
  month =               nov,
}
[SR99] Pierre-Yves Schobbens and Jean-François Raskin. The Logic of "Initially" and "Next". Information Processing Letters 69(5):221-225. Elsevier, 1999. 
@article{ipl69(5)-SR,
  author =              {Schobbens, Pierre-Yves and Raskin, Jean-Fran{\c
                         c}ois},
  title =               {The Logic of {"}Initially{"} and {"}Next{"}},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {69},
  number =              {5},
  pages =               {221-225},
  year =                {1999},
}
[TA99] Stavros Tripakis and Karine Altisen. On-the-Fly Controller Synthesis for Discrete and Dense-Time Systems. In FM'99, Lecture Notes in Computer Science 1708, pages 233-252. Springer-Verlag, September 1999. 
@inproceedings{fm1999-TA,
  author =              {Tripakis, Stavros and Altisen, Karine},
  title =               {On-the-Fly Controller Synthesis for Discrete and
                         Dense-Time Systems},
  editor =              {Wing, Jeannette M. and Woodcock, Jim and Davies,
                         Jim},
  booktitle =           {{P}roceedings of the {W}orld {C}ongress on {F}ormal
                         {M}ethods ({FM}'99)},
  acronym =             {{FM}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1708},
  pages =               {233-252},
  year =                {1999},
  month =               sep,
}
[Tri99] Stavros Tripakis. Timed Diagnostics for Reachability Properties. In TACAS'99, Lecture Notes in Computer Science 1579, pages 59-73. Springer-Verlag, March 1999. 
@inproceedings{tacas1999-Tri,
  author =              {Tripakis, Stavros},
  title =               {Timed Diagnostics for Reachability Properties},
  editor =              {Cleaveland, Rance},
  booktitle =           {{P}roceedings of the 5th {I}nternational
                         {C}onference on {T}ools and {A}lgorithms for
                         {C}onstruction and {A}nalysis of {S}ystems
                         ({TACAS}'99)},
  acronym =             {{TACAS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1579},
  pages =               {59-73},
  year =                {1999},
  month =               mar,
}
[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,
}
[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},
}
[Wei99] Volker Weispfenning. Mixed Real-Integer Linear Quantifier Elimination. In ISSAC'99, pages 129-136. ACM Press, July 1999. 
@inproceedings{issac1999-Wei,
  author =              {Weispfenning, Volker},
  title =               {Mixed Real-Integer Linear Quantifier Elimination},
  booktitle =           {{P}roceedings of the 12th {I}nternational
                         {S}ymposium on {S}ymbolic and {A}lgebraic
                         {C}omputation ({ISSAC}'99)},
  acronym =             {{ISSAC}'99},
  publisher =           {ACM Press},
  pages =               {129-136},
  year =                {1999},
  month =               jul,
}
[Wil99] Thomas Wilke. CTL+ is exponentially more succinct than CTL. In FSTTCS'99, Lecture Notes in Computer Science 1738, pages 110-121. Springer-Verlag, December 1999. 
@inproceedings{fsttcs1999-Wil,
  author =              {Wilke, Thomas},
  title =               {{CTL}{\(^+\)} is exponentially more succinct
                         than~{CTL}},
  editor =              {Rangan, C. Pandu and Raman, Venkatesh and Ramanujam,
                         R.},
  booktitle =           {{P}roceedings of the 19th {C}onference on
                         {F}oundations of {S}oftware {T}echnology and
                         {T}heoretical {C}omputer {S}cience ({FSTTCS}'99)},
  acronym =             {{FSTTCS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1738},
  pages =               {110-121},
  year =                {1999},
  month =               dec,
}
[Wil99] Thomas Wilke. Classifying Discrete Temporal Properties. In STACS'99, Lecture Notes in Computer Science 1563, pages 32-46. Springer-Verlag, March 1999. 
@inproceedings{stacs1999-Wil,
  author =              {Wilke, Thomas},
  title =               {Classifying Discrete Temporal Properties},
  editor =              {Meinel, {\relax Ch}ristoph and Tison, Sophie},
  booktitle =           {{P}roceedings of the 16th {S}ymposium on
                         {T}heoretical {A}spects of {C}omputer {S}cience
                         ({STACS}'99)},
  acronym =             {{STACS}'99},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {1563},
  pages =               {32-46},
  year =                {1999},
  month =               mar,
}
List of authors