Campagne de collecte 15 septembre 2024 – 1 octobre 2024 C'est quoi, la collecte de fonds?

Volume 56; Issue 3

Journal of the ACM

Volume 56; Issue 3
1

Lower bounds for processing data with few random accesses to external memory

Grohe, Martin, Hernich, André, Schweikardt, Nicole
Journal:
Journal of the ACM
Année:
2009
Langue:
english
Fichier:
PDF, 554 KB
english, 2009
2

Two-variable logic on data trees and XML reasoning

Bojańczyk, Mikoaj, Muscholl, Anca, Schwentick, Thomas, Segoufin, Luc
Journal:
Journal of the ACM
Année:
2009
Langue:
english
Fichier:
PDF, 471 KB
english, 2009
3

Settling the complexity of computing two-player Nash equilibria

Chen, Xi, Deng, Xiaotie, Teng, Shang-Hua
Journal:
Journal of the ACM
Année:
2009
Langue:
english
Fichier:
PDF, 657 KB
english, 2009
4

A quasi-polynomial time approximation scheme for minimum weight triangulation

Remy, Jan, Steger, Angelika
Journal:
Journal of the ACM
Année:
2009
Langue:
english
Fichier:
PDF, 804 KB
english, 2009
5

Improved bounds on the average length of longest common subsequences

Lueker, George S.
Journal:
Journal of the ACM
Année:
2009
Langue:
english
Fichier:
PDF, 482 KB
english, 2009
7

Adding nesting structure to words

Alur, Rajeev, Madhusudan, P.
Journal:
Journal of the ACM
Année:
2009
Langue:
english
Fichier:
PDF, 550 KB
english, 2009