Leeuwen, E.J. van & Leeuwen, J. van (2010). Convex Polygon Intersection Graphs. : Department of Information and Computing Sciences, Utrecht University.
|
Leeuwen, J. van (2009). A Fascinating Science. In Fascination for Computation - 25 Jaar opleiding Informatica (pp. 33-46).
|
Leeuwen, J. van (2009, November 9). Informatics: Constructing a New World. Department of Computer Science, Comenius University, Bratislava, 35 Year Anniversary Department of Computer Science.
|
Bodlaender, H.L., Tan, R.B., Dijk, T.C. van & Leeuwen, J. van (2008). Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint. In J Gudmundsson (Ed.), Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory Vol. 5124. Lecture Notes in Computer Science (pp. 102-113). Berlijn: Springer.
|
Meyer, B., Choppy, C., Staunstrup, J. & Leeuwen, J. van (2009). Research Evaluation for Computer Science. Communications of the ACM, 52(4), 31-34.
|
Leeuwen, E.J. van & Leeuwen, J. van (2009). Structure of Polynomial-Time Approximation. onbekend: UU BETA ICS Departement Informatica.
|
Leeuwen, J. van (2009). Towards a philosophy of the information and computing sciences. NIAS Newsletter, 42, 22-25.
|
Leeuwen, J. van (04-18-2009). Ultieme Informatie. NRC Handelsblad
|
Leeuwen, J. va. Attracting (more) students to the Informatics discipline. Venice, Invited Lecture: Informatics Education Europe III.
|
Wiedermann, J. & Leeuwen, J. van (2008). How We Think of Computing Today. In A. Beckmann, C. Dimitracopoulos & B. Löwe (Eds.), Logic and Theory of Algorithms Vol. 5028. Lecture Notes in Computer Science (pp. 579-593). Berlin/Heidelberg, Germany: Springer-Verlag.
|
Bodlaender, H.L., Tan, R.B., van Dijk, T.C. & Leeuwen, J. van (2008). Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint. UU-CS 2008-005. onbekend: UU WINFI Informatica en Informatiekunde.
|
Leeuwen, J. va. Research-intensive universities, excellence, and teaching. Oslo, Keynote lecture: Nasjonalt fakultetsmote i realfag 2008.
|
Michiels, W., Korst, J., Aarts, E. & Leeuwen, J. van (2007). Performance ratios for the Karmarkar-Karp differencing method. Journal of Combinatorial Optimization, 12(1), 19-32.
|
Leeuwen, J. van (2007). Preface. In J. van Leeuwen, G.F. Italiano, W. van der Hoek, Chr. Meinel, H. Sack & F. Plasil (Eds.), SOFSEM 2007: Theory and Practice of Computer Science Vol. 4362. Lecture Notes in Computer Science (pp. V-VI). Berlin: Springer.
|
Leeuwen, J. van, Italiano, G.F., Hoek, W. van der, Meinel, Chr., Sack, H., Plasil, F. & Bielikova, M. (Eds.). (2007). SOFSEM 2007: Theory and Practice of Computer Science (2). Prague: Institute of Computer Science, Academy of Sciences of the Czech Republic.
|
Leeuwen, J. van & Tanca, L. (2007). Student Enrollment and Image of the Informatics Discipline. UU-CS 2007-024. onbekend: UU WINFI Informatica en Informatiekunde.
|
Leeuwen, J. van, Italiano, G.F., Hoek, W. van der, Meinel, Chr., Sack, H. & Plasil, F. (Eds.). (2007). Lecture Notes in Computer Science, 4362.
|
Leeuwen, J. van & Wiedermann, J. (2006). A Theory of Interactive Computation. In D. Goldin, S.A. Smolka & P. Wegner (Eds.), Interactive Computation: the New Paradigm (pp. 119-142). Berlin: Springer-Verlag.
|
Bakker, E.M., Bodlaender, H.L., Tan, R.B. & Leeuwen, J. van (2006). Interval Routing and Minor-Monotone Graph Parameters. UU-CS 2006-001. onbekend: UU WINFI Informatica en Informatiekunde.
|
Leeuwen, J. van & Wiedermann, J. (2006). Lazy Autoconfiguration in Mobile Ad Hoc Networks and Dynamic Sets of Mobile Agents. onbekend: UU WINFI Informatica en Informatiekunde.
|
Leeuwen, E.J. van & Leeuwen, J. van (2006). On the Representation of Disk Graphs. UU-CS 2006-037. onbekend: UU WINFI Informatica en Informatiekunde.
|
Gafni, E., Raynal, M., Santoro, N., Leeuwen, J. van & Zaks, S. (2006). Panel on the Contributions of the DISC Community to Distributed Computing: A Historical Perspective. In S. Dolev (Ed.), Distributed Computing, 20th International Symposium (DISC 2006) Vol. 4167. Lecture Notes in Computer Science (pp. 580). Berlin: Springer -Verlag.
|
Orejas, F. & Leeuwen, J. van (Eds.). (2005). Automata, Languages and Programming (Special Issue) (Theoretical Computer Science). Amsterdam: Theoretical Computer Science 333:1.
|
Leeuwen, J. van (2005, February 25). Een ontmoeting met Deep Blue - Informatica als wetenschap. Eindhoven, CODI Eindsymposium.
|
Leeuwen, J. van (2005, November 25). Great open problems in computational complexity theory. Utrecht, Symposium `Proofs and Problems', Vereniging voor Logica (VvL).
|
Orejas, F. & Leeuwen, J. van (2005). Preface. Theoretical Computer Science, 331(1), 1-2.
|
Leeuwen, J. van (2005, June 7). Science for the Information Age. Delft, ICT Congress 2005.
|
Leeuwen, J. van (2005). The Distinguished Achievements Award - EATCS Award 2005. EATCS Bulletin, 87, 10-11.
|
Leeuwen, J. van (2004). Approaches in Machine Learning. In W.Verhaegh, E.Aarts, J.Korst (Ed.), Algorithms in Ambient Intelligence (Chapter 8) (Philips Research Book Series, Vol 2, 2) (pp. 155-166). Dordrecht: Kluwer Academic Publishers, Dordrecht.
|
Bodlaender, H.L., Kloks, T., Tan, R.B. & Leeuwen, J. van (2004). Approximations for Lambda-Colorings of Graphs. The Computer Journal, 47, 193-204.
|
Verbaan, P.R.A., Leeuwen, J. van & Wiedermann, J. (2004). Complexity of Evolving Interactive Systems. In emphTheory Is Forever, Essays Dedicated to Arto Salomaa on the Occasion of His 70th Birthday (pp. 268-281). Springer-Verlag, Berlin.
|
Verbaan, P.R.A., Leeuwen, J. van & Wiedermann, J. (2004). Lineages of Automata. UU-CS 2004-018. Utrecht: Utrecht University: Information and Computing Sciences.
|
Verbaan, P.R.A., Leeuwen, J. van & Wiedermann, J. (2004). Lineages of Automata - A Model for Evolving Interactive Systems. In J.Karhumaki et al (Ed.), Theory is for ever (pp. 268-281). Berlin: Springer- Verlag.
|
Leeuwen, J. van (2004). The Distinguished Achievements Award - EATCS Award 2004. EATCS Bulletin, 84, 10-11.
|
Goris, H.J.M.J., Bosman, F. & Leeuwen, J. van (2004). Thomas over wonderen. In Jaarboek 2003 Thomas Instituut Utrecht (pp. 31-55). Utrecht.
|
Leeuwen, J. van & Verbunt, F.W.M. (2003). A small window on the neutron star population. In F. Camilo & B.M. Gaensler (Eds.), Young neutron stars and their environment.
|
Bodlaender, H.L., Tan, R.B. & Leeuwen, J. van (2003). Finding a Delta-regular supergraph of minimum order. Discrete Applied Mathematics, 131, 3-9.
|
Leeuwen, J. van (2003). Interactief, intelligent en nog veel meer - Het veranderende beeld van de informatica. TINFON, 12, 63-65.
|
Leeuwen, J. va. Interactief, intelligent en nog veel meer - Het veranderende beeld van de informatica. Utrecht, Dies 2003.
|
Verbaan, P.R.A., Leeuwen, J. van & Wiedermann, J. (2003). Lineages of automata. UU-CS 2004-018. Utrecht: Utrecht University: Information and Computing Sciences.
|
Michiels, W., Korst, J., Aarts, E. & Leeuwen, J. van (2003). Performance ratios for the Differencing Method applied to the Balanced Number Partitioning problem. In 20th Annual Symp.\ on Theoretical Aspects of Computer Science (STACS 2003). Berlijn: Springer-Verlag.
|
Leeuwen, J. van (2003). The distinguished achievements award - EATCS Award 2004. EATCS Bulletin, 81, 14-15.
|
Leeuwen, J. van & Wiedermann, J. (2003). The emergent computational potential of evolving artificial living systems. AI Communications, 15, 205-215.
|
Leeuwen, J. van (2002). Elements of machine learning. In W. Verhaegh, J. Korst & E. Aarts (Eds.), 1st Philips Symposium on Intelligent Algorithms (SOIA 2002) (pp. 11-21). Eindhoven, the Netherlands: Philips Electronics.
|
Leeuwen, J. van & Wiedermann, J. (2002). Exploring the frontiers of computability. ERCIM news, 50, 48-49.
|
Leeuwen, J. van & Wiedermann, J. (2002). Relativistic computers and non-uniform complexity theory. In C.S. Calude, M.J. Dineen & F. Peper (Eds.), Unconventional Models of Computation (UMC 2002) (pp. 287-299). Berlin, Germany: Springer-Verlag.
|
Leeuwen, J. van & Wiedermann, J. (2002). Relativistic computers and non-uniform complexity theory. Technical Report 866. Prague, Czech Republic: Czech Academy of Sciences, Institute of Computer Sciences.
|
Wiedermann, J. & Leeuwen, J. van (2002). The emergent computational potential of evolving artificial living systems. UU-CS 2002-002. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Wiedermann, J. & Leeuwen, J. van (2001). A computational model of interaction in embedded systems. UU-CS 2001-02. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Orejas, F., Spirakis, P.G. & Leeuwen, J. van (Eds.). (2001). Automata, Languages and Programming - ICALP'2001 (LNCS, 2076). Berlin, Germany: Springer-Verlag.
|
Leeuwen, J. van & Wiedermann, J. (2001). Beyond the Turing limit - Evolving interactive systems. In L. Pacholski & P. Ruzicka (Eds.), SOFSEM 2001 - Theory and Practice of Informatics (pp. 90-109). Berlin: Springer-Verlag.
|
Leeuwen, J. van & Wiedermann, J. (2001). Emergence of a super-Turing computational potential in artificial living systems. In J. Kelemen & P. Sosik (Eds.), Advances in Artificial Life - ECAL'2001 (pp. 55-65). Berlin: Springer-Verlag.
|
Leeuwen, J. van & Wiedermann, J. (2001). The Turing machine paradigm in contemporary computing. In B. Enquist & W. Schmid (Eds.), Mathematics Unlimited - 2001 and Beyond (pp. 1139-1155). Berlin: Springer-Verlag.
|
Bodlaender, H.L., Kloks, A.J.J., Tan, R.B. & Leeuwen, J. van (2000). Approximations for Lambda-coloring of graphs. UU-CS 2000-25. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Bodlaender, H.L., Tan, R.B. & Leeuwen, J. van (2000). Finding a Delta-regular supergraph of minimum order. UU-CS 2000-29. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Leeuwen, J. van (2000). Future themes in theoretical computer science. EATCS Bulletin, 71, 8-14.
|
Leeuwen, J. van, Watanabe, O., Hagiya, M., Mosses, P.D. & Ito, T. (Eds.). (2000). IFIP TCS 2000 Conference: Theoretical Computer Science - Exploring New Frontiers of Theoretical Informatics (LNCS, 1872). Berlin: Springer-Verlag.
|
Bodlaender, H.L., Kloks, T., Tan, R.B. & Leeuwen, J. van (2000). Lambda-coloring of graphs. In H. Reichel & S. Tison (Eds.), 17th Annual Symposium on Theoretical Aspects of Computer Science (pp. 395-406). Berlin: Springer-Verlag.
|
Leeuwen, J. van & Wiedermann, J. (2000). On algorithms and interaction. In M. Nielsen & B. Rovan (Eds.), Mathematical Foundations of Computer Science 2000-25th Int. Symposium (pp. 99-112). Berlin: Springer-Verlag.
|
Leeuwen, J. van & Wiedermann, J. (2000). On the power of interactive computing. In J. van Leeuwen (Ed.), IFIP TCS 2000 Conference: Theoretical Computer Science - Exploring New Frontiers of Theoretical Computer Science (pp. 619-623). Berlin: Springer-Verlag.
|
Leeuwen, J. van & Wiedermann, J. (2000). The Turing machine paradigm in contemporary computing. UU-CS 2000-33. Utrecht, The Netherlands: Utrecht University: Information and Computing Sciences.
|
Flammini, M., Leeuwen, J. van & Marchetti-Spaccamela, A. (1998). The complexity of interval routing on random graphhs. The Computer Journal, 41, 16-25.
|
Bodlaender, H.L., Leeuwen, J. van, Tan, R. & Thilikos, D.M. (1997). On interval routing schemes and treewidth. Information and Computation, 139, 91-109.
|
Bodlaender, H.L., Leeuwen, J. van, Tan, R.B. & Thilikos, D.M. (1996). On interval routing schemes and treewidth. UU-CS 1996-41. Utrecht, the Netherlands: Utrecht University: Information and Computing Sciences.
|
Leeuwen, J. van (1996). On the effectiveness of search engines. In J Tromp (Ed.), A Quick and Dynamic Intellect (pp. 81-87). Amsterdam, the Netherlands: CWI Amsterdam.
|
Leeuwen, J. van & Tan, R.B. (1995). Compact Routing Methods: A Survey. UU-CS 1995-05. Utrecht: Utrecht University.
|
Leeuwen, J. van (1995). Guessing Games, Binomial Sum Trees and Distributed Computations in Synchronous Networks. UU-CS 1995-13. Utrecht: Utrecht University.
|
Flammini, M. & Leeuwen, J. van (1995). The Complexity of Interval Routing on Random Graphs. UU-CS 1995-16. Utrecht: Utrecht University.
|
Leeuwen, J. van, Tan, R.B. & Bakker, E.M. (1991). Linear interval routing schemes. RUU-CS 91-07. Utrecht.
|
Leeuwen, J. van & Bakker, E.M. (1991). Some domination problems on trees and on general grahps. RUU-CS 91-22. Utrecht.
|
Leeuwen, J. van & Bakker, E.M. (1991). The optimal placement of replicated items in distributed databases on tree-like networks. RUU-CS 91-23. Utrecht.
|
Leeuwen, J. van & Bakker, E.M. (1991). Uniform d-emulations of rings, with an application to distributed virtual ring contruction. RUU-CS 91-21. Utrecht.
|
La Poutré, J.A., Leeuwen, J. van & Overmars, M.H. (1990). Maintaining 2- and 3-connected components in graphs, Part I: 2- and 3-edge-connected components. RUU-CS 90-26. Utrecht.
|
Leeuwen, J. van, Tan, R.B. & Bakker, E.M. (1990). Perfect Colorings. RUU-CS 90-35. Utrecht.
|
Leeuwen, J. van, Tan, R.B. & Bakker, E.M. (1990). Prefix routing schemes in dynamic networks. RUU-CS 90-10. Utrecht.
|
Kant, G. & Leeuwen, J. van (1990). Strong colorings of graphs. RUU-CS 90-15. Utrecht.
|
Kant, G. & Leeuwen, J. van (1990). The file distribution problem for processor networks. RUU-CS 90-16. Utrecht.
|
Leeuwen, J. van (1989). Correctness of the two-phase commit protocol. RUU-CS 89-34. Utrecht.
|
Knijnenburg, P.M.W. & Leeuwen, J. van (1989). On models for Propositional Dynamic Logic. RUU-CS 89-03. Utrecht.
|
Scholten, E. & Leeuwen, J. van (1989). Structured NC. RUU-CS 89-06. Utrecht.
|
Leeuwen, J. van, Wijshoff, H.A.G. & Tel, G. (1989). The one-dimensional skewing problem. RUU-CS 89-23. Utrecht.
|
Leeuwen, J. van (1988). An optimal pointer machine algorithm for finding nearest common ancestors. RUU-CS 88-17. Utrecht.
|
Drost, M.R. & Leeuwen, J. van (1988). Assertional verification of a majority consensus algorithm for concurrency control in multiple copy databases. RUU-CS 88-13. Utrecht.
|
Brandenburg, H., Leeuwen, J. van & Tan, R.B. (1988). Some observations for the pigeon hole principle. RUU-CS 88-39. Utrecht.
|
Leeuwen, J. van (1988). The client/server model in distributed computing. RUU-CS 88-09. Utrecht.
|
Gafni, E. & Leeuwen, J. van (1987). 2nd International Workshop on Distributed Algorithms (draft papers). RUU-CS 87-10. Utrecht.
|
Bezem, M.A. & Leeuwen, J. van (1987). Enumeration in graphs. RUU-CS 87-07. Utrecht.
|
Leeuwen, J. van (1987). Interval heaps. RUU-CS 87-01. Utrecht.
|
La Poutré, J.A. & Leeuwen, J. van (1987). Maintenance of transitive closures and transitive reductions of graphs. RUU-CS 87-25. Utrecht.
|
Bodlaender, H.L. & Leeuwen, J. van (1986). Distribution of records on a ring of processors. RUU-CS 86-06. Utrecht.
|
Tan, R.B. & Leeuwen, J. van (1986). General symmetric distributed termination detection. RUU-CS 86-02. Utrecht.
|
Leeuwen, J. van (1986). Graph algorithms (95 p.). RUU-CS 86-17. Utrecht.
|
Schoone, A.A. & Leeuwen, J. van (1986). Simulation of parallel algorithms on a distributed network. RUU-CS 86-01. Utrecht.
|
Tel, G., Tan, R.B. & Leeuwen, J. van (1986). The derivation of graph marking algorithms from distributed termination detection protocols. RUU-CS 86-11. Utrecht.
|
Tel, G., Leeuwen, J. van & Wijshoff, H.A.G. (1986). The one-dimensional skewing problem. RUU-CS 86-08. Utrecht.
|
Leeuwen, J. van & Tan, R.B. (1986). Very thin VLSI-layouts of complete binary trees. RUU-CS 86-07. Utrecht.
|
Leeuwen, J. van (1985). $ast$ Pascal; compact reference guide to the programming language. RUU-CS 85-01. Utrecht.
|
Leeuwen, J. van & Tan, R.B. (1985). An improved upperbound for distributed election in bidirectional rings of processors. RUU-CS 85-23. Utrecht.
|
Pluimakers, G.M.J. & Leeuwen, J. van (1985). Authentication (abstract in het engels als -85-9a). RUU-CS 85-09. Utrecht.
|
Schoone, A.A., Bodlaender, H.L. & Leeuwen, J. van (1985). Diameter increase caused by edge deletion. RUU-CS 85-26. Utrecht.
|
Katajainen, J. & Leeuwen, J. van (1985). Fast simulation of Turing machines by random access machines. RUU-CS 85-07. Utrecht.
|
Leeuwen, J. van & Tan, R.B. (1985). Interval routing. RUU-CS 85-16. Utrecht.
|
Bodlaender, H.L. & Leeuwen, J. van (1985). New upperbounds for decentralized extremafinding in a ring of processors. RUU-CS 85-15. Utrecht.
|
Bodlaender, H.L. & Leeuwen, J. van (1985). On the complexity of finding uniform emulations. RUU-CS 85-04. Utrecht.
|
Schoone, A.A. & Leeuwen, J. van (1985). Verification of balanced link-level protocols. RUU-CS 85-12. Utrecht.
|
Leeuwen, J. van & Wijshoff, H.A.G. (1983). A linearity condition for periodic skewing schemes. RUU-CS 83-10. Utrecht.
|
Bodlaender, H.L., Wijshoff, H.A.G. & Leeuwen, J. van (1983). Compositions of double diagonal and cross Latin squares. RUU-CS 83-01. Utrecht.
|
Leeuwen, J. van & Wijshoff, H.A.G. (1983). Data mappings in large parallel computers. RUU-CS 83-11. Utrecht.
|
Wijshoff, H.A.G. & Leeuwen, J. van (1983). On linear skewing schemes and d ordered vectors. RUU-CS 83-07. Utrecht.
|
Penning, H.P. & Leeuwen, J. van (1983). Operating Systems (231 p. in Dutch). RUU-CS 83-18. Utrecht.
|
Leeuwen, J. van (1983). Parallel computers and algorithms. RUU-CS 83-13. Utrecht.
|
Wijshoff, H.A.G. & Leeuwen, J. van (1983). Periodic storage schemes with a minimum number of memory banks. RUU-CS 83-04. Utrecht.
|
Leeuwen, J. van & Tan, R.B. (1983). Routing with compact routing tables. RUU-CS 83-16. Utrecht.
|
Leeuwen, J. van (1983). The technological image of ``1984'' (in Dutch). RUU-CS 83-14. Utrecht.
|
Leeuwen, J. van (1982). Distributed computing. RUU-CS 82-08. Utrecht.
|
Wijshoff, H.A.G. & Leeuwen, J. van (1982). Periodic versus arbitrary tessellations of the plane using polyominos of single type. RUU-CS 82-11. Utrecht.
|
Kramer, P.P.G. & Leeuwen, J. van (1982). Systolic computation and VLSI. RUU-CS 82-09. Utrecht.
|
Kramer, P.P.G. & Leeuwen, J. van (1982). The NP-completeness of finding minimum area Layouts for VLSI-circuits (to appear). RUU-CS 82-06. Utrecht.
|
Kramer, P.P.G. & Leeuwen, J. van (1982). The complexity of VLSI-circuits for arbitrary Boolean functions (to appear). RUU-CS 82-07. Utrecht.
|
Kramer, P.P.G. & Leeuwen, J. van (1982). Wire routing in NP-complete. RUU-CS 82-04. Utrecht.
|
Bohm, A.P.W. & Leeuwen, J. van (1981). A basis for dataflow computing. RUU-CS 81-06. Utrecht.
|
Leeuwen, J. van (1981). Graphics and computational geometry. RUU-CS 81-18. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1981). Maintenance of configurations in the plane (revised edition). RUU-CS 81-03. Utrecht.
|
Birkhoff, I.J.M. & Leeuwen, J. van (1981). Organisatie van bedrijfssystemen voor computer netwerken. RUU-CS 81-14. Utrecht.
|
Leeuwen, J. van & Overmars, M.H. (1981). Stratified balanced search trees. RUU-CS 81-04. Utrecht.
|
Leeuwen, J. van & Overmars, M.H. (1981). The art of dynamizing. RUU-CS 81-08. Utrecht.
|
Leeuwen, J. van (1981). The bounded aspect ratio problem for VLSI. RUU-CS 81-16. Utrecht.
|
Leeuwen, J. van & Overmars, M.H. (1981). VLSI layouts of perfect binary trees (to appear). RUU-CS 81-13. Utrecht.
|
Leeuwen, J. van (1980). Computers en (on)doenlijke problemen. RUU-CS 80-08. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1980). Dynamic multi-dimensional data structures based on quad- and k-d trees. RUU-CS 80-02. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1980). Dynamization of decomposable searching problems yielding good worst case bounds. RUU-CS 80-06. Utrecht.
|
Leeuwen, J. van (1980). Efficient recognition of rational relations. RUU-CS 80-12. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1980). Notes on maintenance of configurations in the plane. RUU-CS 80-05. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1980). Some principles for dynamizing decomposable searching problems. RUU-CS 80-01. Utrecht.
|
Schoone, A.A. & Leeuwen, J. van (1980). Triangulating a starshaped polygon. RUU-CS 80-03. Utrecht.
|
Leeuwen, J. van & Schoone, A.A. (1980). Untangling a traveling salesman tour in the plane. RUU-CS 80-11. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1980). Worst case optimal insertion and deletion methods for decomposable searching problems. RUU-CS 80-10. Utrecht.
|
Leeuwen, J. van (1979). Computers en informatie-verwerking. RUU-CS 79-02. Utrecht.
|
Leeuwen, J. van (1979). Dynamization of decomposable searching problems. RUU-CS 79-05. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1979). Further comments on Bykat's convex hull algorithm. RUU-CS 79-07. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1979). Maintenance of configurations in the plane. RUU-CS 79-09. Utrecht.
|
Leeuwen, J. van (1979). On program efficiency and algebraic complexity - (or- how to compute the Schur transform of a complex polynomial). RUU-CS 79-01. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1979). Rapid subtree indentification revisited. RUU-CS 79-03. Utrecht.
|
Leeuwen, J. van (1979). The complexity of basic complex operations. RUU-CS 79-04. Utrecht.
|
Leeuwen, J. van (1979). The measure problem for rectangular ranges in d-space. RUU-CS 79-06. Utrecht.
|
Overmars, M.H. & Leeuwen, J. van (1979). Two general methods for dynamizing decomposable searching problems. RUU-CS 79-10. Utrecht.
|
Leeuwen, J. van (1978). A useful lemma for context-free programmed grammers. RUU-CS 78-01. Utrecht.
|
Leeuwen, J. van (1978). Compromising statistical data-base with a few known elements in a combinatorial model. RUU-CS 78-02. Utrecht.
|
Leeuwen, J. van (1978). Linear time generation of a new fixed-length data-compression code. RUU-CS 78-03. Utrecht.
|
Boas, P. Emde & Leeuwen, J. van (1978). Move-rules and trade-offs in the pebble game. RUU-CS 78-04. Utrecht.
|
Leeuwen, J. van (1978). The composition of fast priority queues. RUU-CS 78-05. Utrecht.
|
Leeuwen, J. van & Weide, R. van der (1977). Alternative path compression techniques. RUU-CS 77-03. Utrecht.
|
Leeuwen, J. van (1977). Inleiding tot database systems. RUU-CS 77-04. Utrecht.
|
Engelfriet, J., Schmidt, R.E. & Leeuwen, J. van (1977). Stack machines and classes of nonnested macro-languages. RUU-CS 77-02. Utrecht.
|
webmaster@cs.uu.nl,
Sun, 12 Feb 2012 17:01:06 +0100
←
Departement Informatica, Universiteit Utrecht