☰

Costas Busch, Ph.D. - Publications

Affiliations: 
2000 Brown University, Providence, RI 
Tree Info Similar researchers PubMed Report error

37 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Pu L, Wu H, Wang C, Fang S, Mukhopadhyay S, Busch C. Novel Fast User-Placement Ushering Algorithms and Performance Analysis for LTE Femtocell Networks Ieee Transactions On Cognitive Communications and Networking. 6: 381-393. DOI: 10.1109/Tccn.2019.2937091  0.376
2020 Yan K, Wu H, Busch C, Zhang X. Graph representation of random signal and its application for sparse signal detection Digital Signal Processing. 96: 102586. DOI: 10.1016/J.Dsp.2019.102586  0.311
2019 Clements W, Busch C, Pu L, Smith D, Wu H. Balanced Parallel Exploration of Orthogonal Regions Algorithms. 12: 104. DOI: 10.3390/A12050104  0.35
2018 Busch C, Herlihy M, Popovic M, Sharma G. Time-communication impossibility results for distributed transactional memory Distributed Computing. 31: 471-487. DOI: 10.1007/S00446-017-0318-Y  0.604
2017 Sharma G, Busch C. The Bursty Steiner Tree Problem International Journal of Foundations of Computer Science. 28: 869-887. DOI: 10.1142/S0129054117500290  0.315
2016 Sharma G, Busch C. Near-optimal deterministic Steiner tree maintenance in sensor networks Acm Transactions On Sensor Networks. 12. DOI: 10.1145/2854155  0.476
2015 Sharma G, Krishnan H, Busch C, Brandt SR. Near-Optimal Location Tracking Using Sensor Networks International Journal of Networking and Computing. 5: 122-158. DOI: 10.15803/Ijnc.5.1_122  0.4
2015 Sharma G, Busch C, Mukhopadhyay S, Malveaux C. Tight analysis of a collisionless robot gathering algorithm Ieee International Conference On Intelligent Robots and Systems. 2015: 5189-5194. DOI: 10.1145/3056460  0.343
2015 Busch C, Herlihy M, Popovic M, Sharma G. Impossibility results for distributed transactional memory Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 2015: 207-215. DOI: 10.1145/2767386.2767433  0.473
2015 Sharma G, Busch C. Distributed queuing in dynamic networks Parallel Processing Letters. 25. DOI: 10.1142/S012962641550005X  0.463
2015 Sharma G, Busch C. Optimal nearest neighbor queries in sensor networks Theoretical Computer Science. 608: 146-165. DOI: 10.1016/J.Tcs.2015.05.006  0.445
2015 Sharma G, Busch C. A load balanced directory for distributed shared memory objects Journal of Parallel and Distributed Computing. 78: 6-24. DOI: 10.1016/J.Jpdc.2015.02.002  0.407
2015 Sharma G, Busch C, Vaidyanathan R, Rai S, Trahan JL. Efficient transformations for Klee's measure problem in the streaming model Computational Geometry: Theory and Applications. 48: 688-702. DOI: 10.1016/J.Comgeo.2015.06.007  0.343
2015 Sharma G, Busch C. An Analysis Framework for Distributed Hierarchical Directories Algorithmica. 71: 377-408. DOI: 10.1007/S00453-013-9803-2  0.449
2014 Sharma G, Busch C. Transactional memory: models and algorithms Sigact News. 45: 74-103. DOI: 10.1145/2636805.2636824  0.318
2014 Busch C, Lafortune R, Tirthapura S. Sparse covers for planar graphs and graphs that exclude a fixed minor Algorithmica. 69: 658-684. DOI: 10.1007/S00453-013-9757-4  0.674
2014 Sharma G, Busch C. Distributed transactional memory for general networks Distributed Computing. 27: 329-362. DOI: 10.1007/S00446-014-0214-7  0.445
2012 Srinivasagopalan S, Busch C, Iyengar SS. An Oblivious Spanning Tree for Single-Sink Buy-at-Bulk in Low Doubling-Dimension Graphs Ieee Transactions On Computers. 61: 700-712. DOI: 10.1109/Tc.2011.64  0.42
2012 Busch C, Kannan R, Vasilakos AV. Approximating Congestion + Dilation in Networks via "Quality of Routing” Games Ieee Transactions On Computers. 61: 1270-1283. DOI: 10.1109/Tc.2011.145  0.364
2012 Sharma G, Busch C. A Competitive Analysis for Balanced Transactional Memory Workloads Algorithmica. 63: 296-322. DOI: 10.1007/S00453-011-9532-3  0.408
2012 Sharma G, Busch C. Window-based greedy contention management for transactional memory: theory and practice Distributed Computing. 25: 225-248. DOI: 10.1007/S00446-012-0159-7  0.419
2010 Busch C, Tirthapura S. Concurrent counting is harder than queuing Theoretical Computer Science. 411: 3823-3833. DOI: 10.1016/J.Tcs.2010.07.002  0.663
2010 Busch C, Mavronicolas M. An efficient counting network Theoretical Computer Science. 411: 3001-3030. DOI: 10.1016/J.Tcs.2010.04.023  0.367
2009 Busch C, Magdon-Ismail M. Atomic routing games on maximum congestion Theoretical Computer Science. 410: 3337-3347. DOI: 10.1016/J.Tcs.2009.04.015  0.389
2008 Busch C, Magdon-lsmail M, Xi J. Optimal Oblivious Path Selection on the Mesh Ieee Transactions On Computers. 57: 660-671. DOI: 10.1109/Tc.2008.23  0.422
2008 Busch C, Magdon-Ismail M, Sivrikaya F, Yener B. Contention-free MAC protocols for asynchronous wireless sensor networks Distributed Computing. 21: 23-42. DOI: 10.1007/S00446-007-0053-X  0.377
2008 Xu B, Tirthapura S, Busch C. Sketching asynchronous data streams over sliding windows Distributed Computing. 20: 359-374. DOI: 10.1007/S00446-007-0048-7  0.656
2007 Busch C, Magdon-Ismail M, Mavronicolas M. Universal bufferless packet switching Siam Journal On Computing. 37: 1139-1162. DOI: 10.1137/050642095  0.474
2007 Busch C, Magdon-Ismail M, Mavronicolas M. Efficient bufferless packet switching on trees and leveled networks Journal of Parallel and Distributed Computing. 67: 1168-1186. DOI: 10.1016/J.Jpdc.2007.06.005  0.479
2005 Busch C, Tirthapura S. Analysis of Link Reversal Routing Algorithms Siam Journal On Computing. 35: 305-326. DOI: 10.1137/S0097539704443598  0.693
2005 Busch C, Mavronicolas M, Spirakis P. The cost of concurrent, low-contention Read&Modify&Write Theoretical Computer Science. 333: 373-400. DOI: 10.1016/J.Tcs.2004.04.018  0.407
2004 Busch C, Magdon-Ismail M, Mavronicolas M, Spirakis P. Direct routing: Algorithms and complexity Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3221: 134-145. DOI: 10.1007/S00453-005-1189-3  0.45
2004 Busch C. Õ(Congestion + Dilation) Hot-Potato Routing on Leveled Networks Theory of Computing Systems \/ Mathematical Systems Theory. 37: 371-396. DOI: 10.1007/S00224-004-1136-8  0.447
2002 Busch C, Demetriou N, Herlihy M, Mavronicolas M. Threshold counters with increments and decrements Theoretical Computer Science. 270: 811-826. DOI: 10.1016/S0304-3975(01)00113-X  0.546
2002 Busch C, Herlihy M. Sorting and counting networks of arbitrary width and small depth Theory of Computing Systems. 35: 99-128. DOI: 10.1007/S00224-001-1027-1  0.58
1997 Busch C, Mavronicolas M. Impossibility results for weak threshold networks Information Processing Letters. 63: 85-90. DOI: 10.1016/S0020-0190(97)00096-3  0.321
1996 Busch C, Mavronicolas M. A combinatorial treatment of balancing networks Journal of the Acm. 43: 794-839. DOI: 10.1145/234752.234754  0.383
Show low-probability matches.