Home
Participants
Project Activities
Papers and Reports
Research Threads
Search

Pleiades
Assurance for modular and mobile code

Semantic Consistency in Information Exchange

ONR '97 MURI Project

Papers and Reports: 2001-2002

Security Protocols and Access Control

Mobile Code Security

Monitoring Real-Time and Distributed Systems

Analysis of Real-Time and Hybrid Systems

Complexity

  • H. Comon, V. Cortier, and J.C. Mitchell: "Tree Automata with one Memory, Set Constraints and Ping-Pong Protocols", in the Proceedings of the 28th International Colloquium on Automata, Languages and Programming - ICALP 2001, Crete, Greece, July 8-12, 2001.
  • T. Batu, S. Dasgupta, R. Kumar, and R. Rubinfeld: " The complexity of approximating the entropy", in the Proceedings of the 34th ACM Symposium on Theory of Computing - STOC '02, Montréal, Québec, Canada, May 19-21, 2002.
  • T. Batu, E. Fischer, L. Fortnow, R. Kumar, R. Rubinfeld, and, P. White: " Testing random variables for independence and identity", in the Proceedings of 42nd IEEE Conference on Foundations of Computer Science - FOCS 2001, Las Vegas, Nevada, USA, October 14-17, 2001.
  • R. Anderson, S. Kannan, H. Karloff, and R. Ladner: "A Polynomial Time Algorithm for Computing Optimal Binary Search Trees Using Two-way Comparisons", in the Proceedings of the 22nd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS '01), Bangalore, India, December 13-15, 2001.
  • J. Fong, A. Gilbert, S. Kannan, and M. Strauss: Better Alternatives to OSPF Routing, in the Proceedings of 2nd International Workshop on Approximation and Randomized Algorithms in Communication Networks - ARACNE 2001, BRICS, University of Aarhus, Denmark, August 27, 2001.

Adaptive Systems