Zur Hauptnavigation
Zum Inhaltsbereich
Zur Suche
Zum Seitenfuß
Theoretical Foundations of Computer Science
TGI
People
Education
Research
Publications
Misc
Petri Nets World
TGI
Homepage
Announcements
People
Staff
Students
Education
Education (German only)
Thesis (German only)
Research
Publications
Service
Service
Tools
Petri Nets World
UHH
>
MIN
>
Informatics
>
TGI
Bibliography
Jan Henrik Röwekamp
2019
Jan Henrik Röwekamp, Matthias Feldmann,
Daniel Moldt
, and Michael Simon.
Simulating Place / Transition Nets by a distributed, web based, stateless service.
In Moldt et al. (eds.),
Petri Nets and Software Engineering. International Workshop, PNSE'19, Aachen, Germany, June 24, 2019. Proceedings
, pages 163-164.
2018
Daniel Moldt
,
Dennis Schmitz
,
Michael Haustermann
, Matthias Feldmann,
David Mosteller
,
Thomas Wagner
, Jan Henrik Röwekamp,
Lawrence Cabac
, and Michael Simon.
Some ideas for modeling a generic IoT- and Edge-Computing architecture
.
In Lorenz and Metzger (eds.),
Algorithms and Tools for Petri Nets, Proceedings of the 21th Workshop AWPN 2018, Augsburg, Germany
, pages 33-40.
Jan Henrik Röwekamp,
Daniel Moldt
, and Matthias Feldmann.
Investigation of containerizing distributed Petri net simulations
.
In Moldt et al. (eds.),
Petri Nets and Software Engineering. International Workshop, PNSE'18, Bratislava, Slovakia, June 25-26, 2018. Proceedings
, pages 133-142.
2017
Daniel Moldt
, Jan Henrik Röwekamp, and Michael Simon.
A simple prototype of distributed execution of reference nets based on virtual machines
.
In Bergenthum and Kindler (eds.),
Algorithms and Tools for Petri Nets Proceedings of the Workshop AWPN 2017, Kgs. Lyngby, Denmark October 19-20, 2017
, pages 51-57.
2015
Jan Henrik Röwekamp and
Michael Haustermann
.
Applying Petri nets to approximation of the Euclidean distance with the example of SIFT
.
In Moldt et al. (eds.),
Petri Nets and Software Engineering. International Workshop, PNSE'15, Brussels, Belgium, June 22-23, 2015. Proceedings
, pages 323-324.
2013
Jan Henrik Röwekamp.
Komplexitätstheoretische Betrachtungen an einer probabilistischen Abwandlung der Nearest Neighbour-Suche in kd-Trees
.
Masterarbeit, Universität Hamburg, Fachbereich Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, December 2013.
2011
Jan Henrik Röwekamp.
Algorithmische Betrachtung von Switching Graphs
.
Bachelorarbeit, Universität Hamburg, Fachbereich Informatik, Vogt-Kölln Str. 30, D-22527 Hamburg, May 2011.
Imprint/Disclaimer
Last Change: 15:16 06/05/2024