Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Finding Coarse Grained Parallelism in Computational Geometry Algorithms

From MaRDI portal
Publication:3082969
Jump to:navigation, search

DOI10.1007/3-540-44842-X_93zbMath1327.68308OpenAlexW1500513954MaRDI QIDQ3082969

Volodymyr Beletskyy

Publication date: 18 March 2011

Published in: Computational Science and Its Applications — ICCSA 2003 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-44842-x_93



Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)








This page was built for publication: Finding Coarse Grained Parallelism in Computational Geometry Algorithms

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3082969&oldid=16151890"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 21:48.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki