1987
[Ang87] Dana Angluin. Learning regular sets from queries and counterexamples. Information and Computation 75(2):87-106. Academic Press, novembre 1987. 
@article{icomp75(2)-Ang,
  author =              {Angluin, Dana},
  title =               {Learning regular sets from queries and
                         counterexamples},
  publisher =           {Academic Press},
  journal =             {Information and Computation},
  volume =              {75},
  number =              {2},
  pages =               {87-106},
  year =                {1987},
  month =               nov,
  doi =                 {10.1016/0890-5401(87)90052-6},
}
[Bus87] Samuel R. Buss. The Boolean Formula Value Problem is in ALOGTIME. In STOC'87, pages 123-131. ACM Press, mai 1987. 
@inproceedings{stoc1987-Bus,
  author =              {Buss, Samuel R.},
  title =               {The Boolean Formula Value Problem is in {ALOGTIME}},
  booktitle =           {{P}roceedings of the 19th {A}nnual {ACM} {S}ymposium
                         on the {T}heory of {C}omputing ({STOC}'87)},
  acronym =             {{STOC}'87},
  publisher =           {ACM Press},
  pages =               {123-131},
  year =                {1987},
  month =               may,
}
[Cas87] Ilaria Castellani. Bisimulations and abstraction homomorphisms. Journal of Computer and System Sciences 34(2-3):210-235. Academic Press, avril 1987. 
@article{jcss34(2-3)-Cas,
  author =              {Castellani, Ilaria},
  title =               {Bisimulations and abstraction homomorphisms},
  publisher =           {Academic Press},
  journal =             {Journal of Computer and System Sciences},
  volume =              {34},
  number =              {2-3},
  pages =               {210-235},
  year =                {1987},
  month =               apr,
}
[CG87] Edmund M. Clarke et Orna Grumberg. Research on Automatic Verification of Finite-State Concurrent Systems. Annual Review of Computer Science 2:269-290. Annual Reviews Inc., 1987. 
@article{arcs2()-CG,
  author =              {Clarke, Edmund M. and Grumberg, Orna},
  title =               {Research on Automatic Verification of Finite-State
                         Concurrent Systems},
  publisher =           {Annual Reviews Inc.},
  journal =             {Annual Review of Computer Science},
  volume =              {2},
  pages =               {269-290},
  year =                {1987},
}
[EL87] E. Allen Emerson et Chin-Laung Lei. Modalities for Model Checking: Branching Time Logic Strikes Back. Science of Computer Programming 8(3):275-306. Elsevier, juin 1987. 
@article{scp8(3)-EL,
  author =              {Emerson, E. Allen and Lei, Chin-Laung},
  title =               {Modalities for Model Checking: Branching Time Logic
                         Strikes Back},
  publisher =           {Elsevier},
  journal =             {Science of Computer Programming},
  volume =              {8},
  number =              {3},
  pages =               {275-306},
  year =                {1987},
  month =               jun,
}
[Imm87] Neil Immerman. Languages That Capture Complexity Classes. SIAM Journal on Computing 16(4):760-778. Society for Industrial and Applied Math., août 1987. 
@article{siamcomp16(4)-Imm,
  author =              {Immerman, Neil},
  title =               {Languages That Capture Complexity Classes},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Computing},
  volume =              {16},
  number =              {4},
  pages =               {760-778},
  year =                {1987},
  month =               aug,
}
[Kha87] Oussama Khatib. A unified approach for motion and force control of robot manipulators: The operational space formulation. IEEE Journal of Robotics and Auomation 3(1):43-53. Février 1987. 
@article{jra3(1)-Kha,
  author =              {Khatib, Oussama},
  title =               {A~unified approach for motion and force control of
                         robot manipulators: The operational space
                         formulation},
  journal =             {IEEE Journal of Robotics and Auomation},
  volume =              {3},
  number =              {1},
  pages =               {43-53},
  year =                {1987},
  month =               feb,
  doi =                 {10.1109/JRA.1987.1087068},
}
[Koy87] Ron Koymans. Specifying Message Passing and Real-Time Systems with Real-Time Temporal Logic. In ESPRIT'87. Elsevier, septembre 1987. 
@inproceedings{esprit1987-Koy,
  author =              {Koymans, Ron},
  title =               {Specifying Message Passing and Real-Time Systems
                         with Real-Time Temporal Logic},
  booktitle =           {{P}roceedings of the 4th {A}nnual {ESPRIT}
                         {C}onference ({ESPRIT}'87)},
  acronym =             {{ESPRIT}'87},
  publisher =           {Elsevier},
  year =                {1987},
  month =               sep,
}
[Kre87] Mark W. Krentel. The Complexity of Optimization Problems. PhD thesis, Department of Computer Science, Cornell University, Ithaca, New York, USA, 1987. 
@phdthesis{phd-krentel,
  author =              {Krentel, Mark W.},
  title =               {The Complexity of Optimization Problems},
  year =                {1987},
  school =              {Department of Computer Science, Cornell University,
                         Ithaca, New York, USA},
  type =                {{PhD} thesis},
}
[KSW87] Johannes Köbler, Uwe Schöning et Klaus W. Wagner. The difference and truth-table hierarchies for NP. RAIRO – Informatique Théorique et Applications 21(4):419-435. EDP Sciences, 1987. 
@article{rairo-ita21(4)-KSW,
  author =              {K{\"o}bler, Johannes and Sch{\"o}ning, Uwe and
                         Wagner, Klaus W.},
  title =               {The difference and truth-table hierarchies for~{NP}},
  publisher =           {EDP Sciences},
  journal =             {RAIRO~-- Informatique Th{\'e}orique et Applications},
  volume =              {21},
  number =              {4},
  pages =               {419-435},
  year =                {1987},
}
[Lam87] Leslie Lamport. A Fast Mutual Exclusion Algorithm. ACM Transactions on Computer Systems 5(1):1-11. ACM Press, février 1987. 
@article{tocs5(1)-Lam,
  author =              {Lamport, Leslie},
  title =               {A~Fast Mutual Exclusion Algorithm},
  publisher =           {ACM Press},
  journal =             {ACM Transactions on Computer Systems},
  volume =              {5},
  number =              {1},
  pages =               {1-11},
  year =                {1987},
  month =               feb,
}
[MS87] David E. Muller et Paul E. Schupp. Alternating Automata on Infinite Trees. Theoretical Computer Science 54(2-3):267-276. Elsevier, octobre 1987. 
@article{tcs54(2-3)-MS,
  author =              {Muller, David E. and Schupp, Paul E.},
  title =               {Alternating Automata on Infinite Trees},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {54},
  number =              {2-3},
  pages =               {267-276},
  year =                {1987},
  month =               oct,
}
[RW87] Peter J. Ramadge et W. Murray Wonham. Supervisory Control of a Class of Discrete Event Processes. SIAM Journal on Control and Optimization 25(1):206-230. Society for Industrial and Applied Math., janvier 1987. 
@article{siamjco25(1)-RW,
  author =              {Ramadge, Peter J. and Wonham, W. Murray},
  title =               {Supervisory Control of a Class of Discrete Event
                         Processes},
  publisher =           {Society for Industrial and Applied Math.},
  journal =             {SIAM Journal on Control and Optimization},
  volume =              {25},
  number =              {1},
  pages =               {206-230},
  year =                {1987},
  month =               jan,
  doi =                 {10.1137/0325013},
}
[Sto87] Larry J. Stockmeyer. Classifying the Computational Complexity of Problems. Journal of Symbolic Logic 52(1):1-43. Association for Symbolic Logic, mars 1987. 
@article{jsl52(1)-Sto,
  author =              {Stockmeyer, Larry J.},
  title =               {Classifying the Computational Complexity of
                         Problems},
  publisher =           {Association for Symbolic Logic},
  journal =             {Journal of Symbolic Logic},
  volume =              {52},
  number =              {1},
  pages =               {1-43},
  year =                {1987},
  month =               mar,
}
[SVW87] A. Prasad Sistla, Moshe Y. Vardi et Pierre Wolper. The Complementation Problem for Büchi Automata with Applications to Temporal Logics. Theoretical Computer Science 49:217-237. Elsevier, 1987. 
@article{tcs49()-SVW,
  author =              {Sistla, A. Prasad and Vardi, Moshe Y. and Wolper,
                         Pierre},
  title =               {The Complementation Problem for {B}{\"u}chi Automata
                         with Applications to Temporal Logics},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {49},
  pages =               {217-237},
  year =                {1987},
}
[TvE+87] Leen Torenvliet et Peter van Emde Boas. A Note on Time and Space. In CSN'87. SION, novembre 1987. 
@inproceedings{csn1987-TE,
  author =              {Torenvliet, Leen and van Emde Boas, Peter},
  title =               {A Note on Time and Space},
  booktitle =           {{P}roceedings of the 1st {C}onference on {C}omputing
                         {S}cience in the {N}etherlands ({CSN}'87)},
  acronym =             {{CSN}'87},
  publisher =           {SION},
  year =                {1987},
  month =               nov,
}
[TV87] Frank Thuijsman et Okko J. Vrieze. The bad match; A total reward stochastic game. OR Spektrum 9(2):93-99. 1987. 
@article{ORspectrum9(2)-TV,
  author =              {Thuijsman, Frank and Vrieze, Okko J.},
  title =               {The bad match; A~total reward stochastic game},
  journal =             {OR Spektrum},
  volume =              {9},
  number =              {2},
  pages =               {93-99},
  year =                {1987},
  doi =                 {10.1007/BF01732644},
}
[Wag87] Klaus W. Wagner. More complicated questions about maxima and minima, and some closures of NP. Theoretical Computer Science 51:53-80. Elsevier, 1987. 
@article{tcs51()-Wag,
  author =              {Wagner, Klaus W.},
  title =               {More complicated questions about maxima and minima,
                         and some closures of~{NP}},
  publisher =           {Elsevier},
  journal =             {Theoretical Computer Science},
  volume =              {51},
  pages =               {53-80},
  year =                {1987},
}
Liste des auteurs