| 2008 |
| 21 | EE | Sander Evers,
Maarten M. Fokkinga,
Peter M. G. Apers:
Probabilistic processing of interval-valued sensor data.
DMSN 2008: 42-48 |
| 20 | EE | Pavel Serdyukov,
Ling Feng,
Arthur H. van Bunningen,
Sander Evers,
Harold van Heerde,
Peter M. G. Apers,
Maarten M. Fokkinga,
Djoerd Hiemstra:
The Right Expert at the Right Time and Place.
PAKM 2008: 38-49 |
| 2007 |
| 19 | EE | Arthur H. van Bunningen,
Maarten M. Fokkinga,
Peter M. G. Apers,
Ling Feng:
Ranking Query Results using Context-Aware Preferences.
ICDE Workshops 2007: 269-276 |
| 18 | EE | Pavel Serdyukov,
Djoerd Hiemstra,
Maarten M. Fokkinga,
Peter M. G. Apers:
Generative modeling of persons and documents for expert search.
SIGIR 2007: 827-828 |
| 17 | EE | Sander Evers,
Maarten M. Fokkinga,
Peter M. G. Apers:
Composable Markov Building Blocks.
SUM 2007: 131-142 |
| 2006 |
| 16 | EE | Maarten M. Fokkinga:
Z-style notation for Probabilities.
TDM 2006: 19-24 |
| 15 | EE | Maarten M. Fokkinga:
Ignorance in the Relational Model.
TDM 2006: 33-40 |
| 2003 |
| 14 | EE | Roel Wieringa,
Henk M. Blanken,
Maarten M. Fokkinga,
Paul W. P. J. Grefen:
Aligning Application Architecture to the Business Context.
CAiSE 2003: 209-225 |
| 2002 |
| 13 | | Roelof van Zwol,
V. Jeronimus,
Maarten M. Fokkinga,
Peter M. G. Apers:
Data Exchange over Web-based Applications with DXL.
DIWeb 2002: 17-33 |
| 12 | EE | Rik Eshuis,
Maarten M. Fokkinga:
Comparing Refinements for Failure and Bisimulation Semantics.
Fundam. Inform. 52(4): 297-321 (2002) |
| 2001 |
| 11 | EE | Roland Carl Backhouse,
Maarten M. Fokkinga:
The associativity of equivalence and the Towers of Hanoi problem.
Inf. Process. Lett. 77(2-4): 71-76 (2001) |
| 1999 |
| 10 | | Rick van Rein,
Maarten M. Fokkinga:
Protocol Assuring Universal Language.
FMOODS 1999: 241-258 |
| 1996 |
| 9 | | Maarten M. Fokkinga:
Expressions That Talk About Themselves.
Comput. J. 39(5): 386-407 (1996) |
| 8 | | Maarten M. Fokkinga:
Datatype Laws without Signatures.
Mathematical Structures in Computer Science 6(1): 1-32 (1996) |
| 1993 |
| 7 | | Maarten M. Fokkinga,
Mannes Poel,
Job Zwiers:
Modular Completeness for Communication Closed Layers.
CONCUR 1993: 50-65 |
| 1992 |
| 6 | | Maarten M. Fokkinga:
Calculate Categorically!
Formal Asp. Comput. 4(6A): 673-692 (1992) |
| 1991 |
| 5 | | Erik Meijer,
Maarten M. Fokkinga,
Ross Paterson:
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire.
FPCA 1991: 124-144 |
| 4 | | Maarten M. Fokkinga:
An Exercise in Transformational Programming: Backtracking and Branch-and-Bound.
Sci. Comput. Program. 16(1): 19-48 (1991) |
| 3 | | Herman Balsters,
Maarten M. Fokkinga:
Subtyping Can Have a Simple Semantics.
Theor. Comput. Sci. 87(1): 81-96 (1991) |
| 1987 |
| 2 | | Maarten M. Fokkinga:
A Correctness Proof of Sorting by Means of Formal Procedures.
Sci. Comput. Program. 9(3): 263-269 (1987) |
| 1974 |
| 1 | | Maarten M. Fokkinga:
Inductive assertion patters for recursive procedures.
Symposium on Programming 1974: 221-233 |