1979 | |
---|---|
[Abr79] | Karl Abrahamson. Modal Logic of Concurrent Nondeterministic Programs. In SCC'79, Lecture Notes in Computer Science 70, pages 21-33. Springer-Verlag, juillet 1979. |
[APT79] | Bengt Aspvall,
Michael F. Plass et
Robert Endre Tarjan.
A Linear-Time Algorithm for Testing the Truth of
Certain Quantified Boolean Formulas.
Information Processing Letters 8(3):121-123. Elsevier, mars 1979. erratum as \citeipl14(4)-APT.
|
[Bur79] | John P. Burgess.
Logic and Time.
Journal of Symbolic Logic 44(4):566-582. Association for Symbolic Logic, décembre 1979.
|
[CC79] | Patrick Cousot et
Radhia Cousot.
Constructive Versions of Tarski's Fixed Point
Theorems.
Pacific Journal of Mathematics 82(1):43-57. 1979.
|
[EM79] | Andrzej Ehrenfeucht et Jan Mycielski. Positional strategies for mean payoff games. International Journal of Game Theory 8(2):109-113. Springer-Verlag, juin 1979. |
[FL79] | Michael J. Fischer et Richard E. Ladner. Propositional Dynamic Logic of Regular Programs. Journal of Computer and System Sciences 18(2):194-211. Academic Press, avril 1979. |
[GJ79] | Michael R. Garey et David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1979. |
[Val79] | Leslie G. Valiant.
The Complexity of Computing the Permanent.
Theoretical Computer Science 8:189-201. Elsevier, 1979.
|
[VTL79] | Jacobo Valdes, Robert Endre Tarjan et Eugene L. Lawler. The recognition of series-parallel digraphs. In STOC'79, pages 1-12. ACM Press, avril 1979. |
1978 | |
[ITN78] | Katsushi Inoue,
Itsuo Takanami et
Akira Nakamura.
A note on Two-dimensional Finite Automata.
Information Processing Letters 7(1):49-52. Elsevier, janvier 1978.
|
[Kar78] | Richard M. Karp. A characterization of the minimum cycle mean in a digraph. Discrete Mathematics 23(3):309-311. Elsevier, septembre 1978. |
[Mai78] | David Maier.
The Complexity of Some Problems on Subsequences and
Supersequences.
Journal of the ACM 25(2):322-336. ACM Press, avril 1978.
|
[Rac78] | Charles Rackoff. The Covering and Boundedness Problems for Vector Addition Systems. Theoretical Computer Science 6:223-231. Elsevier, 1978. |
[SS78] | William J. Sakoda et
Michael Sipser.
Nondeterminism and the Size of Two Way Finite
Automata.
In STOC'78,
pages 275-286.
ACM Press, mai 1978.
|
1977 | |
[CC77] | Patrick Cousot et 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, janvier 1977. |
[Pnu77] | Amir Pnueli. The Temporal Logic of Programs. In FOCS'77, pages 46-57. IEEE Comp. Soc. Press, octobre 1977. |
[ZL77] | Jacob Ziv et
Abraham Lempel.
A Universal Algorithm for Sequential Data
Compression.
IEEE Transactions on Information Theory 23(3):337-343. IEEE Inf. Theory Soc., mai 1977.
|
1976 | |
[Gal76] | Zvi Galil.
Hierarchies of Complete Problems.
Acta Informatica 6:77-88. Springer-Verlag, 1976.
|
[RV76] | Ronald L. Rivest et
Jean Vuillemin.
On Recognizing Graph Properties from Adjacency
Matrices.
Theoretical Computer Science 3(3):371-384. Elsevier, 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.
|
[Sto76] | Larry J. Stockmeyer.
The Polynomial-Time Hierarchy.
Theoretical Computer Science 3(1):1-22. Elsevier, 1976.
|
[Wra76] | Celia Wrathall.
Complete Sets and the Polynomial-Time Hierarchy.
Theoretical Computer Science 3(1):23-33. Elsevier, 1976.
|
1975 | |
[Mar75] | Donald A. Martin. Borel Determinacy. Annals of Mathematics 102(2):363-371. Princeton University Press, septembre 1975. |
1974 | |
[FR74] | Michael J. Fischer et
Michael O. Rabin.
Super-Exponential Complexity of Presburger
Arithmetic.
TR TM-43, MIT Press, février 1974.
|
[HT74] | John Hopcroft et
Robert Endre Tarjan.
Efficient Planarity Testing.
Journal of the ACM 21(4):549-568. ACM Press, octobre 1974.
|
[Sto74] | Larry J. Stockmeyer. The Complexity of Decision Problems in Automata Theory and Logic. PhD thesis, MIT, 1974. |
1973 | |
[BFP+73] | Manuel Blum,
Robert W. Floyd,
Vaughan R. Pratt,
Ronald L. Rivest et
Robert Endre Tarjan.
Time Bounds for Selection.
Journal of Computer and System Sciences 7(4):448-461. Academic Press, août 1973.
|
[Ros73] | Robert W. Rosenthal. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2(1):65-67. Springer-Verlag, décembre 1973. |
[Ros73] | Robert W. Rosenthal. The network equilibrium problem in integers. Networks 3(1):53-59. John Wiley & Sons, janvier 1973. |
[SM73] | Larry J. Stockmeyer et
Albert R. Meyer.
Word Problems Requiring Exponential Time:
Preliminary Report.
In STOC'73,
pages 1-9.
ACM Press, avril 1973.
|
1972 | |
[Cov72] | Thomas M. Cover. Broadcast Channels. IEEE Transactions on Information Theory 18(1):2-14. IEEE Inf. Theory Soc., janvier 1972. |
[GK72] | Yuri Gurevich et Igor O. Koryakov. Remarks on Berger's paper on the domino problem. Siberian Mathematical Journal 13(2):459-463. Springer-Verlag, mars 1972. |
[HNR72] | Peter E. Hart, Nils J. Nilsson et Bertram Raphael. Correction to "A Formal Basis for the Heuristic Determination of Minimum Cost Paths". SIGACT News 37:28-29. ACM Press, décembre 1972. |
[Kar72] | Richard M. Karp. Reducibility Among Combinatorial Problems. In CCC'72, IBM Research Symposia Series, pages 85-103. Plenum Press, mars 1972. |
[MS72] | Albert R. Meyer et
Larry J. Stockmeyer.
The Equivalence Problem for Regular Expressions with
Squaring Requires Exponential Space.
In FOCS'72,
pages 125-129.
IEEE Comp. Soc. Press, octobre 1972.
|
[Rab72] | Michael O. Rabin.
Automata on infinite objects and Church's thesis.
Regional Conference Series in Mathematics 13.
American Mathematical Society, 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., juin 1972.
|
1971 | |
[Coo71] | Stephen A. Cook.
The complexity of Theorem Proving Procedures.
In STOC'71,
pages 151-158.
ACM Press, 1971.
|
[Mun71] | J. Ian Munro.
Efficient Determination of the Transitive Closure of
a Directed Graph.
Information Processing Letters 1(2):56-58. Elsevier, juin 1971.
|
1970 | |
[Fin70] | Kit Fine. Propositional quantifiers in modal logic. Theoria 36(3):336-346. John Wiley & Sons, décembre 1970. |
[Rab70] | Michael O. Rabin.
Weakly definable relations and special automata.
In SMLFST'70,
pages 1-23.
North-Holland, 1970.
|
[Sav70] | Walter Savitch. Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences 4(2):177-192. Academic Press, avril 1970. |
1969 | |
[BL69] | Julius R. Büchi et Lawrence H. Landweber. Solving Sequential Conditions by Finite-State Strategies. Transactions of the American Mathematical Society 138:295-311. American Mathematical Society, avril 1969. |
[BL69] | Julius R. Büchi et Lawrence H. Landweber. Definiability in the Monadic Second-Order Theory of Successor. Journal of Symbolic Logic 34(2):166-170. Association for Symbolic Logic, juin 1969. |
[Hoa69] | Charles Antony Richard Hoare. An axiomatic basis for computer programming. Communications of the ACM 12(10):576-580. ACM Press, octobre 1969. |
[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, juillet 1969. |
[WL69] | Richard J. Waldinger et
Richard C. T. Lee.
PROW: a step towards automatic program writing.
In IJCAI'69,
pages 241-252.
William Kaufmann Inc., mai 1969.
|
1968 | |
[HNR68] | Peter E. Hart, Nils J. Nilsson et 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, juillet 1968. |
[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.
|
[Pri68] | Arthur N. Prior.
Papers on Time and Tense.
Oxford University Press, 1968.
|
1967 | |
[BH67] | Manuel Blum et
Carl Hewitt.
Automata on a 2-Dimensional Tape.
In FOCS'67,
pages 155-160.
IEEE Comp. Soc. Press, octobre 1967.
|
[DBR67] | George B. Dantzig, W. O. Blattner et 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. |
[Har67] | John C. Harsanyi.
Games with incomplete information played by
"Bayesian" players – (I) The basic model.
Management Science 14(3):159-182. Novembre 1967.
|
[Min67] | Marvin L. Minsky.
Computation: Finite and Infinite Machines.
Prentice Hall, Inc., 1967.
|
[Pri67] | Arthur N. Prior.
Past, Present and Future.
Oxford University Press, 1967.
|
[Ros67] | Pierre Rosenstiehl.
Theory of Graphs.
Gordon and Breach Science Publishers, 1967.
|
1966 | |
[GS66] | Seymour Ginsburg et Edwin Spanier. Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics 16(2):285-296. Décembre 1966. |
[McN66] | Robert McNaughton. Testing and Generating Infinite Sequences by a Finite Automaton. Information and Control 9(6):521-530. Academic Press, décembre 1966. |
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. |
1963 | |
[Chu63] | Alonzo Church. Logic, arithmetic, and automata. In ICM'62, pages 23-35. 1963. |
[Kri63] | Saul A. Kripke.
Semantical Considerations on Modal Logic.
Acta Philosophica Fennica 16:83-94. Philosophical Society of Finland, 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. |
[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. |
1962 | |
[Buc62] | Julius R. Büchi. On a Decision Method in Restricted Second Order Arithmetic. In LMPS'60, pages 1-11. Stanford University Press, juin 1962. |
[Pet62] | Carl Adam Petri.
Kommunikation mit Automaten.
PhD thesis,
Darmstadt University of Technology, Germany,
1962.
|
[Tra62] | Boris A. Trakhtenbrot.
Finite automata and the logic of one-place
predicates.
Siberskii Matematicheskii Zhurnal 3(1):103-131. Sobolev Institute of Mathematics, 1962.
|
[War62] | Stephen Warshall. A Theorem on Boolean Matrices. Journal of the ACM 9(1):11-12. ACM Press, janvier 1962. |
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.
|
[Elg61] | Calvin C. Elgot. Decision problems of finite automata design and related arithmetics. Transactions of the American Mathematical Society 98(1):21-51. American Mathematical Society, janvier 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.
|
[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, novembre 1961.
|
[Sch61] | Marcel-Paul Schützenberger. On the Definition of a Family of Automata. Information and Control 4(2-3):245-270. Academic Press, septembre 1961. |
1960 | |
[Buc60] | Julius R. Büchi. Weak second-order arithmetic and finite automata. Mathematical Logic Quarterly 6(1-6):66-92. 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.
|
1959 | |
[Dij59] | Edsger W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik 1:269-271. Springer-Verlag, 1959. |
[Kri59] | Saul A. Kripke. A Completeness Theorem in Modal Logic. Journal of Symbolic Logic 24(1):1-14. Association for Symbolic Logic, mars 1959. |
[RS59] | Michael O. Rabin et Dana S. Scott. Finite automata and their decision problems. IBM Journal of Research and Development 3(2):114-125. Avril 1959. |
[She59] | John C. Shepherdson.
The Reduction of Two-Way Automata to One-Way
Automata.
IBM Journal of Research and Development 3(2):198-200. Avril 1959.
|
1958 | |
[Bel58] | Richard Bellman.
On a Routing Problem.
Quarterly of Applied Mathematics 16(1):87-90. 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, juillet 1958. |
1957 | |
[Bel57] | Richard Bellman.
Dynamic Programming.
Princeton University Press, 1957.
|
[Pri57] | Arthur N. Prior.
Time and Modality.
Oxford University Press, 1957.
|
1956 | |
[Moo56] | Edward F. Moore. Gedanken-Experiments on Sequential Machines. In Claude E. Shannon et John McCarthy (eds.), Automata Studies, Annals of Mathematics Studies 34, pages 129-153. Princeton University Press, 1956. |
1955 | |
[Tar55] | Alfred Tarski.
A Lattice-Theoretical Fixpoint Theorem and its
Applications.
Pacific Journal of Mathematics 5(2):285-309. 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, octobre 1953. |
1952 | |
[Hig52] | Graham Higman. Ordering by Divisibility in Abstract Algebras. Proceedings of the London Mathematical Society s3-2(1):326-336. 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, novembre 1952. |
[War52] | John Glen Wardrop. Some theoretical aspects of road traffic research. Proceedings of the Institution of Civil Engineers 1(3):325-362. Mai 1952. |
1951 | |
[Nas51] | John F. Nash.
Non-cooperative Games.
Annals of Mathematics 54(2):286-295. Princeton University Press, septembre 1951.
|
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, janvier 1950. |
1947 | |
[MvN47] | Oskar Morgenstern et
John von Neumann.
The Theory of Games and Economic Behavior.
Princeton University Press, 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, mars 1945. |
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. |
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. |
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.
|
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, juin 1927. |
1920 | |
[Pig20] | Arthur C. Pigou. The economics of welfare. MacMillan and Co., 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. |
Sélectionner
98 correspondances trouvéesListe des auteurs
- 1
- 1
- 1
- 4
- 2
- 1
- 2
- 1
- 1
- 2
- 1
- 2
- 2
- 1
- 1
- 1
- 2
- 1
- 1
- 2
- 1
- 1
- 1
- 2
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1
- 3
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 3
- 5
- 1
- 1
- 2
- 2
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 4
- 1
- 1
- 5
- 1
- 1
- 1
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1