Maarten M. Fokkinga

25 papers A* 1A 1B 1Journal 9Unranked 12
YearRankTypeTitle / Venue / Authors
2011 J jnl
The Hough transform.
J. Funct. Program.
Maarten M. Fokkinga
2009 — conf
A Framework to Balance Privacy and Data Usability Using Data Degradation.
CSE (3)
Harold van Heerde, Maarten M. Fokkinga, Nicolas Anciaux
2008 — conf
Probabilistic processing of interval-valued sensor data.
DMSN
Sander Evers, Maarten M. Fokkinga, Peter M. G. Apers
2008 — conf
The Right Expert at the Right Time and Place.
PAKM
Pavel Serdyukov, Ling Feng, Arthur H. van Bunningen, Sander Evers, Harold van Heerde, Peter M. G. Apers, Maarten M. Fokkinga, Djoerd Hiemstra
2007 — conf
Composable Markov Building Blocks.
SUM
Sander Evers, Maarten M. Fokkinga, Peter M. G. Apers
2007 A* conf
Generative modeling of persons and documents for expert search.
SIGIR
Pavel Serdyukov, Djoerd Hiemstra, Maarten M. Fokkinga, Peter M. G. Apers
2007 — conf
Ranking Query Results using Context-Aware Preferences.
ICDE Workshops
Arthur H. van Bunningen, Maarten M. Fokkinga, Peter M. G. Apers, Ling Feng
2006 — conf
Ignorance in the Relational Model.
TDM
Maarten M. Fokkinga
2006 — conf
Z-style notation for Probabilities.
TDM
Maarten M. Fokkinga
2003 A conf
Aligning Application Architecture to the Business Context.
CAiSE
Roel J. Wieringa, Henk M. Blanken, Maarten M. Fokkinga, Paul W. P. J. Grefen
2002 J jnl
Comparing Refinements for Failure and Bisimulation Semantics.
Fundam. Informaticae
Rik Eshuis, Maarten M. Fokkinga
2002 — conf
Data Exchange over Web-based Applications with DXL.
DIWeb
Roelof van Zwol, V. Jeronimus, Maarten M. Fokkinga, Peter M. G. Apers
2001 J jnl
The associativity of equivalence and the Towers of Hanoi problem.
Inf. Process. Lett.
Roland Carl Backhouse, Maarten M. Fokkinga
1999 — conf
Protocol Assuring Universal Language.
FMOODS
Rick van Rein, Maarten M. Fokkinga
1996 J jnl
Datatype Laws without Signatures.
Math. Struct. Comput. Sci.
Maarten M. Fokkinga
1996 J jnl
Expressions That Talk About Themselves.
Comput. J.
Maarten M. Fokkinga
1993 B conf
Modular Completeness for Communication Closed Layers.
CONCUR
Maarten M. Fokkinga, Mannes Poel, Job Zwiers
1992 J jnl
Calculate Categorically!
Formal Aspects Comput.
Maarten M. Fokkinga
1992 — book
Law and order in algorithmics.
Maarten M. Fokkinga
1991 J jnl
An Exercise in Transformational Programming: Backtracking and Branch-and-Bound.
Sci. Comput. Program.
Maarten M. Fokkinga
1991 — conf
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire.
FPCA
Erik Meijer, Maarten M. Fokkinga, Ross Paterson
1991 J jnl
Subtyping Can Have a Simple Semantics.
Theor. Comput. Sci.
Herman Balsters, Maarten M. Fokkinga
1987 J jnl
A Correctness Proof of Sorting by Means of Formal Procedures.
Sci. Comput. Program.
Maarten M. Fokkinga
1977 — conf
Axiomatization of Declarations and the Formal Treatment of an Escape Construct.
Formal Description of Programming Concepts
Maarten M. Fokkinga
1974 — conf
Inductive assertion patters for recursive procedures.
Symposium on Programming
Maarten M. Fokkinga