The goal of www.abstract-talk.org is to promote the work of the scientific community and to facilitate the easy exchange of new ideas and new research. We believe that using podcasts and short, informal discussions and talks we can increases the visibility of research to people inside and outside the respective research community. A podcast episode can be a chat about a new paper, a new book or a discussion or interview about a research topic. These episodes also provide an opportunity to learn about new work for researchers that cannot attend conferences and for students new to the field.
We would like this site to become a collaborative effort of the scientific community and we invite researchers from all areas of science and technology who wish to speak about their work or to interview another researcher to submit short podcasts / interviews targeted at a broad audience.
- Fault Tolerant Approximate BFS Trees
- A Polynomial-time Approximation Scheme for Fault-tolerant Distributed Storage
- Lower Bounds for Distinct Elements in the Message Passing Model
- Improved bounds and algorithms for graph cuts and network reliability
- Convergence in (Social) Influence Networks
- A Super-Fast Distributed Algorithm for Bipartite Metric Facility Location
- Sleeping Experts in Wireless Networks
- On the Precision of Social and Information Networks
- Social Resilience in Online Communities: The Autopsy of Friendster
- Frequency Hopping against a Powerful Adversary
- Conflict Resolution and Membership Problem in Beeping Channels
- Braess’s Paradox in Wireless Networks: The Danger of Improved Technology