Jan van Leeuwen

144 papers A* 8A 7B 19C 2Journal 75Unranked 21
YearRankTypeTitle / Venue / Authors
2024 — conf
Large Language Models and the Extended Church-Turing Thesis.
NCMA
Jirí Wiedermann, Jan van Leeuwen
2021 B conf
Towards Minimally Conscious Cyber-Physical Systems: A Manifesto.
SOFSEM
Jirí Wiedermann, Jan van Leeuwen
2020 — conf
Algorithms, Complexity, and Hans.
Treewidth, Kernels, and Algorithms
Jan van Leeuwen
2019 C conf
Finite State Machines with Feedback: An Architecture Supporting Minimal Machine Consciousness.
CiE
Jirí Wiedermann, Jan van Leeuwen
2019 J jnl
Question answering by humans and machines: A complexity-theoretic view.
Theor. Comput. Sci.
Jan van Leeuwen, Jirí Wiedermann
2018 B ed.
SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29 - February 2, 2018, Proceedings
SOFSEM
A Min Tjoa, Ladjel Bellatreche, Stefan Biffl, Jan van Leeuwen, Jirí Wiedermann
2017 — conf
Epistemic Computation and Artificial Intelligence.
PT-AI
Jirí Wiedermann, Jan van Leeuwen
2017 — conf
Non-classical Turing machines: extending the notion of computation.
NCMA
Jirí Wiedermann, Jan van Leeuwen
2017 J jnl
Shortcutting directed and undirected networks with a degree constraint.
Discret. Appl. Math.
Richard B. Tan, Erik Jan van Leeuwen, Jan van Leeuwen
2017 J jnl
Turing Machines with One-sided Advice and Acceptance of the co-RE Languages.
Fundam. Informaticae
Jan van Leeuwen, Jirí Wiedermann
2015 J jnl
Pure Nash Equilibria in Graphical Games and Treewidth.
Algorithmica
Antonis Thomas, Jan van Leeuwen
2015 J jnl
Separating the Classes of Recursively Enumerable Languages Based on Machine Size.
Int. J. Found. Comput. Sci.
Jan van Leeuwen, Jirí Wiedermann
2015 B conf
What is Computation: An Epistemic Approach.
SOFSEM
Jirí Wiedermann, Jan van Leeuwen
2014 J jnl
On Floridi's Method of Levels of Abstraction.
Minds Mach.
Jan van Leeuwen
2013 J jnl
Integer Representations of Convex Polygon Intersection Graphs.
SIAM J. Discret. Math.
Tobias Müller, Erik Jan van Leeuwen, Jan van Leeuwen
2013 B conf
Treewidth and Pure Nash Equilibria.
IPEC
Antonis Thomas, Jan van Leeuwen
2012 J jnl
Computation as an unbounded process.
Theor. Comput. Sci.
Jan van Leeuwen, Jirí Wiedermann
2012 J jnl
Computer-assisted proof of performance ratios for the Differencing Method.
Discret. Optim.
Wil Michiels, Emile H. L. Aarts, Jan H. M. Korst, Jan van Leeuwen, Frits C. R. Spieksma
2012 J jnl
Structure of Polynomial-Time Approximation.
Theory Comput. Syst.
Erik Jan van Leeuwen, Jan van Leeuwen
2011 — conf
Integer representations of convex polygon intersection graphs.
SCG
Tobias Müller, Erik Jan van Leeuwen, Jan van Leeuwen
2011 — conf
Name Resolution by Rewriting in Dynamic Networks of Mobile Entities.
Rainbow of Computer Science
Jan van Leeuwen, Jirí Wiedermann
2010 A conf
Convex Polygon Intersection Graphs.
GD
Erik Jan van Leeuwen, Jan van Leeuwen
2010 B ed.
SOFSEM 2010: Theory and Practice of Computer Science, 36th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 23-29, 2010. Proceedings
SOFSEM
Jan van Leeuwen, Anca Muscholl, David Peleg, Jaroslav Pokorný, Bernhard Rumpe
2009 J jnl
Viewpoint - Research evaluation for computer science.
Commun. ACM
Bertrand Meyer, Christine Choppy, Jørgen Staunstrup, Jan van Leeuwen
2008 C conf
How We Think of Computing Today.
CiE
Jirí Wiedermann, Jan van Leeuwen
2008 — conf
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint.
SWAT
Hans L. Bodlaender, Richard B. Tan, Thomas C. van Dijk, Jan van Leeuwen
2007 J jnl
Performance ratios of the Karmarkar-Karp differencing method.
J. Comb. Optim.
Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen
2007 — ed.
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
SOFSEM (1)
Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, Frantisek Plásil
2007 — ed.
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
SOFSEM (2)
Jan van Leeuwen, Giuseppe F. Italiano, Wiebe van der Hoek, Christoph Meinel, Harald Sack, Frantisek Plásil, Mária Bieliková
2005 J jnl
Preface: Automata, Languages and Programming .
Theor. Comput. Sci.
Fernando Orejas, Jan van Leeuwen
2004 J jnl
Approximations for lambda-Colorings of Graphs.
Comput. J.
Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen
2004 — conf
Complexity of Evolving Interactive Systems.
Theory Is Forever
Peter Verbaan, Jan van Leeuwen, Jirí Wiedermann
2003 J jnl
Finding a bigtriangleup-regular supergraph of minimum order.
Discret. Appl. Math.
Hans L. Bodlaender, Richard B. Tan, Jan van Leeuwen
2003 A conf
Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem.
STACS
Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen
2003 J jnl
Performance Ratios for the Karmarkar-Karp Differencing Method.
Electron. Notes Discret. Math.
Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen
2002 — conf
Relativistic Computers and Non-uniform Complexity Theory.
UMC
Jirí Wiedermann, Jan van Leeuwen
2002 J jnl
The emergent computational potential of evolving artificial living systems.
AI Commun.
Jirí Wiedermann, Jan van Leeuwen
2001 A* ed.
Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings
ICALP
Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen
2001 B conf
Beyond the Turing Limit: Evolving Interactive Systems.
SOFSEM
Jan van Leeuwen, Jirí Wiedermann
2001 — conf
Emergence of a Super-Turing Computational Potential in Artificial Living Systems.
ECAL
Jirí Wiedermann, Jan van Leeuwen
2000 B conf
On Algorithms and Interaction.
MFCS
Jan van Leeuwen, Jirí Wiedermann
2000 — conf
On the Power of Interactive Computing.
IFIP TCS
Jan van Leeuwen, Jirí Wiedermann
2000 — ed.
Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings
IFIP TCS
Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, Takayasu Ito
2000 A conf
lambda-Coloring of Graphs.
STACS
Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen
1998 J jnl
The Complexity of Interval Routing on Random Graphs.
Comput. J.
Michele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela
1997 J jnl
On Interval Routing Schemes and Treewidth.
Inf. Comput.
Hans L. Bodlaender, Jan van Leeuwen, Richard B. Tan, Dimitrios M. Thilikos
1995 — book
Computer Science Today: Recent Trends and Developments
Jan van Leeuwen
1995 B conf
On Interval Routing Schemes and Treewidth.
WG
Hans L. Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen
1995 B conf
The Complexity of Interval Routing on Random Graphs.
MFCS
Michele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela
1994 A ed.
Algorithms - ESA '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings
ESA
Jan van Leeuwen
1994 B conf
Compact Routing Methods: A Survey.
SIROCCO
Jan van Leeuwen, Richard B. Tan
1994 B ed.
Graph-Theoretic Concepts in Computer Science, 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings
WG
Jan van Leeuwen
1993 J jnl
Interval Heaps.
Comput. J.
Jan van Leeuwen, Derick Wood
1993 J jnl
Maintenance of 2- and 3-edge- connected components of graphs I.
Discret. Math.
Johannes A. La Poutré, Jan van Leeuwen, Mark H. Overmars
1993 J jnl
Prefix Routing Schemes in Dynamic Networks.
Comput. Networks ISDN Syst.
Erwin M. Bakker, Jan van Leeuwen, Richard B. Tan
1993 J jnl
Uniform
Networks
Erwin M. Bakker, Jan van Leeuwen
1992 — ed.
Algorithms, Software, Architecture - Information Processing '92, Volume 1, Proceedings of the IFIP 12th World Computer Congress, Madrid, Spain, 7-11 September 1992
IFIP Congress (1)
Jan van Leeuwen
1992 J jnl
Parallel computing.
Future Gener. Comput. Syst.
Emile H. L. Aarts, Jan van Leeuwen, Martin Rem
1991 — ed.
Distributed Algorithms, 4th International Workshop, WDAG '90, Bari, Italy, September 24-26, 1990, Proceedings
WDAG
Jan van Leeuwen, Nicola Santoro
1991 J jnl
On Models for Propositional Dynamic Logic.
Theor. Comput. Sci.
Peter M. W. Knijnenburg, Jan van Leeuwen
1991 — ed.
PARLE '91: Parallel Architectures and Languages Europe, Volume I: Parallel Architectures and Algorithms, Eindhoven, The Netherlands, June 10-13, 1991, Proceedings
PARLE
Emile H. L. Aarts, Jan van Leeuwen, Martin Rem
1991 — ed.
PARLE '91: Parallel Architectures and Languages Europe, Volume II: Parallel Languages, Eindhoven, The Netherlands, June 10-13, 1991, Proceedings
PARLE
Emile H. L. Aarts, Jan van Leeuwen, Martin Rem
1990 J jnl
Computational complexity of norm-maximization.
Comb.
Hans L. Bodlaender, Peter Gritzmann, Victor Klee, Jan van Leeuwen
1990 — ch.
Graph Algorithms.
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A)
Jan van Leeuwen
1990 — book
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity
Jan van Leeuwen
1990 — book
Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics
Jan van Leeuwen
1990 J jnl
On special multiples of integers.
Bull. EATCS
Goos Kant, Jan van Leeuwen
1990 — conf
The File Distribution Problem for Processor Networks.
SWAT
Goos Kant, Jan van Leeuwen
1989 J jnl
Efficient Elections in Chordal Ring Networks.
Algorithmica
Hagit Attiya, Jan van Leeuwen, Nicola Santoro, Shmuel Zaks
1989 B ed.
Graph-Theoretic Concepts in Computer Science, 14th International Workshop, WG '88, Amsterdam, The Netherlands, June 15-17, 1988, Proceedings
WG
Jan van Leeuwen
1989 B conf
Structured NC.
WADS
Bertha Scholten, Jan van Leeuwen
1988 — conf
Assertional Verification of a Majority Consensus Algorithm for Concurrency Control in Multiple Copy Databases.
Concurrency
Nicolien J. Drost, Jan van Leeuwen
1988 — ed.
Distributed Algorithms, 2nd International Workshop, Amsterdam, The Netherlands, July 8-10, 1987, Proceedings
WDAG
Jan van Leeuwen
1988 J jnl
Fast Simulation of Turing Machines by Random Access Machines.
SIAM J. Comput.
Jyrki Katajainen, Jan van Leeuwen, Martti Penttonen
1988 J jnl
On Estimating the Complexity of Logarithmic Decompositions.
Inf. Process. Lett.
Marc Bezem, Jan van Leeuwen
1988 J jnl
The Derivation of Graph Marking Algorithms From Distributed Termination Detection Protocols.
Sci. Comput. Program.
Gerard Tel, Richard B. Tan, Jan van Leeuwen
1987 J jnl
A non-deterministic algorithm and its analysis.
Bull. EATCS
Gerard Tel, Jan van Leeuwen
1987 J jnl
An Improved Upperbound for Distributed Election in Bidirectional Rings of Processors.
Distributed Comput.
Jan van Leeuwen, Richard B. Tan
1987 J jnl
Array Processing Machines: An Abstract Model.
BIT
Jan van Leeuwen, Jirí Wiedermann
1987 J jnl
Diameter increase caused by edge deletion.
J. Graph Theory
Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen
1987 A* conf
Guessing Games and Distributed Computations in Synchronous Networks.
ICALP
Jan van Leeuwen, Nicola Santoro, Jorge Urrutia, Shmuel Zaks
1987 J jnl
Interval Routing.
Comput. J.
Jan van Leeuwen, Richard B. Tan
1987 B conf
Maintenance of Transitive Closures and Transitive Reductions of Graphs.
WG
Johannes A. La Poutré, Jan van Leeuwen
1987 J jnl
On Linear Skewing Schemes and d-Ordered Vectors.
IEEE Trans. Computers
Harry A. G. Wijshoff, Jan van Leeuwen
1987 A conf
The Derivation of on-the-fly Garbage Collection Algorithms from Distributed Termination Detection Protocols.
STACS
Gerard Tel, Richard B. Tan, Jan van Leeuwen
1986 J jnl
Authentication: A concise survey.
Comput. Secur.
G. M. J. Pluimakers, Jan van Leeuwen
1986 B conf
Improved Diameter Bounds for Altered Graphs.
WG
Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen
1986 A conf
New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors.
STACS
Hans L. Bodlaender, Jan van Leeuwen
1986 — conf
Pragmatic Aspects of Complexity Theory (Panel).
IFIP Congress
Jan van Leeuwen
1986 J jnl
Simulation of Large Networks on Smaller Networks
Inf. Control.
Hans L. Bodlaender, Jan van Leeuwen
1985 B conf
Array processing machines.
FCT
Jan van Leeuwen, Jirí Wiedermann
1985 J jnl
Preface
Inf. Control.
Marek Karpinski, Jan van Leeuwen
1985 A conf
Simulation of Large Networks on Smaller Networks.
STACS
Hans L. Bodlaender, Jan van Leeuwen
1985 J jnl
The Structure of Periodic Storage Schemes for Parallel Memories.
IEEE Trans. Computers
Harry A. G. Wijshoff, Jan van Leeuwen
1984 J jnl
Arbitrary versus Periodic Storage Schemes and Tessellations of the Plane Using One Type of Polyomino
Inf. Control.
Harry A. G. Wijshoff, Jan van Leeuwen
1984 J jnl
Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.
RAIRO Theor. Informatics Appl.
Herbert Edelsbrunner, Jan van Leeuwen, Thomas Ottmann, Derick Wood
1984 J jnl
Systolische Berechnungen und VLSI.
Inform. Spektrum
Mark R. Kramer, Jan van Leeuwen
1984 J jnl
Worst-case Analysis of Set Union Algorithms.
J. ACM
Robert Endre Tarjan, Jan van Leeuwen
1983 — conf
Data Mappings in Large Parallel Computers.
GI Jahrestagung
Jan van Leeuwen, Harry A. G. Wijshoff
1983 — conf
Periodic versus arbitrary tessellations of the plane using polyominos of a single type.
Theoretical Computer Science
Harry A. G. Wijshoff, Jan van Leeuwen
1983 — conf
The VLSI complexity of Boolean functions.
Logic and Machines
Mark R. Kramer, Jan van Leeuwen
1982 J jnl
Dynamic Multi-Dimensional Data Structures Based on Quad- and
Acta Informatica
Mark H. Overmars, Jan van Leeuwen
1982 J jnl
Efficient Recognition of Rational Relations.
Inf. Process. Lett.
Jan van Leeuwen, Maurice Nivat
1982 J jnl
Stratified Balanced Search Trees.
Acta Informatica
Jan van Leeuwen, Mark H. Overmars
1981 — conf
Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds.
Theoretical Computer Science
Mark H. Overmars, Jan van Leeuwen
1981 J jnl
Maintenance of Configurations in the Plane.
J. Comput. Syst. Sci.
Mark H. Overmars, Jan van Leeuwen
1981 J jnl
Some Principles for Dynamizing Decomposable Searching Problems.
Inf. Process. Lett.
Mark H. Overmars, Jan van Leeuwen
1981 B conf
The Art of Dynamizing.
MFCS
Jan van Leeuwen, Mark H. Overmars
1981 J jnl
The Measure Problem for Rectangular Ranges in d-Space.
J. Algorithms
Jan van Leeuwen, Derick Wood
1981 J jnl
The complexity of basic complex operations.
Computing
Helmut Alt, Jan van Leeuwen
1981 J jnl
Two general methods for dynamizing decomposable searching problems.
Computing
Mark H. Overmars, Jan van Leeuwen
1981 B conf
Untangling a Travelling Salesman Tour in the Plane.
WG
Jan van Leeuwen, Anneke A. Schoone
1981 J jnl
Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems.
Inf. Process. Lett.
Mark H. Overmars, Jan van Leeuwen
1980 A* ed.
Automata, Languages and Programming, 7th Colloquium, Noordweijkerhout, The Netherlands, July 14-18, 1980, Proceedings
ICALP
J. W. de Bakker, Jan van Leeuwen
1980 A* conf
Dynamically Maintaining Configurations in the Plane (Detailed Abstract)
STOC
Mark H. Overmars, Jan van Leeuwen
1980 J jnl
Dynamization of Decomposable Searching Problems.
Inf. Process. Lett.
Jan van Leeuwen, Derick Wood
1980 J jnl
Further Comments on Bykat's Convex Hull Algorithm.
Inf. Process. Lett.
Mark H. Overmars, Jan van Leeuwen
1980 J jnl
Stack Machines and Classes of Nonnested Macro Languages.
J. ACM
Joost Engelfriet, Erik Meineche Schmidt, Jan van Leeuwen
1980 J jnl
Über Programmeffizienz und algebraische Komplexität.
Inform. Spektrum
Jan van Leeuwen
1979 J jnl
A Family of Similarity Measures Between Two Strings.
IEEE Trans. Pattern Anal. Mach. Intell.
Nicholas V. Findler, Jan van Leeuwen
1979 J jnl
A Useful Lemma for Context-Free Programmed Grammars.
Acta Informatica
Jan van Leeuwen
1979 — conf
Move Rules and Trade-Offs in the Pebble Game.
Theoretical Computer Science
Peter van Emde Boas, Jan van Leeuwen
1979 J jnl
On Compromising Statistical Data-Bases with a few Known Elements.
Inf. Process. Lett.
Jan van Leeuwen
1979 J jnl
On the Complexity of Decision Trees, the Quasi-Optimizer, and the Power of Heuristic rules
Inf. Control.
Nicholas V. Findler, Jan van Leeuwen
1979 B conf
The complexity of complex division (extended abstract).
FCT
Helmut Alt, Jan van Leeuwen
1978 J jnl
Effective constructions in well-partially- ordered free monoids.
Discret. Math.
Jan van Leeuwen
1978 J jnl
Evaluating a polynomial and its reverse.
SIGACT News
Jan van Leeuwen
1976 J jnl
A Decomposition Theorem for Hyper-Algebraic Extensions of Language Families.
Theor. Comput. Sci.
Jan van Leeuwen, Derick Wood
1976 J jnl
A regularity condition for parallel rewriting systems.
SIGACT News
Jan van Leeuwen
1976 A* conf
On the Construction of Huffman Trees.
ICALP
Jan van Leeuwen
1976 J jnl
The Complexity of Vector-Products.
Inf. Process. Lett.
David P. Dobkin, Jan van Leeuwen
1976 J jnl
The Halting Problem for Linear Turing Assemblers.
J. Comput. Syst. Sci.
Robert M. Baer, Jan van Leeuwen
1976 A* conf
Variations of a New Machine Model
FOCS
Jan van Leeuwen
1975 — conf
A Study of Complexity in Hyper-Algebraic Families.
Automata, Languages, Development
Jan van Leeuwen
1975 J jnl
An improved bound on the number of multiplications and divisions necessary to evaluate a polynomial and all its derivatives.
SIGACT News
Lieuwe de Jong, Jan van Leeuwen
1975 J jnl
The Membership Question for ET0L-Languages is Polynomially Complete.
Inf. Process. Lett.
Jan van Leeuwen
1975 J jnl
The Tape-Complexity of Context-Independent Developmental Languages.
J. Comput. Syst. Sci.
Jan van Leeuwen
1974 A* conf
A Generalisation of Parikh's Theorem in Formal Language Theory.
ICALP
Jan van Leeuwen
1974 A* conf
A Partial Solution to the Reachability-Problem for Vector-Addition Systems
STOC
Jan van Leeuwen
1974 J jnl
A forgotten connection between tag-systems and parallel-rewriting.
SIGACT News
Jan van Leeuwen
1974 J jnl
An Improved Bound for Detecting Looping Configurations in Deterministic DPA's.
Inf. Process. Lett.
Jan van Leeuwen, Carl H. Smith
1974 J jnl
Microprogrammed random access stored program machines.
SIGACT News
Carl H. Smith, Jan van Leeuwen
1974 — conf
Notes on Pre-Set Pushdown Automata.
L Systems
Jan van Leeuwen
1973 J jnl
Characterization of unary developmental languages.
Discret. Math.
Gabor T. Herman, K. P. Lee, Jan van Leeuwen, Grzegorz Rozenberg