- A Greedy Algorithm for Team Formation that is Fair over Time
- Statebased functional programming Maarten Fokkinga, University of Twente, Dept INF
- A Survey in Indexing and Searching XML Documents in 337 one-liners
- Calculate categorically! \Lambda Maarten M Fokkinga y
- Dyads, a generalisation of monads Maarten Fokkinga
- Coalgebras ---a short summary MMF, 28 feb 1994 Coalgebras are dual to algebras, and finality is dual to initiality. We shall be very brief
- Het ontwerpen van een databaseschema Maarten Fokkinga
- Flippos --de nieuwe rage Maarten Fokkinga
- Aggregation --polymorphic and polytypic Maarten M. Fokkinga
- Co-algebras --a short summary MMF, 28 feb 1994 Co-algebras are dual to algebras, and finality is dual to initiality. We shall be very brief
- Subtyping can have a Simple Semantics \Lambda Herman Balsters , Maarten M. Fokkinga y
- A Process Model for Life Cycles Maarten M. Fokkinga and Rick van Rein
- Ternaire relaties in ERDs zijn lastig Maarten M. Fokkinga
- Machine Assisted Constraint Maintenance Maarten Fokkinga
- An alternative approach to I/O Maarten Fokkinga and Jan Kuper
- An explanation of forwards/backwards simulation Maarten Fokkinga, Version of October 24, 2005
- Comparing Refinements for Failure and Bisimulation Semantics
- Abstracte Datatypen en CategorieTheorie Maarten Fokkinga, Universiteit Twente, fac INF
- Background info for Map and Reduce Maarten Fokkinga
- Real-time location-based services for running races Swen-Peter Ekkebus, Maarten M. Fokkinga, Nirvana Meratnia
- PROTOCOL ASSURING UNIVERSAL Rick van Rein
- Weak Entities Expressed Without Weakness Maarten Fokkinga
- Uitleg van de Hough transformatie Maarten M. Fokkinga, Joeri van Ruth
- De databasearchitectuur van Panradio --een zelflerende gedistribueerde muziekspeler--
- Towards a Theory of Moa proposal for a PhD Thesis
- Probabilistische Gegevensbanken --een korte inleiding Maarten Fokkinga
- #zwol, jeronimu, fokkinga, apers#@cs.utwente.nl With large volumes of data being exchanged on the Internet, query languages are needed to bridge
- Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire
- Word count --the derivation Maarten Fokkinga
- 2011-04-29 ADDENDUM TO OO versus FP --a little case study
- Information Processing Letters 77 (2001) 7176 The associativity of equivalence and the Towers of Hanoi problem
- Constructing SQL queries Maarten Fokkinga
- OO versus FP --a little case study Maarten Fokkinga
- Program Specifications for Program Simulations M.M. Fokkinga and J.C.S.P. van der Woude, and J. Zwiers
- Monadic Maps and Folds for Arbitrary Datatypes Maarten Fokkinga \Lambda
- Adjunctions Maarten Fokkinga \Lambda and Lambert Meertens y
- A Correctness Proof of Sorting by means of Formal Procedures Maarten M. Fokkinga
- Modular Completeness Communication Closed Layers \Lambda
- A Process Model for Life Cycles Maarten M. Fokkinga and Rick van Rein
- Towards a Theory of Moa proposal for a PhD Thesis
- About XML integration and distribution Maarten Fokkinga
- Using Underspecification in the Derivation of some Optimal Partition Algorithms
- Extending the Relational Model with Uncertainty and Ignorance Sunil Choenni, Henk Ernst Blok, and Maarten Fokkinga
- A Translation from Attribute Grammars to Catamorphisms
- Documenting the ICT Architecture of TSI R. J. Wieringa1
- Fundamenta Informaticae XX (2001) 1--25 1 Comparing Refinements for
- Formal semantics of ERDs Maarten Fokkinga, Verion of 4th of Sept, 2001
- Math. Struct. in Comp. Science (1993), vol. 11, pp. 1000 Copyright c Cambridge University Press Datatype Laws without Signatures
- A Summary of Refinement Theory Maarten Fokkinga
- Expressions that talk about themselves Maarten Fokkinga, University of Twente, dept. INF, fokkinga@cs.utwente.nl
- Programming Language Concepts --The Lambda Calculus Approach
- Law and Order in Algorithmics Maarten M. Fokkinga
- Law and Order in Algorithmics Maarten Fokkinga
- JFP: page 1 of 5. c Cambridge University Press 2011 doi:10.1017/S0956796810000341
- Probabilistic Processing of Interval-valued Sensor Data Sander Evers
- An alternative approach to I/O Maarten Fokkinga and Jan Kuper
- Inhoudsopgave 1 De Miranda omgeving 3
- Dyads, a generalisation of monads Maarten Fokkinga
- Calculate categorically! Maarten M Fokkinga
- A Gentle Introduction to Category --the calculational approach --
- An exercise in Transformational Programming: Backtracking and Branch-and-Bound
- Program Calculation Properties of Continuous Algebras Maarten M Fokkinga and Erik Meijer
- Restricted Choices Maarten Fokkinga
- MapReduce formulation of PageRank Maarten Fokkinga
- MapReduce --a two-page explanation for laymen Maarten M. Fokkinga
- Counting Join Trees MMF, version of November 3, 2008, 11:09 Problem. Let Obj be a set of so-called objects. Let Tree be the set of non-empty finite
- Associativity of Cartesian Product in Entity-Relation Diagrams Maarten Fokkinga
- Formalization of Indexing in Data Management Maarten M. Fokkinga
- FDFD: Formal Derivations of Functional Dependencies Maarten M. Fokkinga
- XML notions formalized Maarten Fokkinga
- Sequence comprehension for XQuery's FLWOR expression Maarten Fokkinga
- On the Iterative Solution of the Towers of Hanoi Problem Maarten M. Fokkinga
- View integration Herman Balsters, Maarten Fokkinga, and Maurice van Keulen
- De WeetNiet-WistAl-WeetWel-WeetOok puzzel Maarten Fokkinga
- Maarten Fokkinga en Jan Kuper Vakgroep SETI
- Magische woordvierkanten Maarten Fokkinga
- Notities bij het vak Informatiesystemen Maarten Fokkinga
- Tail invariants Maarten Fokkinga
- The Right Expert at the Right Time and Place from expertise identification to expertise selection
- Cost and feasibility estimations of an execution plan Maarten Fokkinga
- SQL versus coSQL --a compendium to Erik Meijer's paper Maarten Fokkinga
