( en | de | ru )

 

Disambiguation of "Hambrusch, Susanne E."

Author of the publication

copydeleteadd this publication to your clipboard
Lower Bounds for Solving Undirected Graph Problems on VLSI.

, and . ICALP, volume 154 of Lecture Notes in Computer Science, page 292-303. Springer, (1983)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Susanne E Rieser

Susanne E Taylor

Ursula E E Köhler

E Gutsche

E Przemeck

 

Other publications of authors with the same name

Query Processing in Broadcasted Spatial Index Trees., , , and . SSTD, volume 2121 of Lecture Notes in Computer Science, page 502-521. Springer, (2001)Introducing computational thinking in education courses., , , , and . SIGCSE, page 465-470. ACM, (2011)Main Memory Evaluation of Monitoring Queries Over Moving Objects., , and . Distributed Parallel Databases, 15 (2): 117-135 (2004)OLAP for Trajectories., , , and . DEXA, volume 5181 of Lecture Notes in Computer Science, page 340-347. Springer, (2008)Parallel scalable libraries and algorithms for computer vision., , , , , , , and . ICPR (3), page 223-228. IEEE, (1994)New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction., and . Algorithmica, 17 (4): 426-448 (1997)A framework for 1-D compaction with forbidden region avoidance VLSI layout., and . Great Lakes Symposium on VLSI, page 146-151. IEEE, (1991)Data Replication for External Searching in Static Tree Structures., and . CIKM, page 360-367. ACM, (2000)New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction., and . ISAAC, volume 762 of Lecture Notes in Computer Science, page 446-455. Springer, (1993)Lower Bounds for Solving Undirected Graph Problems on VLSI., and . ICALP, volume 154 of Lecture Notes in Computer Science, page 292-303. Springer, (1983)