1979
[Abr79] Karl Abrahamson. Modal Logic of Concurrent Nondeterministic Programs. In SCC'79, Lecture Notes in Computer Science 70, pages 21-33. Springer-Verlag, July 1979.
@inproceedings{scc1979-Abr,
  author =              {Abrahamson, Karl},
  title =               {Modal Logic of Concurrent Nondeterministic Programs},
  editor =              {Kahn, Gilles},
  booktitle =           {{P}roceedings of the International Symposium
                         Semantics of Concurrent Computation ({SCC}'79)},
  acronym =             {{SCC}'79},
  publisher =           {Springer-Verlag},
  series =              {Lecture Notes in Computer Science},
  volume =              {70},
  pages =               {21-33},
  year =                {1979},
  month =               jul,
}
[APT79] Bengt Aspvall, Michael F. Plass, and Robert Endre Tarjan. A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas. Information Processing Letters 8(3):121-123. Elsevier, March 1979. erratum as \citeipl14(4)-APT.
@article{ipl8(3)-APT,
  author =              {Aspvall, Bengt and Plass, Michael F. and Tarjan,
                         Robert Endre},
  title =               {A Linear-Time Algorithm for Testing the Truth of
                         Certain Quantified Boolean Formulas},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {8},
  number =              {3},
  pages =               {121-123},
  year =                {1979},
  month =               mar,
  note =                {erratum as~\cite{ipl14(4)-APT}},
}
[Bur79] John P. Burgess. Logic and Time. Journal of Symbolic Logic 44(4):566-582. Association for Symbolic Logic, December 1979.
@article{jsl44(4)-Bur,
  author =              {Burgess,John P.},
  title =               {Logic and Time},
  publisher =           {Association for Symbolic Logic},
  journal =             {Journal of Symbolic Logic},
  volume =              {44},
  number =              {4},
  pages =               {566-582},
  year =                {1979},
  month =               dec,
}
[CC79] Patrick Cousot and Radhia Cousot. Constructive Versions of Tarski's Fixed Point Theorems. Pacific Journal of Mathematics 82(1):43-57. 1979.
@article{pjm82(1)-CC,
  author =              {Cousot, Patrick and Cousot, Radhia},
  title =               {Constructive Versions of {T}arski's Fixed Point
                         Theorems},
  journal =             {Pacific Journal of Mathematics},
  volume =              {82},
  number =              {1},
  pages =               {43-57},
  year =                {1979},
}
[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},
}
[FL79] Michael J. Fischer and Richard E. Ladner. Propositional Dynamic Logic of Regular Programs. Journal of Computer and System Sciences 18(2):194-211. Academic Press, April 1979.
@article{jcss18(2)-FL,
  author =              {Fischer, Michael J. and Ladner, Richard E.},
  title =               {Propositional Dynamic Logic of Regular Programs},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {18},
  number =              {2},
  pages =               {194-211},
  year =                {1979},
  month =               apr,
}
[GJ79] Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1979.
@book{GJ79,
  author =              {Garey, Michael R. and Johnson, David S.},
  title =               {Computers and Intractability: A Guide to the Theory
                         of {NP}-Completeness},
  publisher =           {W.~H. Freeman~\&~Co.},
  year =                {1979},
}
[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},
}
[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},
}
1978
[ITN78] Katsushi Inoue, Itsuo Takanami, and Akira Nakamura. A note on Two-dimensional Finite Automata. Information Processing Letters 7(1):49-52. Elsevier, January 1978.
@article{ipl7(1)-ITN,
  author =              {Inoue, Katsushi and Takanami, Itsuo and Nakamura,
                         Akira},
  title =               {A~note on Two-dimensional Finite Automata},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {7},
  number =              {1},
  pages =               {49-52},
  year =                {1978},
  month =               jan,
}
[Kar78] Richard M. Karp. A characterization of the minimum cycle mean in a digraph. Discrete Mathematics 23(3):309-311. Elsevier, September 1978.
@article{dm23(3)-Kar,
  author =              {Karp, Richard M.},
  title =               {A~characterization of the minimum cycle mean in a
                         digraph},
  publisher =           {Elsevier},
  journal =             {Discrete Mathematics},
  volume =              {23},
  number =              {3},
  pages =               {309-311},
  year =                {1978},
  month =               sep,
}
[Mai78] David Maier. The Complexity of Some Problems on Subsequences and Supersequences. Journal of the ACM 25(2):322-336. ACM Press, April 1978.
@article{jacm25(2)-Mai,
  author =              {Maier, David},
  title =               {The Complexity of Some Problems on Subsequences and
                         Supersequences},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {25},
  number =              {2},
  pages =               {322-336},
  year =                {1978},
  month =               apr,
}
[Rac78] Charles Rackoff. The Covering and Boundedness Problems for Vector Addition Systems. Theoretical Computer Science 6:223-231. Elsevier, 1978.
@article{tcs6()-Rac,
  author =              {Rackoff, Charles},
  title =               {The Covering and Boundedness Problems for Vector
                         Addition Systems},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {6},
  pages =               {223-231},
  year =                {1978},
  doi =                 {10.1016/0304-3975(78)90036-1},
}
[SS78] William J. Sakoda and Michael Sipser. Nondeterminism and the Size of Two Way Finite Automata. In STOC'78, pages 275-286. ACM Press, May 1978.
@inproceedings{stoc1978-SS,
  author =              {Sakoda, William J. and Sipser, Michael},
  title =               {Nondeterminism and the Size of Two Way Finite
                         Automata},
  booktitle =           {{P}roceedings of the 10th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'78)},
  acronym =             {{STOC}'78},
  publisher =           {ACM Press},
  pages =               {275-286},
  year =                {1978},
  month =               may,
}
1977
[CC77] Patrick Cousot and Radhia Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In POPL'77, pages 238-252. ACM Press, January 1977.
@inproceedings{popl1977-CC,
  author =              {Cousot, Patrick and Cousot, Radhia},
  title =               {Abstract Interpretation: A~Unified Lattice Model for
                         Static Analysis of Programs by Construction or
                         Approximation of Fixpoints},
  booktitle =           {Conference Record of the 4th {ACM} {S}ymposium on
                         {P}rinciples of {P}rogramming {L}anguages
                         ({POPL}'77)},
  acronym =             {{POPL}'77},
  publisher =           {ACM Press},
  pages =               {238-252},
  year =                {1977},
  month =               jan,
  doi =                 {10.1145/512950.512973},
}
[Pnu77] Amir Pnueli. The Temporal Logic of Programs. In FOCS'77, pages 46-57. IEEE Comp. Soc. Press, October 1977.
@inproceedings{focs1977-Pnu,
  author =              {Pnueli, Amir},
  title =               {The Temporal Logic of Programs},
  booktitle =           {{P}roceedings of the 18th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'77)},
  acronym =             {{FOCS}'77},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {46-57},
  year =                {1977},
  month =               oct,
  doi =                 {10.1109/SFCS.1977.32},
}
[ZL77] Jacob Ziv and Abraham Lempel. A Universal Algorithm for Sequential Data Compression. IEEE Transactions on Information Theory 23(3):337-343. IEEE Inf. Theory Soc., May 1977.
@article{tit23(3)-ZL,
  author =              {Ziv, Jacob and Lempel, Abraham},
  title =               {A Universal Algorithm for Sequential Data
                         Compression},
  publisher =           {IEEE Inf. Theory Soc.},
  journal =             {IEEE Transactions on Information Theory},
  volume =              {23},
  number =              {3},
  pages =               {337-343},
  year =                {1977},
  month =               may,
}
1976
[Gal76] Zvi Galil. Hierarchies of Complete Problems. Acta Informatica 6:77-88. Springer-Verlag, 1976.
@article{acta6()-Gal,
  author =              {Galil, Zvi},
  title =               {Hierarchies of Complete Problems},
  publisher =           {Springer-Verlag},
  journal =             {Acta Informatica},
  volume =              {6},
  pages =               {77-88},
  year =                {1976},
}
[RV76] Ronald L. Rivest and Jean Vuillemin. On Recognizing Graph Properties from Adjacency Matrices. Theoretical Computer Science 3(3):371-384. Elsevier, 1976.
@article{tcs3(3)-RV,
  author =              {Rivest, Ronald L. and Vuillemin, Jean},
  title =               {On Recognizing Graph Properties from Adjacency
                         Matrices},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {3},
  number =              {3},
  pages =               {371-384},
  year =                {1976},
}
[See76] Detlef G. Seese. Entscheidbarkeits- und Interpretierbarkeitsfragen monadischer Theorien zweiter Stufe gewisser Klassen von Graphen. PhD thesis, Humboldt-Universität zu Berlin, German Democratic Republic, 1976.
@phdthesis{phd-seese,
  author =              {Seese, Detlef G.},
  title =               {Entscheidbarkeits- und {I}nterpretierbarkeitsfragen
                         monadischer {T}heorien zweiter {S}tufe gewisser
                         {K}lassen von {G}raphen},
  year =                {1976},
  school =              {Humboldt-Universit{\"a}t zu Berlin, German
                         Democratic Republic},
}
[Sto76] Larry J. Stockmeyer. The Polynomial-Time Hierarchy. Theoretical Computer Science 3(1):1-22. Elsevier, 1976.
@article{tcs3(1)-Sto,
  author =              {Stockmeyer, Larry J.},
  title =               {The Polynomial-Time Hierarchy},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {3},
  number =              {1},
  pages =               {1-22},
  year =                {1976},
}
[Wra76] Celia Wrathall. Complete Sets and the Polynomial-Time Hierarchy. Theoretical Computer Science 3(1):23-33. Elsevier, 1976.
@article{tcs3(1)-Wra,
  author =              {Wrathall, Celia},
  title =               {Complete Sets and the Polynomial-Time Hierarchy},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {3},
  number =              {1},
  pages =               {23-33},
  year =                {1976},
}
1975
[Mar75] Donald A. Martin. Borel Determinacy. Annals of Mathematics 102(2):363-371. Princeton University Press, September 1975.
@article{am102(2)-Mar,
  author =              {Martin, Donald A.},
  title =               {{B}orel Determinacy},
  publisher =           {Princeton University Press},
  journal =             {Annals of Mathematics},
  volume =              {102},
  number =              {2},
  pages =               {363-371},
  year =                {1975},
  month =               sep,
  doi =                 {10.2307/1971035},
}
1974
[FR74] Michael J. Fischer and Michael O. Rabin. Super-Exponential Complexity of Presburger Arithmetic. TR TM-43, MIT Press, February 1974.
@techreport{TM43-FR,
  author =              {Fischer, Michael J. and Rabin, Michael O.},
  title =               {Super-Exponential Complexity of {P}resburger
                         Arithmetic},
  number =              {TM-43},
  year =                {1974},
  month =               feb,
  institution =         {MIT Press},
  type =                {TR},
}
[HT74] John Hopcroft and Robert Endre Tarjan. Efficient Planarity Testing. Journal of the ACM 21(4):549-568. ACM Press, October 1974.
@article{jacm21(4)-HT,
  author =              {Hopcroft, John and Tarjan, Robert Endre},
  title =               {Efficient Planarity Testing},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {21},
  number =              {4},
  pages =               {549-568},
  year =                {1974},
  month =               oct,
}
[Sto74] Larry J. Stockmeyer. The Complexity of Decision Problems in Automata Theory and Logic. PhD thesis, MIT, 1974.
@phdthesis{phd-stockmeyer,
  author =              {Stockmeyer, Larry J.},
  title =               {The Complexity of Decision Problems in Automata
                         Theory and Logic},
  year =                {1974},
  school =              {MIT},
}
1973
[BFP+73] Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, and Robert Endre Tarjan. Time Bounds for Selection. Journal of Computer and System Sciences 7(4):448-461. Academic Press, August 1973.
@article{jcss7(4)-BFPRT,
  author =              {Blum, Manuel and Floyd, Robert W. and Pratt, Vaughan
                         R. and Rivest, Ronald L. and Tarjan, Robert Endre},
  title =               {Time Bounds for Selection},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {7},
  number =              {4},
  pages =               {448-461},
  year =                {1973},
  month =               aug,
}
[Ros73] Robert W. Rosenthal. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2(1):65-67. Springer-Verlag, December 1973.
@article{ijgt2(1)-Ros,
  author =              {Rosenthal, Robert W.},
  title =               {A~class of games possessing pure-strategy {N}ash
                         equilibria},
  publisher =           {Springer-Verlag},
  journal =             {International Journal of Game Theory},
  volume =              {2},
  number =              {1},
  pages =               {65-67},
  year =                {1973},
  month =               dec,
  doi =                 {10.1007/BF01737559},
}
[Ros73] Robert W. Rosenthal. The network equilibrium problem in integers. Networks 3(1):53-59. John Wiley & Sons, January 1973.
@article{netw3(1)-Ros,
  author =              {Rosenthal, Robert W.},
  title =               {The network equilibrium problem in integers},
  publisher =           {John Wiley \& Sons},
  journal =             {Networks},
  volume =              {3},
  number =              {1},
  pages =               {53-59},
  year =                {1973},
  month =               jan,
  doi =                 {10.1002/net.3230030104},
}
[SM73] Larry J. Stockmeyer and Albert R. Meyer. Word Problems Requiring Exponential Time: Preliminary Report. In STOC'73, pages 1-9. ACM Press, April 1973.
@inproceedings{stoc1973-SM,
  author =              {Stockmeyer, Larry J. and Meyer, Albert R.},
  title =               {Word Problems Requiring Exponential Time:
                         Preliminary Report},
  booktitle =           {{P}roceedings of the 5th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'73)},
  acronym =             {{STOC}'73},
  publisher =           {ACM Press},
  pages =               {1-9},
  year =                {1973},
  month =               apr,
}
1972
[Cov72] Thomas M. Cover. Broadcast Channels. IEEE Transactions on Information Theory 18(1):2-14. IEEE Inf. Theory Soc., January 1972.
@article{tit18(1)-Cov,
  author =              {Cover, Thomas M.},
  title =               {Broadcast Channels},
  publisher =           {IEEE Inf. Theory Soc.},
  journal =             {IEEE Transactions on Information Theory},
  volume =              {18},
  number =              {1},
  pages =               {2-14},
  year =                {1972},
  month =               jan,
  doi =                 {10.1109/TIT.1972.1054727},
}
[GK72] Yuri Gurevich and Igor O. Koryakov. Remarks on Berger's paper on the domino problem. Siberian Mathematical Journal 13(2):459-463. Springer-Verlag, March 1972.
@article{smj13(2)-GK,
  author =              {Gurevich, Yuri and Koryakov, Igor O.},
  title =               {Remarks on {B}erger's paper on the domino problem},
  publisher =           {Springer-Verlag},
  journal =             {Siberian Mathematical Journal},
  volume =              {13},
  number =              {2},
  pages =               {459-463},
  year =                {1972},
  month =               mar,
}
[HNR72] Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. Correction to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths". SIGACT News 37:28-29. ACM Press, December 1972.
@article{sigart-news37()-HNR,
  author =              {Hart, Peter E. and Nilsson, Nils J. and Raphael,
                         Bertram},
  title =               {Correction to {"}A~Formal Basis for the Heuristic
                         Determination of Minimum Cost Paths{"}},
  publisher =           {ACM Press},
  journal =             {SIGACT News},
  volume =              {37},
  pages =               {28-29},
  year =                {1972},
  month =               dec,
  doi =                 {10.1145/1056777.1056779},
}
[Kar72] Richard M. Karp. Reducibility Among Combinatorial Problems. In CCC'72, IBM Research Symposia Series, pages 85-103. Plenum Press, March 1972.
@inproceedings{ccc1972-Kar,
  author =              {Karp, Richard M.},
  title =               {Reducibility Among Combinatorial Problems},
  editor =              {Miller, Raymond E. and Thatcher, James W.},
  booktitle =           {{P}roceedings of a symposium on the Complexity of
                         Computer Computations ({CCC}'72)},
  acronym =             {{CCC}'72},
  publisher =           {Plenum Press},
  series =              {IBM Research Symposia Series},
  pages =               {85-103},
  year =                {1972},
  month =               mar,
}
[MS72] Albert R. Meyer and Larry J. Stockmeyer. The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space. In FOCS'72, pages 125-129. IEEE Comp. Soc. Press, October 1972.
@inproceedings{focs1972-MS,
  author =              {Meyer, Albert R. and Stockmeyer, Larry J.},
  title =               {The Equivalence Problem for Regular Expressions with
                         Squaring Requires Exponential Space},
  booktitle =           {{P}roceedings of the 13th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'72)},
  acronym =             {{FOCS}'72},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {125-129},
  year =                {1972},
  month =               oct,
}
[Rab72] Michael O. Rabin. Automata on infinite objects and Church's thesis. Regional Conference Series in Mathematics 13. American Mathematical Society, 1972.
@book{AIOCT1972-Rab,
  author =              {Rabin, Michael O.},
  title =               {Automata on infinite objects and {C}hurch's thesis},
  publisher =           {American Mathematical Society},
  series =              {Regional Conference Series in Mathematics},
  number =              {13},
  year =                {1972},
}
[Tar72] Robert Endre Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing 1(2):146-160. Society for Industrial and Applied Math., June 1972.
@article{siamcomp1(2)-Tar,
  author =              {Tarjan, Robert Endre},
  title =               {Depth-first search and linear graph algorithms},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Computing},
  volume =              {1},
  number =              {2},
  pages =               {146-160},
  year =                {1972},
  month =               jun,
}
1971
[Coo71] Stephen A. Cook. The complexity of Theorem Proving Procedures. In STOC'71, pages 151-158. ACM Press, 1971.
@inproceedings{stoc1971-Coo,
  author =              {Cook, Stephen A.},
  title =               {The complexity of Theorem Proving Procedures},
  booktitle =           {{P}roceedings of the 3rd {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'71)},
  acronym =             {{STOC}'71},
  publisher =           {ACM Press},
  pages =               {151-158},
  year =                {1971},
}
[Mun71] J. Ian Munro. Efficient Determination of the Transitive Closure of a Directed Graph. Information Processing Letters 1(2):56-58. Elsevier, June 1971.
@article{ipl1(2)-Mun,
  author =              {Munro, J. Ian},
  title =               {Efficient Determination of the Transitive Closure of
                         a Directed Graph},
  publisher =           {Elsevier},
  journal =             {Information Processing Letters},
  volume =              {1},
  number =              {2},
  pages =               {56-58},
  year =                {1971},
  month =               jun,
}
1970
[Fin70] Kit Fine. Propositional quantifiers in modal logic. Theoria 36(3):336-346. John Wiley & Sons, December 1970.
@article{theoria36(3)-Fine,
  author =              {Fine, Kit},
  title =               {Propositional quantifiers in modal logic},
  publisher =           {John Wiley \& Sons},
  journal =             {Theoria},
  volume =              {36},
  number =              {3},
  pages =               {336-346},
  year =                {1970},
  month =               dec,
  doi =                 {10.1111/j.1755-2567.1970.tb00432.x},
}
[Rab70] Michael O. Rabin. Weakly definable relations and special automata. In SMLFST'70, pages 1-23. North-Holland, 1970.
@inproceedings{smlfst1970-Rab,
  author =              {Rabin, Michael O.},
  title =               {Weakly definable relations and special automata},
  editor =              {Bar{-}Hillel, Yehoshua},
  booktitle =           {{P}roceedings of the {S}ymposium on {M}athematical
                         {L}ogic and {F}oundations of {S}et {T}heory
                         ({SMLFST}'70)},
  acronym =             {{SMLFST}'70},
  publisher =           {North-Holland},
  pages =               {1-23},
  year =                {1970},
}
[Sav70] Walter Savitch. Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences 4(2):177-192. Academic Press, April 1970.
@article{jcss4(2)-Sav,
  author =              {Savitch, Walter},
  title =               {Relationships between nondeterministic and
                         deterministic tape complexities},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {4},
  number =              {2},
  pages =               {177-192},
  year =                {1970},
  month =               apr,
  doi =                 {10.1016/S0022-0000(70)80006-X},
}
1969
[BL69] Julius R. Büchi and Lawrence H. Landweber. Solving Sequential Conditions by Finite-State Strategies. Transactions of the American Mathematical Society 138:295-311. American Mathematical Society, April 1969.
@article{TAMS138-BL,
  author =              {B{\"u}chi, Julius R. and Landweber, Lawrence H.},
  title =               {Solving Sequential Conditions by Finite-State
                         Strategies},
  publisher =           {American Mathematical Society},
  journal =             {Transactions of the American Mathematical Society},
  volume =              {138},
  pages =               {295-311},
  year =                {1969},
  month =               apr,
}
[Hoa69] Charles Antony Richard Hoare. An axiomatic basis for computer programming. Communications of the ACM 12(10):576-580. ACM Press, October 1969.
@article{cacm12(10)-Hoa,
  author =              {Hoare, Charles Antony Richard},
  title =               {An axiomatic basis for computer programming},
  publisher =           {ACM Press},
  journal =             {Communications of the ACM},
  volume =              {12},
  number =              {10},
  pages =               {576-580},
  year =                {1969},
  month =               oct,
  doi =                 {10.1145/363235.363259},
}
[Rab69] Michael O. Rabin. Decidability of Second-Order Theories and Automata on Infinite Trees. Transactions of the American Mathematical Society 141:1-35. American Mathematical Society, July 1969.
@article{TAMS141-Rab,
  author =              {Rabin, Michael O.},
  title =               {Decidability of Second-Order Theories and Automata
                         on Infinite Trees},
  publisher =           {American Mathematical Society},
  journal =             {Transactions of the American Mathematical Society},
  volume =              {141},
  pages =               {1-35},
  year =                {1969},
  month =               jul,
}
[WL69] Richard J. Waldinger and Richard C. T. Lee. PROW: a step towards automatic program writing. In IJCAI'69, pages 241-252. William Kaufmann Inc., May 1969.
@inproceedings{ijcai1969-WL,
  author =              {Waldinger, Richard J. and Lee, Richard C. T.},
  title =               {{PROW}: a~step towards automatic program writing},
  editor =              {Walker, Donald E. and Norton, Lewis M.},
  booktitle =           {{P}roceedings of the 1st {I}nternational {J}oint
                         {C}onference on {A}rtificial {I}ntelligence
                         ({IJCAI}'69)},
  acronym =             {{IJCAI}'69},
  publisher =           {William Kaufmann Inc.},
  pages =               {241-252},
  year =                {1969},
  month =               may,
}
1968
[HNR68] Peter E. Hart, Nils J. Nilsson, and Bertram Raphael. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics 4(2):100-107. IEEE, July 1968.
@article{tssc4(2)-HNR,
  author =              {Hart, Peter E. and Nilsson, Nils J. and Raphael,
                         Bertram},
  title =               {A~Formal Basis for the Heuristic Determination of
                         Minimum Cost Paths},
  publisher =           {IEEE},
  journal =             {IEEE Transactions on Systems Science and
                         Cybernetics},
  volume =              {4},
  number =              {2},
  pages =               {100-107},
  year =                {1968},
  month =               jul,
  doi =                 {10.1109/TSSC.1968.300136},
}
[Kam68] Johan Anthony Willem Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, Computer Science Department, University of California at Los Angeles, USA, 1968.
@phdthesis{phd-kamp,
  author =              {Kamp, Johan Anthony Willem},
  title =               {Tense Logic and the Theory of Linear Order},
  year =                {1968},
  school =              {Computer Science Department, University of
                         California at Los~Angeles, USA},
  type =                {{PhD} thesis},
}
[Pri68] Arthur N. Prior. Papers on Time and Tense. Oxford University Press, 1968.
@book{Prior-1968,
  author =              {Prior, Arthur N.},
  title =               {Papers on Time and Tense},
  publisher =           {Oxford University Press},
  year =                {1968},
}
1967
[BH67] Manuel Blum and Carl Hewitt. Automata on a 2-Dimensional Tape. In FOCS'67, pages 155-160. IEEE Comp. Soc. Press, October 1967.
@inproceedings{focs1967-BH,
  author =              {Blum, Manuel and Hewitt, Carl},
  title =               {Automata on a 2-Dimensional Tape},
  booktitle =           {{P}roceedings of the 8th {A}nnual {S}ymposium on
                         {F}oundations of {C}omputer {S}cience ({FOCS}'67)},
  acronym =             {{FOCS}'67},
  publisher =           {IEEE Comp. Soc. Press},
  pages =               {155-160},
  year =                {1967},
  month =               oct,
}
[DBR67] George B. Dantzig, W. O. Blattner, and M. R. Rao. Finding a Cycle in a Graph with Minimum Cost to Time Ratio with Application to a Ship Routing Problem. In Pierre Rosenstiehl (eds.), Theory of Graphs. Gordon and Breach Science Publishers, 1967.
@incollection{thgraph-DBR67,
  author =              {Dantzig, George B. and Blattner, W. O. and Rao, M.
                         R.},
  title =               {Finding a Cycle in a Graph with Minimum Cost to Time
                         Ratio with Application to a Ship Routing Problem},
  editor =              {Rosenstiehl, Pierre},
  booktitle =           {Theory of Graphs},
  publisher =           {Gordon and Breach Science Publishers},
  pages =               {77-84},
  year =                {1967},
}
[Har67] John C. Harsanyi. Games with incomplete information played by "Bayesian" players – (I) The basic model. Management Science 14(3):159-182. November 1967.
@article{ms14(3)-Har,
  author =              {Harsanyi, John C.},
  title =               {Games with incomplete information played by
                         {"}{B}ayesian{"} players~-- (I)~The~basic model},
  journal =             {Management Science},
  volume =              {14},
  number =              {3},
  pages =               {159-182},
  year =                {1967},
  month =               nov,
}
[Min67] Marvin L. Minsky. Computation: Finite and Infinite Machines. Prentice Hall, Inc., 1967.
@book{cfim1967-Min,
  author =              {Minsky, Marvin L.},
  title =               {Computation: Finite and Infinite Machines},
  booktitle =           {Computation: Finite and Infinite Machines},
  publisher =           {Prentice Hall, Inc.},
  year =                {1967},
}
[Pri67] Arthur N. Prior. Past, Present and Future. Oxford University Press, 1967.
@book{Prior-1967,
  author =              {Prior, Arthur N.},
  title =               {Past, Present and Future},
  publisher =           {Oxford University Press},
  year =                {1967},
}
[Ros67] Pierre Rosenstiehl. Theory of Graphs. Gordon and Breach Science Publishers, 1967.
@book{ToG-Ros67,
  title =               {Theory of Graphs},
  editor =              {Rosenstiehl, Pierre},
  booktitle =           {Theory of Graphs},
  publisher =           {Gordon and Breach Science Publishers},
  year =                {1967},
}
1966
[GS66] Seymour Ginsburg and Edwin Spanier. Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics 16(2):285-296. December 1966.
@article{pjm16(2)-GS,
  author =              {Ginsburg, Seymour and Spanier, Edwin},
  title =               {Semigroups, {P}resburger formulas, and languages},
  journal =             {Pacific Journal of Mathematics},
  volume =              {16},
  number =              {2},
  pages =               {285-296},
  year =                {1966},
  month =               dec,
}
[McN66] Robert McNaughton. Testing and Generating Infinite Sequences by a Finite Automaton. Information and Control 9(6):521-530. Academic Press, December 1966.
@article{icont9(6)-Mcn,
  author =              {McNaughton, Robert},
  title =               {Testing and Generating Infinite Sequences by a
                         Finite Automaton},
  publisher =           {Academic Press},
  journal =             {Information and Control},
  volume =              {9},
  number =              {6},
  pages =               {521-530},
  year =                {1966},
  month =               dec,
}
1964
[Cer64] Ján Černý. Poznámka k homogénnym experimentom s konečnými automatmi. Matematicko-fyzikálny časopis 14(3):208-216. 1964.
@article{mfc14(3)-Cer,
  author =              {{\v{C}}ern{\'y}, J{\'a}n},
  title =               {Pozn{\'a}mka k homog{\'e}nnym experimentom s
                         kone{\v{c}}n{\'y}mi automatmi},
  journal =             {Matematicko-fyzik{\'a}lny {\v{c}}asopis},
  volume =              {14},
  number =              {3},
  pages =               {208-216},
  year =                {1964},
}
1963
[Chu63] Alonzo Church. Logic, arithmetic, and automata. In ICM'62, pages 23-35. 1963.
@inproceedings{icm1962-Chu,
  author =              {Church, Alonzo},
  title =               {Logic, arithmetic, and automata},
  booktitle =           {{P}roceedings of the {I}nternational {C}ongress of
                         {M}athematicians ({ICM}'62)},
  acronym =             {{ICM}'62},
  pages =               {23-35},
  year =                {1963},
  confyear =            {1962},
  confmonth =           {8},
}
[Kri63] Saul A. Kripke. Semantical Considerations on Modal Logic. Acta Philosophica Fennica 16:83-94. Philosophical Society of Finland, 1963.
@article{apf16()-Kri,
  author =              {Kripke, Saul A.},
  title =               {Semantical Considerations on Modal Logic},
  publisher =           {Philosophical Society of Finland},
  journal =             {Acta Philosophica Fennica},
  volume =              {16},
  pages =               {83-94},
  year =                {1963},
}
[Kri63] Saul A. Kripke. Semantical Analysis of Modal Logic I: Normal Modal Propositional Calculi. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 9(5-6):67-96. Deutscher Verlag der Wissenschaften, 1963.
@article{zml9(5-6)-Kri,
  author =              {Kripke, Saul A.},
  title =               {Semantical Analysis of Modal Logic~{I}: Normal Modal
                         Propositional Calculi},
  publisher =           {Deutscher Verlag der Wissenschaften},
  journal =             {Zeitschrift fur mathematische Logik und Grundlagen
                         der Mathematik},
  volume =              {9},
  number =              {5-6},
  pages =               {67-96},
  year =                {1963},
}
[Too63] Andrei L. Toom. The complexity of a scheme of functional elements realizing the multiplication of integers. Doklady Akademii Nauk SSSR 150(3):496-498. Russian Academy of Sciences, 1963.
@article{danSSSR150(3)-Too,
  author =              {Toom, Andrei L.},
  title =               {The complexity of a scheme of functional elements
                         realizing the multiplication of integers},
  publisher =           {Russian Academy of Sciences},
  journal =             {Doklady Akademii Nauk SSSR},
  volume =              {150},
  number =              {3},
  pages =               {496-498},
  year =                {1963},
}
1962
[Buc62] Julius R. Büchi. On a Decision Method in Restricted Second Order Arithmetic. In LMPS'60, pages 1-11. Stanford University Press, June 1962.
@inproceedings{lmps1960-Buc,
  author =              {B{\"u}chi, Julius R.},
  title =               {On a Decision Method in Restricted Second Order
                         Arithmetic},
  editor =              {Nagel, Ernest and Suppes, Patrick and Tarski,
                         Alfred},
  booktitle =           {{P}roceedings of the 1960 {I}nternational {C}ongress
                         on {L}ogic, {M}ethodology and {P}hilosophy of
                         {S}cience ({LMPS}'60)},
  acronym =             {{LMPS}'60},
  publisher =           {Stanford University Press},
  pages =               {1-11},
  year =                {1962},
  month =               jun,
  confyear =            {1960},
}
[Pet62] Carl Adam Petri. Kommunikation mit Automaten. PhD thesis, Darmstadt University of Technology, Germany, 1962.
@phdthesis{phd-petri,
  author =              {Petri, Carl Adam},
  title =               {Kommunikation mit Automaten},
  year =                {1962},
  school =              {Darmstadt University of Technology, Germany},
}
[War62] Stephen Warshall. A Theorem on Boolean Matrices. Journal of the ACM 9(1):11-12. ACM Press, January 1962.
@article{jacm9(1)-War,
  author =              {Warshall, Stephen},
  title =               {A~Theorem on Boolean Matrices},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {9},
  number =              {1},
  pages =               {11-12},
  year =                {1962},
  month =               jan,
  doi =                 {10.1145/321105.321107},
}
1961
[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},
}
[Hen61] Leon Henkin. Some Remarks on Infinitely Long Formulas. In Infinitistic Methods – Proceedings of the Symposium on Foundations of Mathematics, pages 167-183. Pergamon Press, 1961.
@inproceedings{sofm1959-Hen,
  author =              {Henkin, Leon},
  title =               {Some Remarks on Infinitely Long Formulas},
  booktitle =           {{I}nfinitistic {M}ethods~-- {P}roceedings of the
                         {S}ymposium on {F}oundations of {M}athematics},
  publisher =           {Pergamon Press},
  pages =               {167-183},
  year =                {1961},
  confyear =            {1959},
  confmonth =           {9},
}
[Min61] Marvin L. Minsky. Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines. Annals of Mathematics 74(3):437-455. Princeton University Press, November 1961.
@article{am74(3)-Min,
  author =              {Minsky, Marvin L.},
  title =               {Recursive Unsolvability of {P}ost's Problem of
                         {"}Tag{"} and other Topics in Theory of {T}uring
                         Machines},
  publisher =           {Princeton University Press},
  journal =             {Annals of Mathematics},
  volume =              {74},
  number =              {3},
  pages =               {437-455},
  year =                {1961},
  month =               nov,
}
[Sch61] Marcel-Paul Schützenberger. On the Definition of a Family of Automata. Information and Control 4(2-3):245-270. Academic Press, September 1961.
@article{icont4(2-3)-Sch,
  author =              {Sch{\"u}tzenberger, Marcel-Paul},
  title =               {On the Definition of a Family of Automata},
  publisher =           {Academic Press},
  journal =             {Information and Control},
  volume =              {4},
  number =              {2-3},
  pages =               {245-270},
  year =                {1961},
  month =               sep,
}
1960
[Chu60] Alonzo Church. Applications of recursive arithmetic to the problem of circuit synthesis. In Summaries of the Summer Institute of Symbolic Logic – Volume 1, pages 3-50. Institute for Defense Analyses, 1960.
@inproceedings{sisl1957-Chu,
  author =              {Church, Alonzo},
  title =               {Applications of recursive arithmetic to the problem
                         of circuit synthesis},
  booktitle =           {{S}ummaries of the {S}ummer {I}nstitute of
                         {S}ymbolic {L}ogic~-- Volume~1},
  publisher =           {Institute for Defense Analyses},
  pages =               {3-50},
  year =                {1960},
  confyear =            {1957},
}
1959
[Dij59] Edsger W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik 1:269-271. Springer-Verlag, 1959.
@article{nm1()-Dij,
  author =              {Dijkstra, Edsger W.},
  title =               {A~note on two problems in connexion with graphs},
  publisher =           {Springer-Verlag},
  journal =             {Numerische Mathematik},
  volume =              {1},
  pages =               {269-271},
  year =                {1959},
  doi =                 {10.1007/BF01386390},
}
[Kri59] Saul A. Kripke. A Completeness Theorem in Modal Logic. Journal of Symbolic Logic 24(1):1-14. Association for Symbolic Logic, March 1959.
@article{jsl24(1)-Kri,
  author =              {Kripke, Saul A.},
  title =               {A Completeness Theorem in Modal Logic},
  publisher =           {Association for Symbolic Logic},
  journal =             {Journal of Symbolic Logic},
  volume =              {24},
  number =              {1},
  pages =               {1-14},
  year =                {1959},
  month =               mar,
}
[She59] John C. Shepherdson. The Reduction of Two-Way Automata to One-Way Automata. IBM Journal of Research and Development 3:198-200. April 1959.
@article{IBM-JRD3-She,
  author =              {Shepherdson, John C.},
  title =               {The Reduction of Two-Way Automata to One-Way
                         Automata},
  journal =             {IBM Journal of Research and Development},
  volume =              {3},
  pages =               {198-200},
  year =                {1959},
  month =               apr,
}
1958
[Bel58] Richard Bellman. On a Routing Problem. Quarterly of Applied Mathematics 16(1):87-90. 1958.
@article{qam16(1)-Bel,
  author =              {Bellman, Richard},
  title =               {On a Routing Problem},
  journal =             {Quarterly of Applied Mathematics},
  volume =              {16},
  number =              {1},
  pages =               {87-90},
  year =                {1958},
}
[Gin58] Seymour Ginsburg. On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine. Journal of the ACM 5(3):266-280. ACM Press, July 1958.
@article{jacm5(3)-Gin,
  author =              {Ginsburg, Seymour},
  title =               {On~the Length of the Smallest Uniform Experiment
                         which Distinguishes the Terminal States of a
                         Machine},
  publisher =           {ACM Press},
  journal =             {Journal of the~ACM},
  volume =              {5},
  number =              {3},
  pages =               {266-280},
  year =                {1958},
  month =               jul,
  doi =                 {10.1145/320932.320938},
}
1957
[Bel57] Richard Bellman. Dynamic Programming. Princeton University Press, 1957.
@book{DP-Bel,
  author =              {Bellman, Richard},
  title =               {Dynamic Programming},
  publisher =           {Princeton University Press},
  year =                {1957},
}
[Pri57] Arthur N. Prior. Time and Modality. Oxford University Press, 1957.
@book{Prior-1957,
  author =              {Prior, Arthur N.},
  title =               {Time and Modality},
  publisher =           {Oxford University Press},
  year =                {1957},
}
1956
[Moo56] Edward F. Moore. Gedanken-Experiments on Sequential Machines. In Claude E. Shannon and John McCarthy (eds.), Automata Studies, Annals of Mathematics Studies 34, pages 129-153. Princeton University Press, 1956.
@incollection{am34-Moo,
  author =              {Moore, Edward F.},
  title =               {Gedanken-Experiments on Sequential Machines},
  editor =              {Shannon, Claude E. and McCarthy, John},
  booktitle =           {Automata Studies},
  publisher =           {Princeton University Press},
  series =              {Annals of Mathematics Studies},
  volume =              {34},
  pages =               {129-153},
  year =                {1956},
  doi =                 {10.1515/9781400882618-006},
}
1955
[Tar55] Alfred Tarski. A Lattice-Theoretical Fixpoint Theorem and its Applications. Pacific Journal of Mathematics 5(2):285-309. 1955.
@article{pjm5(2)-Tar,
  author =              {Tarski, Alfred},
  title =               {A Lattice-Theoretical Fixpoint Theorem and its
                         Applications},
  journal =             {Pacific Journal of Mathematics},
  volume =              {5},
  number =              {2},
  pages =               {285-309},
  year =                {1955},
}
1953
[Sha53] Lloyd S. Shapley. Stochastic games. Proceedings of the National Academy of Sciences 39(10):1095-1100. National Academy of Sciences of the United States of America, October 1953.
@article{pnas39(10)-Sha,
  author =              {Shapley, Lloyd S.},
  title =               {Stochastic games},
  publisher =           {National Academy of Sciences of the United States of
                         America},
  journal =             {Proceedings of the National Academy of Sciences},
  volume =              {39},
  number =              {10},
  pages =               {1095-1100},
  year =                {1953},
  month =               oct,
  doi =                 {10.1073/pnas.39.10.1095},
}
1952
[Hig52] Graham Higman. Ordering by Divisibility in Abstract Algebras. Proceedings of the London Mathematical Society s3-2(1):326-336. 1952.
@article{plms-s3-2(1)-Hig,
  author =              {Higman, Graham},
  title =               {Ordering by Divisibility in Abstract Algebras},
  journal =             {Proceedings of the London Mathematical Society},
  volume =              {s3-2},
  number =              {1},
  pages =               {326-336},
  year =                {1952},
}
[Str52] Arthur N. Strahler. Hypsometric (area-altitude) analysis of erosional topography. Geological Society of America Bulletin 63(11):1117-1142. Geological Society of America, November 1952.
@article{gsab63(11)-Str,
  author =              {Strahler, Arthur N.},
  title =               {Hypsometric (area-altitude) analysis of erosional
                         topography},
  publisher =           {Geological Society of America},
  journal =             {Geological Society of America Bulletin},
  volume =              {63},
  number =              {11},
  pages =               {1117-1142},
  year =                {1952},
  month =               nov,
  doi =                 {10.1130/0016-7606(1952)63[1117:HAAOET]2.0.CO;2},
}
[War52] John Glen Wardrop. Some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers 1(3):325-362. May 1952.
@article{pice1(3)-War,
  author =              {Wardrop, John Glen},
  title =               {Some theoretical aspects of road traffic research},
  journal =             {Proceedings of the Institution of Civil Engineers},
  volume =              {1},
  number =              {3},
  pages =               {325-362},
  year =                {1952},
  month =               may,
  doi =                 {10.1680/ipeds.1952.11259},
}
1951
[Nas51] John F. Nash. Non-cooperative Games. Annals of Mathematics 54(2):286-295. Princeton University Press, September 1951.
@article{am54(2)-Nash,
  author =              {Nash, Jr., John F.},
  title =               {Non-cooperative Games},
  publisher =           {Princeton University Press},
  journal =             {Annals of Mathematics},
  volume =              {54},
  number =              {2},
  pages =               {286-295},
  year =                {1951},
  month =               sep,
}
1950
[Nas50] John F. Nash. Equilibrium Points in n-Person Games. Proceedings of the National Academy of Sciences 36(1):48-49. National Academy of Sciences of the United States of America, January 1950.
@article{pnas36(1)-Nash,
  author =              {Nash, Jr., John F.},
  title =               {Equilibrium Points in {\(n\)}-Person Games},
  publisher =           {National Academy of Sciences of the United States of
                         America},
  journal =             {Proceedings of the National Academy of Sciences},
  volume =              {36},
  number =              {1},
  pages =               {48-49},
  year =                {1950},
  month =               jan,
}
1947
[MvN47] Oskar Morgenstern and John von Neumann. The Theory of Games and Economic Behavior. Princeton University Press, 1947.
@book{MvN-game1947,
  author =              {Morgenstern, Oskar and von~Neumann, John},
  title =               {The Theory of Games and Economic Behavior},
  publisher =           {Princeton University Press},
  year =                {1947},
}
1945
[Hor45] Robert E. Horton. Erosional development of streams and their drainage basins; hydrophysical approach to quantitative morphology. Geological Society of America Bulletin 56(3):275-370. Geological Society of America, March 1945.
@article{gsab56(3)-Hor,
  author =              {Horton, Robert E.},
  title =               {Erosional development of streams and their drainage
                         basins; hydrophysical approach to quantitative
                         morphology},
  publisher =           {Geological Society of America},
  journal =             {Geological Society of America Bulletin},
  volume =              {56},
  number =              {3},
  pages =               {275-370},
  year =                {1945},
  month =               mar,
  doi =                 {10.1130/0016-7606(1945)56[275:EDOSAT]2.0.CO;2},
}
1938
[Tur38] Alan M. Turing. On computable numbers, with an application to the Entscheidungsproblem. A Correction. Proceedings of the London Mathematical Society s2-43(6):544-546. 1938.
@article{plms-s2-43(6)-Tur,
  author =              {Turing, Alan M.},
  title =               {On~computable numbers, with an application to the
                         {\emph{Entscheidungsproblem}}. A~Correction},
  journal =             {Proceedings of the London Mathematical Society},
  volume =              {s2-43},
  number =              {6},
  pages =               {544-546},
  year =                {1938},
  doi =                 {10.1112/plms/s2-43.6.544},
}
1937
[Tur37] Alan M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society s2-42(1):230-265. 1937.
@article{plms-s2-42(1)-Tur,
  author =              {Turing, Alan M.},
  title =               {On~computable numbers, with an application to the
                         {\emph{Entscheidungsproblem}}},
  journal =             {Proceedings of the London Mathematical Society},
  volume =              {s2-42},
  number =              {1},
  pages =               {230-265},
  year =                {1937},
  doi =                 {10.1112/plms/s2-42.1.230},
}
1928
[Kna28] Bronisław Knaster. Un théorème sur les fonctions d'ensembles. Annales de la Société Polonaise de Mathématiques 6:133-134. Polish Mathematical Society, 1928.
@article{aspm6()-Kna,
  author =              {Knaster, Bronis{\l}aw},
  title =               {Un th{\'e}or{\`e}me sur les fonctions d'ensembles},
  publisher =           {Polish Mathematical Society},
  journal =             {Annales de la Soci\'et\'e Polonaise de
                         Math\'ematiques},
  volume =              {6},
  pages =               {133-134},
  year =                {1928},
}
1927
[Kon27] Dénes Kőnig. Über eine Schlussweise aus dem Endlichen ins Unendliche. Acta litt. sci. Reg. Univ. Hung. Francisco-Josephinae, Sect. sci. math. 3(2-3):121-130. János Bolyai Mathematical Institute, University of Szeged, June 1927.
@article{actaszeged3(2-3)-Kon,
  author =              {K{\H o}nig, D{\'e}nes},
  title =               {{\"U}ber eine Schlussweise aus dem Endlichen ins
                         Unendliche},
  publisher =           {J{\'a}nos Bolyai Mathematical Institute, University
                         of Szeged},
  journal =             {Acta litt. sci. Reg. Univ. Hung.
                         Francisco-Josephinae, Sect. sci. math.},
  volume =              {3},
  number =              {2-3},
  pages =               {121-130},
  year =                {1927},
  month =               jun,
}
1920
[Pig20] Arthur C. Pigou. The economics of welfare. MacMillan and Co., 1920.
@book{Pigou1920,
  author =              {Pigou, Arthur C.},
  title =               {The~economics of welfare},
  publisher =           {MacMillan and Co.},
  year =                {1920},
}
1901
[Bou01] Charles L. Bouton. Nim, a game with a complete mathematical theory. Annals of Mathematics 3(1-4):35-39. Princeton University Press, 1901.
@article{am3(1-4)-Bou,
  author =              {Bouton, Charles L.},
  title =               {Nim, a~game with a complete mathematical theory},
  publisher =           {Princeton University Press},
  journal =             {Annals of Mathematics},
  volume =              {3},
  number =              {1-4},
  pages =               {35-39},
  year =                {1901},
}
List of authors