Home
Papertalks
About
Help
Improve
Upload
Login
Register
Login Required
×
You have to login to use this feature.
Title
Abstract
Keywords
Authors
exact
AAAI 2021
AACL 2020
ACCV 2020
ACL 2020
ACL Workshops
ACM-CHIL 2020
ACML 2020
AISTATS 2020
AISTATS 2021
AKBC 2020
BMVC 2020
BMVC 2021
CHI 2020
CIKM 2020
COLING 2020
COLING Workshops 2020
COLT 2020
COLT 2021
CoRL 2020
CVPR 2020
DCASE 2020
EACL 2021
ECML PKDD 2020
EMNLP 2020
ESWC 2020
FOCI 2020
HotCloud 2020
HotEdge 2020
HotStorage 2020
ICALP 2020
ICAPS 2020
ICFP 2020
ICLR 2020
ICLR 2021
ICML 2020
ICML 2021
ICN 2020
ICWSM 2020
ICWSM 2021
IJCAI 2021
ISMIR 2020
KDD 2020
KR 2020
L@S 2020
MIDL 2020
MLHC 2020
MLSYS 2021
MSML 2020
MSR 2020
NeurIPS 2020
NeurIPS 2021
OOPSLA 2020
OpML 2020
OSDI 2020
PLDI 2020
PLDI 2021
PODC 2020
POPL 2020
RECSYS 2020
SIGCOMM 2020
SIGDIAL 2020
SIGGRAPH 2020
SIGIR 2020
SOUPS 2020
SPAA 2020
STOC 2020
UAI 2020
USENIX ATC 2020
USENIX Security 2020
WACV 2021
WOOT 2020
PODC 2020
Arts and Music
Biology
Chemistry
Computer Science
Economics
Engineering
Geoscience
History
Law
Humanities
Mathematics
Medical Sciences
Neuroscience
Physics
Politics
Psychology
Social Sciences
All dates
Today
Last week
Last month
Last year
Reset
Hide
Hide
Hide
Sort by:
Default
Date (upload)
Date (paper)
Likes
Stars
Views
Duration
Random
Search match
66
papertalks found
03/08/2020
Brief announcement: Hazard pointer protection of structures with immutable links
Maged M. Michael
Keywords
Abstract
Paper
hazard pointer
,
concurrent algorithm
,
safe reclamation
8:48
03/08/2020
Simple, deterministic, constant-round coloring in the congested clique
Artur Czumaj
,
Peter Davies
,
Merav Parter
Keywords
Abstract
Paper
derandomization
,
congested clique
,
massively parallel computation
,
coloring
24:57
03/08/2020
Perigee: Efficient peer-to-peer network design for blockchains
Yifan Mao
,
Soubhik Deb
,
Shaileshh Bojja Venkatakrishnan
and
Sreeram Kannan
,
Kannan Srinivasan
Keywords
Abstract
Paper
blockchain
,
peer-to-peer
,
multi-armed bandit
,
topology
21:00
03/08/2020
Lower bounds for distributed sketching of maximal matchings and maximal independent sets
Sepehr Assadi
,
Gillat Kol
,
Rotem Oshman
Keywords
Abstract
Paper
distributed sketching
,
communication complexity
,
maximal matching
,
maximal independent set
,
broadcast congested clique
24:10
03/08/2020
Can uncoordinated beeps tell stories?
Fabien Dufoulon
,
Janna Burman
,
Joffroy Beauquier
Keywords
Abstract
Paper
local message broadcast
,
beeping model
,
interference control
,
uncoordinated starts
23:49
03/08/2020
Computing shortest paths and diameter in the hybrid network model
Fabian Kuhn
,
Philipp Schneider
Keywords
Abstract
Paper
27:41
03/08/2020
Beyond alice and bob: Improved inapproximability for maximum independent set in CONGEST
Yuval Efron
,
Ofer Grossman
,
Seri Khoury
Keywords
Abstract
Paper
21:10
03/08/2020
How much does randomness help with locally checkable problems?
Alkida Balliu
,
Sebastian Brandt
,
Dennis Olivetti
,
Jukka Suomela
Keywords
Abstract
Paper
distributed computational complexity
,
LOCAL model
,
locally checkable labeling problems
24:29
03/08/2020
Brief announcement: On implementing software transactional memory in the c++ memory model
Matthew Rodriguez
,
Michael Spear
Keywords
Abstract
Paper
speculation
,
C++
,
transactional memory
,
synchronization
9:54
03/08/2020
On the subject of non-equivocation: Defining non-equivocation in synchronous agreement systems
Mads Frederik Madsen
,
Søren Debois
Keywords
Abstract
Paper
synchronous systems
,
agreement
,
non-equivocation
,
fault tolerance
22:43
03/08/2020
Efficient and simple algorithms for fault-tolerant spanners
Michael Dinitz
,
Caleb Robelle
Keywords
Abstract
Paper
fault-tolerance
,
spanners
24:26
03/08/2020
Probably approximately knowing
Yoram Moses
,
Nitzan Zamir
Keywords
Abstract
Paper
probabilistic constraints
,
locality of information
,
probabilistic protocols
,
probabilistic beliefs
18:35
03/08/2020
Distributed construction of light networks
Michael Elkin
,
Arnold Filtser
,
Ofer Neiman
Keywords
Abstract
Paper
shallow light tree
,
CONGEST
,
light spanners
,
doubling dimension
19:50
03/08/2020
Efficient deterministic distributed coloring with small bandwidth
Philipp Bamberger
,
Fabian Kuhn
,
Yannic Maus
Keywords
Abstract
Paper
CONGEST model
,
massively parallel computation
,
deterministic vertex coloring
17:41
03/08/2020
Genuinely distributed byzantine machine learning
El-Mahdi El-Mhamdi
,
Rachid Guerraoui
,
Arsany Guirguis
and
Lê Nguyên Hoang
,
Sébastien Rouault
Keywords
Abstract
Paper
distributed machine learning
,
byzantine parameter servers
,
byzantine fault tolerance
22:05
03/08/2020
The energy complexity of BFS in radio networks
Yi-Jun Chang
,
Varsha Dani
,
Thomas P. Hayes
,
Seth Pettie
Keywords
Abstract
Paper
sensor networks
,
distributed computing
,
graph algorithms
,
radio networks
,
energy-aware computing
23:46
03/08/2020
Revisiting asynchronous fault tolerant computation with optimal resilience
Ittai Abraham
,
Danny Dolev
,
Gilad Stern
Keywords
Abstract
Paper
23:38
03/08/2020
Sleeping is efficient: MIS in o(1)-rounds node-averaged awake complexity
Soumyottam Chatterjee
,
Robert Gmyr
,
Gopal Pandurangan
Keywords
Abstract
Paper
energy-efficiency
,
maximal independent set
,
sleeping model
,
node-averaged round complexity
,
awake complexity
,
resource-efficient algorithm
,
MIS
,
energy-efficient algorithm
28:27
03/08/2020
Distributed computation and reconfiguration in actively dynamic networks
Othon Michail
,
George Skretas
,
Paul G. Spirakis
Keywords
Abstract
Paper
polylogarithmic time
,
distributed algorithms
,
edge complexity
,
transformation
,
reconfiguration
,
dynamic networks
24:10
03/08/2020
Seeing far vs. Seeing wide: Volume complexity of local graph problems
Will Rosenbaum
,
Jukka Suomela
Keywords
Abstract
Paper
locally checkable labeling
,
hierarchy
,
LCL
,
volume complexity
,
query complexity
,
LOCAL model
19:57
03/08/2020
Brief announcement: Classification of distributed binary labeling problems
Alkida Balliu
,
Sebastian Brandt
,
Yuval Efron
and
Juho Hirvonen
,
Yannic Maus
,
Dennis Olivetti
,
Jukka Suomela
Keywords
Abstract
Paper
LOCAL model
,
locally checkable labeling problems
,
distributed computational complexity
,
graph problems
10:08
03/08/2020
Compact distributed certification of planar graphs
Laurent Feuilloley
,
Pierre Fraigniaud
,
Pedro Montealegre
and
Ivan Rapaport
,
Éric Rémila
,
Ioan Todinca
Keywords
Abstract
Paper
distributed graph algorithms
,
fault-tolerance
,
communication networks
17:02
03/08/2020
Upper and lower bounds on the space complexity of detectable objects
Ohad Ben-Baruch
,
Danny Hendler
,
Matan Rusanovsky
Keywords
Abstract
Paper
concurrent objects
,
recoverable algorithms
,
detectability
,
non-volatile memory
19:54
03/08/2020
Brief announcement: Optimal time and space leader election in population protocols
Petra Berenbrink
,
George Giakkoupis
,
Peter Kling
Keywords
Abstract
Paper
population protocols
,
leader election
,
stabilization time
11:25
03/08/2020
From bezout’s identity to space-optimal election in anonymous memory systems
Emmanuel Godard
,
Damien Imbs
,
Michel Raynal
,
Gadi Taubenfeld
Keywords
Abstract
Paper
equality-based comparison
,
bounded register
,
atomic register
,
process identity
,
symmetric algorithm
,
asynchrony
,
concurrent algorithm
,
bezout identity
,
symmetry breaking
,
leader election
,
RW register
,
anonymous register
18:26
03/08/2020
Self-stabilizing leader election in regular graphs
Hsueh-Ping Chen
,
Ho-Lin Chen
Keywords
Abstract
Paper
regular graphs
,
spanning tree
,
leader election
,
self-stabilizing
,
euler cycle
,
population protocols
19:10
03/08/2020
Distributed approximation on power graphs
Reuven Bar-Yehuda
,
Keren Censor-Hillel
,
Yannic Maus
and
Shreyas Pai
,
Sriram V. Pemmaraju
Keywords
Abstract
Paper
19:02
03/08/2020
Brief announcement: Round eliminator: A tool for automatic speedup simulation
Dennis Olivetti
Keywords
Abstract
Paper
locally checkable problems
,
round elimination
,
LOCAL model
,
speedup simulation
,
automatic lower bounds
,
automatic upper bounds
,
graph problems
10:28
03/08/2020
Brief announcement: Self-stabilizing systems in spite of high dynamics
Karine Altisen
,
Stéphane Devismes
,
Anaı̈s Durand
and
Colette Johnen
,
Franck Petit
Keywords
Abstract
Paper
self-stabilization
,
speculation
,
time-varying graphs
,
leader election
9:36
03/08/2020
Brief announcement: Intermediate value linearizability: A quantitative correctness criterion
Arik Rinberg
,
Idit Keidar
Keywords
Abstract
Paper
8:33
03/08/2020
Noisy beeps
Klim Efremenko
,
Gillat Kol
,
Raghuvansh R. Saxena
Keywords
Abstract
Paper
communication complexity
,
distributed systems
,
lower bounds
,
beeping models
,
error-correcting codes
,
interactive coding
21:36
03/08/2020
Want to gather? No need to chatter!
Sébastien Bouchard
,
Yoann Dieudonné
,
Andrzej Pelc
Keywords
Abstract
Paper
deterministic algorithm
,
anonymous mobile agent
,
gathering
19:01
03/08/2020
K-set agreement bounds in round-based models through combinatorial topology
Adam Shimi
,
Armando Castañeda
Keywords
Abstract
Paper
24:40
03/08/2020
Multiple source replacement path problem
Manoj Gupta
,
Rahul Jain
,
Nitiksha Modi
Keywords
Abstract
Paper
24:16
03/08/2020
Brief announcement: The only undoable CRDTs are counters
Stephen Dolan
Keywords
Abstract
Paper
8:49
03/08/2020
Brief announcement: Why extension-based proofs fail
Dan Alistarh
,
James Aspnes
,
Faith Ellen
and
Rati Gelashvili
,
Leqi Zhu
Keywords
Abstract
Paper
impossibility proofs
,
set agreement
,
valency arguments
8:45
03/08/2020
Positive aging admits fast asynchronous plurality consensus
Gregor Bankhamer
,
Robert Elsässer
,
Dominik Kaaser
,
Matjaž Krnc
Keywords
Abstract
Paper
positive aging
,
plurality consensus
,
tail bounds
,
asynchronicity
,
pólya-eggenberger distributions
27:24
03/08/2020
Brief announcement: On the significance of consecutive ballots in paxos
Eli Goldweber
,
Nuda Zhang
,
Manos Kapritsos
Keywords
Abstract
Paper
state machine replication
,
weakening
,
paxos
,
consensus
9:58
03/08/2020
Exponentially faster shortest paths in the congested clique
Michal Dory
,
Merav Parter
Keywords
Abstract
Paper
congested clique
,
shortest paths
,
near-additive emulator
23:50
03/08/2020
Recoverable mutual exclusion with constant amortized RMR complexity from standard primitives
David Yu Cheng Chan
,
Philipp Woelfel
Keywords
Abstract
Paper
shared memory
,
fetch and increment
,
recoverable mutual exclusion
,
asynchronous system
18:37
«
1
2
»