A-212 (STCS Seminar Room)
How Easy/Hard it is to Schedule in Networks?
Correctness of Closed Nesting in Software Transactional Memory Systems
Synergistic Challenges in Data-Intensive Science and Exascale Computing
Probabilistic Approximation of Metrics by Tree Metrics
Probabilistic Programming: A Program Analysis Perspective
Topology of Some Random Complexes
Automated Analysis of Probabilistic Infinite-state Systems
Bridging the Gap: From Non-determinism to Determinism in UL
Fast Low Rank Approximation via Random Projections
Pages
