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