|
76
|
Deciding the Winner in Parity Games is
– Marcin Jurdziński
- 1998
|
|
62
|
On the complexity of bounded-variable queries
– Moshe Y Vardi
- 1995
|
|
4
|
H uttel and Josva Kleist. Objects as Mobile Processes
– RS-96-38 Hans
- 1996
|
|
3
|
On a family of boolean matrices
– A E Andreev
- 1986
|
|
2
|
CASOP: A fast algorithm for computing the n-ary composition of a binary associative operator
– James Cooper, Leslie Kitchen
- 1990
|
|
12
|
Stølting Brodal and Chris Okasaki. Optimal purely functional priority queues
– Gerth
- 1996
|
|
4
|
Some Remarks on Boolean Sums
– K Mehlhorn
- 1979
|
|
7
|
A linear time approach to the set maxima problem
– A Bar-Noy, R Motwani, J Naor
- 1992
|
|
66
|
The art of computer programming, Volume I: Fundamental Algorithms
– D E Knuth
- 1968
|
|
105
|
The Art of Computer Programming, Volume III: Sorting and Searching
– D E Knuth
- 1973
|
|
16
|
A Complete Axiom System for Isomorphism of Types in Closed Categories.
– S. Soloviev
- 1993
|
|
4
|
Stølting Brodal and Sven Skyum. The Complexity of Computing the k-ary Composition of a Binary Associative Operator
– RS-96-42 Gerth
- 1996
|
|
2
|
Zapiski Nauchnych Seminarov Leningradskogo Otdelenya Matematicheskogo Instituta im.V.A.Steklova AN SSSR
– K Bruce, R Di Cosmo, G Longo
- 1981
|
|
2
|
Ecole Normale Superieure
– Preprint LIENS-90-14
- 1990
|
|
2
|
Recent Publications in the BRICS Report Series RS-96-46 Alexander E. Andreev and Sergei Soloviev. A Deciding Algorithm for Linear Isomorphism of Types with Complexity Cn(log (n
– Ivan B Damg ard, Torben P Pedersen, Birgit Pfitzmann
- 1996
|
|
18
|
Retrieving Library Functions By Unifying Types Modulo Linear Isomorphism
– Mikael Rittri
- 1992
|
|
68
|
A Term Calculus for Intuitionistic Linear Logic
– Nick Benton, Gavin Bierman, Valeria De Paiva, Martin Hyland
- 1993
|
|
33
|
A Presheaf Semantics of Value-Passing Processes
– Glynn Winskel, Glynn Winskel
- 1996
|
|
182
|
Tree Automata, Mu-Calculus and Determinacy (Extended Abstract)
– E. A. Emerson, C. S. Jutla
- 1991
|
