Notice: Unexpected clearActionName after getActionName already called in /var/www/html/includes/context/RequestContext.php on line 338
Torben Hagerup - MaRDI portal

Torben Hagerup

From MaRDI portal
(Redirected from Person:1175942)
Person:415280

Available identifiers

zbMath Open hagerup.torbenDBLPh/TorbenHagerupWikidataQ102424249 ScholiaQ102424249MaRDI QIDQ415280

List of research outcomes

PublicationDate of PublicationType
Prefix graphs and their applications2024-01-05Paper
Self-simulation for the Passive Optical Star model2023-05-08Paper
More efficient parallel flow algorithms2023-03-21Paper
Fast and optimal simulations between CRCW PRAMs2022-08-18Paper
The log-star revolution2022-08-18Paper
A perfect parallel dictionary2022-08-18Paper
Merging and sorting strings in parallel2022-08-18Paper
https://portal.mardi4nfdi.de/entity/Q50924272022-07-21Paper
On-the-Fly Array Initialization in Less Space2020-11-25Paper
Space-efficient DFS and applications to connectivity problems: simpler, leaner, faster2020-02-28Paper
Fast breadth-first search in still less space2020-02-24Paper
Highly succinct dynamic data structures2020-01-30Paper
Rank-select indices without tears2020-01-16Paper
Fast integer merging on the EREW PRAM2019-12-04Paper
Maintaining discrete probability distributions optimally2019-03-29Paper
Parallel algorithms with optimal speedup for bounded treewidth2019-01-10Paper
Space-efficient Euler partition and bipartite edge coloring2018-12-04Paper
Dynamic algorithms for graphs of bounded treewidth2018-07-04Paper
Space-Efficient Euler Partition and Bipartite Edge Coloring2017-07-21Paper
Space-efficient Basic Graph Algorithms2017-01-24Paper
Optimal parallel string algorithms2016-09-01Paper
Easy Multiple-Precision Divisors and Word-RAM Constants2015-09-16Paper
Trimming of Graphs, with Application to Point Labeling2013-03-19Paper
Kernels for Edge Dominating Set: Simpler or Smaller2012-09-25Paper
Simpler Linear-Time Kernelization for Planar Dominating Set2012-06-15Paper
A strengthened analysis of an algorithm for dominating set in planar graphs2012-05-11Paper
Finding the maximum suffix with fewer comparisons2011-08-23Paper
Trimming of graphs, with application to point labeling2010-10-06Paper
Finding the Maximum Suffix with Fewer Comparisons2010-05-28Paper
An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees2010-01-21Paper
A Pictorial Description of Cole’s Parallel Merge Sort2009-11-12Paper
Online and Offline Access to Short Lists2008-09-17Paper
A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs2008-07-01Paper
STACS 20042007-10-01Paper
Simpler computation of single-source shortest paths in linear average time2006-10-25Paper
Fast parallel space allocation, estimation, and integer sorting2006-10-10Paper
https://portal.mardi4nfdi.de/entity/Q30464712004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q44113442003-07-08Paper
https://portal.mardi4nfdi.de/entity/Q47961702003-03-02Paper
Parallel preprocessing for path queries without concurrent reading.2003-01-14Paper
Deterministic Dictionaries2002-08-01Paper
Routing flow through a strongly connected graph2002-05-21Paper
https://portal.mardi4nfdi.de/entity/Q42284372002-01-17Paper
https://portal.mardi4nfdi.de/entity/Q27625142002-01-09Paper
https://portal.mardi4nfdi.de/entity/Q27541342001-12-09Paper
Dynamic algorithms for graphs of bounded treewidth2001-04-24Paper
https://portal.mardi4nfdi.de/entity/Q43220732000-07-06Paper
Self-Simulation for the Passive Optical Star2000-03-16Paper
https://portal.mardi4nfdi.de/entity/Q42523151999-06-17Paper
Characterizing multiterminal flow networks and computing flows in networks of small treewidth1999-02-21Paper
More general parallel tree contraction: Register allocation and broadcasting in a tree1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q42181471998-11-11Paper
Parallel Algorithms with Optimal Speedup for Bounded Treewidth1998-09-21Paper
A Reliable Randomized Algorithm for the Closest-Pair Problem1997-11-25Paper
Improved parallel integer sorting without concurrent writing1997-11-10Paper
An $o(n^3 )$-Time Maximum-Flow Algorithm1997-06-09Paper
The parallel complexity of integer prefix summation1997-02-27Paper
Fast integer merging on the EREW PRAM1997-01-22Paper
https://portal.mardi4nfdi.de/entity/Q48861001996-08-22Paper
Fast Deterministic Processor Allocation1995-07-03Paper
A Randomized Maximum-Flow Algorithm1995-05-30Paper
https://portal.mardi4nfdi.de/entity/Q47634341995-04-11Paper
Drawing Graphs in the Plane with High Resolution1994-10-10Paper
https://portal.mardi4nfdi.de/entity/Q42842481994-03-24Paper
https://portal.mardi4nfdi.de/entity/Q31403951993-12-15Paper
https://portal.mardi4nfdi.de/entity/Q40365811993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40386951993-05-18Paper
On a compaction theorem of Ragde1992-12-06Paper
https://portal.mardi4nfdi.de/entity/Q39748571992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39751421992-06-26Paper
Improved deterministic parallel integer sorting1992-06-25Paper
Optimal parallel algorithms on planar graphs1990-01-01Paper
A guided tour of Chernoff bounds1990-01-01Paper
Improved nonconservative sequential and parallel integer sorting1990-01-01Paper
Planar Depth-First Search in $O(\log n)$ Parallel Time1990-01-01Paper
Optimal merging and sorting on the EREW PRAM1989-01-01Paper
Hybridsort revisited and parallelized1989-01-01Paper
Optimal Parallel 5-Colouring of Planar Graphs1989-01-01Paper
On saving space in parallel computation1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37952451988-01-01Paper
Towards optimal parallel bucket sorting1987-01-01Paper
Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37835971987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37273961986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47274341986-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Torben Hagerup