The unpredictable deviousness of models

DOI10.1016/j.tcs.2008.08.019zbMath1157.68029OpenAlexW2062482828MaRDI QIDQ959796

Franco P. Preparata

Publication date: 12 December 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.08.019

zbMATH Keywords

parallel computingcomputational geometrysequencing by hybridizationcomputation modelsalgorithmic research

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (1)

A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Sorting in \(c \log n\) parallel steps
• Horizons of parallel computation
• On the computational power of pushdown automata
• Algorithms for Reporting and Counting Geometric Intersections
• Fast Parallel Matrix Inversion Algorithms
• Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
• Robust Plane Sweep for Intersecting Segments
• The role of arithmetic in fast parallel matrix inversion

This page was built for publication: The unpredictable deviousness of models