Jan van Leeuwen

According to our database, Jan van Leeuwen authored at least 119 papers between 1973 and 2021.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2021

Towards Minimally Conscious Cyber-Physical Systems: A Manifesto.

Jirí Wiedermann, Jan van Leeuwen

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

2020

Algorithms, Complexity, and Hans.

Jan van Leeuwen

Proceedings of the Treewidth, Kernels, and Algorithms, 2020

2019

Question answering by humans and machines: A complexity-theoretic view.

Jan van Leeuwen, Jirí Wiedermann

Theor. Comput. Sci., 2019

Finite State Machines with Feedback: An Architecture Supporting Minimal Machine Consciousness.

Jirí Wiedermann, Jan van Leeuwen

Proceedings of the Computing with Foresight and Industry, 2019

2017

Turing Machines with One-sided Advice and Acceptance of the co-RE Languages.

Jan van Leeuwen, Jirí Wiedermann

Fundam. Informaticae, 2017

Shortcutting directed and undirected networks with a degree constraint.

Richard B. Tan, Erik Jan van Leeuwen, Jan van Leeuwen

Discret. Appl. Math., 2017

Epistemic Computation and Artificial Intelligence.

Jirí Wiedermann, Jan van Leeuwen

Proceedings of the Philosophy and Theory of Artificial Intelligence 2017, 2017

Non-classical Turing machines: extending the notion of computation.

Jirí Wiedermann, Jan van Leeuwen

Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017

2015

Separating the Classes of Recursively Enumerable Languages Based on Machine Size.

Jan van Leeuwen, Jirí Wiedermann

Int. J. Found. Comput. Sci., 2015

Pure Nash Equilibria in Graphical Games and Treewidth.

Antonis Thomas, Jan van Leeuwen

Algorithmica, 2015

What is Computation: An Epistemic Approach.

Jirí Wiedermann, Jan van Leeuwen

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

2014

On Floridi's Method of Levels of Abstraction.

Jan van Leeuwen

Minds Mach., 2014

2013

Integer Representations of Convex Polygon Intersection Graphs.

Tobias Müller, Erik Jan van Leeuwen, Jan van Leeuwen

SIAM J. Discret. Math., 2013

Treewidth and Pure Nash Equilibria.

Antonis Thomas, Jan van Leeuwen

Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013

2012

Computation as an unbounded process.

Jan van Leeuwen, Jirí Wiedermann

Theor. Comput. Sci., 2012

Structure of Polynomial-Time Approximation.

Erik Jan van Leeuwen, Jan van Leeuwen

Theory Comput. Syst., 2012

Computer-assisted proof of performance ratios for the Differencing Method.

Wil Michiels, Emile H. L. Aarts, Jan H. M. Korst, Jan van Leeuwen, Frits C. R. Spieksma

Discret. Optim., 2012

2011

Name Resolution by Rewriting in Dynamic Networks of Mobile Entities.

Jan van Leeuwen, Jirí Wiedermann

Proceedings of the Rainbow of Computer Science, 2011

2010

Convex Polygon Intersection Graphs.

Erik Jan van Leeuwen, Jan van Leeuwen

Proceedings of the Graph Drawing - 18th International Symposium, 2010

2009

Viewpoint - Research evaluation for computer science.

Bertrand Meyer, Christine Choppy, Jørgen Staunstrup, Jan van Leeuwen

Commun. ACM, 2009

2008

Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint.

Hans L. Bodlaender, Richard B. Tan, Thomas C. van Dijk, Jan van Leeuwen

Proceedings of the Algorithm Theory, 2008

How We Think of Computing Today.

Jirí Wiedermann, Jan van Leeuwen

Proceedings of the Logic and Theory of Algorithms, 2008

2005

Preface: Automata, Languages and Programming .

Fernando Orejas, Jan van Leeuwen

Theor. Comput. Sci., 2005

2004

Approximations for lambda-Colorings of Graphs.

Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen

Comput. J., 2004

Complexity of Evolving Interactive Systems.

Peter Verbaan, Jan van Leeuwen, Jirí Wiedermann

Proceedings of the Theory Is Forever, 2004

2003

Performance Ratios for the Karmarkar-Karp Differencing Method.

Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen

Electron. Notes Discret. Math., 2003

Finding a bigtriangleup-regular supergraph of minimum order.

Hans L. Bodlaender, Richard B. Tan, Jan van Leeuwen

Discret. Appl. Math., 2003

Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem.

Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

2002

The emergent computational potential of evolving artificial living systems.

Jirí Wiedermann, Jan van Leeuwen

AI Commun., 2002

Relativistic Computers and Non-uniform Complexity Theory.

Jirí Wiedermann, Jan van Leeuwen

Proceedings of the Unconventional Models of Computation, Third International Conference, 2002

2001

Beyond the Turing Limit: Evolving Interactive Systems.

Jan van Leeuwen, Jirí Wiedermann

Proceedings of the SOFSEM 2001: Theory and Practice of Informatics, 28th Conference on Current Trends in Theory and Practice of Informatics Piestany, Slovak Republic, November 24, 2001

Emergence of a Super-Turing Computational Potential in Artificial Living Systems.

Jirí Wiedermann, Jan van Leeuwen

Proceedings of the Advances in Artificial Life, 6th European Conference, 2001

2000

lambda-Coloring of Graphs.

Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen

Proceedings of the STACS 2000, 2000

On Algorithms and Interaction.

Jan van Leeuwen, Jirí Wiedermann

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

On the Power of Interactive Computing.

Jan van Leeuwen, Jirí Wiedermann

Proceedings of the Theoretical Computer Science, 2000

1998

The Complexity of Interval Routing on Random Graphs.

Michele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela

Comput. J., 1998

1997

On Interval Routing Schemes and Treewidth.

Hans L. Bodlaender, Jan van Leeuwen, Richard B. Tan, Dimitrios M. Thilikos

Inf. Comput., 1997

1994

Compact Routing Methods: A Survey.

Jan van Leeuwen, Richard B. Tan

Proceedings of the Structural Information and Communication Complexity, 1994

1993

Uniform <i>d</i>-emulations of rings, with an application to distributed virtual ring construction.

Erwin M. Bakker, Jan van Leeuwen

Networks, 1993

Maintenance of 2- and 3-edge- connected components of graphs I.

Johannes A. La Poutré, Jan van Leeuwen, Mark H. Overmars

Discret. Math., 1993

Prefix Routing Schemes in Dynamic Networks.

Erwin M. Bakker, Jan van Leeuwen, Richard B. Tan

Comput. Networks ISDN Syst., 1993

Interval Heaps.

Jan van Leeuwen, Derick Wood

Comput. J., 1993

1992

Parallel computing.

Emile H. L. Aarts, Jan van Leeuwen, Martin Rem

Future Gener. Comput. Syst., 1992

1991

On Models for Propositional Dynamic Logic.

Peter M. W. Knijnenburg, Jan van Leeuwen

Theor. Comput. Sci., 1991

1990

On special multiples of integers.

Goos Kant, Jan van Leeuwen

Bull. EATCS, 1990

Computational complexity of norm-maximization.

Hans L. Bodlaender, Peter Gritzmann, Victor Klee, Jan van Leeuwen

Comb., 1990

The File Distribution Problem for Processor Networks.

Goos Kant, Jan van Leeuwen

Proceedings of the SWAT 90, 1990

Graph Algorithms.

Jan van Leeuwen

Proceedings of the Handbook of Theoretical Computer Science, 1990

1989

Efficient Elections in Chordal Ring Networks.

Hagit Attiya, Jan van Leeuwen, Nicola Santoro, Shmuel Zaks

Algorithmica, 1989

Structured NC.

Bertha Scholten, Jan van Leeuwen

Proceedings of the Algorithms and Data Structures, 1989

1988

Fast Simulation of Turing Machines by Random Access Machines.

Jyrki Katajainen, Jan van Leeuwen, Martti Penttonen

SIAM J. Comput., 1988

The Derivation of Graph Marking Algorithms From Distributed Termination Detection Protocols.

Gerard Tel, Richard B. Tan, Jan van Leeuwen

Sci. Comput. Program., 1988

On Estimating the Complexity of Logarithmic Decompositions.

Marc Bezem, Jan van Leeuwen

Inf. Process. Lett., 1988

Assertional Verification of a Majority Consensus Algorithm for Concurrency Control in Multiple Copy Databases.

Nicolien J. Drost, Jan van Leeuwen

Proceedings of the Concurrency 88: International Conference on Concurrency, 1988

1987

On Linear Skewing Schemes and d-Ordered Vectors.

Harry A. G. Wijshoff, Jan van Leeuwen

IEEE Trans. Computers, 1987

Diameter increase caused by edge deletion.

Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen

J. Graph Theory, 1987

A non-deterministic algorithm and its analysis.

Gerard Tel, Jan van Leeuwen

Bull. EATCS, 1987

An Improved Upperbound for Distributed Election in Bidirectional Rings of Processors.

Jan van Leeuwen, Richard B. Tan

Distributed Comput., 1987

Interval Routing.

Jan van Leeuwen, Richard B. Tan

Comput. J., 1987

Array Processing Machines: An Abstract Model.

Jan van Leeuwen, Jirí Wiedermann

BIT, 1987

Maintenance of Transitive Closures and Transitive Reductions of Graphs.

Johannes A. La Poutré, Jan van Leeuwen

Proceedings of the Graph-Theoretic Concepts in Computer Science, International Workshop, 1987

The Derivation of on-the-fly Garbage Collection Algorithms from Distributed Termination Detection Protocols.

Gerard Tel, Richard B. Tan, Jan van Leeuwen

Proceedings of the STACS 87, 1987

Guessing Games and Distributed Computations in Synchronous Networks.

Jan van Leeuwen, Nicola Santoro, Jorge Urrutia, Shmuel Zaks

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

Simulation of Large Networks on Smaller Networks

Hans L. Bodlaender, Jan van Leeuwen

Inf. Control., December, 1986

Improved Diameter Bounds for Altered Graphs.

Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen

Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors.

Hans L. Bodlaender, Jan van Leeuwen

Proceedings of the STACS 86, 1986

Pragmatic Aspects of Complexity Theory (Panel).

Jan van Leeuwen

Proceedings of the Information Processing 86, 1986

1985

The Structure of Periodic Storage Schemes for Parallel Memories.

Harry A. G. Wijshoff, Jan van Leeuwen

IEEE Trans. Computers, 1985

Preface

Marek Karpinski, Jan van Leeuwen

Inf. Control., 1985

Array processing machines.

Jan van Leeuwen, Jirí Wiedermann

Proceedings of the Fundamentals of Computation Theory, 1985

1984

Arbitrary versus Periodic Storage Schemes and Tessellations of the Plane Using One Type of Polyomino

Harry A. G. Wijshoff, Jan van Leeuwen

Inf. Control., July, 1984

Worst-case Analysis of Set Union Algorithms.

Robert Endre Tarjan, Jan van Leeuwen

J. ACM, 1984

Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.

Herbert Edelsbrunner, Jan van Leeuwen, Thomas Ottmann, Derick Wood

RAIRO Theor. Informatics Appl., 1984

Systolische Berechnungen und VLSI.

Mark R. Kramer, Jan van Leeuwen

Inform. Spektrum, 1984

1983

Periodic versus arbitrary tessellations of the plane using polyominos of a single type.

Harry A. G. Wijshoff, Jan van Leeuwen

Proceedings of the Theoretical Computer Science, 1983

The VLSI complexity of Boolean functions.

Mark R. Kramer, Jan van Leeuwen

Proceedings of the Logic and Machines: Decision Problems and Complexity, 1983

Data Mappings in Large Parallel Computers.

Jan van Leeuwen, Harry A. G. Wijshoff

Proceedings of the GI - 13. Jahrestagung, Hamburg, 3.-7. Oktober 1983, Proceedings, 1983

1982

Efficient Recognition of Rational Relations.

Jan van Leeuwen, Maurice Nivat

Inf. Process. Lett., 1982

Dynamic Multi-Dimensional Data Structures Based on Quad- and <i> K - D </i> Trees.

Mark H. Overmars, Jan van Leeuwen

Acta Informatica, 1982

Stratified Balanced Search Trees.

Jan van Leeuwen, Mark H. Overmars

Acta Informatica, 1982

1981

Maintenance of Configurations in the Plane.

Mark H. Overmars, Jan van Leeuwen

J. Comput. Syst. Sci., 1981

The Measure Problem for Rectangular Ranges in d-Space.

Jan van Leeuwen, Derick Wood

J. Algorithms, 1981

Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems.

Mark H. Overmars, Jan van Leeuwen

Inf. Process. Lett., 1981

Some Principles for Dynamizing Decomposable Searching Problems.

Mark H. Overmars, Jan van Leeuwen

Inf. Process. Lett., 1981

Two general methods for dynamizing decomposable searching problems.

Mark H. Overmars, Jan van Leeuwen

Computing, 1981

The complexity of basic complex operations.

Helmut Alt, Jan van Leeuwen

Computing, 1981

Untangling a Travelling Salesman Tour in the Plane.

Jan van Leeuwen, Anneke A. Schoone

Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds.

Mark H. Overmars, Jan van Leeuwen

Proceedings of the Theoretical Computer Science, 1981

The Art of Dynamizing.

Jan van Leeuwen, Mark H. Overmars

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980

Stack Machines and Classes of Nonnested Macro Languages.

Joost Engelfriet, Erik Meineche Schmidt, Jan van Leeuwen

J. ACM, 1980

Further Comments on Bykat's Convex Hull Algorithm.

Mark H. Overmars, Jan van Leeuwen

Inf. Process. Lett., 1980

Dynamization of Decomposable Searching Problems.

Jan van Leeuwen, Derick Wood

Inf. Process. Lett., 1980

Über Programmeffizienz und algebraische Komplexität.

Jan van Leeuwen

Inform. Spektrum, 1980

Dynamically Maintaining Configurations in the Plane (Detailed Abstract)

Mark H. Overmars, Jan van Leeuwen

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1979

On the Complexity of Decision Trees, the Quasi-Optimizer, and the Power of Heuristic rules

Nicholas V. Findler, Jan van Leeuwen

Inf. Control., January, 1979

A Family of Similarity Measures Between Two Strings.

Nicholas V. Findler, Jan van Leeuwen

IEEE Trans. Pattern Anal. Mach. Intell., 1979

On Compromising Statistical Data-Bases with a few Known Elements.

Jan van Leeuwen

Inf. Process. Lett., 1979

A Useful Lemma for Context-Free Programmed Grammars.

Jan van Leeuwen

Acta Informatica, 1979

Move Rules and Trade-Offs in the Pebble Game.

Peter van Emde Boas, Jan van Leeuwen

Proceedings of the Theoretical Computer Science, 1979

The complexity of complex division (extended abstract).

Helmut Alt, Jan van Leeuwen

Proceedings of the Fundamentals of Computation Theory, 1979

1978

Evaluating a polynomial and its reverse.

Jan van Leeuwen

SIGACT News, 1978

Effective constructions in well-partially- ordered free monoids.

Jan van Leeuwen

Discret. Math., 1978

1976

A Decomposition Theorem for Hyper-Algebraic Extensions of Language Families.

Jan van Leeuwen, Derick Wood

Theor. Comput. Sci., 1976

A regularity condition for parallel rewriting systems.

Jan van Leeuwen

SIGACT News, 1976

The Halting Problem for Linear Turing Assemblers.

Robert M. Baer, Jan van Leeuwen

J. Comput. Syst. Sci., 1976

The Complexity of Vector-Products.

David P. Dobkin, Jan van Leeuwen

Inf. Process. Lett., 1976

On the Construction of Huffman Trees.

Jan van Leeuwen

Proceedings of the Third International Colloquium on Automata, 1976

Variations of a New Machine Model

Jan van Leeuwen

Proceedings of the 17th Annual Symposium on Foundations of Computer Science, 1976

1975

An improved bound on the number of multiplications and divisions necessary to evaluate a polynomial and all its derivatives.

Lieuwe de Jong, Jan van Leeuwen

SIGACT News, 1975

The Tape-Complexity of Context-Independent Developmental Languages.

Jan van Leeuwen

J. Comput. Syst. Sci., 1975

The Membership Question for ET0L-Languages is Polynomially Complete.

Jan van Leeuwen

Inf. Process. Lett., 1975

A Study of Complexity in Hyper-Algebraic Families.

Jan van Leeuwen

Proceedings of the Automata, Languages, Development: At the crossroads of biology, mathematics and computer science, result of an international conference held at Noordwijkerhout, The Netherlands, March 31, 1975

1974

Microprogrammed random access stored program machines.

Carl H. Smith, Jan van Leeuwen

SIGACT News, 1974

A forgotten connection between tag-systems and parallel-rewriting.

Jan van Leeuwen

SIGACT News, 1974

An Improved Bound for Detecting Looping Configurations in Deterministic DPA's.

Jan van Leeuwen, Carl H. Smith

Inf. Process. Lett., 1974

A Partial Solution to the Reachability-Problem for Vector-Addition Systems

Jan van Leeuwen

Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974

A Generalisation of Parikh's Theorem in Formal Language Theory.

Jan van Leeuwen

Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974

Notes on Pre-Set Pushdown Automata.

Jan van Leeuwen

Proceedings of the L Systems, 1974

1973

Characterization of unary developmental languages.

Gabor T. Herman, K. P. Lee, Jan van Leeuwen, Grzegorz Rozenberg

Discret. Math., 1973