1984
[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,
}
[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},
}
[Gra84] Susanne Graf. On Lamport's Comparison between Linear and Branching Time Logic. RAIRO – Informatique Théorique et Applications 18(4):345-353. EDP Sciences, 1984. 
@article{rairo-ita18(4)-Gra,
  author =              {Graf, Susanne},
  title =               {On {L}amport's Comparison between Linear and
                         Branching Time Logic},
  publisher =           {EDP Sciences},
  journal =             {RAIRO~-- Informatique Th{\'e}orique et Applications},
  volume =              {18},
  number =              {4},
  pages =               {345-353},
  year =                {1984},
}
[MH84] Satoru Miyano and Takeshi Hayashi. Alternating Finite Automata on ω-words. Theoretical Computer Science 32:321-330. Elsevier, 1984. 
@article{tcs32()-MH,
  author =              {Miyano, Satoru and Hayashi, Takeshi},
  title =               {Alternating Finite Automata on {\(\omega\)}-words},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {32},
  pages =               {321-330},
  year =                {1984},
}
[dNH84] Rocco de Nicola and Matthew C. B. Hennessy. Testing Equivalence for Processes. Theoretical Computer Science 34:83-133. Elsevier, 1984. 
@article{tcs34()-DH,
  author =              {de Nicola, Rocco and Hennessy, Matthew C. B.},
  title =               {Testing Equivalence for Processes},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {34},
  pages =               {83-133},
  year =                {1984},
}
[Pap84] Christos H. Papadimitriou. On the Complexity of Unique Solutions. Journal of the ACM 31(2):392-400. ACM Press, April 1984. 
@article{jacm31(2)-Pap,
  author =              {Papadimitriou, {\relax Ch}ristos H.},
  title =               {On the Complexity of Unique Solutions},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {31},
  number =              {2},
  pages =               {392-400},
  year =                {1984},
  month =               apr,
}
[Rei84] John H. Reif. The Complexity of Two-Player Games of Incomplete Information. Journal of Computer and System Sciences 29(2):274-301. Academic Press, October 1984. 
@article{jsl66(3)-Reif,
  author =              {Reif, John H.},
  title =               {The Complexity of Two-Player Games of Incomplete
                         Information},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {29},
  number =              {2},
  pages =               {274-301},
  year =                {1984},
  month =               oct,
}
[RS84] Neil Robertson and Paul D. Seymour. Graph minors III: Planar tree-width. Journal of Combinatorial Theory, series B 86(1):49-64. Elsevier, February 1984. 
@article{jctB36(1)-RS,
  author =              {Robertson, Neil and Seymour, Paul D.},
  title =               {Graph minors~{III}: Planar tree-width},
  publisher =           {Elsevier},
  journal =             {Journal of Combinatorial Theory, series~{B}},
  volume =              {86},
  number =              {1},
  pages =               {49-64},
  year =                {1984},
  month =               feb,
  doi =                 {10.1016/0095-8956(84)90013-3},
}
List of authors