Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
A LOWER BOUND FOR RANDOMIZED ALGEBRAIC DECISION TREESGrigoriev, Dima ; Karpinski, Marek ; Meyer auf Der Heide, Friedhelm ; Smolensky, RomanComputational complexity, 1997 [Periódico revisado por pares]Springer VerlagTexto completo disponível |
2 |
Material Type: Artigo
|
![]() |
A lower time bound for the Knapsack problem on random access machinesKLEIN, P ; AUF DER HEIDE, F. MActa informatica, 1983-09, Vol.19 (4), p.385-395 [Periódico revisado por pares]Berlin: SpringerTexto completo disponível |
3 |
Material Type: Artigo
|
![]() |
Allocating Weighted Jobs in ParallelBerenbrink, P. ; Heide, F. Meyer auf der ; Schröder, K.Theory of computing systems, 1999-06, Vol.32 (3), p.281-300 [Periódico revisado por pares]Texto completo disponível |
4 |
Material Type: Ata de Congresso
|
![]() |
Communication-efficient parallel multiway and approximate minimum cut computationAUF DER HEIDE, F. M ; MARTINEZ, G. TLecture notes in computer science, 1998, p.316-330 [Periódico revisado por pares]New York NY: Springer-VerlagTexto completo disponível |
5 |
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 |
6 |
Material Type: Artigo
|
![]() |
Contention resolution in hashing based shared memory simulationsCZUMAJ, Artur ; AUF DER HEIDE, Friedhelm Meyer ; STEMANN, VolkerSIAM journal on computing, 2000-01, Vol.29 (5), p.1703-1739 [Periódico revisado por pares]Philadelphia, PA: Society for Industrial and Applied MathematicsTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
Data Management in Networks: Experimental Evaluation of a Provably Good StrategyKrick, C ; Meyer auf der Heide, F ; Raecke, H ; Voecking, B ; Westermann, MTheory of computing systems, 2002, Vol.35 (2), p.217-245 [Periódico revisado por pares]New York: Springer Nature B.VTexto completo disponível |
8 |
Material Type: Ata de Congresso
|
![]() |
Deterministic routing with bounded buffers: turning offline into online protocolsMeyer auf der Heide, F. ; Scheideler, C.Proceedings of 37th Conference on Foundations of Computer Science, 1996, p.370-379IEEETexto completo disponível |
9 |
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 |
10 |
Material Type: Artigo
|
![]() |
Efficiency of universal parallel computersMEYER AUF DER HEIDE, FActa informatica, 1983-07, Vol.19 (3), p.269-296 [Periódico revisado por pares]Berlin: SpringerTexto completo disponível |