The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Susanne E. Hambrusch: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mikhail J. Atallah, Susanne E. Hambrusch
    Solving Tree Problems on a Mesh-Connected Processor Array (Preliminary Version) [Citation Graph (1, 0)][DBLP]
    FOCS, 1985, pp:222-231 [Conf]
  2. Susanne E. Hambrusch, Hung-Yi Tu
    New Algorithms and Approaches for 1-Dimensional Layout Compaction. [Citation Graph (0, 0)][DBLP]
    New Results and New Trends in Computer Science, 1991, pp:152-171 [Conf]
  3. Susanne E. Hambrusch, Chuan-Ming Liu
    Data Replication for External Searching in Static Tree Structures. [Citation Graph (0, 0)][DBLP]
    CIKM, 2000, pp:360-367 [Conf]
  4. Dmitri V. Kalashnikov, Sunil Prabhakar, Susanne E. Hambrusch, Walid G. Aref
    Efficient Evaluation of Continuous Range Queries on Moving Objects. [Citation Graph (0, 0)][DBLP]
    DEXA, 2002, pp:731-740 [Conf]
  5. Mohamed F. Mokbel, Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar
    Towards scalable location-aware services: requirements and research issues. [Citation Graph (0, 0)][DBLP]
    GIS, 2003, pp:110-117 [Conf]
  6. Susanne E. Hambrusch, Janos Simon
    Lower Bounds for Solving Undirected Graph Problems on VLSI. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:292-303 [Conf]
  7. Dongyan Xu, Mohamed Hefeeda, Susanne E. Hambrusch, Bharat K. Bhargava
    On Peer-to-Peer Media Streaming. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2002, pp:363-371 [Conf]
  8. Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin
    Parallelizing the Data Cube. [Citation Graph (0, 18)][DBLP]
    ICDT, 2001, pp:129-143 [Conf]
  9. Susanne E. Hambrusch, Hyeong-Seok Lim
    Minimizing Broadcast Costs under Edge Reductions in Tree Networks. [Citation Graph (0, 0)][DBLP]
    ICPADS, 1997, pp:188-195 [Conf]
  10. Susanne E. Hambrusch
    Models for Parallel Computation. [Citation Graph (0, 0)][DBLP]
    ICPP Workshop, 1996, pp:92-95 [Conf]
  11. Susanne E. Hambrusch, Ashfaq A. Khokhar, Yi Liu
    Scalable S-to-P Broadcasting on Message-Passing MPPs. [Citation Graph (0, 0)][DBLP]
    ICPP, Vol. 1, 1996, pp:69-76 [Conf]
  12. Susanne E. Hambrusch, Frank K. H. A. Dehne
    Determining Maximum itk-Width Connectivity on Meshes. [Citation Graph (0, 0)][DBLP]
    IPPS, 1992, pp:234-241 [Conf]
  13. Susanne E. Hambrusch, Ashfaq A. Khokhar
    Maintaining Spatial Data Sets in Distributed-Memory Machines. [Citation Graph (0, 0)][DBLP]
    IPPS, 1997, pp:702-707 [Conf]
  14. Susanne E. Hambrusch, Hung-Yi Tu
    New Algorithms for Minimizing the Longest Wire Length during Circuit Compaction. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:446-455 [Conf]
  15. Susanne E. Hambrusch, Xin He, Russ Miller
    Parallel Algorithms for Gray-Scale Image Component Labeling on a Mesh-Connected Computer. [Citation Graph (0, 0)][DBLP]
    SPAA, 1992, pp:100-108 [Conf]
  16. Frank K. H. A. Dehne, Susanne E. Hambrusch
    Parallel algorithms for determining k-width- connectivity in binary images. [Citation Graph (0, 0)][DBLP]
    SPDP, 1990, pp:488-496 [Conf]
  17. Susanne E. Hambrusch, Chuan-Ming Liu, Walid G. Aref, Sunil Prabhakar
    Query Processing in Broadcasted Spatial Index Trees. [Citation Graph (0, 0)][DBLP]
    SSTD, 2001, pp:502-521 [Conf]
  18. Xiaopeng Xiong, Mohamed F. Mokbel, Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar
    Scalable Spatio-temporal Continuous Query Processing for Location-aware Services. [Citation Graph (0, 0)][DBLP]
    SSDBM, 2004, pp:317-0 [Conf]
  19. Mohamed F. Mokbel, Xiaopeng Xiong, Walid G. Aref, Susanne E. Hambrusch, Sunil Prabhakar, Moustafa A. Hammad
    PLACE: A Query Processor for Handling Real-time Spatio-temporal Data Streams. [Citation Graph (0, 0)][DBLP]
    VLDB, 2004, pp:1377-1380 [Conf]
  20. Mikhail J. Atallah, Susanne E. Hambrusch
    Optimal Channel Placement for Multi-Terminal Nets. [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:97-114 [Conf]
  21. Mikhail J. Atallah, Susanne E. Hambrusch, Lynn E. Te Winkel
    Topological Numbering of Features on a Mesh. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:5, pp:762-769 [Journal]
  22. Shaodi Gao, Susanne E. Hambrusch
    Two-Layer Channel Routing with Vertical Uni-Length Overlap. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1986, v:1, n:2, pp:223-232 [Journal]
  23. Susanne E. Hambrusch, Hung-Yi Tu
    New Algorithms for Minimizing the Longest Wire Length During Circuit Compaction. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:4, pp:426-448 [Journal]
  24. Susanne E. Hambrusch, Frank K. H. A. Dehne
    Determining Maximum K-width-connectivity on Meshes. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:91-105 [Journal]
  25. Susanne E. Hambrusch, Hung-Yi Tu
    A Framework for 1-D Compaction with Forbidden Region Avoidance. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:203-226 [Journal]
  26. 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. [Citation Graph (0, 0)][DBLP]
    Concurrency - Practice and Experience, 1997, v:9, n:3, pp:203-221 [Journal]
  27. Alberto Apostolico, Mikhail J. Atallah, Susanne E. Hambrusch
    New Clique and Independent Set Algorithms for Circle Graphs (Discrete Applied Mathematics 36 (1992) 1-24). [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:41, n:2, pp:179-180 [Journal]
  28. Susanne E. Hambrusch, Hyeong-Seok Lim
    Minimizing Broadcast Costs Under Edge Reductions in Tree Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:93-117 [Journal]
  29. Susanne E. Hambrusch, Chuan-Ming Liu, Walid G. Aref, Sunil Prabhakar
    Efficient query execution on broadcasted index tree structures. [Citation Graph (0, 0)][DBLP]
    Data Knowl. Eng., 2007, v:60, n:3, pp:511-529 [Journal]
  30. Dmitri V. Kalashnikov, Sunil Prabhakar, Susanne E. Hambrusch
    Main Memory Evaluation of Monitoring Queries Over Moving Objects. [Citation Graph (0, 0)][DBLP]
    Distributed and Parallel Databases, 2004, v:15, n:2, pp:117-135 [Journal]
  31. Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambrusch, Andrew Rau-Chaplin
    Parallelizing the Data Cube. [Citation Graph (0, 0)][DBLP]
    Distributed and Parallel Databases, 2002, v:11, n:2, pp:181-201 [Journal]
  32. Mikhail J. Atallah, Susanne E. Hambrusch
    Solving Tree Problems on a Mesh-Connected Processor Array [Citation Graph (0, 0)][DBLP]
    Information and Control, 1986, v:69, n:1-3, pp:168-187 [Journal]
  33. Alberto Apostolico, Susanne E. Hambrusch
    Finding Maximum Cliques on Circular-Arc Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:4, pp:209-215 [Journal]
  34. Greg N. Frederickson, Susanne E. Hambrusch, Hung-Yi Tu
    Shortest Path Computations in Source-Deplanarized Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:47, n:2, pp:71-75 [Journal]
  35. Ajay K. Gupta, Susanne E. Hambrusch
    Optimal Three-Dimensional Layouts of Complete Binary Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:2, pp:99-104 [Journal]
  36. Susanne E. Hambrusch, Chuan-Ming Liu
    Data replication in static tree structures. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:4, pp:197-202 [Journal]
  37. Susanne E. Hambrusch, Michael Luby
    Parallel Asynchronous Connected Components in a Mesh. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:38, n:5, pp:257-263 [Journal]
  38. Susanne E. Hambrusch, Chuan-Ming Liu, Sunil Prabhakar
    Broadcasting and querying multi-dimensional index trees in a multi-channel environment. [Citation Graph (0, 0)][DBLP]
    Inf. Syst., 2006, v:31, n:8, pp:870-886 [Journal]
  39. Mikhail J. Atallah, Susanne E. Hambrusch
    On Bipartite Matchings of Minimum Density. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:4, pp:480-502 [Journal]
  40. Yukon Chang, Susanne E. Hambrusch, Janos Simon
    On the Computational Complexity of Continuous Routing. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1989, v:10, n:1, pp:86-108 [Journal]
  41. Susanne E. Hambrusch, Hung-Yi Tu
    Edge Weight Reduction Problems in Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:1, pp:66-93 [Journal]
  42. Susanne E. Hambrusch, Chuan-Ming Liu, Hyeong-Seok Lim
    Clustering in Trees: Optimizing Cluster Sizes and Number of Subtrees. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2000, v:4, n:4, pp:- [Journal]
  43. Frank K. H. A. Dehne, Susanne E. Hambrusch
    Parallel Algorithms for Determining k-Width Connectivity in Binary Images. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1991, v:12, n:1, pp:12-23 [Journal]
  44. Concettina Guerra, Susanne E. Hambrusch
    Parallel Algorithms for Line Detection on a Mesh. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1989, v:6, n:1, pp:1-19 [Journal]
  45. Ajay K. Gupta, Susanne E. Hambrusch
    Multiple Network Embedding into Hypercubes. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1993, v:19, n:2, pp:73-82 [Journal]
  46. Susanne E. Hambrusch, Xin He, Russ Miller
    Parallel Algorithms for Gray-Scale Digitized Picture Component Labeling on a Mesh-Connected Computer. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:20, n:1, pp:56-68 [Journal]
  47. Susanne E. Hambrusch, Ashfaq A. Khokhar
    C3: A Parallel Model for Coarse-Grained Machines. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:32, n:2, pp:139-154 [Journal]
  48. Ashfaq A. Khokhar, Susanne E. Hambrusch, Erturk Dogan Kocalar
    Termination detection in data-driven parallel computations/applications. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2003, v:63, n:3, pp:312-326 [Journal]
  49. Susanne E. Hambrusch, Bruce M. Maggs
    Editors' Foreword. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1999, v:32, n:3, pp:211- [Journal]
  50. Ajay K. Gupta, Susanne E. Hambrusch
    Load balanced tree embeddings. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1992, v:18, n:6, pp:595-614 [Journal]
  51. Susanne E. Hambrusch, Farooq Hameed, Ashfaq A. Khokhar
    Communication Operations on Coarse-Grained Mesh Architectures. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1995, v:21, n:5, pp:731-752 [Journal]
  52. Susanne E. Hambrusch, Hyeong-Seok Lim
    Minimizing the Diameter in Tree Networks Under Edge Reductions. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1999, v:9, n:3, pp:361-371 [Journal]
  53. Susanne E. Hambrusch
    VLSI Algorithms for the Connected Component Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:2, pp:354-365 [Journal]
  54. Susanne E. Hambrusch, Janos Simon
    Solving Undirected Graph Problems on VLSI. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:3, pp:527-544 [Journal]
  55. 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 Scott Vitter, Xiang Zhang
    The Indiana Center for Database Systems at Purdue University. [Citation Graph (0, 0)][DBLP]
    SIGMOD Record, 2005, v:34, n:2, pp:53-58 [Journal]
  56. Mikhail J. Atallah, Susanne E. Hambrusch
    Optimal Rotation Problems in Channel Routing. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1986, v:35, n:9, pp:843-847 [Journal]
  57. Ajay K. Gupta, Susanne E. Hambrusch
    Embedding Complete Binary Trees into Butterfly Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1991, v:40, n:7, pp:853-863 [Journal]
  58. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2002, v:51, n:10, pp:1124-1140 [Journal]
  59. Susanne E. Hambrusch
    Channel Routing Algorithms for Overlap Models. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1985, v:4, n:1, pp:23-30 [Journal]
  60. Susanne E. Hambrusch, Ashfaq A. Khokhar, Yi Liu
    Scalable S-To-P Broadcasting on Message-Passing MPPs. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1998, v:9, n:8, pp:758-768 [Journal]
  61. Sarvjeet Singh, Chris Mayfield, Sunil Prabhakar, Rahul Shah, Susanne E. Hambrusch
    Indexing Uncertain Categorical Data. [Citation Graph (0, 0)][DBLP]
    ICDE, 2007, pp:616-625 [Conf]

  62. The Orion Uncertain Data Management System. [Citation Graph (, )][DBLP]


  63. OLAP for Trajectories. [Citation Graph (, )][DBLP]


  64. Database Support for Probabilistic Attributes and Tuples. [Citation Graph (, )][DBLP]


  65. The present and future of computational thinking. [Citation Graph (, )][DBLP]


  66. Using peer-led team learning to increase participation and success of under-represented groups in introductory computer science. [Citation Graph (, )][DBLP]


  67. A multidisciplinary approach towards computational thinking for science majors. [Citation Graph (, )][DBLP]


  68. Computational thinking in high school courses. [Citation Graph (, )][DBLP]


  69. Orion 2.0: native support for uncertain data. [Citation Graph (, )][DBLP]


  70. Query Selectivity Estimation for Uncertain Data. [Citation Graph (, )][DBLP]


  71. New clique and independent set algorithms for circle graphs. [Citation Graph (, )][DBLP]


Search in 0.051secs, Finished in 0.055secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002