Sciweavers

Share
SIGMOD
2008
ACM
158views Database» more  SIGMOD 2008»
10 years 9 months ago
How NOT to review a paper: the tools and techniques of the adversarial reviewer
There are several useful guides available for how to review a paper in Computer Science [10, 6, 12, 7, 2]. These are soberly presented, carefully reasoned and sensibly argued. As ...
Graham Cormode
STOC
2004
ACM
158views Algorithms» more  STOC 2004»
10 years 10 months ago
Collective asynchronous reading with polylogarithmic worst-case overhead
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...
Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander ...
SPAA
2009
ACM
10 years 10 months ago
Buffer management for colored packets with deadlines
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Mosci...
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
10 years 10 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
WWW
2009
ACM
10 years 10 months ago
A geographical analysis of knowledge production in computer science
We analyze knowledge production in Computer Science by means of coauthorship networks. For this, we consider 30 graduate programs of different regions of the world, being 8 progra...
Alberto H. F. Laender, Guilherme Vale Menezes, Niv...

1
posts
with
2982
views
1558profile views Browse  My Posts »
VitaliyIndependent Researcher
Vitaliy
books