%0 Journal Article %1 Bader2011Memory-efficientSierpinski-orderTraversals %A Bader, M. %A Rahnema, K. %A Vigh, C. %D 2011 %I Springer Link %J Para 2010 - State of the Art in Scientific and Parallel Computing %K EXC310 %P 302--312 %R 10.1007/978-3-642-28145-7_30 %T Memory-efficient Sierpinski-order traversals on dynamically adaptive, recursivly structured triangular grids %U https://link.springer.com/chapter/10.1007%2F978-3-642-28145-7_30 %V 0

@article{Bader2011Memory-efficientSierpinski-orderTraversals, added-at = {2021-12-08T17:10:53.000+0100}, author = {Bader, M. and Rahnema, K. and Vigh, C.}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2b2daaeed5ca64520ae1672f598d23472/simtech}, doi = {10.1007/978-3-642-28145-7_30}, interhash = {b5abe87b8b1c08027c3c52fcf5e07003}, intrahash = {b2daaeed5ca64520ae1672f598d23472}, journal = {Para 2010 - State of the Art in Scientific and Parallel Computing}, keywords = {EXC310}, pages = {302--312}, publisher = {Springer Link}, timestamp = {2023-07-31T05:40:30.000+0200}, title = {Memory-efficient Sierpinski-order traversals on dynamically adaptive, recursivly structured triangular grids}, url = {https://link.springer.com/chapter/10.1007%2F978-3-642-28145-7_30}, volume = 0, year = 2011 }