Susanne E. Hambrusch

Susanne E. Hambrusch, Christoph Hoffmann, John T. Korb, Towards Computational Thinking in Science, Transform Science: Computational Education for Scientists, Microsoft Research, editor: Yan Xu, pp 88-91, 2009.
Susanne E. Hambrusch, Christoph Hoffmann, John T. Korb, Mark Haugan, and Anthony Hosking, A Multidisciplinary Approach Towards Computational Thinking for Science Majors, 39th ACM Technical Symposium on Computer Science Education (SIGSCE'09), I 5 pages, March 2009.
S. Horwitz, S. Rogers, M. Biggers, D. Binkley, S. Hambrusch, E. Munson, and B. Ryder, Using Peer-Led Team Learning to Increase Participation and Success of Under-represented Groups in Introductory Computer Science, 39th ACM Technical Symposium on Computer Science Education (SIGSCE'09), 5 pages, March 2009.
Sarvjeet Singh, Chris Mayfield, Sunil Prabhakar, Rahul Shah, Susanne E. Hambrusch. Orion 2.0: Native Support for Uncertain Data, Demo paper, ACM SIGMOD, 2008.
Sarvjeet Singh, Chris Mayfield, Sunil Prabhakar, Rahul Shah, Susanne E. Hambrusch, Jennifer Neville, and Reynold. Cheng, Database Support for Probabilistic Attributes and Tuples, 24th International Conference on Data Engineering (ICDE), April 2008.
Sarvjeet Singh, Chris Mayfield, Sunil Prabhakar, Rahul Shah, Susanne E. Hambrusch. Indexing Uncertain Categorical Data, 23rd IEEE International Conference on Data Engineering (ICDE 2007), April 2007. [PDF]
Susanne E. Hambrusch, Chuan-Ming Liu, Walid Aref, Sunil Prabhakar. Efficient query execution on broadcasted index tree structures, Data Knowledge Engineering, May 2006.
Susanne E. Hambrusch, Chuan-Ming Liu, Sunil Prabhakar. Broadcasting and Querying Multi-dimensional Index Trees in a Multi-channel environment, Information Systems, Vol. 31, pp 870-886, 2006.
Mourad Ouzzani, Walid G. Aref, Elisa Bertino, Ann Christine Catlin, Christopher W. Clifton, Wing-Kai Hon, Ahmed K. Elmagarmid, Arif Ghafoor, Susanne E. Hambrusch, Sunil Prabhakar, Jeffrey Vitter, Xiang Zhang. The Indiana Center for Database Systems at Purdue University), SIGMOD Record, Vol. 34, Nr., pp 53-58, 2005.
Dmitri V. Kalashnikov, Sunil Prabhakar, Susanne E. Hambrusch. Main Memory Evaluation of Monitoring Queries Over Moving Objects, Distributed and Parallel Databases: An International Journal, Vol. 15, No. 2, pp 117-136, 2004. [PDF]
Mohamed F. Mokbel, Xiaopeng Xiong, Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar. PLACE: A Query Processor for Handling Real-time Spatio-temporal Data Streams, 13th International Conference on Very Large Data Bases (VLDB), pp 1377-1380, 2004. [PDF]
Xiaopeng Xiong, Mohamed F. Mokbel, Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar. Scalable Spatio-temporal Continuous Query Processing for Location-aware Services, 16th International Conference on Scientific and Statistical Database Management (SSDBM) Conference), June 2004. [PDF]
Mohamed F. Mokbel, Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar. Towards Scalable Location-aware Services: Requirements and Research Issues, ACM Symposium on Geographic Information Systems (ACM GIS), pp 110-117, November 2003. [PDF]
Ashfaq A. Khokhar, Susanne E. Hambrusch, Erturk D. Kocalar. Termination Detection in Data-Driven Parallel Computations/Applications, Journal of Parallel and Distributed Computing, 63(3), pp 312-326, 2003. [PDF]
Susanne E. Hambrusch, Chuan-Ming Liu. Data Replication for Static Tree Structures, Information Processing Letters, vol. 86/4, pp 197-202, 2003.
Dmitri V. Kalashnikov, Sunil Prabhakar, Susanne E. Hambrusch, Walid G. Aref. Efficient Evaluation of Continuous Range Queries on Moving Objects, 13th International Conference on Database and Expert Systems Applications (DEXA 2002), pp 731-740, September 2002. [PDF]
Dongyan Xu, Mohamed Hefeeda, Susanne E. Hambrusch, Bharat K. Bhargava. On Peerto- Peer Media Streaming, 22nd International Conference on Distributed Computing Systems (ICDCS 2002), pp 363-371, July 2002. [PDF]
Sunil Prabhakar, Yuni Xia, Dmitri V. Kalashnikov, Walid G. Aref, Susanne E. Hambrusch. Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects, IEEE Transaction on Computers, Vol. 51, Nr. 10, pp 1124- 1140, 2002. [PDF]
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin. Parallelizing The Data Cube, Distributed and Parallel Databases, Special Issue on Parallel and Distributed Data Mining, Vol. 11, Nr. 2, pp 181-203, 2002. [PDF]
Susanne E. Hambrusch, Chuan-Ming Liu, Walid G. Aref, Sunil Prabhakar. Query Processing in Broadcasted Spatial Index Trees, 7th International Symposium on Spatial and Temporal Databases (SSTD 2001), pp 502-521, Springer Verlag LNCS 2121, July 2001. [PDF]
Frank Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin. Parallelizing The Data Cube, 8th International Conference on Database Theory, pp 129-143, January 2001. [PDF]
Susanne E. Hambrusch, Chuan-Ming Liu. Data Replication for External Searching inStatic Tree Structures, 9-th Internat. Conf. on Information and Knowledge Management (CIKM 2000), pp 360-367, November 2000. [PDF]
Susanne E. Hambrusch, Chuan-Ming Liu, Hyeong-Seok Lim. Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees, Journal of Graph Algorithms and Applications, Vol. 4, no. 4, pp. 1-26, 2000. [PDF]
Ashfaq A. Khokhar, Susanne E. Hambrusch, Erturk Kocalar. Termination Detection: Models and Algorithms for SPMD Computing Paradigms, 12-th Internat. Conf. on Parallel and Distributed Computing Systems, pp 377-382, August 1999. [PDF]
Susanne E. Hambrusch, Hyeong-Seok Lim. Minimizing the Diameter in Tree Networks under Edge Reductions, Parallel Processing Letters, Vol. 9, Nr. 3, pp 361-371, 1999. [PDF]
Susanne E. Hambrusch, Hyeong-Seok Lim. Minimizing Broadcast Costs under Edge Reductions in Tree Networks, (with H.-S. Lim), Discrete Applied Mathematics, Vol. 19, pp 93-117, 1999. [PDF]
Susanne E. Hambrusch, Ashfaq A. Khokhar, Yi Liu. Scalable S-to-P Broadcasting on Message- Passing MPPs, IEEE Transaction on Parallel and Distributed Systems, Vol. 9, Nr. 8, pp 758-768, 1998. [PDF]
Susanne E. Hambrusch, Hyeong-Seok Lim. Minimizing Broadcast Costs under Edge Reductions in Tree Networks, 1997 International Conference on Parallel and Distributed Systems, pp 188-195, December 1997.
Susanne E. Hambrusch, Ashfaq A. Khokhar. Maintaining Spatial Data Sets in Distributed- Memory Machines, 11-th Internat. Parallel Processing Symposium, April 1997. [PDF]
Susanne E. Hambrusch, Hung-Yi Tu. Edge Weight Reduction Problems in Directed, Acyclic Graphs, Journal of Algorithms, Vol. 24, pp 66-93, 1997. [PDF]
Farooq Hameed, Susanne E. Hambrusch, Ashfaq A. Khokhar, Jamshed N. Patel. Contour Ranking on Coarse-Grained Machines: A Case Study for Low-level Vision Computations, Concurrency: Practice and Experience, Vol. 9, Nr. 3, pp 203-222, 1997. [PDF]
Susanne E. Hambrusch, Hung-Yi Tu. New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction, Algorithmica, Vol. 17, pp 426-448, 1997. [PDF]
Susanne E. Hambrusch, Ashfaq A. Khokhar, Yi Liu. Scalable S-to-P Broadcasting on Message- Passing MPPs, Proceedings of 25-th International Conference on Parallel Processing, Vol. I, pp 69-76, August 1996.
Susanne E. Hambrusch, Ashfaq A. Khokhar. C3: A Parallel Model for Coarse-grained Machines, Journal on Parallel and Distributed Computing, Vol. 32, Nr. 2, pp 139-154, 1996. [PDF]
Susanne E. Hambrusch, Farooq Hameed, Ashfaq A. Khokhar. Communication Operations on Coarse-Grained Mesh Architectures, Parallel Computing, Vol. 21, pp 731-751, 1995. [PDF]
Susanne E. Hambrusch, Ashfaq A. Khokhar. C3: An Architecture-independent Model for Coarse-grained Parallel Machines, Proceedings of 6-th IEEE Symposium on Parallel and Distributed Processing, pp 544{551, October 1994.
L.H. Jamieson, E. Delp, S. Hambrusch, A. Khokhar, G.W. Cook, F. Hameed, J. Patel, and K. Shen. Parallel Scalable Libraries and Algorithms for Computer Vision, Proceedings of 12-th International Conference on Pattern Recognition, pp 223-228, October 1994.
Susanne E. Hambrusch, Xin He, Russ Miller. Mesh Algorithms for Gray-Scale Digitized Picture Component Labeling, Journal on Parallel and Distributed Computing, Vol. 20, pp 56-68, 1994.
Susanne E. Hambrusch, Hung-Yi Tu. New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction, Proceedings of 4-th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, Springer Verlag, Vol. 762, pp 446-455, December 1993.
Greg N. Frederickson, Susanne E. Hambrusch, Hung-Yi Tu. Shortest Path Computations in Source-Deplanarized Graphs, Information Processing Letters, Vol. 47, pp 71-75, 1993.
Ajay K. Gupta, Susanne E. Hambrusch. Multiple Network Embeddings into the Hypercube, Journal on Parallel and Distributed Computing, Vol. 19, pp 73-82, 1993.
Susanne E. Hambrusch, Frank Dehne. Determining Maximum k-Width-Connectivity on Meshes, Computational Geometry: Theory and Applications, Vol. 3, pp 91-105, 1993.
Susanne E. Hambrusch, Xin He, Russ Miller. Mesh Algorithms for Gray-Scale Digitized Picture Component Labeling, Proceedings of 4th ACM Symposium on Parallel Algorithms and Architectures, pp 100-108, July 1992.
Frank Dehne, Susanne E. Hambrusch. Determining Maximum k-Width-Connectivity on Meshes, Proceedings of 6-th Internat. Parallel Processing Symposium, pp 234-241, March 1992.
Susanne E. Hambrusch, Hung-Yi Tu. Minimizing Total Wire Length During 1-Dimensional Compaction, Integration, the VLSI Journal, Vol. 14, pp 113-144, 1992.
Ajay K. Gupta, Susanne E. Hambrusch. Load Balanced Tree Embeddings, Parallel Computing, Vol. 18, pp 595-614, 1992.
Susanne E. Hambrusch, Hung-Yi Tu. A Framework for 1-D Compaction with Forbidden Region Avoidance, Computational Geometry: Theory and Applications, Vol. 1, Nr. 4, pp 203-226, 1992.
Alberto Apostolico, Mikhail J. Atallah, Susanne E. Hambrusch. New Clique and Independent Set Algorithms for Circle Graphs, Discrete Applied Mathematics, Vol. 36, pp 1-24, 1992.
Susanne E. Hambrusch, Hung-Yi Tu. A Framework for 1-D Compaction with Forbidden Region Avoidance, Proceedings of First Great Lakes Symposium on VLSI, pp 146-151, March 1991.
Mikhail J. Atallah, Susanne E. Hambrusch, Lynn E. Te Winkel. Topological Numbering of Features on a Mesh, Algorithmica, Vol. 6, pp 762-769, 1991.
Ajay K. Gupta, Susanne E. Hambrusch. Embedding Complete Binary Tress into Buttery Networks, IEEE Transactions on Computers, Vol. 40, Nr. 7, pp 853-863, 1991.
Susanne E. Hambrusch, Michael Luby. Parallel Asynchronous Connected Components in a Mesh, Information Processing Letters, Vol. 38, pp 257-263, 1991.
Frank Dehne, Susanne E. Hambrusch. Parallel Algorithms for Determining k-Width-Connectivity in Binary Images, Journal on Parallel and Distributed Computing, Vol. 12. Nr. 1, pp 12-23, 1991.
Frank Dehne, Susanne E. Hambrusch. Parallel Algorithms for Determining k-Width-Connectivity in Binary Images, Proceedings of 2nd IEEE Symposium on Parallel and Distributed Processing, pp 488-496, December 1990.
Susanne E. Hambrusch, Hung-Yi Tu. 1-D Compaction in the Presence of Forbidden Regions, Proceedings of 28-th Allerton Conference on Comm., Control, and Computing, pp 828-837, October 1990.
Susanne E. Hambrusch, Lynn E. Te Winkel. Parallel Heuristics for the Steiner Tree Problem in Images without Sorting or Routing, Proceedings of 10th International Conference on Pattern Recognition, Vol. II, pp 356-361, June 1990.
Ajay K. Gupta, Susanne E. Hambrusch. Multiple Network Embeddings into the Hypercube, Proceedings of 5th Distributed Memory Computing Conference, Vol. II, pp 1384-1392, April 1990.
Ajay K. Gupta, Susanne E. Hambrusch, A. Boals, N. Sherwani. A Lower Bound on Embedding Large Hypercubes into Small Hypercubes, Congressus Numerantium, Vol. 78, pp 141-151, 1990.
Mikhail J. Atallah, Susanne E. Hambrusch. Optimal Placement for Multi-Terminal Nets, Proceedings of 1989 Workshop on Algorithms and Data Structures, in Lecture Notes in Computer Science, Springer Verlag, Vol. 382, pp 97-114, August 1989.
Yukon Chang, Susanne E. Hambrusch, Janos Simon. On the Computational Complexity of Continuous Routing, Journal of Algorithms, Vol. 10, pp 86-108, 1989.
Concettina Guerra, Susanne E. Hambrusch. Parallel Algorithms for Line Detection on a Mesh, Journal of Parallel and Distributed Computing, Vol. 6, Nr. 1, pp 1-19, 1989.
Mikhail J. Atallah, Susanne E. Hambrusch, Lynn E. Te Winkel. Topological Numbering of Features on a Mesh, Proceedings of 26-th Allerton Conference on Communication, Control, and Computing, pp 1114-1115, September 1988.
Susanne E. Hambrusch, Lynn E. Te Winkel. A Study of Connected Component Labeling Algorithms on the MPP, Proceedings of 3rd Internat. Conferenceeditorial board, on Supercomputing, Vol. 1, pp 477-483, May 1988.
Ajay K. Gupta, Susanne E. Hambrusch. Embedding Large Tree Machines into Small Ones, Proceedings of Fifth MIT Conference on Advanced Research in VLSI, MIT Press, pp 179-198, March 1988.
Susanne E. Hambrusch, Greg N. Frederickson. Planar Linear Arrangements of Outerplanar Graphs, IEEE Transactions on Circuits and Systems, Vol. 35, No. 3, pp 323-333, 1988.
Concettina Guerra, Susanne E. Hambrusch. Parallel Algorithms for Line Detection on a Mesh, Proceedings of IEEE Workshop on Computer Architecture for Pattern Analysis and Machine Intelligence, pp 99-106, October 1987.
Mikhail J. Atallah, Susanne E. Hambrusch. On Bipartite Matchings of Minimum Density, Journal of Algorithms, Vol. 8, pp 480-502, 1987.
Alberto Apostolico, Susanne E. Hambrusch. Finding Maximum Cliques in Circular-Arc Graphs, Information Processing Letters, Vol. 26, Nr. 4, pp 209-215, 1987.
Ajay K. Gupta, Susanne E. Hambrusch. Optimal Three-dimensional Layouts of Complete Binary Trees, Information Processing Letters, Vol. 26, Nr. 2, pp 99-104, 1987.
Ajay K. Gupta, Susanne E. Hambrusch. Optimal 3-dimensional Layouts of Complete Binary Trees, Proceedings of 24-th Allerton Conference on Communication, Control, and Computing, pp 573-574, October 1986.
Shaodi Gao, Susanne E. Hambrusch. Two-Layer Channel Routing with Vertical Unit-Length Overlap, Algorithmica, Vol. 1, pp 223-232, 1986.
Mikhail J. Atallah, Susanne E. Hambrusch. Optimal Rotation Problems in Channel Routing, IEEE Transactions on Computers, Vol. c-35, Nr. 9, pp 843-847, 1986.
Mikhail J. Atallah, Susanne E. Hambrusch. Solving Tree Problems on a Mesh-Connected Processor Array, Information and Control, Vol. 69, Nr. 1-3, pp 168-187, 1986.
Mikhail J. Atallah, Susanne E. Hambrusch. An Assignment Algorithm with Applications to Integrated Circuit Layout, Discrete Applied Mathematics, Vol. 13, No. 1, pp. 9-22, 1986.
Mikhail J. Atallah, Susanne E. Hambrusch. Solving Tree Problems on a Mesh-Connected Processor Array, Proceedings of 26-th Symp. on the Foundations of Computer Science, pp 222-231, October 1985.
Yukon Chang, Susanne E. Hambrusch, Janos Simon. Continuous Routing and Broadcasting on Interconnection Networks, Proceedings of 23-rd Allerton Conference on Communication, Control, and Computing, pp 270-279, October 1985.
Susanne E. Hambrusch. Parallel Algorithms for Bridge- and Bi-Connectivity on Minimum Area Meshes, Proceedings of 1985 NCC, AFIPS Conference Proceedings, pp 319-327, July 1985.
Susanne E. Hambrusch. Efficient Solutions to a Class of Placement Problems, Proceedings of 11-th Workshop on Graphtheoretic Concepts in Computer Science, Trauner Verlag, pp 11-31, June 1985.
Susanne E. Hambrusch, Janos Simon. S Solving Undirected Graph Problems on VLSI, SIAM J. on Computing, Vol. 14, No. 3, pp 527-544, 1985.
Susanne E. Hambrusch. Channel Routing Algorithms for Overlap Models, IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, Vol. Cad-4, Nr. 1, pp 23-30, 1985.
Susanne E. Hambrusch. Using Overlap and Minimizing Contact Points in Channel Routing, Proceedings of 21-st Annual Allerton Conf. on Communication, Control, and Computing, pp 256-258, October 1983.
Susanne E. Hambrusch, Janos Simon. Lower Bounds for Solving Undirected Graph Problems on VLSI, Proceedings of 10th Colloquium on Automata, Languages, and Programming, in Lecture Notes in Computer Science, 154, Springer Verlag, pp 292-303, 1983.
Susanne E. Hambrusch. VLSI Algorithms for the Connected Component Problem, SIAM J. on Computing, Vol. 12, No. 2, pp 354-365, 1983.
Susanne E. Hambrusch. VLSI Algorithms for the Verification Problem of the Connected Component Problem, Proceeding of 7-th Annual Workshop on Graphtheoretic Aspects in Computer Science, Hansen Verlag, pp 321-342, June 1981.
Susanne E. Hambrusch. VLSI Algorithms for the Connected Component Problem, Proceedings of 15-th Annual Conf. on Information Sciences and Systems, Johns Hopkins University, pp 275-279, March 1981.

Susanne E. Hambrusch - Publications HOMEPAGE
Susanne E. Hambrusch, Christoph Hoffmann, John T. Korb, Towards Computational Thinking in Science, Transform Science: Computational Education for Scientists, Microsoft Research, editor: Yan Xu, pp 88-91, 2009. Susanne E. Hambrusch, Christoph Hoffmann, John T. Korb, Mark Haugan, and Anthony Hosking, A Multidisciplinary Approach Towards Computational Thinking for Science Majors, 39th ACM Technical Symposium on Computer Science Education (SIGSCE'09), I 5 pages, March 2009. S. Horwitz, S. Rogers, M. Biggers, D. Binkley, S. Hambrusch, E. Munson, and B. Ryder, Using Peer-Led Team Learning to Increase Participation and Success of Under-represented Groups in Introductory Computer Science, 39th ACM Technical Symposium on Computer Science Education (SIGSCE'09), 5 pages, March 2009. Sarvjeet Singh, Chris Mayfield, Sunil Prabhakar, Rahul Shah, Susanne E. Hambrusch. Orion 2.0: Native Support for Uncertain Data, Demo paper, ACM SIGMOD, 2008. Sarvjeet Singh, Chris Mayfield, Sunil Prabhakar, Rahul Shah, Susanne E. Hambrusch, Jennifer Neville, and Reynold. Cheng, Database Support for Probabilistic Attributes and Tuples, 24th International Conference on Data Engineering (ICDE), April 2008. Sarvjeet Singh, Chris Mayfield, Sunil Prabhakar, Rahul Shah, Susanne E. Hambrusch. Indexing Uncertain Categorical Data, 23rd IEEE International Conference on Data Engineering (ICDE 2007), April 2007. [PDF] Susanne E. Hambrusch, Chuan-Ming Liu, Walid Aref, Sunil Prabhakar. Efficient query execution on broadcasted index tree structures, Data Knowledge Engineering, May 2006. Susanne E. Hambrusch, Chuan-Ming Liu, Sunil Prabhakar. Broadcasting and Querying Multi-dimensional Index Trees in a Multi-channel environment, Information Systems, Vol. 31, pp 870-886, 2006. Mourad Ouzzani, Walid G. Aref, Elisa Bertino, Ann Christine Catlin, Christopher W. Clifton, Wing-Kai Hon, Ahmed K. Elmagarmid, Arif Ghafoor, Susanne E. Hambrusch, Sunil Prabhakar, Jeffrey Vitter, Xiang Zhang. The Indiana Center for Database Systems at Purdue University), SIGMOD Record, Vol. 34, Nr., pp 53-58, 2005. Dmitri V. Kalashnikov, Sunil Prabhakar, Susanne E. Hambrusch. Main Memory Evaluation of Monitoring Queries Over Moving Objects, Distributed and Parallel Databases: An International Journal, Vol. 15, No. 2, pp 117-136, 2004. [PDF] Mohamed F. Mokbel, Xiaopeng Xiong, Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar. PLACE: A Query Processor for Handling Real-time Spatio-temporal Data Streams, 13th International Conference on Very Large Data Bases (VLDB), pp 1377-1380, 2004. [PDF] Xiaopeng Xiong, Mohamed F. Mokbel, Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar. Scalable Spatio-temporal Continuous Query Processing for Location-aware Services, 16th International Conference on Scientific and Statistical Database Management (SSDBM) Conference), June 2004. [PDF] Mohamed F. Mokbel, Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar. Towards Scalable Location-aware Services: Requirements and Research Issues, ACM Symposium on Geographic Information Systems (ACM GIS), pp 110-117, November 2003. [PDF] Ashfaq A. Khokhar, Susanne E. Hambrusch, Erturk D. Kocalar. Termination Detection in Data-Driven Parallel Computations/Applications, Journal of Parallel and Distributed Computing, 63(3), pp 312-326, 2003. [PDF] Susanne E. Hambrusch, Chuan-Ming Liu. Data Replication for Static Tree Structures, Information Processing Letters, vol. 86/4, pp 197-202, 2003. Dmitri V. Kalashnikov, Sunil Prabhakar, Susanne E. Hambrusch, Walid G. Aref. Efficient Evaluation of Continuous Range Queries on Moving Objects, 13th International Conference on Database and Expert Systems Applications (DEXA 2002), pp 731-740, September 2002. [PDF] Dongyan Xu, Mohamed Hefeeda, Susanne E. Hambrusch, Bharat K. Bhargava. On Peerto- Peer Media Streaming, 22nd International Conference on Distributed Computing Systems (ICDCS 2002), pp 363-371, July 2002. [PDF] Sunil Prabhakar, Yuni Xia, Dmitri V. Kalashnikov, Walid G. Aref, Susanne E. Hambrusch. Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects, IEEE Transaction on Computers, Vol. 51, Nr. 10, pp 1124- 1140, 2002. [PDF] Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin. Parallelizing The Data Cube, Distributed and Parallel Databases, Special Issue on Parallel and Distributed Data Mining, Vol. 11, Nr. 2, pp 181-203, 2002. [PDF] Susanne E. Hambrusch, Chuan-Ming Liu, Walid G. Aref, Sunil Prabhakar. Query Processing in Broadcasted Spatial Index Trees, 7th International Symposium on Spatial and Temporal Databases (SSTD 2001), pp 502-521, Springer Verlag LNCS 2121, July 2001. [PDF] Frank Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin. Parallelizing The Data Cube, 8th International Conference on Database Theory, pp 129-143, January 2001. [PDF] Susanne E. Hambrusch, Chuan-Ming Liu. Data Replication for External Searching inStatic Tree Structures, 9-th Internat. Conf. on Information and Knowledge Management (CIKM 2000), pp 360-367, November 2000. [PDF] Susanne E. Hambrusch, Chuan-Ming Liu, Hyeong-Seok Lim. Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees, Journal of Graph Algorithms and Applications, Vol. 4, no. 4, pp. 1-26, 2000. [PDF] Ashfaq A. Khokhar, Susanne E. Hambrusch, Erturk Kocalar. Termination Detection: Models and Algorithms for SPMD Computing Paradigms, 12-th Internat. Conf. on Parallel and Distributed Computing Systems, pp 377-382, August 1999. [PDF] Susanne E. Hambrusch, Hyeong-Seok Lim. Minimizing the Diameter in Tree Networks under Edge Reductions, Parallel Processing Letters, Vol. 9, Nr. 3, pp 361-371, 1999. [PDF] Susanne E. Hambrusch, Hyeong-Seok Lim. Minimizing Broadcast Costs under Edge Reductions in Tree Networks, (with H.-S. Lim), Discrete Applied Mathematics, Vol. 19, pp 93-117, 1999. [PDF] Susanne E. Hambrusch, Ashfaq A. Khokhar, Yi Liu. Scalable S-to-P Broadcasting on Message- Passing MPPs, IEEE Transaction on Parallel and Distributed Systems, Vol. 9, Nr. 8, pp 758-768, 1998. [PDF] Susanne E. Hambrusch, Hyeong-Seok Lim. Minimizing Broadcast Costs under Edge Reductions in Tree Networks, 1997 International Conference on Parallel and Distributed Systems, pp 188-195, December 1997. Susanne E. Hambrusch, Ashfaq A. Khokhar. Maintaining Spatial Data Sets in Distributed- Memory Machines, 11-th Internat. Parallel Processing Symposium, April 1997. [PDF] Susanne E. Hambrusch, Hung-Yi Tu. Edge Weight Reduction Problems in Directed, Acyclic Graphs, Journal of Algorithms, Vol. 24, pp 66-93, 1997. [PDF] Farooq Hameed, Susanne E. Hambrusch, Ashfaq A. Khokhar, Jamshed N. Patel. Contour Ranking on Coarse-Grained Machines: A Case Study for Low-level Vision Computations, Concurrency: Practice and Experience, Vol. 9, Nr. 3, pp 203-222, 1997. [PDF] Susanne E. Hambrusch, Hung-Yi Tu. New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction, Algorithmica, Vol. 17, pp 426-448, 1997. [PDF] Susanne E. Hambrusch, Ashfaq A. Khokhar, Yi Liu. Scalable S-to-P Broadcasting on Message- Passing MPPs, Proceedings of 25-th International Conference on Parallel Processing, Vol. I, pp 69-76, August 1996. Susanne E. Hambrusch, Ashfaq A. Khokhar. C3: A Parallel Model for Coarse-grained Machines, Journal on Parallel and Distributed Computing, Vol. 32, Nr. 2, pp 139-154, 1996. [PDF] Susanne E. Hambrusch, Farooq Hameed, Ashfaq A. Khokhar. Communication Operations on Coarse-Grained Mesh Architectures, Parallel Computing, Vol. 21, pp 731-751, 1995. [PDF] Susanne E. Hambrusch, Ashfaq A. Khokhar. C3: An Architecture-independent Model for Coarse-grained Parallel Machines, Proceedings of 6-th IEEE Symposium on Parallel and Distributed Processing, pp 544{551, October 1994. L.H. Jamieson, E. Delp, S. Hambrusch, A. Khokhar, G.W. Cook, F. Hameed, J. Patel, and K. Shen. Parallel Scalable Libraries and Algorithms for Computer Vision, Proceedings of 12-th International Conference on Pattern Recognition, pp 223-228, October 1994. Susanne E. Hambrusch, Xin He, Russ Miller. Mesh Algorithms for Gray-Scale Digitized Picture Component Labeling, Journal on Parallel and Distributed Computing, Vol. 20, pp 56-68, 1994. Susanne E. Hambrusch, Hung-Yi Tu. New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction, Proceedings of 4-th International Symposium on Algorithms and Computation, Lecture Notes in Computer Science, Springer Verlag, Vol. 762, pp 446-455, December 1993. Greg N. Frederickson, Susanne E. Hambrusch, Hung-Yi Tu. Shortest Path Computations in Source-Deplanarized Graphs, Information Processing Letters, Vol. 47, pp 71-75, 1993. Ajay K. Gupta, Susanne E. Hambrusch. Multiple Network Embeddings into the Hypercube, Journal on Parallel and Distributed Computing, Vol. 19, pp 73-82, 1993. Susanne E. Hambrusch, Frank Dehne. Determining Maximum k-Width-Connectivity on Meshes, Computational Geometry: Theory and Applications, Vol. 3, pp 91-105, 1993. Susanne E. Hambrusch, Xin He, Russ Miller. Mesh Algorithms for Gray-Scale Digitized Picture Component Labeling, Proceedings of 4th ACM Symposium on Parallel Algorithms and Architectures, pp 100-108, July 1992. Frank Dehne, Susanne E. Hambrusch. Determining Maximum k-Width-Connectivity on Meshes, Proceedings of 6-th Internat. Parallel Processing Symposium, pp 234-241, March 1992. Susanne E. Hambrusch, Hung-Yi Tu. Minimizing Total Wire Length During 1-Dimensional Compaction, Integration, the VLSI Journal, Vol. 14, pp 113-144, 1992. Ajay K. Gupta, Susanne E. Hambrusch. Load Balanced Tree Embeddings, Parallel Computing, Vol. 18, pp 595-614, 1992. Susanne E. Hambrusch, Hung-Yi Tu. A Framework for 1-D Compaction with Forbidden Region Avoidance, Computational Geometry: Theory and Applications, Vol. 1, Nr. 4, pp 203-226, 1992. Alberto Apostolico, Mikhail J. Atallah, Susanne E. Hambrusch. New Clique and Independent Set Algorithms for Circle Graphs, Discrete Applied Mathematics, Vol. 36, pp 1-24, 1992. Susanne E. Hambrusch, Hung-Yi Tu. A Framework for 1-D Compaction with Forbidden Region Avoidance, Proceedings of First Great Lakes Symposium on VLSI, pp 146-151, March 1991. Mikhail J. Atallah, Susanne E. Hambrusch, Lynn E. Te Winkel. Topological Numbering of Features on a Mesh, Algorithmica, Vol. 6, pp 762-769, 1991. Ajay K. Gupta, Susanne E. Hambrusch. Embedding Complete Binary Tress into Buttery Networks, IEEE Transactions on Computers, Vol. 40, Nr. 7, pp 853-863, 1991. Susanne E. Hambrusch, Michael Luby. Parallel Asynchronous Connected Components in a Mesh, Information Processing Letters, Vol. 38, pp 257-263, 1991. Frank Dehne, Susanne E. Hambrusch. Parallel Algorithms for Determining k-Width-Connectivity in Binary Images, Journal on Parallel and Distributed Computing, Vol. 12. Nr. 1, pp 12-23, 1991. Frank Dehne, Susanne E. Hambrusch. Parallel Algorithms for Determining k-Width-Connectivity in Binary Images, Proceedings of 2nd IEEE Symposium on Parallel and Distributed Processing, pp 488-496, December 1990. Susanne E. Hambrusch, Hung-Yi Tu. 1-D Compaction in the Presence of Forbidden Regions, Proceedings of 28-th Allerton Conference on Comm., Control, and Computing, pp 828-837, October 1990. Susanne E. Hambrusch, Lynn E. Te Winkel. Parallel Heuristics for the Steiner Tree Problem in Images without Sorting or Routing, Proceedings of 10th International Conference on Pattern Recognition, Vol. II, pp 356-361, June 1990. Ajay K. Gupta, Susanne E. Hambrusch. Multiple Network Embeddings into the Hypercube, Proceedings of 5th Distributed Memory Computing Conference, Vol. II, pp 1384-1392, April 1990. Ajay K. Gupta, Susanne E. Hambrusch, A. Boals, N. Sherwani. A Lower Bound on Embedding Large Hypercubes into Small Hypercubes, Congressus Numerantium, Vol. 78, pp 141-151, 1990. Mikhail J. Atallah, Susanne E. Hambrusch. Optimal Placement for Multi-Terminal Nets, Proceedings of 1989 Workshop on Algorithms and Data Structures, in Lecture Notes in Computer Science, Springer Verlag, Vol. 382, pp 97-114, August 1989. Yukon Chang, Susanne E. Hambrusch, Janos Simon. On the Computational Complexity of Continuous Routing, Journal of Algorithms, Vol. 10, pp 86-108, 1989. Concettina Guerra, Susanne E. Hambrusch. Parallel Algorithms for Line Detection on a Mesh, Journal of Parallel and Distributed Computing, Vol. 6, Nr. 1, pp 1-19, 1989. Mikhail J. Atallah, Susanne E. Hambrusch, Lynn E. Te Winkel. Topological Numbering of Features on a Mesh, Proceedings of 26-th Allerton Conference on Communication, Control, and Computing, pp 1114-1115, September 1988. Susanne E. Hambrusch, Lynn E. Te Winkel. A Study of Connected Component Labeling Algorithms on the MPP, Proceedings of 3rd Internat. Conferenceeditorial board, on Supercomputing, Vol. 1, pp 477-483, May 1988. Ajay K. Gupta, Susanne E. Hambrusch. Embedding Large Tree Machines into Small Ones, Proceedings of Fifth MIT Conference on Advanced Research in VLSI, MIT Press, pp 179-198, March 1988. Susanne E. Hambrusch, Greg N. Frederickson. Planar Linear Arrangements of Outerplanar Graphs, IEEE Transactions on Circuits and Systems, Vol. 35, No. 3, pp 323-333, 1988. Concettina Guerra, Susanne E. Hambrusch. Parallel Algorithms for Line Detection on a Mesh, Proceedings of IEEE Workshop on Computer Architecture for Pattern Analysis and Machine Intelligence, pp 99-106, October 1987. Mikhail J. Atallah, Susanne E. Hambrusch. On Bipartite Matchings of Minimum Density, Journal of Algorithms, Vol. 8, pp 480-502, 1987. Alberto Apostolico, Susanne E. Hambrusch. Finding Maximum Cliques in Circular-Arc Graphs, Information Processing Letters, Vol. 26, Nr. 4, pp 209-215, 1987. Ajay K. Gupta, Susanne E. Hambrusch. Optimal Three-dimensional Layouts of Complete Binary Trees, Information Processing Letters, Vol. 26, Nr. 2, pp 99-104, 1987. Ajay K. Gupta, Susanne E. Hambrusch. Optimal 3-dimensional Layouts of Complete Binary Trees, Proceedings of 24-th Allerton Conference on Communication, Control, and Computing, pp 573-574, October 1986. Shaodi Gao, Susanne E. Hambrusch. Two-Layer Channel Routing with Vertical Unit-Length Overlap, Algorithmica, Vol. 1, pp 223-232, 1986. Mikhail J. Atallah, Susanne E. Hambrusch. Optimal Rotation Problems in Channel Routing, IEEE Transactions on Computers, Vol. c-35, Nr. 9, pp 843-847, 1986. Mikhail J. Atallah, Susanne E. Hambrusch. Solving Tree Problems on a Mesh-Connected Processor Array, Information and Control, Vol. 69, Nr. 1-3, pp 168-187, 1986. Mikhail J. Atallah, Susanne E. Hambrusch. An Assignment Algorithm with Applications to Integrated Circuit Layout, Discrete Applied Mathematics, Vol. 13, No. 1, pp. 9-22, 1986. Mikhail J. Atallah, Susanne E. Hambrusch. Solving Tree Problems on a Mesh-Connected Processor Array, Proceedings of 26-th Symp. on the Foundations of Computer Science, pp 222-231, October 1985. Yukon Chang, Susanne E. Hambrusch, Janos Simon. Continuous Routing and Broadcasting on Interconnection Networks, Proceedings of 23-rd Allerton Conference on Communication, Control, and Computing, pp 270-279, October 1985. Susanne E. Hambrusch. Parallel Algorithms for Bridge- and Bi-Connectivity on Minimum Area Meshes, Proceedings of 1985 NCC, AFIPS Conference Proceedings, pp 319-327, July 1985. Susanne E. Hambrusch. Efficient Solutions to a Class of Placement Problems, Proceedings of 11-th Workshop on Graphtheoretic Concepts in Computer Science, Trauner Verlag, pp 11-31, June 1985. Susanne E. Hambrusch, Janos Simon. S Solving Undirected Graph Problems on VLSI, SIAM J. on Computing, Vol. 14, No. 3, pp 527-544, 1985. Susanne E. Hambrusch. Channel Routing Algorithms for Overlap Models, IEEE Transactions on Computer Aided Design of Integrated Circuits and Systems, Vol. Cad-4, Nr. 1, pp 23-30, 1985. Susanne E. Hambrusch. Using Overlap and Minimizing Contact Points in Channel Routing, Proceedings of 21-st Annual Allerton Conf. on Communication, Control, and Computing, pp 256-258, October 1983. Susanne E. Hambrusch, Janos Simon. Lower Bounds for Solving Undirected Graph Problems on VLSI, Proceedings of 10th Colloquium on Automata, Languages, and Programming, in Lecture Notes in Computer Science, 154, Springer Verlag, pp 292-303, 1983. Susanne E. Hambrusch. VLSI Algorithms for the Connected Component Problem, SIAM J. on Computing, Vol. 12, No. 2, pp 354-365, 1983. Susanne E. Hambrusch. VLSI Algorithms for the Verification Problem of the Connected Component Problem, Proceeding of 7-th Annual Workshop on Graphtheoretic Aspects in Computer Science, Hansen Verlag, pp 321-342, June 1981. Susanne E. Hambrusch. VLSI Algorithms for the Connected Component Problem, Proceedings of 15-th Annual Conf. on Information Sciences and Systems, Johns Hopkins University, pp 275-279, March 1981.

Susanne E. Hambrusch - Publications