The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jan van Leeuwen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  85. How We Think of Computing Today. [Citation Graph (, )][DBLP]


  86. Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint. [Citation Graph (, )][DBLP]


  87. Viewpoint - Research evaluation for computer science. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002