1987 | |
---|---|
[Ang87] | Dana Angluin. Learning regular sets from queries and counterexamples. Information and Computation 75(2):87-106. Academic Press, November 1987. |
[Bus87] | Samuel R. Buss.
The Boolean Formula Value Problem is in ALOGTIME.
In STOC'87,
pages 123-131.
ACM Press, May 1987.
|
[Cas87] | Ilaria Castellani.
Bisimulations and abstraction homomorphisms.
Journal of Computer and System Sciences 34(2-3):210-235. Academic Press, April 1987.
|
[CG87] | Edmund M. Clarke and
Orna Grumberg.
Research on Automatic Verification of Finite-State
Concurrent Systems.
Annual Review of Computer Science 2:269-290. Annual Reviews Inc., 1987.
|
[EL87] | E. Allen Emerson and
Chin-Laung Lei.
Modalities for Model Checking: Branching Time Logic
Strikes Back.
Science of Computer Programming 8(3):275-306. Elsevier, June 1987.
|
[Imm87] | Neil Immerman.
Languages That Capture Complexity Classes.
SIAM Journal on Computing 16(4):760-778. Society for Industrial and Applied Math., August 1987.
|
[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. February 1987. |
[Koy87] | Ron Koymans.
Specifying Message Passing and Real-Time Systems
with Real-Time Temporal Logic.
In ESPRIT'87.
Elsevier, September 1987.
|
[Kre87] | Mark W. Krentel.
The Complexity of Optimization Problems.
PhD thesis,
Department of Computer Science, Cornell University,
Ithaca, New York, USA,
1987.
|
[KSW87] | Johannes Köbler,
Uwe Schöning, and
Klaus W. Wagner.
The difference and truth-table hierarchies for NP.
RAIRO – Informatique Théorique et Applications 21(4):419-435. EDP Sciences, 1987.
|
[Lam87] | Leslie Lamport.
A Fast Mutual Exclusion Algorithm.
ACM Transactions on Computer Systems 5(1):1-11. ACM Press, February 1987.
|
[MS87] | David E. Muller and
Paul E. Schupp.
Alternating Automata on Infinite Trees.
Theoretical Computer Science 54(2-3):267-276. Elsevier, October 1987.
|
[RW87] | Peter J. Ramadge and 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., January 1987. |
[Sto87] | Larry J. Stockmeyer.
Classifying the Computational Complexity of
Problems.
Journal of Symbolic Logic 52(1):1-43. Association for Symbolic Logic, March 1987.
|
[SVW87] | A. Prasad Sistla,
Moshe Y. Vardi, and
Pierre Wolper.
The Complementation Problem for Büchi Automata
with Applications to Temporal Logics.
Theoretical Computer Science 49:217-237. Elsevier, 1987.
|
[TvE+87] | Leen Torenvliet and
Peter van Emde Boas.
A Note on Time and Space.
In CSN'87.
SION, November 1987.
|
[TV87] | Frank Thuijsman and Okko J. Vrieze. The bad match; A total reward stochastic game. OR Spektrum 9(2):93-99. 1987. |
[Wag87] | Klaus W. Wagner.
More complicated questions about maxima and minima,
and some closures of NP.
Theoretical Computer Science 51:53-80. Elsevier, 1987.
|
Search
Displayed 18 resultsList of authors
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 2
- 1
- 1