Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Svante Carlsson - MaRDI portal

Svante Carlsson

From MaRDI portal
(Redirected from Person:1293869)
Person:671416

Available identifiers

zbMath Open carlsson.svanteWikidataQ102111030 ScholiaQ102111030MaRDI QIDQ671416

List of research outcomes





PublicationDate of PublicationType
Searching rigid data structures2023-12-12Paper
Linear-time in-place selection in less than 3n comparisons2023-03-21Paper
Heap construction: Optimal in both worst and average cases?2023-03-21Paper
Computing a shortest watchman path in a simple polygon in polynomial-time2022-12-16Paper
In-place linear probing sort2022-08-18Paper
https://portal.mardi4nfdi.de/entity/Q30247602005-07-04Paper
ONLINE ROUTING IN CONVEX SUBDIVISIONS2004-09-29Paper
https://portal.mardi4nfdi.de/entity/Q44724792004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q27683432002-01-30Paper
https://portal.mardi4nfdi.de/entity/Q45257122001-01-24Paper
Finding the shortest watchman route in a simple polygon1999-11-23Paper
Computing vision points in polygons1999-06-29Paper
Heaps with bits1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q47634251995-04-11Paper
https://portal.mardi4nfdi.de/entity/Q31389401993-10-20Paper
OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS1993-08-22Paper
Sublinear merging and natural mergesort1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40356791993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40374331993-05-18Paper
A general approach to dominance in the plane1992-06-28Paper
An optimal parallel adaptive sorting algorithm1992-06-27Paper
On partitions and presortedness of sequences1992-01-01Paper
An optimal algorithm for deleting the root of a heap1991-01-01Paper
A note on the construction of the data structure ``deap1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37967321988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37967661988-01-01Paper
Average-case results on heapsort1987-01-01Paper
A variant of heapsort with almost optimal number of comparisons1987-01-01Paper
Improving worst-case behavior of heaps1984-01-01Paper

Research outcomes over time

This page was built for person: Svante Carlsson