Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDJan van Leeuwen
Person information
- affiliation: Utrecht University, Netherlands
- award: ACM Distinguished Service Award, 2013
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[c49]Jirí Wiedermann, Jan van Leeuwen:
Towards Minimally Conscious Cyber-Physical Systems: A Manifesto. SOFSEM 2021: 43-55- 2020
- [c48]Jan van Leeuwen:
Algorithms, Complexity, and Hans. Treewidth, Kernels, and Algorithms 2020: 22-27
2010 – 2019
- 2019
- [j74]Jan van Leeuwen, Jirí Wiedermann:
Question answering by humans and machines: A complexity-theoretic view. Theor. Comput. Sci. 777: 464-473 (2019) - [c47]Jirí Wiedermann, Jan van Leeuwen:
Finite State Machines with Feedback: An Architecture Supporting Minimal Machine Consciousness. CiE 2019: 286-297 - 2018
- [e18]A Min Tjoa
, Ladjel Bellatreche, Stefan Biffl, Jan van Leeuwen, Jirí Wiedermann:
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. Lecture Notes in Computer Science 10706, Springer 2018, ISBN 978-3-319-73116-2 [contents] - 2017
- [j73]Richard B. Tan, Erik Jan van Leeuwen, Jan van Leeuwen:
Shortcutting directed and undirected networks with a degree constraint. Discret. Appl. Math. 220: 91-117 (2017) - [j72]Jan van Leeuwen, Jirí Wiedermann:
Turing Machines with One-sided Advice and Acceptance of the co-RE Languages. Fundam. Informaticae 153(4): 347-366 (2017) - [c46]Jirí Wiedermann, Jan van Leeuwen:
Non-classical Turing machines: extending the notion of computation. NCMA 2017: 29-40 - [c45]Jirí Wiedermann, Jan van Leeuwen:
Epistemic Computation and Artificial Intelligence. PT-AI 2017: 215-224 - 2015
- [j71]Antonis Thomas, Jan van Leeuwen:
Pure Nash Equilibria in Graphical Games and Treewidth. Algorithmica 71(3): 581-604 (2015) - [j70]Jan van Leeuwen, Jirí Wiedermann:
Separating the Classes of Recursively Enumerable Languages Based on Machine Size. Int. J. Found. Comput. Sci. 26(6): 677-696 (2015) - [c44]Jirí Wiedermann, Jan van Leeuwen:
What is Computation: An Epistemic Approach. SOFSEM 2015: 1-13 - 2014
- [j69]Jan van Leeuwen:
On Floridi's Method of Levels of Abstraction. Minds Mach. 24(1): 5-17 (2014) - 2013
- [j68]Tobias Müller, Erik Jan van Leeuwen, Jan van Leeuwen:
Integer Representations of Convex Polygon Intersection Graphs. SIAM J. Discret. Math. 27(1): 205-231 (2013) - [c43]Antonis Thomas, Jan van Leeuwen:
Treewidth and Pure Nash Equilibria. IPEC 2013: 348-360 - 2012
- [j67]Wil Michiels, Emile H. L. Aarts, Jan H. M. Korst, Jan van Leeuwen, Frits C. R. Spieksma:
Computer-assisted proof of performance ratios for the Differencing Method. Discret. Optim. 9(1): 1-16 (2012) - [j66]Erik Jan van Leeuwen, Jan van Leeuwen:
Structure of Polynomial-Time Approximation. Theory Comput. Syst. 50(4): 641-674 (2012) - [j65]Jan van Leeuwen, Jirí Wiedermann:
Computation as an unbounded process. Theor. Comput. Sci. 429: 202-212 (2012) - 2011
- [c42]Jan van Leeuwen, Jirí Wiedermann:
Name Resolution by Rewriting in Dynamic Networks of Mobile Entities. Rainbow of Computer Science 2011: 215-227 - [c41]Tobias Müller, Erik Jan van Leeuwen, Jan van Leeuwen:
Integer representations of convex polygon intersection graphs. SCG 2011: 300-307 - 2010
- [c40]Erik Jan van Leeuwen, Jan van Leeuwen:
Convex Polygon Intersection Graphs. Graph Drawing 2010: 377-388 - [e17]Jan van Leeuwen, Anca Muscholl, David Peleg, Jaroslav Pokorný, Bernhard Rumpe:
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. Lecture Notes in Computer Science 5901, Springer 2010, ISBN 978-3-642-11265-2 [contents]
2000 – 2009
- 2009
- [j64]Bertrand Meyer, Christine Choppy, Jørgen Staunstrup, Jan van Leeuwen:
Viewpoint - Research evaluation for computer science. Commun. ACM 52(4): 31-34 (2009) - 2008
- [c39]Jirí Wiedermann, Jan van Leeuwen:
How We Think of Computing Today. CiE 2008: 579-593 - [c38]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
- [j63]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) - [e16]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. Lecture Notes in Computer Science 4362, Springer 2007, ISBN 978-3-540-69506-6 [contents] - [e15]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, ISBN 80-903298-9-6 [contents] - 2005
- [j62]Fernando Orejas, Jan van Leeuwen:
Preface: Automata, Languages and Programming . Theor. Comput. Sci. 331(1): 1-2 (2005) - 2004
- [j61]Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen:
Approximations for lambda-Colorings of Graphs. Comput. J. 47(2): 193-204 (2004) - [c37]Peter Verbaan, Jan van Leeuwen, Jirí Wiedermann:
Complexity of Evolving Interactive Systems. Theory Is Forever 2004: 268-281 - 2003
- [j60]Hans L. Bodlaender, Richard B. Tan, Jan van Leeuwen:
Finding a bigtriangleup-regular supergraph of minimum order. Discret. Appl. Math. 131(1): 3-9 (2003) - [j59]Wil Michiels, Jan H. M. Korst, Emile H. L. Aarts, Jan van Leeuwen:
Performance Ratios for the Karmarkar-Karp Differencing Method. Electron. Notes Discret. Math. 13: 71-75 (2003) - [c36]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 - 2002
- [j58]Jirí Wiedermann, Jan van Leeuwen:
The emergent computational potential of evolving artificial living systems. AI Commun. 15(4): 205-215 (2002) - [c35]Jirí Wiedermann, Jan van Leeuwen:
Relativistic Computers and Non-uniform Complexity Theory. UMC 2002: 287-299 - 2001
- [c34]Jirí Wiedermann, Jan van Leeuwen:
Emergence of a Super-Turing Computational Potential in Artificial Living Systems. ECAL 2001: 55-65 - [c33]Jan van Leeuwen, Jirí Wiedermann:
Beyond the Turing Limit: Evolving Interactive Systems. SOFSEM 2001: 90-109 - [e14]Fernando Orejas, Paul G. Spirakis, Jan van Leeuwen:
Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings. Lecture Notes in Computer Science 2076, Springer 2001, ISBN 3-540-42287-0 [contents] - 2000
- [c32]Jan van Leeuwen, Jirí Wiedermann:
On the Power of Interactive Computing. IFIP TCS 2000: 619-623 - [c31]Jan van Leeuwen, Jirí Wiedermann:
On Algorithms and Interaction. MFCS 2000: 99-113 - [c30]Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen:
lambda-Coloring of Graphs. STACS 2000: 395-406 - [e13]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. Lecture Notes in Computer Science 1872, Springer 2000, ISBN 3-540-67823-9 [contents]
1990 – 1999
- 1998
- [j57]Michele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela:
The Complexity of Interval Routing on Random Graphs. Comput. J. 41(1): 16-25 (1998) - 1997
- [j56]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
- [c29]Michele Flammini, Jan van Leeuwen, Alberto Marchetti-Spaccamela:
The Complexity of Interval Routing on Random Graphs. MFCS 1995: 37-49 - [c28]Hans L. Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen:
On Interval Routing Schemes and Treewidth. WG 1995: 181-196 - [e12]Jan van Leeuwen:
Computer Science Today: Recent Trends and Developments. Lecture Notes in Computer Science 1000, Springer 1995, ISBN 3-540-60105-8 [contents] - 1994
- [c27]Jan van Leeuwen, Richard B. Tan:
Compact Routing Methods: A Survey. SIROCCO 1994: 99-110 - [e11]Jan van Leeuwen:
Algorithms - ESA '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings. Lecture Notes in Computer Science 855, Springer 1994, ISBN 3-540-58434-X [contents] - [e10]Jan van Leeuwen:
Graph-Theoretic Concepts in Computer Science, 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings. Lecture Notes in Computer Science 790, Springer 1994, ISBN 3-540-57899-4 [contents] - 1993
- [j55]Jan van Leeuwen, Derick Wood:
Interval Heaps. Comput. J. 36(3): 209-216 (1993) - [j54]Erwin M. Bakker, Jan van Leeuwen, Richard B. Tan:
Prefix Routing Schemes in Dynamic Networks. Comput. Networks ISDN Syst. 26(4): 403-421 (1993) - [j53]Johannes A. La Poutré, Jan van Leeuwen, Mark H. Overmars:
Maintenance of 2- and 3-edge- connected components of graphs I. Discret. Math. 114(1-3): 329-359 (1993) - [j52]Erwin M. Bakker, Jan van Leeuwen:
Uniform d-emulations of rings, with an application to distributed virtual ring construction. Networks 23(4): 237-248 (1993) - 1992
- [j51]Emile H. L. Aarts, Jan van Leeuwen, Martin Rem:
Parallel computing. Future Gener. Comput. Syst. 8(4): 267-268 (1992) - [e9]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. IFIP Transactions A-12, North-Holland 1992, ISBN 0-444-89747-X [contents] - 1991
- [j50]Peter M. W. Knijnenburg, Jan van Leeuwen:
On Models for Propositional Dynamic Logic. Theor. Comput. Sci. 91(2): 181-203 (1991) - [e8]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. Lecture Notes in Computer Science 505, Springer 1991, ISBN 3-540-54151-9 [contents] - [e7]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. Lecture Notes in Computer Science 506, Springer 1991, ISBN 3-540-54152-7 [contents] - [e6]Jan van Leeuwen, Nicola Santoro:
Distributed Algorithms, 4th International Workshop, WDAG '90, Bari, Italy, September 24-26, 1990, Proceedings. Lecture Notes in Computer Science 486, Springer 1991, ISBN 3-540-54099-7 [contents] - 1990
- [j49]Hans L. Bodlaender, Peter Gritzmann, Victor Klee, Jan van Leeuwen:
Computational complexity of norm-maximization. Comb. 10(2): 203-225 (1990) - [j48]Goos Kant, Jan van Leeuwen:
On special multiples of integers. Bull. EATCS 41: 210-211 (1990) - [c26]Goos Kant, Jan van Leeuwen:
The File Distribution Problem for Processor Networks. SWAT 1990: 48-59 - [p1]Jan van Leeuwen:
Graph Algorithms. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 525-631 - [e5]Jan van Leeuwen:
Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity. Elsevier and MIT Press 1990, ISBN 0-444-88071-2 [contents] - [e4]Jan van Leeuwen:
Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics. Elsevier and MIT Press 1990, ISBN 0-444-88074-7 [contents]
1980 – 1989
- 1989
- [j47]Hagit Attiya, Jan van Leeuwen, Nicola Santoro, Shmuel Zaks:
Efficient Elections in Chordal Ring Networks. Algorithmica 4(3): 437-446 (1989) - [c25]Bertha Scholten, Jan van Leeuwen:
Structured NC. WADS 1989: 487-498 - [e3]Jan van Leeuwen:
Graph-Theoretic Concepts in Computer Science, 14th International Workshop, WG '88, Amsterdam, The Netherlands, June 15-17, 1988, Proceedings. Lecture Notes in Computer Science 344, Springer 1989, ISBN 3-540-50728-0 [contents] - 1988
- [j46]Marc Bezem, Jan van Leeuwen:
On Estimating the Complexity of Logarithmic Decompositions. Inf. Process. Lett. 26(6): 321-324 (1988) - [j45]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) - [j44]Jyrki Katajainen, Jan van Leeuwen, Martti Penttonen:
Fast Simulation of Turing Machines by Random Access Machines. SIAM J. Comput. 17(1): 77-88 (1988) - [c24]Nicolien J. Drost, Jan van Leeuwen:
Assertional Verification of a Majority Consensus Algorithm for Concurrency Control in Multiple Copy Databases. Concurrency 1988: 320-334 - [e2]Jan van Leeuwen:
Distributed Algorithms, 2nd International Workshop, Amsterdam, The Netherlands, July 8-10, 1987, Proceedings. Lecture Notes in Computer Science 312, Springer 1988, ISBN 3-540-19366-9 [contents] - 1987
- [j43]Jan van Leeuwen, Jirí Wiedermann:
Array Processing Machines: An Abstract Model. BIT 27(1): 25-43 (1987) - [j42]Jan van Leeuwen, Richard B. Tan:
Interval Routing. Comput. J. 30(4): 298-307 (1987) - [j41]Jan van Leeuwen, Richard B. Tan:
An Improved Upperbound for Distributed Election in Bidirectional Rings of Processors. Distributed Comput. 2(3): 149-160 (1987) - [j40]Gerard Tel, Jan van Leeuwen:
A non-deterministic algorithm and its analysis. Bull. EATCS 33: 100-102 (1987) - [j39]Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen:
Diameter increase caused by edge deletion. J. Graph Theory 11(3): 409-427 (1987) - [j38]Harry A. G. Wijshoff, Jan van Leeuwen:
On Linear Skewing Schemes and d-Ordered Vectors. IEEE Trans. Computers 36(2): 233-239 (1987) - [c23]Jan van Leeuwen, Nicola Santoro, Jorge Urrutia, Shmuel Zaks:
Guessing Games and Distributed Computations in Synchronous Networks. ICALP 1987: 347-356 - [c22]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 - [c21]Johannes A. La Poutré, Jan van Leeuwen:
Maintenance of Transitive Closures and Transitive Reductions of Graphs. WG 1987: 106-120 - 1986
- [j37]Hans L. Bodlaender, Jan van Leeuwen:
Simulation of Large Networks on Smaller Networks. Inf. Control. 71(3): 143-180 (1986) - [c20]Jan van Leeuwen:
Pragmatic Aspects of Complexity Theory (Panel). IFIP Congress 1986: 5-6 - [c19]Hans L. Bodlaender, Jan van Leeuwen:
New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors. STACS 1986: 119-129 - [c18]Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen:
Improved Diameter Bounds for Altered Graphs. WG 1986: 227-236 - 1985
- [j36]Marek Karpinski, Jan van Leeuwen:
Preface. Inf. Control. 64(1-3): 1 (1985) - [j35]Harry A. G. Wijshoff, Jan van Leeuwen:
The Structure of Periodic Storage Schemes for Parallel Memories. IEEE Trans. Computers 34(6): 501-505 (1985) - [c17]Jan van Leeuwen, Jirí Wiedermann:
Array processing machines. FCT 1985: 257-268 - [c16]Hans L. Bodlaender, Jan van Leeuwen:
Simulation of Large Networks on Smaller Networks. STACS 1985: 47-58 - 1984
- [j34]Harry A. G. Wijshoff, Jan van Leeuwen:
Arbitrary versus Periodic Storage Schemes and Tessellations of the Plane Using One Type of Polyomino. Inf. Control. 62(1): 1-25 (1984) - [j33]Mark R. Kramer, Jan van Leeuwen:
Systolische Berechnungen und VLSI. Inform. Spektrum 7(3): 154-165 (1984) - [j32]Herbert Edelsbrunner, Jan van Leeuwen, Thomas Ottmann, Derick Wood:
Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space. RAIRO Theor. Informatics Appl. 18(2): 171-183 (1984) - [j31]Robert Endre Tarjan, Jan van Leeuwen:
Worst-case Analysis of Set Union Algorithms. J. ACM 31(2): 245-281 (1984) - 1983
- [c15]Jan van Leeuwen, Harry A. G. Wijshoff:
Data Mappings in Large Parallel Computers. GI Jahrestagung 1983: 8-20 - [c14]Mark R. Kramer, Jan van Leeuwen:
The VLSI complexity of Boolean functions. Logic and Machines 1983: 397-407 - [c13]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
- [j30]Mark H. Overmars, Jan van Leeuwen:
Dynamic Multi-Dimensional Data Structures Based on Quad- and K - D Trees. Acta Informatica 17: 267-285 (1982) - [j29]Jan van Leeuwen, Mark H. Overmars:
Stratified Balanced Search Trees. Acta Informatica 18: 345-359 (1982) - [j28]Jan van Leeuwen, Maurice Nivat:
Efficient Recognition of Rational Relations. Inf. Process. Lett. 14(1): 34-38 (1982) - 1981
- [j27]Mark H. Overmars, Jan van Leeuwen:
Two general methods for dynamizing decomposable searching problems. Computing 26(2): 155-166 (1981) - [j26]Helmut Alt, Jan van Leeuwen:
The complexity of basic complex operations. Computing 27(3): 205-215 (1981) - [j25]Mark H. Overmars, Jan van Leeuwen:
Some Principles for Dynamizing Decomposable Searching Problems. Inf. Process. Lett. 12(1): 49-53 (1981) - [j24]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) - [j23]Jan van Leeuwen, Derick Wood:
The Measure Problem for Rectangular Ranges in d-Space. J. Algorithms 2(3): 282-300 (1981) - [j22]Mark H. Overmars, Jan van Leeuwen:
Maintenance of Configurations in the Plane. J. Comput. Syst. Sci. 23(2): 166-204 (1981) - [c12]Jan van Leeuwen, Mark H. Overmars:
The Art of Dynamizing. MFCS 1981: 121-131 - [c11]Mark H. Overmars, Jan van Leeuwen:
Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds. Theoretical Computer Science 1981: 224-233 - [c10]Jan van Leeuwen, Anneke A. Schoone:
Untangling a Travelling Salesman Tour in the Plane. WG 1981: 87-98 - 1980
- [j21]Jan van Leeuwen:
Über Programmeffizienz und algebraische Komplexität. Inform. Spektrum 3(3): 172-180 (1980) - [j20]Jan van Leeuwen, Derick Wood:
Dynamization of Decomposable Searching Problems. Inf. Process. Lett. 10(2): 51-56 (1980) - [j19]Mark H. Overmars, Jan van Leeuwen:
Further Comments on Bykat's Convex Hull Algorithm. Inf. Process. Lett. 10(4/5): 209-212 (1980) - [j18]Joost Engelfriet, Erik Meineche Schmidt, Jan van Leeuwen:
Stack Machines and Classes of Nonnested Macro Languages. J. ACM 27(1): 96-117 (1980) - [c9]Mark H. Overmars, Jan van Leeuwen:
Dynamically Maintaining Configurations in the Plane (Detailed Abstract). STOC 1980: 135-145 - [e1]J. W. de Bakker, Jan van Leeuwen:
Automata, Languages and Programming, 7th Colloquium, Noordweijkerhout, The Netherlands, July 14-18, 1980, Proceedings. Lecture Notes in Computer Science 85, Springer 1980, ISBN 3-540-10003-2 [contents]
1970 – 1979
- 1979
- [j17]Jan van Leeuwen:
A Useful Lemma for Context-Free Programmed Grammars. Acta Informatica 11: 373-386 (1979) - [j16]Nicholas V. Findler, Jan van Leeuwen:
On the Complexity of Decision Trees, the Quasi-Optimizer, and the Power of Heuristic rules. Inf. Control. 40(1): 1-19 (1979) - [j15]Jan van Leeuwen:
On Compromising Statistical Data-Bases with a few Known Elements. Inf. Process. Lett. 8(3): 149-153 (1979) - [j14]Nicholas V. Findler, Jan van Leeuwen:
A Family of Similarity Measures Between Two Strings. IEEE Trans. Pattern Anal. Mach. Intell. 1(1): 116-118 (1979) - [c8]Helmut Alt, Jan van Leeuwen:
The complexity of complex division (extended abstract). FCT 1979: 13-17 - [c7]Peter van Emde Boas, Jan van Leeuwen:
Move Rules and Trade-Offs in the Pebble Game. Theoretical Computer Science 1979: 101-112 - 1978
- [j13]Jan van Leeuwen:
Effective constructions in well-partially- ordered free monoids. Discret. Math. 21(3): 237-252 (1978) - [j12]Jan van Leeuwen:
Evaluating a polynomial and its reverse. SIGACT News 10(1): 18-21 (1978) - 1976
- [j11]David P. Dobkin, Jan van Leeuwen:
The Complexity of Vector-Products. Inf. Process. Lett. 4(6): 149-154 (1976) - [j10]Robert M. Baer, Jan van Leeuwen:
The Halting Problem for Linear Turing Assemblers. J. Comput. Syst. Sci. 13(2): 119-135 (1976) - [j9]Jan van Leeuwen:
A regularity condition for parallel rewriting systems. SIGACT News 8(4): 24-27 (1976) - [j8]