|
6
|
An Old Sub-Quadratic Algorithm for Finding Extremal Sets
– Paul Pritchard
- 1994
|
|
9
|
Opportunistic algorithms for eliminating supersets
– P Pritchard
- 1991
|
|
9
|
Finding extremal sets in less than quadratic time
– D Yellin, C Jutla
- 1993
|
|
123
|
Dynamic Perfect Hashing: Upper and Lower Bounds
– Martin Dietzfelbinger, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert E. Tarjan
- 1990
|
|
314
|
R.: Three partition refinement algorithms
– R Paige, Tarjan
- 1987
|
|
2173
|
The Design and Analysis of Computer Algorithms
– A V Aho, J E Hopcroft, J D Ullman
- 1974
|
|
4
|
A Simple Sub-Quadratic Algorithm for Computing the Subset Partial Order
– Paul Pritchard
- 1995
|
|
477
|
Concrete Mathematics
– R L Graham, D E Knuth, O Patashnik
- 1989
|
|
2
|
A fast bit-parallel algorithm for computing the subset partial order
– P Pritchard
- 1999
|
|
231
|
The reflexive chemical abstract machine and the join-calculus
– Cédric Fournet, Georges Gonthier
- 1996
|
|
13
|
Linear Forwarders
– Philippa Gardner, Cosimo Laneve , Lucian Wischik
- 2007
|
|
34
|
Functional Nets
– Martin Odersky
- 2000
|
|
48
|
Bisimulations in the join-calculus
– Cédric Fournet, Cosimo Laneve, Luc Maranget, Didier Rémy
- 1998
|
|
47
|
The problem of “Weak Bisimulation up to
– Davide Sangiorgi, Robin Milner
- 1992
|
|
80
|
On Asynchrony in Name-Passing Calculi
– Massimo Merro, Davide Sangiorgi
- 1998
|
|
18
|
PiDuce: A process calculus with native XML datatypes
– Allen L. Brown, Cosimo Laneve, L. Gregory Meredith
- 2005
|
|
44
|
Implicit typing `a la ML for the join-calculus
– Edric Fournet, Cosimo Laneve, Luc Maranget
- 1997
|
|
17
|
Join Java: An alternative concurrency semantics for Java
– G Stewart Itzstein, David Kearney
- 2001
|
|
9
|
Expressive synchronization types for inheritance in the join calculus
– Qin Ma, Luc Maranget
- 2003
|
