Selected Publications

I am currently working in the field of distributed computing and algorithms: e.g. data dissemination and Internet robotics.

This is a list of my publications. Some belong to a previous life.

Send me e-mail at vliberatore@acm.org to request papers not available on-line.

Multicast-Based Data Dissemination

• Q. Cai and V. Liberatore. Layered Multicast Scheduling for the L_¥ Objective. Proceedings of the Eighteenth ACM-SIAM Symposium on Discrete Algorithms (SODA 07).
• Jonathan Beaver's thesis
• Application-Perceived Multicast Push Performance (with W. Zhang and W. Li). To appear in IPDPS 2004.
• Middleware for Scalable Data Dissemination (with P. K. Chrysanthis and K. Pruhs). Middleware for Communications, Q. H. Mahmoud Ed., 2003.
• An Optimized Multicast-based Data Dissemination Middleware. (with W. Li, V. Penkrot, S. Roychowdhury, W. Zhang, P. K. Chrysanthis, and K. Pruhs). In ICDE 2003 (demo session).
• Middleware Support for Multicast-Based Data Dissemination: A Working Reality (with P. K. Chrysanthis and K. Pruhs). Preliminary Version. In WORDS 2003.
• Circular Arrangements. Tech. Rep. EECS-02-11, CWRU (Revised version in ICALP 2002).
• A Recursion-based Broadcast Paradigm in Wormhole Routed Mesh/Torus Networks (with X. Zhuang). In IPDPS 2002.
• Multicast Scheduling for List Requests. In Infocom 2002, 1129-1137.
• Broadcast Scheduling for Set Requests. In DIMACS Workshop on Resource Management and Scheduling in Next Generation Networks, 2001. Talk slides.
• Congestion control for low-priority filler traffic. (with Brian Ott and Tim Warnky). In Quality of Service over Next Generation Internet, SPIE ITCom 2003, 73-82.
• Dynamics and Characteristics of Filler Traffic (Thesis by Nasser Alzeidi), abridged version (source files).
• Effects of Filler Traffic in IP Networks. In DIMACS Mini-Workshop on Quality of Service Issues in the Internet, 2001.
• Pushing Politely: Improving Web Responsiveness One Packet at a Time (with Brian D. Davison). Tech. Rep. DCS-TR-415, 2000. Abstract. Revised version in PAWS 00, Talk slides.
• Scheduling Jobs Before Shut-Down. Tech. Rep. 99-72, 1999, UMIACS. Abstract. Revised versions in SWAT 2000 and © Nordic Journal of Computing
• Data Dissemination on the Web: Speculative and Unobtrusive (with Brian D. Davison). Tech. Rep. 99-23, 1999, UMIACS. Abstract. (Revised version appeared in Performance Evaluation Letters).
  
• Caching and Scheduling for Broadcast Disk Systems. Tech. Rep. 98-71, 1998, UMIACS. Abstract. (Revised version to appear in ALENEX 2000 and in the Journal of Experimental Algorithmics). Talk slides [Microsoft Explorer, PNG].
• Broadcast Disk Paging with a Small Cache, Tech. Rep. TR98-36, 1998, DIMACS. Abstract.
• On Broadcast Disk Paging © SIAM (with Sanjeev Khanna), SIAM Journal on Computing.

Internet Robotics and Network Control Systems

• Local Flow Separation. IWQoS 2004.
• Pervasive Computing (Slides from a talk at ABB, January 2004).
• Network Adaptive Pervasive Applications. Workshop on Ubiquitous Computing Environments, 2003.
  
• IP Communication and Distributed Agents for Unmanned Autonomous Vehicles (with W. S. Newman and K. Bhasin). AIAA-UAV 2003.
• Networked Control System Co-Simulation for Co-Design (with M. S. Branicky and S. Phillips). American Control Conference (ACC03). (Talk slides.)
• Compliant Control and Software Agents for Internet Robotics (with A. Al-Hammouri, D. Rosas, A. Covitch, M. Kose, and W. S. Newman). Eighth IEEE International Workshop on Object-oriented Real-time Dependable Systems (WORDS 2003). (Preliminary version).
• An Experiment in Remote Robotics (with L. Ngai and W. S. Newman), In ICRA 2002, 2190-2195.
• Scheduling of Network Access for Feedback-Based Embedded Systems. In Quality of Service over Next Generation Internet, SPIE ITCom 2002, 73-82.

Modeling

• Randomization Constrained. Tech. Rep. 02-14, EECS CWRU.
• Empirical Investigation of the Markov Reference Model. (In SODA 99).

Register Allocation

• Hardness and Algorithms for Local Register Allocation (with Martin Farach and Ulrich Kremer), Tech. Rep. DCS-TR-332, 1997. Abstract. Revised version in CC 99.
• On Local Register Allocation (with Martin Farach), Tech. Rep. TR97-33, 1997, DIMACS. Abstract. (Short version in SODA 98, final version in the special issues of the Journal of Algorithms on SODA 98).

Others

• The minimum backlog problem (with M. A. Bender, S. P. Fekete, A. Kröller, V. Liberatore, J. S. B. Mitchell, V. Polishchuk, and J. Suomela)
• Efficient Application Placement in a Dynamic Hosting Platform (with Z. Al-Qudah, M. Allman, and M. Rabinovich), WWW 2009.
• Detecting AAA Vulnerabilities by Mining Execution Profiles (with Zhan Xu, David Leon, and Andy Poidgurski), IEEE Symposium on Security and Privacy, 2004.
• Multi-Criteria Space Based Internet Routing (with B. Malakooti, M. Griffith, T. Linsky, and N. Malakooti). To appear in IERC 2004.
• Uniform Multipaging Reduces to Paging, Tech. Rep. TR97-69, 1997, DIMACS. Abstract. In Information Processing Letters, 67 (1998) 9-12.
• Analysis of An Approach for the Set Maxima Problem. Tech. Rep. LCSR-TR-284, 1997. Abstract. (Short version in SODA 98).
• Learning to Prove: A Taxonomy of Objectives. In Proc. DIMACS Symposium on Teaching Logic and Reasoning in an Illogical World.
• The List Update Problem and the Retrieval of Sets (with Fabrizio d'Amore), Theoretical Computer Science, 130, (1994), 101-123. Abstract.

Doctoral Thesis

Home Page of Vincenzo Liberatore