| 2008 |
|---|
| 104 | EE | Jirí Wiedermann,
Jan van Leeuwen:
How We Think of Computing Today.
CiE 2008: 579-593 |
| 103 | EE | Hans L. Bodlaender,
Richard B. Tan,
Thomas C. van Dijk,
Jan van Leeuwen:
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint.
SWAT 2008: 102-113 |
| 2007 |
|---|
| 102 | | Jan van Leeuwen,
Giuseppe F. Italiano,
Wiebe van der Hoek,
Christoph Meinel,
Harald Sack,
Frantisek Plasil,
Mária Bieliková:
SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings Volume II
Institute of Computer Science AS CR, Prague 2007 |
| 101 | | Jan van Leeuwen,
Giuseppe F. Italiano,
Wiebe van der Hoek,
Christoph Meinel,
Harald Sack,
Frantisek Plasil:
SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Harrachov, Czech Republic, January 20-26, 2007, Proceedings
Springer 2007 |
| 100 | EE | Wil Michiels,
Jan H. M. Korst,
Emile H. L. Aarts,
Jan van Leeuwen:
Performance ratios of the Karmarkar-Karp differencing method.
J. Comb. Optim. 13(1): 19-32 (2007) |
| 2005 |
|---|
| 99 | EE | Fernando Orejas,
Jan van Leeuwen:
Preface: Automata, Languages and Programming .
Theor. Comput. Sci. 331(1): 1-2 (2005) |
| 2004 |
|---|
| 98 | EE | Peter Verbaan,
Jan van Leeuwen,
Jirí Wiedermann:
Complexity of Evolving Interactive Systems.
Theory Is Forever 2004: 268-281 |
| 97 | EE | Hans L. Bodlaender,
Ton Kloks,
Richard B. Tan,
Jan van Leeuwen:
Approximations for lambda-Colorings of Graphs.
Comput. J. 47(2): 193-204 (2004) |
| 2003 |
|---|
| 96 | EE | Wil Michiels,
Jan H. M. Korst,
Emile H. L. Aarts,
Jan van Leeuwen:
Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem.
STACS 2003: 583-595 |
| 95 | EE | Hans L. Bodlaender,
Richard B. Tan,
Jan van Leeuwen:
Finding a bigtriangleup-regular supergraph of minimum order.
Discrete Applied Mathematics 131(1): 3-9 (2003) |
| 94 | EE | Wil Michiels,
Jan H. M. Korst,
Emile H. L. Aarts,
Jan van Leeuwen:
Performance Ratios for the Karmarkar-Karp Differencing Method.
Electronic Notes in Discrete Mathematics 13: 71-75 (2003) |
| 2002 |
|---|
| 93 | EE | Jirí Wiedermann,
Jan van Leeuwen:
Relativistic Computers and Non-uniform Complexity Theory.
UMC 2002: 287-299 |
| 92 | EE | Jirí Wiedermann,
Jan van Leeuwen:
The emergent computational potential of evolving artificial living systems.
AI Commun. 15(4): 205-215 (2002) |
| 2001 |
|---|
| 91 | | Fernando Orejas,
Paul G. Spirakis,
Jan van Leeuwen:
Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings
Springer 2001 |
| 90 | EE | Jirí Wiedermann,
Jan van Leeuwen:
Emergence of a Super-Turing Computational Potential in Artificial Living Systems.
ECAL 2001: 55-65 |
| 89 | EE | Jan van Leeuwen,
Jirí Wiedermann:
Beyond the Turing Limit: Evolving Interactive Systems.
SOFSEM 2001: 90-109 |
| 2000 |
|---|
| 88 | | Jan van Leeuwen,
Osamu Watanabe,
Masami Hagiya,
Peter D. Mosses,
Takayasu Ito:
Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings
Springer 2000 |
| 87 | EE | Jan van Leeuwen,
Jirí Wiedermann:
On the Power of Interactive Computing.
IFIP TCS 2000: 619-623 |
| 86 | EE | Jan van Leeuwen,
Jirí Wiedermann:
On Algorithms and Interaction.
MFCS 2000: 99-113 |
| 85 | EE | Hans L. Bodlaender,
Ton Kloks,
Richard B. Tan,
Jan van Leeuwen:
lambda-Coloring of Graphs.
STACS 2000: 395-406 |
| 1998 |
|---|
| 84 | | Michele Flammini,
Jan van Leeuwen,
Alberto Marchetti-Spaccamela:
The Complexity of Interval Routing on Random Graphs.
Comput. J. 41(1): 16-25 (1998) |
| 1997 |
|---|
| 83 | | Hans L. Bodlaender,
Jan van Leeuwen,
Richard B. Tan,
Dimitrios M. Thilikos:
On Interval Routing Schemes and Treewidth.
Inf. Comput. 139(1): 92-109 (1997) |
| 1995 |
|---|
| 82 | | Jan van Leeuwen:
Computer Science Today: Recent Trends and Developments
Springer 1995 |
| 81 | | Michele Flammini,
Jan van Leeuwen,
Alberto Marchetti-Spaccamela:
The Complexity of Interval Routing on Random Graphs.
MFCS 1995: 37-49 |
| 80 | | Hans L. Bodlaender,
Richard B. Tan,
Dimitrios M. Thilikos,
Jan van Leeuwen:
On Interval Routing Schemes and Treewidth.
WG 1995: 181-196 |
| 1994 |
|---|
| 79 | | Jan van Leeuwen:
Graph-Theoretic Concepts in Computer Science, 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings
Springer 1994 |
| 78 | | Jan van Leeuwen:
Algorithms - ESA '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings
Springer 1994 |
| 77 | | Jan van Leeuwen,
Richard B. Tan:
Compact Routing Methods: A Survey.
SIROCCO 1994: 99-110 |
| 1993 |
|---|
| 76 | | Jan van Leeuwen,
Derick Wood:
Interval Heaps.
Comput. J. 36(3): 209-216 (1993) |
| 75 | | Erwin M. Bakker,
Jan van Leeuwen,
Richard B. Tan:
Prefix Routing Schemes in Dynamic Networks.
Computer Networks and ISDN Systems 26(4): 403-421 (1993) |
| 74 | EE | Johannes A. La Poutré,
Jan van Leeuwen,
Mark H. Overmars:
Maintenance of 2- and 3-edge- connected components of graphs I.
Discrete Mathematics 114(1-3): 329-359 (1993) |
| 1992 |
|---|
| 73 | | Jan van Leeuwen:
Algorithms, Software, Architecture - Information Processing '92, Volume 1, Proceedings of the IFIP 12th World Computer Congress, Madrid, Spain, 7-11 September 1992
North-Holland 1992 |
| 1991 |
|---|
| 72 | | Jan van Leeuwen,
Nicola Santoro:
Distributed Algorithms, 4th International Workshop, WDAG '90, Bari, Italy, September 24-26, 1990, Proceedings
Springer 1991 |
| 71 | | Emile H. L. Aarts,
Jan van Leeuwen,
Martin Rem:
PARLE '91: Parallel Architectures and Languages Europe, Volume I: Parallel Architectures and Algorithms, Eindhoven, The Netherlands, June 10-13, 1991, Proceedings
Springer 1991 |
| 70 | | Emile H. L. Aarts,
Jan van Leeuwen,
Martin Rem:
PARLE '91: Parallel Architectures and Languages Europe, Volume II: Parallel Languages, Eindhoven, The Netherlands, June 10-13, 1991, Proceedings
Springer 1991 |
| 69 | | Peter M. W. Knijnenburg,
Jan van Leeuwen:
On Models for Propositional Dynamic Logic.
Theor. Comput. Sci. 91(2): 181-203 (1991) |
| 1990 |
|---|
| 68 | | Jan van Leeuwen:
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity
Elsevier and MIT Press 1990 |
| 67 | | Jan van Leeuwen:
Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics
Elsevier and MIT Press 1990 |
| 66 | | Goos Kant,
Jan van Leeuwen:
The File Distribution Problem for Processor Networks.
SWAT 1990: 48-59 |
| 65 | | Jan van Leeuwen:
Graph Algorithms.
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 525-631 |
| 64 | | Goos Kant,
Jan van Leeuwen:
On special multiples of integers.
Bulletin of the EATCS 41: 210-211 (1990) |
| 63 | | Hans L. Bodlaender,
Peter Gritzmann,
Victor Klee,
Jan van Leeuwen:
Computational complexity of norm-maximization.
Combinatorica 10(2): 203-225 (1990) |
| 1989 |
|---|
| 62 | | Jan van Leeuwen:
Graph-Theoretic Concepts in Computer Science, 14th International Workshop, WG '88, Amsterdam, The Netherlands, June 15-17, 1988, Proceedings
Springer 1989 |
| 61 | | Bertha Scholten,
Jan van Leeuwen:
Structured NC.
WADS 1989: 487-498 |
| 60 | | Hagit Attiya,
Jan van Leeuwen,
Nicola Santoro,
Shmuel Zaks:
Efficient Elections in Chordal Ring Networks.
Algorithmica 4(3): 437-446 (1989) |
| 1988 |
|---|
| 59 | | Jan van Leeuwen:
Distributed Algorithms, 2nd International Workshop, Amsterdam, The Netherlands, July 8-10, 1987, Proceedings
Springer 1988 |
| 58 | | Nicolien J. Drost,
Jan van Leeuwen:
Assertional Verification of a Majority Consensus Algorithm for Concurrency Control in Multiple Copy Databases.
Concurrency 1988: 320-334 |
| 57 | | Marc Bezem,
Jan van Leeuwen:
On Estimating the Complexity of Logarithmic Decompositions.
Inf. Process. Lett. 26(6): 321-324 (1988) |
| 56 | | Jyrki Katajainen,
Jan van Leeuwen,
Martti Penttonen:
Fast Simulation of Turing Machines by Random Access Machines.
SIAM J. Comput. 17(1): 77-88 (1988) |
| 55 | | Gerard Tel,
Richard B. Tan,
Jan van Leeuwen:
The Derivation of Graph Marking Algorithms From Distributed Termination Detection Protocols.
Sci. Comput. Program. 10(1): 107-137 (1988) |
| 1987 |
|---|
| 54 | | Jan van Leeuwen,
Nicola Santoro,
Jorge Urrutia,
Shmuel Zaks:
Guessing Games and Distributed Computations in Synchronous Networks.
ICALP 1987: 347-356 |
| 53 | | Gerard Tel,
Richard B. Tan,
Jan van Leeuwen:
The Derivation of on-the-fly Garbage Collection Algorithms from Distributed Termination Detection Protocols.
STACS 1987: 445-455 |
| 52 | | Johannes A. La Poutré,
Jan van Leeuwen:
Maintenance of Transitive Closures and Transitive Reductions of Graphs.
WG 1987: 106-120 |
| 51 | | Jan van Leeuwen,
Jirí Wiedermann:
Array Processing Machines: An Abstract Model.
BIT 27(1): 25-43 (1987) |
| 50 | | Gerard Tel,
Jan van Leeuwen:
A non-deterministic algorithm and its analysis.
Bulletin of the EATCS 33: 100-102 (1987) |
| 49 | | Jan van Leeuwen,
Richard B. Tan:
Interval Routing.
Comput. J. 30(4): 298-307 (1987) |
| 48 | | Jan van Leeuwen,
Richard B. Tan:
An Improved Upperbound for Distributed Election in Bidirectional Rings of Processors.
Distributed Computing 2(3): 149-160 (1987) |
| 47 | | Harry A. G. Wijshoff,
Jan van Leeuwen:
On Linear Skewing Schemes and d-Ordered Vectors.
IEEE Trans. Computers 36(2): 233-239 (1987) |
| 1986 |
|---|
| 46 | | Jan van Leeuwen:
Pragmatic Aspects of Complexity Theory (Panel).
IFIP Congress 1986: 5-6 |
| 45 | | Hans L. Bodlaender,
Jan van Leeuwen:
New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors.
STACS 1986: 119-129 |
| 44 | | Anneke A. Schoone,
Hans L. Bodlaender,
Jan van Leeuwen:
Improved Diameter Bounds for Altered Graphs.
WG 1986: 227-236 |
| 43 | | Hans L. Bodlaender,
Jan van Leeuwen:
Simulation of Large Networks on Smaller Networks
Information and Control 71(3): 143-180 (1986) |
| 1985 |
|---|
| 42 | | Jan van Leeuwen,
Jirí Wiedermann:
Array processing machines.
FCT 1985: 257-268 |
| 41 | | Hans L. Bodlaender,
Jan van Leeuwen:
Simulation of Large Networks on Smaller Networks.
STACS 1985: 47-58 |
| 40 | | Harry A. G. Wijshoff,
Jan van Leeuwen:
The Structure of Periodic Storage Schemes for Parallel Memories.
IEEE Trans. Computers 34(6): 501-505 (1985) |
| 39 | | Marek Karpinski,
Jan van Leeuwen:
Preface
Information and Control 64(1-3): 1 (1985) |
| 1984 |
|---|
| 38 | | Herbert Edelsbrunner,
Jan van Leeuwen,
Thomas Ottmann,
Derick Wood:
Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.
ITA 18(2): 171-183 (1984) |
| 37 | | Mark R. Kramer,
Jan van Leeuwen:
Systolische Berechnungen und VLSI.
Informatik Spektrum 7(3): 154-165 (1984) |
| 36 | | Harry A. G. Wijshoff,
Jan van Leeuwen:
Arbitrary versus Periodic Storage Schemes and Tessellations of the Plane Using One Type of Polyomino
Information and Control 62(1): 1-25 (1984) |
| 35 | EE | Robert Endre Tarjan,
Jan van Leeuwen:
Worst-case Analysis of Set Union Algorithms.
J. ACM 31(2): 245-281 (1984) |
| 1983 |
|---|
| 34 | | Jan van Leeuwen,
Harry A. G. Wijshoff:
Data Mappings in Large Parallel Computers.
GI Jahrestagung 1983: 8-20 |
| 33 | | Mark R. Kramer,
Jan van Leeuwen:
The VLSI complexity of Boolean functions.
Logic and Machines 1983: 397-407 |
| 32 | | Harry A. G. Wijshoff,
Jan van Leeuwen:
Periodic versus arbitrary tessellations of the plane using polyominos of a single type.
Theoretical Computer Science 1983: 353-366 |
| 1982 |
|---|
| 31 | | Mark H. Overmars,
Jan van Leeuwen:
Dynamic Multi-Dimensional Data Structures Based on Quad- and K - D Trees.
Acta Inf. 17: 267-285 (1982) |
| 30 | | Jan van Leeuwen,
Mark H. Overmars:
Stratified Balanced Search Trees.
Acta Inf. 18: 345-359 (1982) |
| 29 | | Jan van Leeuwen,
Maurice Nivat:
Efficient Recognition of Rational Relations.
Inf. Process. Lett. 14(1): 34-38 (1982) |
| 1981 |
|---|
| 28 | | Jan van Leeuwen,
Mark H. Overmars:
The Art of Dynamizing.
MFCS 1981: 121-131 |
| 27 | | Mark H. Overmars,
Jan van Leeuwen:
Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds.
Theoretical Computer Science 1981: 224-233 |
| 26 | | Mark H. Overmars,
Jan van Leeuwen:
Some Principles for Dynamizing Decomposable Searching Problems.
Inf. Process. Lett. 12(1): 49-53 (1981) |
| 25 | | Mark H. Overmars,
Jan van Leeuwen:
Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems.
Inf. Process. Lett. 12(4): 168-173 (1981) |
| 24 | | Jan van Leeuwen,
Derick Wood:
The Measure Problem for Rectangular Ranges in d-Space.
J. Algorithms 2(3): 282-300 (1981) |
| 23 | | Mark H. Overmars,
Jan van Leeuwen:
Maintenance of Configurations in the Plane.
J. Comput. Syst. Sci. 23(2): 166-204 (1981) |
| 1980 |
|---|
| 22 | | J. W. de Bakker,
Jan van Leeuwen:
Automata, Languages and Programming, 7th Colloquium, Noordweijkerhout, The Netherland, July 14-18, 1980, Proceedings
Springer 1980 |
| 21 | | Mark H. Overmars,
Jan van Leeuwen:
Dynamically Maintaining Configurations in the Plane (Detailed Abstract)
STOC 1980: 135-145 |
| 20 | | Jan van Leeuwen,
Derick Wood:
Dynamization of Decomposable Searching Problems.
Inf. Process. Lett. 10(2): 51-56 (1980) |
| 19 | | Mark H. Overmars,
Jan van Leeuwen:
Further Comments on Bykat's Convex Hull Algorithm.
Inf. Process. Lett. 10(4/5): 209-212 (1980) |
| 18 | | Jan van Leeuwen:
Über Programmeffizienz und algebraische Komplexität.
Informatik Spektrum 3(3): 172-180 (1980) |
| 17 | EE | Joost Engelfriet,
Erik Meineche Schmidt,
Jan van Leeuwen:
Stack Machines and Classes of Nonnested Macro Languages.
J. ACM 27(1): 96-117 (1980) |
| 1979 |
|---|
| 16 | | Helmut Alt,
Jan van Leeuwen:
The complexity of complex division (extended abstract).
FCT 1979: 13-17 |
| 15 | | Peter van Emde Boas,
Jan van Leeuwen:
Move Rules and Trade-Offs in the Pebble Game.
Theoretical Computer Science 1979: 101-112 |
| 14 | | Jan van Leeuwen:
A Useful Lemma for Context-Free Programmed Grammars.
Acta Inf. 11: 373-386 (1979) |
| 13 | | Jan van Leeuwen:
On Compromising Statistical Data-Bases with a few Known Elements.
Inf. Process. Lett. 8(3): 149-153 (1979) |
| 12 | | Nicholas V. Findler,
Jan van Leeuwen:
On the Complexity of Decision Trees, the Quasi-Optimizer, and the Power of Heuristic rules
Information and Control 40(1): 1-19 (1979) |
| 1976 |
|---|
| 11 | | Jan van Leeuwen:
Variations of a New Machine Model
FOCS 1976: 228-235 |
| 10 | | Jan van Leeuwen:
On the Construction of Huffman Trees.
ICALP 1976: 382-410 |
| 9 | | David P. Dobkin,
Jan van Leeuwen:
The Complexity of Vector-Products.
Inf. Process. Lett. 4(6): 149-154 (1976) |
| 8 | | Robert M. Baer,
Jan van Leeuwen:
The Halting Problem for Linear Turing Assemblers.
J. Comput. Syst. Sci. 13(2): 119-135 (1976) |
| 7 | | Jan van Leeuwen,
Derick Wood:
A Decomposition Theorem for Hyper-Algebraic Extensions of Language Families.
Theor. Comput. Sci. 1(3): 199-214 (1976) |
| 1975 |
|---|
| 6 | | Jan van Leeuwen:
The Membership Question for ET0L-Languages is Polynomially Complete.
Inf. Process. Lett. 3(5): 138-143 (1975) |
| 5 | | Jan van Leeuwen:
The Tape-Complexity of Context-Independent Developmental Languages.
J. Comput. Syst. Sci. 11(2): 203-211 (1975) |
| 1974 |
|---|
| 4 | | Jan van Leeuwen:
A Generalisation of Parikh's Theorem in Formal Language Theory.
ICALP 1974: 17-26 |
| 3 | | Jan van Leeuwen:
Notes on Pre-Set Pushdown Automata.
L Systems 1974: 177-188 |
| 2 | | Jan van Leeuwen:
A Partial Solution to the Reachability-Problem for Vector-Addition Systems
STOC 1974: 303-309 |
| 1 | | Jan van Leeuwen,
Carl H. Smith:
An Improved Bound for Detecting Looping Configurations in Deterministic DPA's.
Inf. Process. Lett. 3(1): 22-24 (1974) |
