( en | de | ru )

 

Disambiguation of "van Leeuwen, Jan"

Author of the publication

copydeleteadd this publication to your clipboard
The complexity of complex division (extended abstract).

, and . FCT, page 13-17. Akademie-Verlag, Berlin, (1979)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Imalina Leeuwen

Peter Leeuwen

Jan van Neerven

Jan van Weeren

Sara Leeuwen

 

Other publications of authors with the same name

Structure of Polynomial-Time Approximation., and . Theory Comput. Syst., 50 (4): 641-674 (2012)Convex Polygon Intersection Graphs., and . GD, volume 6502 of Lecture Notes in Computer Science, page 377-388. Springer, (2010)Shortcutting directed and undirected networks with a degree constraint., , and . Discret. Appl. Math., (2017)Integer representations of convex polygon intersection graphs., , and . SCG, page 300-307. ACM, (2011)Non-classical Turing machines: extending the notion of computation., and . NCMA, page 29-40. Österreichische Computer Gesellschaft, (2017)Maintenance of Transitive Closures and Transitive Reductions of Graphs., and . WG, volume 314 of Lecture Notes in Computer Science, page 106-120. Springer, (1987)Microprogrammed random access stored program machines., and . SIGACT News, 6 (3): 23-32 (1974)Maintenance of Transitive Closures and Transitive Reductions of Graphs, and . WG '87: Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science, page 106--120. London, UK, Springer-Verlag, (1988)On Floridi's Method of Levels of Abstraction.. Minds and Machines, 24 (1): 5-17 (2014)The Complexity of Interval Routing on Random Graphs., , and . MFCS, volume 969 of Lecture Notes in Computer Science, page 37-49. Springer, (1995)