Jan van Leeuwen
Affiliations:- Utrecht University, Netherlands
According to our database1,
Jan van Leeuwen
authored at least 120 papers
between 1973 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on viaf.org
-
on id.loc.gov
-
on d-nb.info
-
on cs.uu.nl
-
on isni.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Proceedings of the Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024), 2024
2021
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021
2020
Proceedings of the Treewidth, Kernels, and Algorithms, 2020
2019
Theor. Comput. Sci., 2019
Finite State Machines with Feedback: An Architecture Supporting Minimal Machine Consciousness.
Proceedings of the Computing with Foresight and Industry, 2019
2017
Fundam. Informaticae, 2017
Discret. Appl. Math., 2017
Proceedings of the Philosophy and Theory of Artificial Intelligence 2017, 2017
Non-classical Turing machines: extending the notion of computation.
Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017
2015
Int. J. Found. Comput. Sci., 2015
Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015
2014
2013
SIAM J. Discret. Math., 2013
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013
2012
Discret. Optim., 2012
2011
Proceedings of the Rainbow of Computer Science, 2011
2010
Proceedings of the Graph Drawing - 18th International Symposium, 2010
2009
2008
Proceedings of the Algorithm Theory, 2008
Proceedings of the Logic and Theory of Algorithms, 2008
2005
2004
Proceedings of the Theory Is Forever, 2004
2003
Electron. Notes Discret. Math., 2003
Discret. Appl. Math., 2003
Performance Ratios for the Differencing Method Applied to the Balanced Number Partitioning Problem.
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003
2002
AI Commun., 2002
Proceedings of the Unconventional Models of Computation, Third International Conference, 2002
2001
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
Proceedings of the Advances in Artificial Life, 6th European Conference, 2001
2000
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000
Proceedings of the Theoretical Computer Science, 2000
1998
1997
1994
Compact Routing Methods: A Survey.
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.
Networks, 1993
1992
1991
1990
On special multiples of integers.
Bull. EATCS, 1990
Proceedings of the SWAT 90, 1990
Graph Algorithms.
Proceedings of the Handbook of Theoretical Computer Science, 1990
1989
1988
The Derivation of Graph Marking Algorithms From Distributed Termination Detection Protocols.
Sci. Comput. Program., 1988
Inf. Process. Lett., 1988
Assertional Verification of a Majority Consensus Algorithm for Concurrency Control in Multiple Copy Databases.
Proceedings of the Concurrency 88: International Conference on Concurrency, 1988
1987
A non-deterministic algorithm and its analysis.
Bull. EATCS, 1987
An Improved Upperbound for Distributed Election in Bidirectional Rings of Processors.
Distributed Comput., 1987
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.
Proceedings of the STACS 87, 1987
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987
1986
Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986
Proceedings of the STACS 86, 1986
Pragmatic Aspects of Complexity Theory (Panel).
Proceedings of the Information Processing 86, 1986
1985
IEEE Trans. Computers, 1985
Proceedings of the Fundamentals of Computation Theory, 1985
1984
Arbitrary versus Periodic Storage Schemes and Tessellations of the Plane Using One Type of Polyomino
Inf. Control., July, 1984
Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.
RAIRO Theor. Informatics Appl., 1984
Systolische Berechnungen und VLSI.
Inform. Spektrum, 1984
1983
Periodic versus arbitrary tessellations of the plane using polyominos of a single type.
Proceedings of the Theoretical Computer Science, 1983
Proceedings of the Logic and Machines: Decision Problems and Complexity, 1983
Proceedings of the GI - 13. Jahrestagung, Hamburg, 3.-7. Oktober 1983, Proceedings, 1983
1982
Acta Informatica, 1982
1981
Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems.
Inf. Process. Lett., 1981
Inf. Process. Lett., 1981
Untangling a Travelling Salesman Tour in the Plane.
Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981
Proceedings of the Theoretical Computer Science, 1981
Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981
1980
Über Programmeffizienz und algebraische Komplexität.
Inform. Spektrum, 1980
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
Inf. Control., January, 1979
IEEE Trans. Pattern Anal. Mach. Intell., 1979
Inf. Process. Lett., 1979
Proceedings of the Theoretical Computer Science, 1979
The complexity of complex division (extended abstract).
Proceedings of the Fundamentals of Computation Theory, 1979
1978
Discret. Math., 1978
1976
Theor. Comput. Sci., 1976
On the Construction of Huffman Trees.
Proceedings of the Third International Colloquium on Automata, 1976
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.
SIGACT News, 1975
J. Comput. Syst. Sci., 1975
Inf. Process. Lett., 1975
A Study of Complexity in Hyper-Algebraic Families.
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
Inf. Process. Lett., 1974
Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30, 1974
Proceedings of the Automata, Languages and Programming, 2nd Colloquium, University of Saarbrücken, Germany, July 29, 1974
1973