Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

SODA
2008
ACM

favoriteEmaildiscussreport

86views Algorithms» more SODA 2008»

Declaring independence via the sketching of sketches

13 years 6 months ago

Declaring independence via the sketching of sketches

Download www.cs.umass.edu

Piotr Indyk, Andrew McGregor

Real-time Traffic

Algorithms | SODA 2008 |

claim paper

Related Content

» Declarative Programming of User Interfaces

» Bounded Nondeterminism of Logic Programs

» Probabilistic Event Structures and Domains

» What is InputOutput Logic InputOutput Logic Constraints Permissions

» The ICSFORTH RDFSuite Managing Voluminous RDF Description Bases

» Three counterexamples refuting Kieus plan for quantum adiabatic hypercomputation and some ...

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	SODA
Authors	Piotr Indyk, Andrew McGregor

Comments (0)