![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Journal of the ACM, Volume 54, 2007
Volume 54, Number 1, March 2007
- Martin Grohe
:
The complexity of homomorphism and constraint satisfaction problems seen from the other side. 1:1-1:24 - Jean-Pierre Jouannaud, Albert Rubio:
Polymorphic higher-order recursive path orderings. 2:1-2:48 - Nikhil Bansal, Tracy Kimbrel, Kirk Pruhs:
Speed scaling to manage energy and temperature. 3:1-3:39 - Sean Hallgren:
Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem. 4:1-4:19
Volume 54, Number 2, April 2007
- Sara Cohen
, Werner Nutt
, Yehoshua Sagiv:
Deciding equivalences among conjunctive aggregate queries. 5 - Jos C. M. Baeten, Flavio Corradini, Clemens Grabmayer:
A characterization of regular expressions under bisimulation. 6 - Jan A. Bergstra, John V. Tucker:
The rational numbers as an abstract data type. 7 - Vincent Danos, Elham Kashefi, Prakash Panangaden:
The measurement calculus. 8 - Dimitris Achlioptas, Frank McSherry:
Fast computation of low-rank matrix approximations. 9 - Dimitris Achlioptas, Assaf Naor, Yuval Peres:
On the maximum satisfiability of random formulas. 10
Volume 54, Number 3, June 2007
- Anupam Gupta, Amit Kumar
, Martin Pál, Tim Roughgarden:
Approximation via cost sharing: Simpler and better approximation algorithms for network design. 11 - Irit Dinur
:
The PCP theorem by gap amplification. 12 - Arne Andersson, Mikkel Thorup:
Dynamic ordered sets with exponential search trees. 13 - Vincent Conitzer, Tuomas Sandholm, Jérôme Lang:
When are elections with few candidates hard to manipulate?. 14 - Joseph Y. Halpern, Riccardo Pucella:
Characterizing and reasoning about probabilistic and non-probabilistic expectation. 15
Volume 54, Number 4, July 2007
- Jiangzhuo Chen
, Robert D. Kleinberg
, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta:
(Almost) Tight bounds and existence theorems for single-commodity confluent flows. 16 - Elitza N. Maneva
, Elchanan Mossel
, Martin J. Wainwright
:
A new look at survey propagation and its generalizations. 17 - Éric Colin de Verdière, Francis Lazarus:
Optimal pants decompositions and shortest homotopic cycles on an orientable surface. 18 - Stijn Vansummeren:
On deciding well-definedness for query languages on trees. 19 - Tero Harju
, Dirk Nowotka:
Periodicity and unbordered words: A proof of the extended duval conjecture. 20 - Mark Rudelson, Roman Vershynin:
Sampling from large matrices: An approach through geometric functional analysis. 21
Volume 54, Number 5, October 2007
- Aranyak Mehta, Amin Saberi, Umesh V. Vazirani, Vijay V. Vazirani:
AdWords and generalized online matching. 22 - Rafail Ostrovsky, Yuval Rabani
:
Low distortion embeddings for edit distance. 23 - Thomas Eiter, Kazuhisa Makino:
On computing all abductive explanations from a propositional Horn theory. 24 - Andrew Gilpin, Tuomas Sandholm:
Lossless abstraction of imperfect information games. 25 - Eijiro Sumii, Benjamin C. Pierce:
A bisimulation for type abstraction and recursion. 26
Volume 54, Number 6, December 2007
- Martin E. Dyer
, Leslie Ann Goldberg, Mike Paterson:
On counting homomorphisms to directed acyclic graphs. 27 - Mikkel Thorup:
Equivalence between priority queues and sorting. 28 - Ling Cheung, Mariëlle Stoelinga
, Frits W. Vaandrager:
A testing scenario for probabilistic processes. 29 - Faith Ellen, Panagiota Fatourou, Eric Ruppert:
Time lower bounds for implementations of multi-writer snapshots. 30 - Sibsankar Haldar, K. Vidyasankar:
On specification of Read/Write shared variables. 31 - Nick G. Duffield
, Carsten Lund, Mikkel Thorup:
Priority sampling for estimation of arbitrary subset sums. 32
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.