output
20022009
most citedThe ALPS project release 1.3: open source software for strongly correlated systems

727 citations

Showing 2008Show all

10 papers · 1 filter

cs.DS20081 cited

Finding Sparse Cuts Locally Using Evolving Sets

Reid Andersen, Yuval Peres

A {\em local graph partitioning algorithm} finds a set of vertices with small conductance (i.e. a sparse cut) by adaptively exploring part of a large graph , starting from a spe…

cs.LO200817 cited

A TLA+ Proof System

Kaustuv C. Chaudhuri, Damien Doligez, Leslie Lamport +1

We describe an extension to the TLA+ specification language with constructs for writing proofs and a proof environment, called the Proof Manager (PM), to checks those proofs. The l…

cs.DS200843 cited

Multi-Armed Bandits in Metric Spaces

Robert Kleinberg, Aleksandrs Slivkins, Eli Upfal

In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of trials so as to maximize the total payoff of the chosen strategies. While the…

cs.GT20081 cited

Algorithmic Pricing via Virtual Valuations

Shuchi Chawla, Jason Hartline, Robert Kleinberg

Algorithmic pricing is the computational problem that sellers (e.g., in supermarkets) face when trying to set prices for their items to maximize their profit in the presence of a k…

cs.DS20085 cited

Bloomier Filters: A second look

Denis Charles, Kumar Chellapilla

A Bloom filter is a space efficient structure for storing static sets, where the space efficiency is gained at the expense of a small probability of false-positives. A Bloomier fil…

cond-mat.str-el200852 cited

Strong-Coupling Phases of Frustrated Bosons on a 2-leg Ladder with Ring Exchange

D. N. Sheng, Olexei I. Motrunich, Simon Trebst +2

Developing a theoretical framework to access quantum phases of itinerant bosons or fermions in two dimensions (2D) that exhibit singular structure along surfaces in momentum space…