Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Ata de Congresso
|
Static and dynamic data management in networksMeyer auf der Heide, Friedhelm ; Vöcking, BertholdEuro-Par'97 Parallel Processing, 2005, p.46-56 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
2 |
Material Type: Artigo
|
Dynamic perfect hashing: upper and lower boundsDIETZFELBINGER, M ; KARLIN, A ; MEHLHORN, K ; MEYER AUF DER HEIDE, F ; ROHNERT, H ; TARJAN, R. ESIAM journal on computing, 1994-08, Vol.23 (4), p.738-761 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
|
3 |
Material Type: Ata de Congresso
|
Dynamic data structures for realtime management of large geometric scenesFISCHER, M ; MEYER AUF DER HEIDE, F ; STROTHMANN, W.-BLecture notes in computer science, 1997, p.157-170 [Periódico revisado por pares]New York NY: Springer-VerlagTexto completo disponível |
|
4 |
Material Type: Ata de Congresso
|
Provably Good and Practical Strategies for Non-uniform Data Management in Networksauf der Heide, Friedhelm Meyer ; Vöcking, Berthold ; Westermann, MatthiasAlgorithms - ESA’ 99, 1999, p.89-100 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
5 |
Material Type: Artigo
|
Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP modelBäumker, Armin ; Dittrich, Wolfgang ; der Heide, Friedhelm Meyer aufTheoretical computer science, 1998-08, Vol.203 (2), p.175-203 [Periódico revisado por pares]Amsterdam: Elsevier B.VTexto completo disponível |
|
6 |
Material Type: Artigo
|
A time-space tradeoff for element distinctnessBORODIN, A ; FICH, F ; MEYER AUF DER HEIDE, F ; UPFAL, E ; WIGDERSON, ASIAM journal on computing, 1987-02, Vol.16 (1), p.97-99 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
|
7 |
Material Type: Artigo
|
Shortest-Path Routing in Arbitrary Networksauf der Heide, Friedhelm Meyer ; Vöcking, BertholdJournal of algorithms, 1999-04, Vol.31 (1), p.105-131 [Periódico revisado por pares]San Diego, CA: Elsevier IncTexto completo disponível |
|
8 |
Material Type: Ata de Congresso
|
Communication efficient parallel searchingBäumker, Armin ; auf der Heide, Friedhelm MeyerLecture notes in computer science, 1997, p.233-254 [Periódico revisado por pares]Berlin, Heidelberg: Springer Berlin HeidelbergTexto completo disponível |
|
9 |
Material Type: Artigo
|
Routing on networks of optical crossbars: Parallel computingMEYER AUF DER HEIDE, F ; SCHRÖDER, K ; SCHWARZE, FTheoretical computer science, 1998, Vol.196 (1-2), p.181-200 [Periódico revisado por pares]Amsterdam: ElsevierTexto completo disponível |
|
10 |
Material Type: Artigo
|
The tree model for hashing : Lower and upper boundsGIL, J ; MEYER AUF DER HEIDE, F ; WIGDERSON, ASIAM journal on computing, 1996-10, Vol.25 (5), p.936-955 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |