Old Web
English
Sign In
Acemap
>
authorDetail
>
WillhalmThomas
WillhalmThomas
Computer science
Shortest path problem
Dijkstra's algorithm
Computation
Algorithm
7
Papers
0
Citations
0
KQI
Citation Trend
Filter By
Interval:
1900~2024
1900
2024
Author
Papers (6)
Sort By
Default
Most Recent
Most Early
Most Citation
No data
Journal
Conference
Others
Evaluating persistent memory range indexes
2019
VLDB | Very Large Data Bases
LerschLucas
HaoXiangpeng
OukidIsmail
WangTianzheng
WillhalmThomas
Show All
Source
Cite
Save
Citations (0)
Memory management techniques for large-scale persistent-main-memory systems
2017
VLDB | Very Large Data Bases
OukidIsmail
BoossDaniel
LespinasseAdrien
LehnerWolfgang
WillhalmThomas
GomesGrégoire
Show All
Source
Cite
Save
Citations (0)
SAP HANA adoption of non-volatile memory
2017
VLDB | Very Large Data Bases
AndreiMihnea
LemkeChristian
RadestockGünter
SchulzeRobert
ThielCarsten
BlancoRolando
MeghlanAkanksha
ShariqueMuhammad
SeifertSebastian
VishnoiSurendra
BoossDaniel
PehThomas
SchreterIvan
ThesingWerner
WagleMehul
WillhalmThomas
Show All
Source
Cite
Save
Citations (0)
Partitioning graphs to speedup Dijkstra's algorithm
2007
H MöhringRolf
SchillingHeiko
SchützBirk
WagnerDorothea
WillhalmThomas
Show All
Source
Cite
Save
Citations (0)
Geometric containers for efficient shortest-path computation
2005
WagnerDorothea
WillhalmThomas
ZaroliagisChristos
Show All
Source
Cite
Save
Citations (0)
Combining speed-up techniques for shortest-path computations
2005
HolzerMartin
SchulzFrank
WagnerDorothea
WillhalmThomas
Show All
Source
Cite
Save
Citations (0)
1