| Title/Authors | Title | Research Artifacts
[?] A research
artifact is any by-product of a research project that is not
directly included in the published research paper. In Computer
Science research this is often source code and data sets, but
it could also be media, documentation, inputs to proof
assistants, shell-scripts to run experiments, etc.
|
Details |
|---|
|
Distributed Partial Clustering Sudipto Guha, Yi Li, Qin Zhang |
Distributed Partial Clustering Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Björn Feldkord, Friedhelm Meyer auf der Heide |
Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Brief Announcement: Complete Visibility for Oblivious Robots in Linear Time Gokarna Sharma, Costas Busch, Supratik Mukhopadhyay |
Brief Announcement: Complete Visibility for Oblivious Robots in Linear Time Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource Peter Kling, Alexander Mäcker, Sören Riechers, Alexander Skopalik |
Sharing is Caring: Multiprocessor Scheduling with a Sharable Resource Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
Some Sequential Algorithms are Almost Always Parallel Guy E. Blelloch |
Some Sequential Algorithms are Almost Always Parallel Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Swarm-based Incast Congestion Control in Datacenters Serving Web Applications Haoyu Wang, Haiying Shen, Guoxin Liu |
Swarm-based Incast Congestion Control in Datacenters Serving Web Applications Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs Colin Cooper, Tomasz Radzik, Nicolas Rivera |
Improved Cover Time Bounds for the Coalescing-Branching Random Walk on Graphs Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing Laxman Dhulipala, Guy E. Blelloch, Julian Shun |
Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Brief Announcement: Graph Matching in Massive Datasets Soheil Behnezhad, Mahsa Derakhshan, Hossein Esfandiari, Elif Tan, Hadi Yami |
Brief Announcement: Graph Matching in Massive Datasets Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Brief Announcement: Scheduling Parallelizable Jobs Online to Maximize Throughput Kunal Agrawal, Jing Li, Kefu Lu, Benjamin Moseley |
Brief Announcement: Scheduling Parallelizable Jobs Online to Maximize Throughput Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
On Energy Conservation in Data Centers Susanne Albers |
On Energy Conservation in Data Centers Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Marcin Bienkowski, Jan Marcinkowski, Maciej Pacut, Stefan Schmid, Aleksandra Spyra |
Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Is Our Model for Contention Resolution Wrong?: Confronting the Cost of Collisions William C. Anderton, Maxwell Young |
Is Our Model for Contention Resolution Wrong?: Confronting the Cost of Collisions Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Optimal Reissue Policies for Reducing Tail Latency Tim Kaler, Yuxiong He, Sameh Elnikety |
Optimal Reissue Policies for Reducing Tail Latency Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Brief Announcement: Towards Fault-Tolerant Bin Packing for Online Cloud Resource Allocation Chuanyou Li, Xueyan Tang |
Brief Announcement: Towards Fault-Tolerant Bin Packing for Online Cloud Resource Allocation Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Lower Bounds in the Asymmetric External Memory Model Riko Jacob, Nodari Sitchinava |
Lower Bounds in the Asymmetric External Memory Model Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Matrix Multiplication, a Little Faster Elaye Karstadt, Oded Schwartz |
Matrix Multiplication, a Little Faster Details |
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
|
Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation Umut A. Acar, Vitaly Aksenov, Sam Westrick |
Brief Announcement: Parallel Dynamic Tree Contraction via Self-Adjusting Computation Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Brief Announcement: Extending Transactional Memory with Atomic Deferral Tingzhe Zhou, Victor Luchangco, Michael F. Spear |
Brief Announcement: Extending Transactional Memory with Atomic Deferral Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Fast Scheduling in Distributed Transactional Memory Costas Busch, Maurice Herlihy, Miroslav Popovic, Gokarna Sharma |
Fast Scheduling in Distributed Transactional Memory Details |
|
Author Comments:
Discussion Comments:
0
Sharing:
Research produced no artifacts
Verification:
Authors have
verified
information
|
|
Brief Announcement: Hazard Eras - Non-Blocking Memory Reclamation Pedro Ramalhete, Andreia Correia |
Brief Announcement: Hazard Eras - Non-Blocking Memory Reclamation Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Asymptotically Optimal Approximation Algorithms for Coflow Scheduling Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman |
Asymptotically Optimal Approximation Algorithms for Coflow Scheduling Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Bounding Laconic Proof Systems by Solving CSPs in Parallel Jason Li, Ryan O'Donnell |
Bounding Laconic Proof Systems by Solving CSPs in Parallel Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Yuan Tang, Shiyi Wang |
Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs Shahbaz Khan |
Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack Tobias Friedrich, Sven Ihde, Christoph Keßler, Pascal Lenzner, Stefan Neubert, David Schumann |
Brief Announcement: Efficient Best Response Computation for Strategic Network Formation under Attack Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Concurrent Data Structures for Near-Memory Computing Zhiyu Liu, Irina Calciu, Maurice Herlihy, Onur Mutlu |
Concurrent Data Structures for Near-Memory Computing Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms Rezaul Chowdhury, Pramod Ganapathi, Yuan Tang, Jesmin Jahan Tithi |
Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Brief Announcement: Meeting the Challenges of Parallelizing Sequential Programs Rohit Atre, Ali Jannesari, Felix Wolf |
Brief Announcement: Meeting the Challenges of Parallelizing Sequential Programs Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Beyond P vs. NP: Quadratic-Time Hardness for Big Data Problems Piotr Indyk |
Beyond P vs. NP: Quadratic-Time Hardness for Big Data Problems Details |
|
Discussion Comments:
0
Verification:
Author has
not verified
information
|
|
Bicriteria Distributed Submodular Maximization in a Few Rounds Alessandro Epasto, Vahab S. Mirrokni, Morteza Zadimoghaddam |
Bicriteria Distributed Submodular Maximization in a Few Rounds Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Tight Bounds for Clairvoyant Dynamic Bin Packing Yossi Azar, Danny Vainstein |
Tight Bounds for Clairvoyant Dynamic Bin Packing Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
A Communication-Avoiding Parallel Algorithm for the Symmetric Eigenvalue Problem Edgar Solomonik, Grey Ballard, James Demmel, Torsten Hoefler |
A Communication-Avoiding Parallel Algorithm for the Symmetric Eigenvalue Problem Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Impact of Knowledge on Election Time in Anonymous Networks Yoann Dieudonné, Andrzej Pelc |
Impact of Knowledge on Election Time in Anonymous Networks Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
David Eppstein, Michael T. Goodrich |
Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Distributed Graph Clustering by Load Balancing He Sun, Luca Zanetti |
Distributed Graph Clustering by Load Balancing Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Minimizing Total Weighted Flow Time with Calibrations Vincent Chau, Minming Li, Samuel McCauley, Kai Wang |
Minimizing Total Weighted Flow Time with Calibrations Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers: Extended Abstract Richard Cole, Vijaya Ramachandran |
Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers: Extended Abstract Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Distributed Detection of Cycles Pierre Fraigniaud, Dennis Olivetti |
Distributed Detection of Cycles Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Randomized Composable Coresets for Matching and Vertex Cover Sepehr Assadi, Sanjeev Khanna |
Randomized Composable Coresets for Matching and Vertex Cover Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Brief Announcement: A New Improved Bound for Coflow Scheduling Mehrnoosh Shafiee, Javad Ghaderi |
Brief Announcement: A New Improved Bound for Coflow Scheduling Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Hand-Over-Hand Transactions with Precise Memory Reclamation Tingzhe Zhou, Victor Luchangco, Michael F. Spear |
Hand-Over-Hand Transactions with Precise Memory Reclamation Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Online Flexible Job Scheduling for Minimum Span Runtian Ren, Xueyan Tang |
Online Flexible Job Scheduling for Minimum Span Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Almost Optimal Streaming Algorithms for Coverage Problems MohammadHossein Bateni, Hossein Esfandiari, Vahab S. Mirrokni |
Almost Optimal Streaming Algorithms for Coverage Problems Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Optimal Local Buffer Management for Information Gathering with Adversarial Traffic Stefan Dobrev, Manuel Lafond, Lata Narayanan, Jaroslav Opatrny |
Optimal Local Buffer Management for Information Gathering with Adversarial Traffic Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Brief Announcement: Hardware Transactional Storage Class Memory Ellis Giles, Kshitij Doshi, Peter J. Varman |
Brief Announcement: Hardware Transactional Storage Class Memory Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|
|
Antje Bjelde, Max Klimm, Daniel Schmand |
Details |
|
Discussion Comments:
0
Verification:
Authors have
not verified
information
|