J. Van Leeuwen

From MaRDI portal
(Redirected from Person:418789)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Large language models and the extended Church-Turing thesis2025-08-19Paper
On Interval Routing Schemes and treewidth
Graph-Theoretic Concepts in Computer Science
2024-02-28Paper
The file distribution problem for processor networks
SWAT 90
2022-12-09Paper
Algorithms, Complexity, and Hans
Treewidth, Kernels, and Algorithms
2022-10-19Paper
Finite state machines with feedback: an architecture supporting minimal machine consciousness2020-05-12Paper
Question answering by humans and machines: a complexity-theoretic view
Theoretical Computer Science
2019-06-18Paper
Turing machines with one-sided advice and acceptance of the co-RE languages
Fundamenta Informaticae
2018-01-05Paper
Shortcutting directed and undirected networks with a degree constraint
Discrete Applied Mathematics
2017-02-06Paper
Separating the classes of recursively enumerable languages based on machine size
International Journal of Foundations of Computer Science
2015-12-11Paper
Pure Nash equilibria in graphical games and treewidth
Algorithmica
2015-05-04Paper
What is computation: an epistemic approach
Lecture Notes in Computer Science
2015-02-20Paper
Integer representations of convex polygon intersection graphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
2014-03-24Paper
Treewidth and pure Nash equilibria
Parameterized and Exact Computation
2013-12-10Paper
Integer representations of convex polygon intersection graphs
SIAM Journal on Discrete Mathematics
2013-06-27Paper
A theory of interactive computation
Interactive Computation
2013-06-18Paper
Structure of polynomial-time approximation
Theory of Computing Systems
2012-12-06Paper
Computer-assisted proof of performance ratios for the differencing method
Discrete Optimization
2012-07-12Paper
Computation as an unbounded process
Theoretical Computer Science
2012-05-30Paper
Name resolution by rewriting in dynamic networks of mobile entities
Lecture Notes in Computer Science
2011-05-27Paper
Convex Polygon Intersection Graphs
Graph Drawing
2011-02-11Paper
The complexity of interval routing on random graphs
Lecture Notes in Computer Science
2010-06-17Paper
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
Algorithm Theory – SWAT 2008
2008-07-15Paper
How We Think of Computing Today
Logic and Theory of Algorithms
2008-06-19Paper
Performance ratios of the Karmarkar-Karp differencing method
Journal of Combinatorial Optimization
2007-02-14Paper
scientific article; zbMATH DE number 2230249 (Why is no real title available?)2005-11-18Paper
Theory Is Forever
Lecture Notes in Computer Science
2005-01-18Paper
scientific article; zbMATH DE number 2080910 (Why is no real title available?)2004-08-04Paper
Approximations for  -Colorings of Graphs
The Computer Journal
2004-07-01Paper
scientific article; zbMATH DE number 2013816 (Why is no real title available?)2003-12-07Paper
Finding a -regular supergraph of minimum order
Discrete Applied Mathematics
2003-09-25Paper
scientific article; zbMATH DE number 1962846 (Why is no real title available?)2003-08-11Paper
scientific article; zbMATH DE number 1900795 (Why is no real title available?)2003-04-27Paper
scientific article; zbMATH DE number 1759398 (Why is no real title available?)2002-11-04Paper
scientific article; zbMATH DE number 1687054 (Why is no real title available?)2002-08-11Paper
scientific article; zbMATH DE number 1759503 (Why is no real title available?)2002-06-25Paper
scientific article; zbMATH DE number 1500531 (Why is no real title available?)2002-04-08Paper
The Complexity of Interval Routing on Random Graphs
The Computer Journal
1999-01-25Paper
On interval routing schemes and treewidth
Information and Computation
1998-06-15Paper
scientific article; zbMATH DE number 1142299 (Why is no real title available?)1998-05-04Paper
Prefix routing schemes in dynamic networks
Computer Networks and ISDN Systems
1994-09-05Paper
Maintenance of 2- and 3-edge-connected components of graphs. I
Discrete Mathematics
1993-10-24Paper
Uniform <i>d</i>‐emulations of rings, with an application to distributed virtual ring construction
Networks
1993-08-23Paper
Interval Heaps
The Computer Journal
1993-08-08Paper
scientific article; zbMATH DE number 218385 (Why is no real title available?)1993-06-29Paper
scientific article; zbMATH DE number 140491 (Why is no real title available?)1993-03-28Paper
On models for propositional dynamic logic
Theoretical Computer Science
1992-06-28Paper
scientific article; zbMATH DE number 4774 (Why is no real title available?)1992-06-25Paper
Computational complexity of norm-maximization
Combinatorica
1990-01-01Paper
scientific article; zbMATH DE number 4110079 (Why is no real title available?)1989-01-01Paper
Efficient elections in chordal ring networks
Algorithmica
1989-01-01Paper
scientific article; zbMATH DE number 4083002 (Why is no real title available?)1988-01-01Paper
On estimating the complexity of logarithmic decomposition
Information Processing Letters
1988-01-01Paper
Fast Simulation of Turing Machines by Random Access Machines
SIAM Journal on Computing
1988-01-01Paper
The derivation of graph marking algorithms from distributed termination detection protocols
Science of Computer Programming
1988-01-01Paper
scientific article; zbMATH DE number 4008432 (Why is no real title available?)1987-01-01Paper
scientific article; zbMATH DE number 4049013 (Why is no real title available?)1987-01-01Paper
scientific article; zbMATH DE number 4092762 (Why is no real title available?)1987-01-01Paper
scientific article; zbMATH DE number 3990849 (Why is no real title available?)1987-01-01Paper
Interval Routing
The Computer Journal
1987-01-01Paper
Diameter increase caused by edge deletion
Journal of Graph Theory
1987-01-01Paper
Array processing machines: an abstract model
BIT
1987-01-01Paper
On Linear Skewing Schemes and d-Ordered Vectors
IEEE Transactions on Computers
1987-01-01Paper
scientific article; zbMATH DE number 3978376 (Why is no real title available?)1986-01-01Paper
scientific article; zbMATH DE number 3940741 (Why is no real title available?)1986-01-01Paper
Simulation of large networks on smaller networks
Information and Control
1986-01-01Paper
scientific article; zbMATH DE number 3903985 (Why is no real title available?)1985-01-01Paper
scientific article; zbMATH DE number 3917713 (Why is no real title available?)1985-01-01Paper
The Structure of Periodic Storage Schemes for Parallel Memories
IEEE Transactions on Computers
1985-01-01Paper
scientific article; zbMATH DE number 3878851 (Why is no real title available?)1984-01-01Paper
scientific article; zbMATH DE number 3918378 (Why is no real title available?)1984-01-01Paper
Worst-case Analysis of Set Union Algorithms
Journal of the ACM
1984-01-01Paper
Arbitrary versus periodic storage schemes and tessellations of the plane using one type of polyomino
Information and Control
1984-01-01Paper
Systolische Berechnungen und VLSI
Informatik Spektrum
1984-01-01Paper
scientific article; zbMATH DE number 3839293 (Why is no real title available?)1983-01-01Paper
scientific article; zbMATH DE number 3800919 (Why is no real title available?)1983-01-01Paper
scientific article; zbMATH DE number 3819095 (Why is no real title available?)1983-01-01Paper
scientific article; zbMATH DE number 3858389 (Why is no real title available?)1983-01-01Paper
Stratified balanced search trees
Acta Informatica
1983-01-01Paper
scientific article; zbMATH DE number 3882232 (Why is no real title available?)1982-01-01Paper
scientific article; zbMATH DE number 3776845 (Why is no real title available?)1982-01-01Paper
Dynamic multi-dimensional data structures based on quad- and k-d trees
Acta Informatica
1982-01-01Paper
Efficient recognition of rational relations
Information Processing Letters
1982-01-01Paper
scientific article; zbMATH DE number 3716801 (Why is no real title available?)1981-01-01Paper
scientific article; zbMATH DE number 3722116 (Why is no real title available?)1981-01-01Paper
Maintenance of configurations in the plane
Journal of Computer and System Sciences
1981-01-01Paper
Worst-case optimal insertion and deletion methods for decomposable searching problems
Information Processing Letters
1981-01-01Paper
The measure problem for rectangular ranges in d-space
Journal of Algorithms
1981-01-01Paper
Two general methods for dynamizing decomposable searching problems
Computing
1981-01-01Paper
The complexity of basic complex operations
Computing
1981-01-01Paper
Some principles for dynamizing decomposable searching problems
Information Processing Letters
1981-01-01Paper
scientific article; zbMATH DE number 3832024 (Why is no real title available?)1980-01-01Paper
Stack Machines and Classes of Nonnested Macro Languages
Journal of the ACM
1980-01-01Paper
Further comments on Bykat's convex hull algorithm
Information Processing Letters
1980-01-01Paper
Über Programmeffizienz und algebraische Komplexitaet
Informatik Spektrum
1980-01-01Paper
scientific article; zbMATH DE number 3614810 (Why is no real title available?)1979-01-01Paper
On the complexity of decision trees, the quasi-optimizer, and the power of heuristic rules
Information and Control
1979-01-01Paper
On compromising statistical data-bases with a few known elements
Information Processing Letters
1979-01-01Paper
A useful lemma for context-free programmed grammars
Acta Informatica
1979-01-01Paper
scientific article; zbMATH DE number 3586487 (Why is no real title available?)1978-01-01Paper
Effective constructions in well-partially-ordered free monoids
Discrete Mathematics
1978-01-01Paper
Deciding Associativity for Partial Multiplication Tables of Order 3
Mathematics of Computation
1978-01-01Paper
Some elementary proofs of lower bounds in complexity theory
Linear Algebra and its Applications
1978-01-01Paper
scientific article; zbMATH DE number 3553767 (Why is no real title available?)1977-01-01Paper
An extension of Hansen's theorem for star chains.
Journal für die reine und angewandte Mathematik (Crelles Journal)
1977-01-01Paper
An extension of Hansen's theorem for star chains.
Journal für die reine und angewandte Mathematik (Crelles Journal)
1977-01-01Paper
scientific article; zbMATH DE number 3558968 (Why is no real title available?)1976-01-01Paper
scientific article; zbMATH DE number 3569830 (Why is no real title available?)1976-01-01Paper
A decomposition theorem for hyper-algebraic extensions of language families
Theoretical Computer Science
1976-01-01Paper
The halting problem for linear Turing assemblers
Journal of Computer and System Sciences
1976-01-01Paper
The complexity of vector-products
Information Processing Letters
1976-01-01Paper
On efficiently computing the product of two binary relations
International Journal of Computer Mathematics
1976-01-01Paper
scientific article; zbMATH DE number 3507952 (Why is no real title available?)1975-01-01Paper
On the fixpoints of monogenic functions in free monoids
Semigroup Forum
1975-01-01Paper
The membership question for ETOL-languages is polynomially complete
Information Processing Letters
1975-01-01Paper
The tape-complexity of context-independent developmental languages
Journal of Computer and System Sciences
1975-01-01Paper
scientific article; zbMATH DE number 3459894 (Why is no real title available?)1974-01-01Paper
scientific article; zbMATH DE number 3564361 (Why is no real title available?)1974-01-01Paper
scientific article; zbMATH DE number 3466545 (Why is no real title available?)1974-01-01Paper


Research outcomes over time


This page was built for person: J. Van Leeuwen