7 Publications

Mark all

[7]
2021 | Thesis | IST-REx-ID: 9056 | OA
Multi-cover persistence and Delaunay mosaics
G.F. Osang, Multi-Cover Persistence and Delaunay Mosaics, IST Austria, 2021.
View | Files available | DOI
 
[6]
2021 | Journal Article | IST-REx-ID: 9317 | OA
The multi-cover persistence of Euclidean balls
H. Edelsbrunner, G.F. Osang, Discrete and Computational Geometry (2021).
View | Files available | DOI | Download Published Version (ext.)
 
[5]
2020 | Conference Paper | IST-REx-ID: 8703 | OA
Generalizing CGAL periodic Delaunay triangulations
G.F. Osang, M. Rouxel-Labbé, M. Teillaud, in:, 28th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
View | Files available | DOI
 
[4]
2019 | Conference Paper | IST-REx-ID: 7216
LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale
G.F. Osang, J. Cook, A. Fabrikant, M. Gruteser, in:, 2019 IEEE Intelligent Transportation Systems Conference, IEEE, 2019.
View | DOI
 
[3]
2018 | Conference Paper | IST-REx-ID: 193 | OA
On the memory hardness of data independent password hashing functions
J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.
View | DOI | Download Submitted Version (ext.)
 
[2]
2018 | Conference Paper | IST-REx-ID: 187 | OA
The multi-cover persistence of Euclidean balls
H. Edelsbrunner, G.F. Osang, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
View | Files available | DOI
 
[1]
2017 | Journal Article | IST-REx-ID: 1065 | OA
Pushdown reachability with constant treewidth
K. Chatterjee, G.F. Osang, Information Processing Letters 122 (2017) 25–29.
View | Files available | DOI
 

Search

Filter Publications

7 Publications

Mark all

[7]
2021 | Thesis | IST-REx-ID: 9056 | OA
Multi-cover persistence and Delaunay mosaics
G.F. Osang, Multi-Cover Persistence and Delaunay Mosaics, IST Austria, 2021.
View | Files available | DOI
 
[6]
2021 | Journal Article | IST-REx-ID: 9317 | OA
The multi-cover persistence of Euclidean balls
H. Edelsbrunner, G.F. Osang, Discrete and Computational Geometry (2021).
View | Files available | DOI | Download Published Version (ext.)
 
[5]
2020 | Conference Paper | IST-REx-ID: 8703 | OA
Generalizing CGAL periodic Delaunay triangulations
G.F. Osang, M. Rouxel-Labbé, M. Teillaud, in:, 28th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
View | Files available | DOI
 
[4]
2019 | Conference Paper | IST-REx-ID: 7216
LiveTraVeL: Real-time matching of transit vehicle trajectories to transit routes at scale
G.F. Osang, J. Cook, A. Fabrikant, M. Gruteser, in:, 2019 IEEE Intelligent Transportation Systems Conference, IEEE, 2019.
View | DOI
 
[3]
2018 | Conference Paper | IST-REx-ID: 193 | OA
On the memory hardness of data independent password hashing functions
J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.
View | DOI | Download Submitted Version (ext.)
 
[2]
2018 | Conference Paper | IST-REx-ID: 187 | OA
The multi-cover persistence of Euclidean balls
H. Edelsbrunner, G.F. Osang, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
View | Files available | DOI
 
[1]
2017 | Journal Article | IST-REx-ID: 1065 | OA
Pushdown reachability with constant treewidth
K. Chatterjee, G.F. Osang, Information Processing Letters 122 (2017) 25–29.
View | Files available | DOI
 

Search

Filter Publications