http://www.informatik.uni-trier.de/~ley/db/conf/stoc/stoc2004.html
STOC 2004
http://doi.acm.org/10.1145/1007352.1007368	6	Know thy Neighbor’s Neighbor: the Power of Lookahead in ∗ Randomized P2P Networks	abraham academy addressable adversarial aizenman algorithmic algorithms alternative analysis annals announcement applications approach architectures areas aspnes asymptotic aware awerbuch azar balakrishnan balanced barab barri bartal based bawa benjamini berger better brief building butter castro cherno chord ciency cient clusters collective communications computing conference contacts content continuous coppersmith cycles decentralized degree density deployment deterministic diamadi diameter dimension dimensional directions disc discontinuity discrete distance distrib distributed dodds druschel dynamic dynamics eclecticism emulation existence experimental fault fraigniaud francis fudico future gamarnik ganesan ganesh gauron gavoille generic geometry global goel govindan graph graphs gribble gummadi handley harvey hash hashing huang hypothesis ieee ifip impact improving incrementally international internet intl ipdps iptps jczak ject jones joseph journal july june kaashoek karger karp kleinberg know kochen koorde kranakis krizanc kubiatowicz kumar large latency lelism leware linked lists locality location loguinov long longe lookup malkhi manku mathematical mathmematical measure midd milgram models morris munro naor national nature neighbor network networks newman nite novel november observations optimal overlay overview pages paral paris pastry paul pavlov peer percolation perseus perspective phenomenon physics platforms podc pool practical principles probabilistic problem proc processing properties proximity psychology publishing pugh raghavan random range rata ratnasamy references report resilience resilient rhea roby routing rowstron saroiu scalable scale scenarios scheme schulman science search selected service shah shenker shrinks siam sigcomm sigmetrics simple skip skipnet small social soda spaa statistics stoc stoica stribling strogatz structured structures study suppl sviridenko symp symphony symposium systems table tables tapestry technical technologies tests theimer theoretic theory third today tolerant topology transition trees uence university usenix usits viceroy watts wieder with wolman workshop world worlds zhang zhao
http://doi.acm.org/10.1145/1007352.1007447	71	Rational Secret Sharing and Multiparty Computation: Extended Abstract	about abstract admissibility algorithmic algorithms also applications aspects available biased bits blum boneh boolean brandenburger cambridge canetti chaum cleve coin commitments communications completeness computation computer computing conditions conference contracts controlled coop correctness course crypto cryptographic cryptography cryptology damg design directions disclosure discrete distributed draft ective epistemic erative ersp evaluation even exchange exclusivity extended fagin fault feigenbaum foundations function functions future game general goldreich goldwasser gradual halp html ieee infomational international ipping iterated journal keisler keys know latest lecture ledge lemp luby manuscript mass mcgrew mechanism mental methods micali mobile moses moshet multi multiparty naor ninth notes oded orne pages party play porter practical press proc protocol protocols provably racko random randomized rationality reasoning recent references release results rubinstein schemes science secret secure shamir share shenker shoham signatures signing simultaneously springer studies symmetrically symp systems tark technion tennenholtz their theorems theoretical theory thesis timed tolerant towards trans unconditionally university unpublished vardi verlag version volume weizmann wigderson wisdom with workshop
http://doi.acm.org/10.1145/1007352.1007393	26	Bounded-Concurrent Secure Multi-Party Computation with a Dishonest Majority	able achieving adaptive agreement almost applications arguments assumptions auxiliary available barak barrier beaver beyond black bounded bounds canetti chapter chor chosen ciency cient ciphertext coin common comp completeness complexity computation computing concurrent constant constructions crypto cryptographic cryptography cryptology damg deniability disc dishonest distributed dolev draft dwork endence eurocrypt exchange extraction fair fault feige focs foundations from function functions game general generate generator goldreich goldwasser golwasser have hiding honest http immoral impagliazzo improved indep indistinguishability interactive jacm jority jour journal katz kilian knowledge krawczyk kushilevitz languages levin limitations lindell lncs logarithmic logarithmically lower luby malleable manuscript many mental micali model multi multiparty multy naor nothing numb oded oracle osability osable osition ostrovsky pages paradigm party pass petrank play podc polynomial preliminary preparation presence primitives proof proofs prot protocols psbookfrag pseudorandom rabin random realizing reference references requires resettable richardson rogaway rosen round rounds sahai secret secrets secure security self setup shamir shared sharing siam simulation smith springer stad stoc strict string systems that their theorem theorems thesis time tolerant tossing universal universally unpublished validity veri verlag version weizmann wigderson wisdom with without witness yield zero
http://doi.acm.org/10.1145/1007352.1007407	37	Unconditional Lower Bounds on the Time-Approximation Tradeoffs for the ∗ Distributed Minimum Spanning Tree Problem	alamitos algorithm algorithms almost annual applications approach approximate approximating approximation arora august automata awerbuch bertsekas boston bounds cambridge chakrabarti chazelle cherno chin chromatic cient clique coloring colouring communication company complexity comput computation computer computing connected connection constant constructing construction counting czygrinow data decomp delta diameter ding discrete distributed dominating dubhashi edge edition election elkin engebrethsen erty european extension fast faster foundations gafni gallager garay goldb goldreich goldwasser grable graph graphs hall hamming hanckowiak hard hardness hochbaum holmerin humblet ieee ilan improvements inter international island israel jaraman july karonski kuhn kushilevitz kutten lang languages leader learning linear linial lncs locality logn london lotker lower luby lund lvov manuscript marco massachusetts matching maximum message messages minimum near nearest nearly neighb network networks newp nisan numb optimal orleans osition ound ounds panconesi patt pelc peleg philadelphia plotkin prentice press principles problems proc programming prop protocol publishing radhakrishnan ramat random randomized references related rhode rounds rubinovich science searching sensitive sets shamir siam size skeletons small spanning spira srinivasan srinivisan structures sublinear suel symp syst szymanska testing theory thesis tight time ting towards trans tree trees university wattnhofer weakly weight york
http://doi.acm.org/10.1145/1007352.1007430	57	Auction Algorithms for Market Equilibrium	algorithm algorithms analysis applications approx approximating approximation argument arrow assignment auction auctions bansal bertsekas brainard cambridge canada case cheng cient combinatorial commerce comp complexity computational compute computer computing convergent cowles debreu demange deng devanur discrete discussion distributed dual dynamic econometrica economic economics economy electronic elements endent equilibria equilibrium etitive existance existence flow focs foundation foundations french fsttcs gale garg general harward hungarian implementation improved increments indep introduction issue item jain journal june kuhn lausanne linear logistics mahdian market mass method montreal multi naval network online optimization other outcomes pages papadimitriou paris parity policies political press prices pricing primal problem problems proofs pure quarterly queb references research safra samuelson scarf scheme science sciences simultaneous social software sotomayor special stoc symposium system technology theoretical theory tutorial university vazirani walras wealth wellman with workshop
http://doi.acm.org/10.1145/1007352.1007410	40	Primal-Dual Algorithms for Deterministic Inventory Problems	acknowledgments algorithm algorithms annual another approach approximate approximation archer arkin askoy assembly asymmetric asymptotic bertsimas bilde braunschweig bussieck case center chaitanya chuzhoy cient citeseer communication complexity computational computing concave constrained convex coordinated cornell cost costs covering crowston demand demands department deterministic discrete discussions distribution dual dynamic echelon ecke economic ective endent epsilon erenguk erformance erin facility federgrun fink forest formulation formulations general goemans guha halp hard helpful heuristics html hull inapproximability individual installation integrality international inventory item ithaca jain january joint joneja journal khanna kortsarz krarup lagrangian leontief letters levi linear location lower lubb management manuscript mathematical median methoden metric minimum model models multi multilevel naor note numerische olyhedral operations optimal optimierungsaufgaben optimization ound ounds pages parameters piecewise planning plant preparation primal private problem problems proceedings product production programming raghavan randomized rany references relaxation replenishment research retailer rounding roundy schema school science service setup shen shmoys siam simchi single size sizing solutions stage stationary stern stimulating strong structural structures study substitution suggestions survey swamy symposium systems technical technique technology thank theory thesis time tzur uncapacitated university unpublished using varying vazirani veinott version vohra volume wagner warehouse whitin williamson with wolsey worst zangwill zero
http://doi.acm.org/10.1145/1007352.1007375	11	Sorting and Searching in the Presence of Memory Faults ∗ (without Redundancy)	absence access acknowledgments addison adventures adversary algorithm algorithms always analysis annual anonymous answer answering answers applications argument asks aslam aspects assaf assume aumann automata barrier based bender best binary borgstrom bound breaking budap cambridge cannot case cases chen chlebus choosing claims classical cocoon colton combinatorial combinatorics combining comments communication communications comparison comparisons computations computer computers computing comtex concept conf consistent containing contains cook coping correct corrupted croft data decide denote design desired destructive deterministic dhagat diary discrete dynamic ecause either electronic element elements empty encer erformance erroneous error errors ership european every exhibit faithfully farach fast fault faults faulty feige fifty focs following follows former foundations gacs gambin games ganesan gasieniec geometric gibson gives gondolat goor gouda hall hamdioui have hence high icalp ieee indeed indyk informacioelm information international involved january journal katz keys kinds kleitman known kosara lakshmanan languages larger latter least leaves leda leighton length less letr level liar liars library limit linearly lists lncs loquium lower machines mathematician mehlhorn memb memories memory merge merging meyer models most musser muthukrishnan napl nearly necessary needs netherlands network networks noisy note obtained optimal ordered original ossible otherwise ound ounded ounds parallel parallelism path patterson pelc peleg personal platform plauger plaxton playing practice pram prentice presence press probability proc procedures programming prove provide publication publishing queries query question questions raghavan raid random ravikumar reading references reliable remark requires resilient result reviewer rivest rodgers science sciences scribners search searched searching secondary semiconductor sequence shared should show shows siam simple simulation simulations since size soda sons sorted sorting stacs standard stepanov stoc storage strategies strategy structures subsequence surveys symp system template testing tests than thank that them theorem theoretical theory therefore this thus tight time tolerant total trans twenty ulam ullman university upfal used useful values wesley when whether while wiley will winkler winklmann wish with word worst years yields york
http://doi.acm.org/10.1145/1007352.1007426	54	A Conjecture about Polynomial Time Computable Lattice-Lattice Functions	about academic ajtai amsterdam annual arithmetic axiom axiomatic bounded caracas choice combinatorica complexity computable computer conjectured counting diego dold eckman foundations fulton graduate harris holland ieee jech lattices lecture logic mathematical mathematics methods north notes osium paris pigeonhole polynomial press principle problems proc properties random references representation science springer symp text their theory time verlag wilkie
http://doi.acm.org/10.1145/1007352.1007439	64	Using Mixture Models for Collaborative Filtering	actual algorithms amazon amount analysis arti azar baker based breese categorization cial class clustering collab commerce communications comp computations computed computer computing conf conference constant convergent converges data david distributional drineas ecial ectral edition electronic empirical etitive even fiat filtering finite foundations from golub grows heckerman hofmann hopkins ieee increasing information intel international internet intl introduction involving issue item jagopalan johns joint kadie karlin kerendis kleinb kumar latent ligence linden loan ltering matrix mccallum mclachlan mcsherry mixture models needed orative ound oundedly peel predictive press probabilistic proc puzicha raghavan recommendation recommendations recommender references remains resnick retrieval saia sandler science sigir smith symposium systems text that theory though thus tomkins uncertainty university varian which wiley will with words york
http://doi.acm.org/10.1145/1007352.1007371	8	Approximating the Cut-Norm via Grothendieck’s Inequality	ability absolutely acad academy algorithm algorithmic algorithms alon also amsterdam analysis annual applications approximating approximation arora aspects atlanta automata babai banach based basic bermond biclusters bioinformatics bound cambridge cant case cation classes cnrs colloquium combinatorial combinatorica comp complex complexity comput computer computing concepts conference consequences constant constante crete data derandomizing diestel dimensional discovering duke edition ellipsoid expression fast feige focs foundations fournier frequency frieze gene genome geometry georgia goemans graphs greece grothendieck haagerup handbook heterogeneous highly holland ieee improved inapproximability independent inequality integer integrated inter international intractability israel itai jameson jarchow johnson kannan karpinski krivine kupiec langberg languages lect lefmann lemma lewin lindenstrauss livnat london loque lovasz lund maha massachusetts math mathematical matias matrices maximal maximum method methods modularity molecular moments motwani national nesterov network nite nonconvex norms north notes nuclear operators optimal optimization organization orie other outward papadimitriou parallel paris partitions paulo pelczy pittsburgh press probabilistic problem problems proc proceedings produits programming programs proof quadratic quick ramesh random randomized references regular regularity relaxation relaxations results revealing rietz rotations rounding sampling satis schrijver science sciences second semide shamir sharan siam signi simple society software solutions some sotteau space spaces spencer stad statistically stoc student studia sudan summing symposium szegedy szemer tanay technique techniques tensoriels texts their theory tonge tool topologiques trique tschel university upper using vega vergnas veri wide wiley williamson with yannakakis yeast york yuster zwick
http://doi.acm.org/10.1145/1007352.1007438	63	A Decentralized Algorithm for Spectral Analysis	achlioptas addressable advances aggregate algorithm algorithms american analysis anatomy applications applied approximation area authoritative azar balakrishnan benjamini berkeley boyd brin chain chains cholesky chord chung clustering clusterings computations computer computing conf conference content coste czechoslovak data deerwester designing diaconis distributed dobra druschel dumais ecole edition eigenvectors engine environment factors fastest fault fiat fiedler flour foundations francis from furnas gallivan gehrke ghosh global golub good gossip granovetter graph graphs handley harshman heath hopkins hyperlinked hypertextual ieee ifip indexing industrial information infrastructure internet intl inverses isdn johns jordan joseph journal kaashoek kannan karger karlin karp kempe kleinberg kubiatowicz landauer large latent lecture lectures leighton loan local location lookup lovasz markov mathematical mathematics matrices matrix mcsherry middleware mixing morris multicommodity network networks neural nite nonnegative notes numerical object observation ortega page pages parallel partitioning pastry peer perturbation peyton platforms plemmons prabhakar press proc processing property pseudo random ratnasamy references report review romine routing rowstron saia saloff sameh scalable scale science sciences search semantic service shah shenker siam sigcomm society sociology sources spectral springer stewart stoica strength submitted symmetric symp synthesis systems tapestry technical their theorems theory third ties times tolerant university using vempala vetta voigt walks weak wedin weiss wide xiao zhao
http://doi.acm.org/10.1145/1007352.1007417	45	¨ An Approximate Konig’s Theorem for Edge-Coloring Weighted Bipartite Graphs	academic academy achieved again algorithms alkalmaz allow allows amounts analysis annual applied applying architecture areas arising beetem benes berkeley bipartite brie brucker california cally choice chung clos coloring colors combinatorial combined comes communications computer computing conclude condition conference connecting consider considern correa crossbar decomp degdi degf degfk denneau determin diestel dimacs discrete discuss distributions edge ehavior elonging ercomputer erences erencing erfect ertesit essentially establish exist following found foundations from function generalization generalized give goemans graduate graph graphok graphs guarantees halmazok heuristics hurink hwang ideas implementation improved improvement improving inequality integer interconnection international into ipco items itoh iwasaki journal karmarkar karp kurisaka large lemma letters local loulou main manuscript mathematical mathematics mathematikai maxe melen method mimicking multiprocessor multirate nagano needed networks nonblocking nsok numb only operations optimal optimization osition otherwise ound packaging packing particular partitioning performance practical preparation press probabilistic problem problems proceedings programming prove random rate rearrangeability rearrangeable references research result rhee ross same satisfy scale scheduling schuurman science search section selected sequence series sets siam similar since sizes slepian slight smaller society soda solutions some springer stage strengthen strengthening study such switching symposium system systems szettudomanyi takahashi taken talagrand tech technical technologies telephone term texts than that then theorem theorems theoretical theory there therefore this total translates turner university unpublished used value verlag vertices very vredeveld washington weights weingarten werner werra when whenever where with york
http://doi.acm.org/10.1145/1007352.1007364	3	New Hardness Results for Congestion Minimization and Machine Scheduling	algorithmic algorithms allocation annual applications approach approximability approximate approximating approximation arora berman boolean bounds cation characterization checking chekuri chuzhoy classi colloquium combinatorial combinatorica complete completeness complexity computational computer computers computing conference constraint cover dasgupta derived dinur discrete disjoint eccc edge electronic erlebach factor foundations freeman freund from garey good guha guide guruswami halperin handbooks hard hardness holland hypergraph hypergraphs ieee inapproximability interval intractability inventory jaraman johnson journal khanna khot krauthgamer lawler lenstra logistics lower lund machine machines management manuscript maximization minimization motwani multi multilayered multiple naor near north operations optimal optimization ostrovsky pages parallel paths phase polylogarithmic probabilistic problem problems proc proceedings production proof proofs provably rabani raghavan randomized real references regev related repetition report research resource results revisited rinnooy rounding safra satisfaction scheduling schieber science selection sequencing shepherd shmoys siam sicomp spieksma stoc sudan symposium szegedy technique theorem theory thompson throughput time trevisan under uniform veri vertex williamson within yannakakis yehuda
http://doi.acm.org/10.1145/1007352.1007377	13	Graph Entropy and Quantum Sorting Problems∗	aaronson above academia achieve alfonsin algorithmica algorithms alphabet ambainis ambiguous annual antiblocking appendix archive arguments arxiv ascending assumption balancing beals bennett bernstein better between bound bounded bounds brassard brunn buhrman cases change chapter circuit cleve coding collision combinatorica completes complexities complexity computation computational computer computing conference consider constant containe corners csisz decision denote density depends disc discrete distance distinct distinctness distributed distribution divide dominated easily edited element elements entropy equation equations except extensions falls farhi follows formulas foundations fredman from function generate generated geometry gives goldstone good graph graphs gutmann hashing have having ieee immediately implies includes independently information insertion interval intervals into john journal kahn koml lemma length letters limit linear linial list lower lume make mapping marton maximum means meth minimum minkowski mosca need neerbek newman nitesimal nition note numbers only onto order ordered over pages parts perfect pick point points polynomials polytope polytopes poset posid positive prague print probability problem problems proc processing proof proposition prove proves quadrant quant quantum radhakhrishnan ragde ramirez random real reed references regard replaced rightmost rner saks science sciences search searching seen sequence sequentially show siam simonyi sipser some sons sort sorting source space speed splits splitting stanley strengths structure such suppose survey symposium system that them then theoretical theory there this threshold tive tochastically transactions transformation tree uniformly unique updated value valued variable variables vazirani veri volume weaknesses when where which wigderson wiley with wolf written
http://doi.acm.org/10.1145/1007352.1007423	50	A New Family Of Cayley Expanders (?)	abstract additive ajtai alamitos algebraic algorithm algorithms alon amer american ampli anal analysis annual appear appl applications applied arch arguments association aviv babai basel beat berlin better bias biased birkhauser bound canada capalbo cation cayley cient cients circuits closed codes coef combinatorial combinatorica commutator commutators complexity comput computer computing concentrator concentrators conductors conference connection connections constant construction constructions correcting decodable dedicata degree depth derandomizing diaconis diameter dimacs direct discrete dixon dual eichler eigenvalue eigenvalues electronic encodable entropy epsilon error estimation every examples exhaustive existence expander expanders expanding explicit exponential extended formen forms foundations fourier fourth from functional functions funkcional gabber gafa galil generalized generating geom geometric goldreich gons graph graphs gromov group groups hard hardness hetyei ieee impagliazzo inequalities informacii information informatsii invariant isoperimetric jimbo journal june kalton kantor kazhdan klawe komlos kongruenzzetafunktion lecture lemma level levin liebeck limitations limited linear lomnica lossless louis lovasz lubotzky machinery margulis maruoka math mathematical matrices measures meshulam methods microsurveys milman missouri mixing modular montreal morgenstern naor nearly network networks nikolov ninth nisan nite notes obtained pages parallel part paso pcps peredachi peredaci perferct phillips pinsker pippenger power preserving press prilozh prime princeton probab probability problemy proc proceedings product property providence pseudorandomness pure quadratische quaternare quebec questions ramanujan random randomness rearrangeable references regular reingold remarks replacement requires resolution riemannsche roberts roichman rounds russian sarnak sasson schemes science security selberg selecting semi seress series sets shahshahani shalev short siam simple sipser sixth sized small society some sorting space spaces special spielman springer steps stockholm structure structures studies subgroups submeasures sudan superconcentrators symmetric sympos symposium syst szemeredi tanner tatranska teletraf tests texas that their theoret theoretic theory thirty thiry time times transactions transformations twenty uniformly urquhart vadhan valiant vegas venkatesan verlag vermutung versus viii volume waves weiss width wigderson winkler with zuckerman
http://doi.acm.org/10.1145/1007352.1007431	58	The Spending Constraint Model for Market Equilibrium: ∗ Algorithmic, Existence and Uniqueness Results	algorithm algorithmic algorithms aliprantis annals annual approx approximating approximation arrow auction available brown burkinshaw buyers case collab comp complexity computation computing consensus constraint constraints debreu deng denotes devanur dual econometrica economic economics economie economies economy eisenb elements ending engl equilibria equilibrium etitive existence focs foundation fsttcs full gale games garg gatech grads hansen have http improved internet jain jective lausanne linear mahdian manuscript market mathematical method model monograph mutuel nikhil nite norm olynomial optimality oration pages papadimitriou pari paris politique prices primal probabilities proc proceedings pure references results richesse safra scarf scheme social sociale springer statistics stoc submitted symposium theorie theory time transl uniqueness utilities vazirani vector verlag version vijay walras wealth when with
http://doi.acm.org/10.1145/1007352.1007387	21	A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time	acyclic algorithm algorithmics algorithms alstrup analysis ancestors application applications barrier based bender biconnected biconnectivity breaking cation ciency closure colton common components computers computing connectivity cormen data deleting demetrescu depth digraphs directed distributed dynamic edges edition experimental farach fast faster finding focs frigioni fully gabow gavoille good graph graphs harel henzinger improved information introduction italiano journal kaplan king latin leiserson letters linear lowest maintaining mathematics miller nanni nding nearest pages pairs parallelization path paths press problem proceedings processing rauhe reachability references revisited rivest roditty schieber search second sharir shortest siam simpler simpli soda spaa stein strong study survey tarjan through transitive union vishkin with zaroliagis zwick
http://doi.acm.org/10.1145/1007352.1007398	30	Low Distortion Maps Between Point Sets∗	achieved adjacent akutsu algeb algorithm algorithmic algorithms also among analysis anchor appendix appl applications applied approximating approximation assigned assoc available babai banach bandwidth beijing belongie berkeley bijection birkhauser blache blum canada caterpillars chazelle check children chinn chordal christos chvatalova circular class classes clique combinatorica combinatorics comparing complete completeness completes complexity comput computation computational computer computing conference confronting congress conjecture connected consists construct contemporary contexts corresp croft cuts dense description dewdney deza dimacs discr discrete distance distances distortion distortions distributed does done downey dynamic each easy ecause eccc ecting ects eddings edge edges editors edomonton eigenvalue erent erformance ermutation erta erts etween evenly exactly examples except excluded exists expansion february feige fellows finally finding finite first focs follows fortin foundations framework from fujiyama garey genus geometric geometry gibbs give given graduate graham grandchildren graph graphs grigoryev guarantees gupta hagedoorn hair handbook haralambides hard hausdor have hence heuristics holland html http huttenlocher ieee images implications improved increased incur indyk information input instance integer intel international interval into intractability inverse isomorphism ject jobs johnson journal kanaya karpinski klanderman known knuth kobler konjevod kratochvil kratsch krauthgamer kriegel laurent layout least lectures length lengths less ligence lindenstrauss linear linial london luks mach machine magen makedon malik mann manuscript mapping marcus matching math mathematicians mathematics matou matrices meth metric metrics miller minimization minimum monien motivation mount much multiplicity multiprocessor must nesetril ning nite north note notice novemb november npcomplete numb observations ohyama oint olynomial onding only ordering ositive other ounded pages pairs pairwise papadimitriou parameterized partition pattern patterns petit planar point preprint problem problems proc processor processors programming progress proof proposition protein putting puzicha question rabinovich ravi recognition recognizing reduction references relaxations renyi resp results root rucklidge safra saxe schedule scheduling science sciences second semi separating septemb series serna sets shap shape show siam simple single skeptic small some spaces springer stanley state stege strong strongly structural sublinear submatrix survey surveys symp system systematically systems tardos technical tested testing texts than that then theoretical theory there these this thus time together toran trans tree trees trends tutorial under unger uniform university unpublished unweighted using utrecht valence veltkamp vempala verify vertex vertices volume weight weighted well wenk when which whose wilf will wirtgen with without wonk zelikovsky
http://doi.acm.org/10.1145/1007352.1007401	33	Isotopic Implicit Surface Meshing	accuracy agrachev algebraic algorithm algorithms allan amer analysis anisotropy annu appear approximates approximation approximations aronov available banchoff basu been believe bern bloomenthal brodlie bull cambridge carried chazal cient cline closeness coarseness cohen complexes comput computer conclusion condition conditioning considered construction contour control cornell critical cubes curvature dcohen decomposition delaunay diff differentiable differential dimensional discontinuous dobkin dold drawback dynamical edelsbrunner elds element embedded ensure eppstein festschrift figueiredo finite function functions generation geom geometric gilbert given gomes good goodman goresky gottlieb graphics guaranteeing harer hart hatcher hausdorff have having hierarchical high hirsch http ieee implementation implicit improving index inria interactive interpolation interval introduction involved isosurfacing isotopic isotopie issn january journal kaufmann knowledge lectures level levy linear lopez lorensen macpherson main manifolds maps march marching math mathematics measure measures mesh milnor modeling modi moreover morgan morse nement nite objects october pach pages pallaschke papers piecewise point points pollack polygonization polygonizer polyhedra predicates preparation press princeton prisme proc proceedings provably publishers quality rather reconstruction references regular relative required requires resolution ricky robustness rourke ruppert samaranayake same sanderson sard scholtes sciences sense series sets sharir shewchuk should siggraph silvio simple simplicity smooth snyder space springer stander steiner strati studies submitted surface surfaces sympos system systems that theory though thurston tools topology tracing transactions university values vector velho verlag visualization what wilks william with wrapping york zomorodian
http://doi.acm.org/10.1145/1007352.1007369	7	The Zero-One Principle for Switching Networks	addison adversarial aiello ajtai algorithm algorithms analysis andelman andrews annual application arbitrary architectures association assumption awerbuch azar birman bolot borodin cally cioq comp compared computer computing conserving contention cormen diot discrete distrib donald dynamic erentiated erformance etitive european exact fernandez found gail global greedy hahne hantler ieee infocom internet introduction jacm jagop jean journal kesselman kleinb knuth koml kushilevitz leighton leiserson line local loss lotker machinery management mansour marie memory merging models multi nearly network networks nitions olan olicies olicy ologies only optimal optimum optl ostrovsky ounded ounds over pages paral patt press principles problem proc proceedings programming protocols queue queueing queuing raghavan reading references resolution restricted results richter rivest rosb rosen routing scheduling schieb science searching section sequences serv service services shamir shared shown siam sidi simple size sorting stability streams strongest studied sudan sviridenko switches symp symposium systems szemer theory they tree under universal values volume weighted wesley while williamson with work
http://doi.acm.org/10.1145/1007352.1007386	20	Estimating the Weight of Metric Minimum Spanning Trees in Sublinear-Time	ackermann alamitos alamos algorithm algorithms alon alto annual applications approximate approximating approximation approximations atlanta automata baltimore batu beach berlin burlington callahan carlo chapter chazelle clustering complexity computational computer computing connection constructing crete czuma decomp demensional dense diego discrete distance edit edited editors elds elsevier eppstein ergun erty euclidean european fast focs fortnow foundations frieze geometric geometry goldreich goldwasser greece handbook icalp ieee indyk international inverse january journal july june kannan karger kilian klein kosara languages learning lecture leeuwen lemma linear loquium magen march metric minimum mishra monte multidimensional nding nearest neighb newman notes novemb oblinger octob oint optimal orejas osition otential pages palo parnas paterson pettie philadelphia pitt press problems proceedings programming prop ramachandran randomized rank raskhodnikova redondo references regularity related rubinfeld sack sami scheme schemes science septemb sets siam society soda sohler space spaces spanners spanning spirakis springer stoc sublinear symposium tarjan testing theory time tree trees trevisan urrutia vazirani vempala verlag volume washington weakly weight with york ziegler
http://doi.acm.org/10.1145/1007352.1007419	47	Boosted Sampling: Approximation Algorithms for Stochastic Optimization	alamitos alexander algorithms allocating allocation allocations amit amitabh andreas annual anupam appear applications applied approximation approximations ashish aumann balance balancing bandwidth based beach beale bell bene better birge budget building bursty chapter chichester ciency combinatorial comput computer computing conference connections constrained convex cooperative cost costs dantzig david department design discrete discussion dual econom econometrics editors electronic equitable foundations fourth francois function gabriel game games general generalizations george global goel graphs greg groningen group gupta hall handbook haneveld hart hedging herve holland ieee immorlica improved incomplete industrial indyk inequalities integer interconnection interscience introduction jacm jain jobs john journal kall kamal karger klein kleinberg knowledge kumar linear load louveaux maarten machines management marc maria martin mathematics mechanisms median mettu michael minimizing minkoff mirrokni models mohring moulin neerlandica netherlands network networks nicole north online oper operations optimization pages parallel peter pinedo piotr plaxton policies power precedence prentice press prim primal priority problem problems proceedings processing procrastination programming rabani ramgopal ravi redondo references related research robert robins rolf roughgarden scheduling schultz schulz science scott series sharing shenker shortest siam simpler sinha skutella society some sons springer stage state statist stein steiner stoc stochastic stougie strategyproof subject submodular survey symposium system systems tardos technical theory thiry times tree trees twelfth type uetz uncertainty under university vahab vancouver vazirani verlag versus vijay vlerk volume wallace wiley willem with york young yuval zelikovsky
http://doi.acm.org/10.1145/1007352.1007425	53	Counting Complexity Classes for Numeric Computations II: Algebraic and Semialgebraic Sets	ablex addison addition additive algebra algebraic algebraically algorithmic algorithms amer analysis analytic annals appear appl applied bach balc basic basu benedetti berechnungskomplexit betti binary blum bochnak bounding bounds bredon brique bruce bund burgisser cambridge canny case characteristic characteristics classes clausen closed cohomology coins commutative comp company compl complete completeness complex complexity components comput computation computational computations compute computing connected corporation coste counting cucker deciding decision degree description deterministic dimension discovery discrete editors eisenbud elds elementarsymmetrischen elements elimination enseign enumeration ergebnisse ernst euler exponential fast fibre fitchas focs folge formula funktionen gabarr galligo generalizations generalized geom geometric geometry germ grenzgebiete grigoriev grund hard hartshorne hatcher heintz held hermann hierarchy higher hilbert hirzebruch honor hopcroft hypersurfaces ideals ihrer inequalities inputs international interpolationskoe intrinsic isaac james jections journal karpinski koiran lakatos lectures lehren levine lickteig lncs logic london machines math mathematical mathematics mathematik mathematischen mayr meer menlo methods meyer milnor model monogr morgenstern morse motion mover mumford munkres nability nullstellensatz number numbers numeric numerical ometrie order over pages papadimitriou parallel parameters park permanent planning points pollack polynomial polynomials power precise press princeton problem problems proc projective proofs pspace publishing pure quanti randomized real reals reducibility reduction references refutations reif reliability risler roadmaps robot schnorr schwartz semi semialgebraic semigroups semilinear sequential sets settings shafarevich sharir sheaf shokrollahi shub siam single singular smale solern solving some specker springer steenrod stoc strassen structural studies subexponential symb symbolic symposium syst systems szafraniec tarski testing that theoret theory time toda topological topology toss trees turing university valiant varieties variety vegas verlag version volume vorob weak werther wesley which wissenschaften with word zienten
http://doi.acm.org/10.1145/1007352.1007356	38	Network Games	advantage agents algorithm algorithmic algorithms allocation analysis anarchy anshelevich applications approximation archer atomic auction auctions axiomatic balancing based behavior being capacitated cascades case charging ciency cking comp complexity computer computing congestion context control convergence coop correa cost costs creation czuma dasgupta deng design devanur dual economic edge elastic endent environments equilibria equilibrium erations erative erger eriment erimental erimentational estrin etitive europ fabrikant facility fair farms feigenbaum focs friedman from frugal game games garg genericity greenwald hershb herzog ieee indep information interner internet jain johari journal kelly kent khandekar kleinb koutsoupias krysta learning like limited load locality location loss lowest luthra maneva manuscript market mathematics mechanism mechanisms monoton moses multicast nash near network networking networks nisan ology operations optimal orah osium ounds pages pandit papadimitriou path paths peering podc population price prices primal proc proceedings provider pure rate references research resource results ronen roughgarden routing safra sami scheduling schulz sciences scott server service shai sharing shenker shor shortest sigcomm simulations skorin slow societies soda sopher spaa stability stackelb stacs stier stoc strategies suri symp system talwar tardos telecommunications theory tight toth transactions transmissions trees tsitsiklis unpublished vazirani vetta vickerey vocking volume wexler what with worst worth yang zhang zhou
http://doi.acm.org/10.1145/1007352.1007372	9	Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems	achlioptas albuquerque algebra algorithm algorithms alon anal analysis annual appear appl application applications approximate approximating approximation approximations arxiv available based basis benczur bern boman carlo carnegie cation chaco chebychev chen cient combinatorial combinatorica computation computer computers computing connection constructing convergence convex cuts designing development diagonal diagonally disclosure dissection dominant donath eigenvalues eigenvectors equations evaluation fast focs frieze furedi game generalized gilb golub good graph graphs gremban guide hendrickson http ieee improved inexact ipps iterative joshi journal kannan karger karp karypis koml kumar labs leighton leland letin linear lipton logic lovasz lower maggs manuscript mathematics mathematik matrices matrix maximum mcsherry mellon methods metis miller minimum minneap monte most multicommodity national nding nearly nested nguyen numerical numerische octob olis optimization ordering ounds overton pages parallel parekh partitioning peleg performance preconditioner preconditioners preconditioning presented problem random rank ravi recent references reif research revised richardson rose sand sandia sept server siam simonovits solution solving spanning sparse sparsi spielman stoc structures submitted supp symmetric system systems talk tarjan tech technical teng their theorems theoretic theory thesis time toledo topics tree uiuc university unpublished unstructured user vaidya vempala version volume walks weight west with workshop zagha
http://doi.acm.org/10.1145/1007352.1007400	32	On Coresets for k -Means and k -Median Clustering	above accurate acknowledgments advance after again agarwal algorithm algorithms along already also amir amount analysis annu answer answering answers appear appendix applications apply approximate approximating approximation arbitrary arguing arora arti arya assoc associated assume assumptions aturally authors balls based being bentley best better between binary bits blow both bound bounded bounds build callaghan candidate care case ccurr cell cells cens center centers centroid charikar check checking cient ciently clarkson clear clearly close closest closet clustering combinatorial combining comput compute computed computing conclusions conference cons consider considerable considering constant construct constructed construction contain contained containing contains continue copt core coreset coresets corollary cost criterion current currently data decomposable deletions denoted depth described diagrams diameter dilation dimensions discrete discussions distance does doing doiu done dual dynamic each easily easy ected efrat empty enough enumerate equivalent erent estimate euclidean european even every exactly example exist existence exists expectation expected explicitly exposition extend extending extent extracting facility factor falls feder feed first following follows found fptas from fully function further furthermore fuzzy garg generated geom geometric given golin gonzalez greene grid guha gure hand hash hashing have hence here heuristic high however idea ieee imai implemented imply improved improvement inaba indeed indyk insensitive insertion insertions inside integer intel intercluster interesting interestingly into itself jain jective kanungo karpinski katoh kenyon khandekar kolliopoulos label larger leaf leaves legal lemma length level levels ligence like line linear local location logk lower lter ltering mach maintain manipulation marked matou maxi maximum maxp means meansn measures median medians metric mettu minimal minimize mishra motion mount multiple munagala must naive namely nding near nearest nearly needed neighbor neighboring neighbors netanyahu next nition node nodes nonempty nordic note nothing number numerous observe only operators optimal order other otherwise output over pages pair pandit panigrahy paper parameter parameters partial particular path peled perform permute permuted piatko pick picks piotr plaxton point points polynomial possibilities preprocess previous primal probability probe problem problems proc proceedings process procopiuc proof provides proximity putting quadtree queries query quickly rabani raghavan raman randomization randomized randomly range ratio reader rebuild recently recompute reduce references region regular related relevant remind removed replacement representation representative required requires research respectively result resulting results return returning returns roughly ruction running runs same samet satish saxe scan scheme schemes schwarz search searching section sense series sets shmoys showed siam side silverman similar similarly simple simplify since sing size small smaller smid snap solution some space spaced speed split spread square stage standard static stops store stored stream streaming streams stretch structure structures studied sublinear subset succeeds such summarize swap swaps sympos table take takes tardos tcandidate technique techniques terminates than thank that their then theorem theoret theory there things this through throw thus till time together total transformation troid tuple tuples uncertainty under unique uniquely unit update useful using valid values varadara variance vazirani vega veri verify voronoi want weber weight weighted well what when where whether which will with worst would
http://doi.acm.org/10.1145/1007352.1007362	1	A New PCP Outer Verifier with Applications to Homogeneous Linear Equations and Max-Bisection	ability able absolute accept acceptance accepted achieve achieving actually algorithms almost also analysis analyze anced appendix applications appropriate approximability approximate approximating approximation arbitrarily arora arrive assignment assignments assume assumed auxiliary average balanced basic between bipartite bisection blue book brief build call case cases cation chapter characterization checking choice chooses chosen ciently cients claim clause clauses clear clearly clique code codes coincide color colorable colored coloring combinatorial communication completeness complexity computational computer computing conference consider constant constants constraint constructed constructions containing contradiction contribute convert copies corollary correct corresp could cover deals definition degree denote details distance distinct does dumer each earlier ecomes ectation ective ectively ects edge edges eing either eling ends enforce ensures equal equation equations equivalent erfect error erties erty etition etitions etween even every example fact factor family fashion favorable feige following follows form formal foundations fourier fraction framework from function functions gadget gadgets games generalization give given gives goemans good graph graphs grows half halperin hand happ hard hardness hastad have here holds holmerin however hypergraphs ieee implies improved inapproximability indeed index inequalities inner instance integer introduce intuitively ject jection jections jects jority journal khot krauthgamer label larger least leave left lemma like linear literature location long looks lows lund magnitude major making manuscript maximum micciancio might minimum mixer mixing more most motawani much must necessarily need needs negligible neighb nite note notion numb obtained obtaining oincide oint omit onding onds only optimal optimization optimum original osed osite ossible other outer over overall pages papadimitriou paral parallel parameters particular personal petrank pick picking place polylogarithmic polynomials power preserved preserves primary probabilistic probability problem problems proc process produces product program programming promised proof proofs prop properties property protocol prove proven prover proves random randomly recall reduces reduction references regev relations repetition replacing requiring resp rest restricts result results right robust round rubinfeld safra salesman same satis satisfy satisfying satisj saying science secondary section semide sets several show showing shown siam side sides simple since sketch small smooth smoothness some sorkin soundness standard still straightforward strong such sudan supp symposium system szegedy tables terms test testing than that their them then theorem theorems theory there therefore these they this those thought threshold throwing thus times traveling trevisan typical underlying uniform unique unweighted upto used useful using variable variables vempala veri verifier version vertex vertexweighted vertices wants weight weighted weights whenever where which will williamson wise with within would zwick
http://doi.acm.org/10.1145/1007352.1007435	61	Lower Bounds for Dynamic Connectivity	abstract access accessed accesses achieve actually adaptive addition addressed adjacent advances algebraic algorithm algorithmica algorithms already also analogous annual another answering answers appendix applications applies approach approached arbitrary array asked assume assuming augmenting authors based beame between biconnectivity binary bits biweighted branching cannot case cases cell characterization characterized chronogram claim combination combining comparison complete complexity computation computer computing concise conference connectivity consider considered corresp cost crucial cumulative current customary data date dates defer demaine derive desire despite deterministic dietz directions discrete discussion distribution dynamic each easier easy eatedly ecause ecially ecomes ective edge element elements elieve elow entropy eppstein equally eration erformed ersp established etween even exception experience extending eyond fact factor fairly fenwick fich following forest form foundations fredman frequency frequent from fsttcs fully gaps gave generated given gives graph graphs group hampapuram hardness have henzinger here history hold holm however husfeldt ideas improved include incremental indexing indices integers interested interesting interleaving international intervals isaac italiano journal king knowing known leaves lemma length less lichtenb likely list listed lling logarithmic long lower machine maintaining maintenance many matching meaningful measured memb memory miltersen minimum model models more most motivated much must namely natural near needs notable note noticed numb observation obtained olylogarithmic only operation operations optimal osed ossible ound ounds owerful pages parameter parameters partial planar poly practical practice predecessor presented prob probabilities probability problem problems proc process proof proofs prove proved queries query question quite raised raman random randomized ranges rank rauhe reach reader recently references related relevant remained replacement restrict restricted result results roughly running sadakane saks sampling satis science sciences searchable searching section select semigroup sequence sequences setting several should show showed shows siam similar similarity sleator smaller soda software solution some sorted spanning splay stoc strengthened stronger structure structures subramanian subset succinct such sums sung survey symmetric symposium system tables takes tamassia tarjan technique techniques technology terms than that then theoretical theory these they this thorup though tight time trade tradeo tree trees trust understanding update updates used using usually values variable version vitter wads were westbrook what when where whether which widely will with without word words workshop yield yields yung
http://doi.acm.org/10.1145/1007352.1007446	70	Computing Nash Equilibria for Scheduling on Restricted Parallel Links	accepted ahuja algorithms also amman annals annual anomalies applications applied approach approximate approximation aspects automata ball barrier beyond bounds case cation cient complexity computation computational computer computers computing conference coop coordination czuma decomp department dinitz discrete economics editors electrical engineering equilibria equilibrium erative exact extreme feldmann focs fotakis foundations fusion gairing game games garg goemans goldb graham graph hall handbook horowitz icalp ictcs improved internet italian journal kendrick kleinb kolliop kontogiannis koutsoupias languages lenstra lncs loquium lucking machines magnanti mathematical mathematics mavronicolas maximum mckelvey mclennan mfcs monien multiprocessing nash nashi network networks nite nonidentical orlin osition oulos ounds pages papadimitriou parallel prentice problem problems proc processors programming ratio references rode routing rust sahni scheduling science sequential shmoys siam single soda source spirakis stacs stein stoc structure survey symposium systems tardos tarjan theoretical theory thesis tight timing unrelated unsplittable vocking vrto which worst
http://doi.acm.org/10.1145/1007352.1007385	19	Approximation Algorithms for Deadline-TSP and Vehicle Routing with Time-Windows	alcan aldowaisan algorithm algorithms allahverdi aluminium american amsterdam annals application applications approximating approximation arkin assad awerbuch azar batch bibliography blum bruno budget cases chambers changeover chawla chekuri collecting complexity computational computer computing considerations constrained constraints costs coverage deadlines desrochers desrosiers discounted downey ecial emden eople ergh european even factory foundations freenet frontiers gagn genetic geometric geometry golden gravel group guarantees gupta handbook handling heuristic html http improved international inventory involving jobs jordan journal kantor karger karuno kolen kumar lance land lane lenstra levy liao local logistics machine make management manufacturing manuscript math mathematical maximum methods meyerson minimum minko mitchell multi nagamochi narasimhan naval network networks north omega operational operations optimization order orienteering osman pages path phase practices press price prize problem problems proceedings production release repairman research resource review reward rosenwein routing salesman salesmen savelsb scheduling science sciences search sequencing setup shahar shops siam siferd society solomon solve soumis studies survey symposium systems task thangiah time times traveling trees trienekens tsitsiklis using variants vehicle vempala vinayagamoorthy vohra volume weight weinert windows wisner with yang yehuda
http://doi.acm.org/10.1145/1007352.1007413	42	Algorithms for Dynamic Geometric Problems over Data Streams	acknowledgments adam algorithm algorithmic algorithms alon analysis applications apply approach approximate approximating approximation arya athos author available bartal base better callaghan charikar chazelle chekuri chooses cient clustering color combinatorica communication comparing complexity computation computational computer computing conference coresets cormode count counting covering czuma data databases datar december dimacs dimensional discussions distributions dynamic each embeddings estimating estimation euclidean facility fast following foundations frahling frequency from garg generators gilbert given goel graham greedy guha hamming hellerstein helpful heuristics high histogram hong http icalp iccv image improved indyk initially input instead international invited jolet journal khandekar kotidis kushilevitz large like limited live local location logo madden maintenance manuscript martin matias mazumdar means median medians metric metrics meyerson minimum mishra models moments motwani munagala munro muthu muthukrishnan muthukrishtheorem nearest needed neighbor nite norms number online ostrovsky pages pandit panigrahy paterson peled personal plotkin point points probabilistic problem problems proceedings proceeds pseudorandom rabani raman record references report requirements retrieval rounding rubinfeld rutgers science sciences search selection sensor sigmod similarity sketch small smallest soda sohler solution sorting space spaces spanning spectrum stable statistical step storage strauss stream streaming streams sublinear submodular such sudipto summaries symposium system szegedy talk tech techniques technology thank thaper that their then theories theory there thirtieth time tree trees trends trevisan update uses using very vision vldb weight where with wolsey workshop would
http://doi.acm.org/10.1145/1007352.1007383	18	The All-or-Nothing Multicommodity Flow Problem	algorithm algorithmic algorithmica algorithms appear appeared applegate applications approx approximate approximation approximations areas aspnes aumann awerbuch azar balancing bansal berlin bienkowski blum bounds cambridge chakrabarti changing chawla chekuri chuzhoy circuit circuits cohen combinatorial combinatorica communications competitive complexity computing conference congestion constructing cuts decomposition demand demands designing diagonally dinitz disjoint distortion domain dominant dual edge embeddings euclidean even exercises fiat flow flows focs frank fundamental garg general geometry goemans good graph graphs greedy gupta guruswami hardness harrelson hawaii hicss hildrum holland icalp ieee improved inapproximability information integral international intra ipco itai jacm jaraman jcss journal kaplan khanna kleinberg kolliopoulos kolman korte korzeniowski kumar layout leighton letters line linial load london machine maggs making manuscript metrics meyerson miller minimization minimize minimizing multicommodity multicut multidimensional mydlarz naor near networks north note oblivious online optimal outline packing pages parekh paths planar plotkin polynomial practical preconditioning preliminary preserving primal problem problems proc processing proofs provably rabani rabinovich raghavan randomized ravi references regev related results revisited robertson robust rounding routing scheduling scheideler schemes schrijver sciences selected seymour shamir shepherd siam sigcomm single small socg soda solving some source spaa springer srinivasan stein stoc strongly survey switching symmetric system systems technique their theorem theorems thesis thompson throughput time timetable tradeo tree trees uncertain understanding unsplittable varadara vazirani venkataraman verlag version virtual vlsi volume waarts with yannakakis
http://doi.acm.org/10.1145/1007352.1007363	2	Asymmetric k -Center is log∗ n-Hard to Approximate	actually algorithm algorithms another aplikace applied approach approximate approximation archer arora asymmetric because being biased bottleneck bound called cation center centers centre characterization charikar checking clustering coloring combinatorial company completeness complexity comput computational computer computers computing conference cost costs cover dinur directed discrete distance dorit dyer easy eccc editor electronic facility factor foundations freeman frieze function functions garey given goal gonzalez graph graphs group guide guruswami halperin hard hardness heuristic hochbaum holmerin hypergraph hypergraphs ieee implications importance inapproximability integer integrality intercluster interesting intractability jacm johnson khot khuller kortsarz krauthgamer lett linear locating location loquium lund matematiky math maximum metric minimize motwani mount multilayered namely narasimhan near nemhauser nonnegative nonstandard note notion oper optimal optimization outliers over pages panigrahy parallel plesn polylogarithmic probabilistic problem problems proceedings program programming proof proofs publishing ratio reduction references regev regular relaxation repetition result safra same science shmoys shows siam simple slightly smyth solutions sometimes springer srinivasan steiner sudan symmetric symposium szegedy that theorem theoret theory this trees under uniform vazirani veri verlag vertex vertices vishwanathan wang weighted with within
http://doi.acm.org/10.1145/1007352.1007436	62	Lower Bounds for Linear Degeneracy Testing	ability acad algebraic algorithm algorithmica algorithms annual appl april area arkin barequet barrera berg better betti between binary bose bound bounds canad canada characteristics chiang chicago class codes complexity comput computation computational computations computer conf constraints containing containment convex correcting data decision degeneracies detecting dietzfelbinger dimacs dimensional dimensions disc discrete distance dobkin erickson error estimates euler finding fredman geom geometric geometry good grigoriev groot hard hausdor heide held holland information interval intrinsic japan jentaan journal karpinski knapsack kreveld least linear ling lipton lncs lower macwillams matousek membership meyer minimum mitchell molds nagura north number numbers ontario optimization ottawa overmars partitions peled perfect polygon polyhedral polyhedron polynomial prime primitives problem problems proc randomized references rner sacristan satis science search segment seidel sets siam skiena sloane smolensky sometimes sorting space spherical springer steele structures sums symp sympos system systems testing theoret theoretical theory topological toussaint translational tree trees under varying verlag violated volume vorob with workshop yang
http://doi.acm.org/10.1145/1007352.1007391	24	Linear FPT Reductions and Computational Lower Bounds	abrahamson alber algorithm algorithmica algorithms analogs annals annual applied approximability approximation arithmetic ausiello beigel bodlaender bordeauxi carolinae chaplin characterizing cheetham chen chicago chor classes coarse combinatorial commentationes completeness complexity computation computational computer computers computing conference coppersmith cover crescenzi database dehne deng dept design dimension discrete distinguishing dominating downey drugs ects endent etril exact existence feige fellows fernau finding fixed further gambosi general genetic grained gramm graphs hard have hierarchy huang icalp ieee impagliazzo improved improvements indep information jian journal juedes kanj kann kilian kloks labri large lecture letters limited logic lower machines marchetti mathematicae matrix maximum multiplication niedermeier nondeterminism notes observations olynomial onential optimization ounds papadimitriou parallel parameter parameterized paturi planar poljak problem problems proc processing progression properties protasi pspace ptas pure queries reducibilities references related report robson rossmanith science sciences selection sets siam side soda solving spaccamela sparse springer stacs stege string strong strongly subgraph substring symbolic symp system taillon tarjan tech texas their theoretical tight time tractability transactions trojanowski universitatis universite university verlag versus vertex wang which winograd without yannakakis
http://doi.acm.org/10.1145/1007352.1007354	12	Invited Talk	algorithm algorithms also ambainis amplification amplitude appear arxiv author available berkeley bounds brassard buhrman chicago complexity computation contemporary copyright database degree distinctness element estimation fast field focs from grover heiligman held hoyer http illinois information june logic lower magniez mathematics mechanical mosca owner pages polynomial print problem proceedings quant quantum query references results santha search stoc surveys szegedy tapp trends triangle until volume walk washington wolf
http://doi.acm.org/10.1145/1007352.1007442	67	The Two Possible Values of the Chromatic Number of a Random Graph	achlioptas advanced akad algorithms alon appendix applications bollob cambridge chromatic colorability combinatorica concentration discrete edition evolution forms friedgut geometric graphs have inequality interscience janson john kozl krivelevich kutato life linear luczak magyar math mathematics matrix method note number optimization paci paul press probabilistic proof random references rucinski second series shamir sharp since sons spencer structures studies that therefore threshold thus triangle university vaaler volume wiley with work york
http://doi.acm.org/10.1145/1007352.1007366	4	On the Performance of Greedy Algorithms in Packet Buffering	able adver adversary aiello algorithm algorithms amortized analysis andelman annual architectures arrives assume azar aziz balanced becomes beginning being block bounded buffer buffering case ciency cioq comm competitive completely computation computing delay denote derive differentiated discrete during each either emptied empty european every expression fairness fold following free freund from function goes guarantees gurations hahne have having hence holds improved increase infocom international iving kesselman koga landa latter least line list lncs load lose loses loss losses lotker maining management mansour memory multi naor networks nity number ones online only optimal other ourselves over packet packets paging parallel parallelism patt pattern policies populated potential prakash proc queue queueing queues rajagopolan ramachandran rate ratio reaches reasonable references repeated respectively restrict richter rosen routers rules same sary scheduler scheduling schieber sequences served serves services shamir shared siam since size sizes sleator stee step still summed sviridenko switch switches switching symp tarjan tends terminate that them then theory there this throughput throughputs time towards transmission transmit transmits until update usual when which while
http://doi.acm.org/10.1145/1007352.1007403	34	Hit-and-Run from a Corner	after again algorithm algorithms annealing applications applies available average ball bound carlo case cient combinatorics comput computing conductance considering convex corollary discr distributed distribution dyer erimetric etween fast faster first focs follows frieze functions generating geom geometry have helps hence here hitrun http improved invariant isop kannan lemma localization logcon logconcave mapping math microsoft mixes mixing monte next note obtained odies oints operations ound ounded over probabilistic problems proc procedures prog proof provably proves random randomness references regions research sampling satis scaling simonovits simulated smith space start steps stoc structures subset supp symposium tech that then theorem there therefore through thus under uniformly used using vempala volume walk walks warm where which with wwwmath
http://doi.acm.org/10.1145/1007352.1007381	16	Approximation Algorithm for k-node Connected Subgraphs via Critical Graphs	academic algebra algorithm algorithmica algorithms annual appear application applications approx approximating approximation archive augmentation auletta birge bounds british cambridge cheriyan comb combin combinatorial combinatorica combinatorics comput computing conf conjecture connected connectivity cost coverings covers critical critically crossing design digraphen dinitz discrete ecken edge endlichkeitsatze english erratum existence fach families frank gabow german grad graham graph graphen graphs grotschel handbook high improved isaac issue jackson jordan journal keeping kexue khuller kortsarz kriesell kritische lecture linear lncs london lovasz mader matching math mathematical mathematics mathematik maurer minimal minimalen minimum murty nding near network nite node notes number nutov optimal optimum pairs parente press problems proc programming progress proof raghavachari ravi references representation rooted series sets seventh siam size slater soda spanning special state stoc subgraph subgraphs submodular surveys symp tardos theory thurimella tongbao toronto uniform univ upper vempala vertex vertices vetta waterloo williamson with zusammenhangenden
http://doi.acm.org/10.1145/1007352.1007396	29	Batch Codes and Their Applications	abstract adaptive aiken ajtai alon amsterdam appear applications approximations arguments available balancing barrier beaver beimel beyond books breaking cachin canetti capalbo chor ciency cient circuits codes communication computation computationally computer condensers conductors constant contracts correcting crescenzo crypto cryptolib cryptology data database decoding degree derandomizing deterministic dispersal entropies error eurocrypt evaluation even exchange expander expanders expansion extended extractors factors fault february feigenbaum focs from function generator generators gertner gilboa goldreich goldwasser harvard hiding holland http icalp ieee impagliazzo implies information instances ishai journal katz kaufman keywords kilian knowledge komlos krivelevich kumar kushilevitz laboratory lemma lempel less litsyn lncs load local logspace loss macwilliams malkin manuscript micali model muller multi multioracle multiparty naor needed nissim north note oblivious omer optimal ostrovsky over pages party philby pinkas podc polylogarithmic polynomial polynomials preprocessing preserving privacy private proc procedures proofs protecting protocol protocols pseudo pseudorandom queries rabin random randomized randomness raymond reducing reed references reingold reiter replication report retrieval rubinfeld safra salil schemes sciences secrets secure security selective server servers shaltiel shma should signing simple simulation single sipser sloane sorted spielman stacs stadler statistics stoc strauss subexponential sudan system szemeredi tables technical testing theoretic theory tolerance transactions transfer trevisan ucsb umans unbalanced unless vadhan version wigderson with without wright zero zuckerman
http://doi.acm.org/10.1145/1007352.1007353	72	Multi-Linear Formulas for Permanent and Determinant are of Super-Polynomial Size	aaronson additions algebra algebraic algebras alon appear applicable arithmetic assignment assume because boolean bound bounds burgisser cambridge cannot characteristic circuit circuits clausen communication commutative complexity computation computational computations computer computing conference constant contradiction cult depth derandomizing derivatives determinant deterministic engineering erdos exponential exponentially feasible fields finite focs formula formulas from function functions gathen gives grigoriev hypothesis identity impagliazzo interestingly john journal kabanets kalorkoti karpinski lecture lemma linear lond lower main math mathematical matrix means method models monotone multi multilinear negation nevertheless nisan nition note number omputing output over partial paterson permanent polynomial powerful preliminary press probabiliatic proof proposition prove proving quantum random razborov references schnorr science section shamir shokrollahi shpilka siam size skepticism small snir sons spencer springer start stoc symbolic syntactic systems testing tests that then theorem theoretical theory thus univ universal valiant variables verlag version very weak where wigderson wiley will with york zero
http://doi.acm.org/10.1145/1007352.1007374	10	Dictionary Matching and Indexing with Errors and Don’t Cares	abrahamson accomplishments adaptive akutsu algorithm algorithmica algorithms alphab amir ancestors annual applications approach approximate arrays automata brodal buchsbaum cambridge candidate care cares case cations characters chawla checking cient cole combinatorial comm common complexity compressed computation computer computing construction corasick cross curse data databases deberg deterministic dictionaries dictionary dimensional dimensionality discrete dispatching dynamic eatcs economical editor eling error ership european failure farach fast faster ferragina fetterer fischer foundations functions galil gasieniec generalized geometric giancarlo goodrich greene grossi hagerup harel hariharan hashing high idury ieice improved index indexing indyk information journal karp keselman kushilevitz landau large length letters lewenstein line linear lncs logarithmic lookup lowest manb mass matches matching mccreight mehlhorn memb method miltersen minsky mismatches monographs motwani multi muthukrishnan nding nearest needs neighb news optimal ossible ostrovsky other ounds over pagh paradigm parallel parallelization park parnas password paterson pattern patterns perceptrons porat poutr preliminary press proc proceedings processing products publication queries rabani range ravada references removing research retrieval rodeh sahinalp schieb science sciences search searching security serial shekhar siam sigact simpler simpli sokol sorting space spaces sparse spatial springer static string structures submitted subset switching symposium system systems tarjan text theoretical theory tkde towards trans tree trees ukkonen using variable venkatesh verifying verlag version vishkin vitter weiner westbrook wildcard willard with workshop worst
http://doi.acm.org/10.1145/1007352.1007404	35	A Simple Polynomial-time Rescaling Algorithm for Solving Linear Programs	academic acknowledgements adam after agmon akedamii algorithm algorithmica algorithms also always analysis annual applying approach attention basis berlin bertsimas binary blum books boosting bound bringing bylander called canadian cation characterizations cheung chvatal ciently citeseer classi classic close cohen combinatorial combinatorica comments communication complexity computation computational computer computing conclude condition conference conic consider constraint convert convex cucker culty current denoted determine directions discrete discuss distance divide doklady dunagan earlier ecause efore ekonomika english ensure erceptron erceptrons error erties erturbation essentially evaluation feasibility feasible feasiblity form formative forster foundations fourteenth freeman frenk freund frieze from functions future geometric geometry grateful grotchel have helping high homogenization homogenized however html http ideas ieee incorp inequalities information input interior into introduce introduction journal just kannan karmarkar khachiyan klivans kluwer learning length like linear lovasz lower malicious many mario matekon matematicheskie math mathematical mathematics measure measures method methods metody might minimizing minimum minsky mizuno model more nauk nearly nemirovski neurodynamics next noise noisy normalized numb olynomial optimal optimization orating original osedness ounded over particular perceptron perceptrons performance phase point presence principles probabilistic problem problems proceedings produces program programming programs prop publishers quantity random recently reduce reduction references referred region relate related relaxation renegar replace return rewrite rocco rosenblatt rounded russian schrijver science search section sense series servedio sets show siam sixteenth slight small smith smooth smoothed solution solutions solved solving some soviet spartan spielman springer sssr stages standard status stefankovic strict studied symposium system szegedy technique teng than thank that their theory these this threshold through time times traditional translation turing typical typically used useful using vaidya valid value variable vempala vera verlag vertex walks width will winnow with workshop yudin
http://doi.acm.org/10.1145/1007352.1007421	48	Derandomizing Homomorphism Testing in General ∗ Groups	abstract algebraic algorithms almost alon amortized analysis annual applications approximability approximation approximations basel bellare bias biased birkhauser bits blum california canada cayley character characteristic characterization checkable chung cient circuits codes combinatorial combinatorica communication complexity computational computer computing concentrators construction constructions copp correcting decemb degree derandomizing diameters diego dimacs discrepancy discrete distributions editors eigenvalues electronic elian endent epsilon erconcentrators ersmith erty estimate even every existence expanders expanding explicit extended fifth florida focs foundations free from gabb galil general generalized generators goldreich goldwasser gons graph graphs groups handbook hastad homomorphism ieee impagliazzo improved inapproximability indep information informatsii interp invariant island jasekaran jcss journal june katz kiwi kluwer lemma length letters linear linearity locally loquium luby lund mansour manuscript march margulis math mathematics measures methods milman milwaukee montreal morgenstern naor networks nisan novemb numerical octob olation olynomials onential optimal otzky over ower pages pardalos pcps peralta peredachi phillips preliminary press prime private probabilistic probability problems problemy proceedings processing program progress proofs prop pseudorandom queb query ramanujan rand random randomized randomness references regular reif results robust roichman rolim rubinfeld russell samorodnitsky sarnak sasson science sciences self series sets short siam simple singer sixth size sized small some spaces sparse stad stoc structures sudan sums symposium system tanner testable testing tests their theoretical theory tight tolerant towards transactions trevisan tutorial twenty unless vadhan variables velickovic verlag version volume wigderson wisconsin wise with without york
http://doi.acm.org/10.1145/1007352.1007414	43	Sublinear Algorithms for Testing Monotone and Unimodal Distributions	access accessed additional after again algorithm algorithms analog analogs annual appropriate approximate approximating approximation assumption balanced batu call case cations changes checkers checks choice close closeness closeto combinatorica compare complexity computational computer computing conditional cumulative dasgupta degree devroye discrete distribution distributions dodis domain domains each efore electronic endence enough entropy eparate equal erent ergun evaluation example expansion extend extensions fast fischer following form fortnow foundations function general generating given goldreich goldwasser gorithm graphs hold identity ieee implies improved indep indicate instructive international interval intervals into journal kannan karmarkar kumar latter lehman lemma length linear loquium maxsmum model modi moment monotone monotonicity multidimensional needed newman numb obtain occur olylogarithmic olynomial only oracle oset ounded outline over packing pages partition partitioning patched pcps probability problems proc programming programs proof random randomization raskhodnikova references resp results rough rubinfeld samorodnitsky sample says science sciences scienti section sequence siam similar since smith smooth statistical step subintervaps such supp symposium system tasks techniques testing that then theorem theory these this thus time together tool under uniform uniformity unimodal unimodality variables various viswanathan where whether which white will with workshop
http://doi.acm.org/10.1145/1007352.1007422	49	Better Extractors for Better Codes?	algebraic algorithms alon alphabets amnon annual appear appears applications approximating aravind asymptotically august based beyond bound bounds bruck certain christopher ciently codes combinatorial complexity comput computer computing concatenated construction constructions correcting correction david decodable decoding depth developments discrete dispersers eatcs edmonds entropies erasure error expander explicit extractor extractors focs foundations from generator generators geometric good graphs guruswami hardness ieee improved indyk information institute jaikumar jehoshua johan joseph journal july lemma letin linear list luby luca madhu march massachusetts mathematics michael minimization moni muller naor near nearly news noga october optimal over pages piotr preliminary problems proceedings pseudo pseudorandom radhakrishnan random rate recent recovery reed references ronen ronny roth safra salil science sciences shaltiel shma shmuel siam sigact simple smaller solomon sources srinivasan stad stoc sudan superconcentrators symposium system technology theory thesis through time transactions trevisan umans unique vadhan venkatesan version very weak with without zuckerman
http://doi.acm.org/10.1145/1007352.1007399	31	Bypassing the Embedding	absolu abstract after algirithms algorithm algorithmic algorithms alon annual application applications applied approach approaches approximability approximate approximating approximation arbitrary architectures arora assouad asymptotic awerbuch banyans bartal based bilipschitz bits blackb bounded broder burlington calinescu callahan change charikar check chekuri chosen ciency claim clarkson class clidean clustering combinatorica communication communications compact comput computer computing conclusions conference consider convert coordinate coordinates coresets corollary covering cowen dans data decomp dedicata dimen dimension dimensional dimensionality discret discrete distance distinct distortion distrib distributed divisions doubling doubly dynamic each easy eddable edding eddings eilam elds eling endence endent enough ermutations erties etween euclid euclidean european every exists extended extension factor fakcharoenphol family fast faster finding follows forms foundations fractals fractional framework france frieze from function game gavoille geom geometric geometrical geometries geometry gives global goel graph graphs growth gudmundsson guha guillotine gupta hamming hand hard harrelson have hence hildrum ieee improved inal indep industrial indyk infocom inherent internet into intrinsically joint journal karger karlo karp katz known kolliop kosara krauthgamer kubiatowicz laakso lang langford large least length levcop line linear linial lipschitz lipschitziens locality localized london manuscript math mathematical mathematics mazumdar means median medians meets metric metrices metrics minimum mitchell mitzenmacher model modi moreover most multidimensional must narasimhan navigating nding nearest nearly necessary neighb nets network nite nonlinear note numb oint oints olygonal olynomial onential oper optimization oracle oracles origproblems ortant osition otential other otherwise oulos ound over packing page pages paral paul peled peleg perennes place plane plaut plongements plotkin polynomial predicting preserving press previous principles probabilistic probacm problem problems proceedings programming proof prop proximity quasip queries rabani rabinovich raghavan reduction references related requires restricted result round routing ruhl running salesman scheme schemes science sciences search sensitive server sets seventeenth shared shmoys shown siam sicomp silva simple since sion small smid smith society soda some space spaces spanners spaof springer steiner still stoc storage strategies streams stretch strucdiscrete structure structures succinct such survey symposium system tables talwar tardos tenenbaum that their theorem theoretic theory there these third thirteenth thirtieth thirty this thorup thus tial tight time trade traveling tree trevisan tural unless upfal value verlag vermont vertex weighted west what when where while wise with worse zhang zwick
http://doi.acm.org/10.1145/1007352.1007355	25	Expander Flows, Geometric Embeddings and Graph Partitioning	ability algorithm algorithmic algorithms annals application applications applied approximate approximating approximation available banach bisection capacity chains chbaum coloring combinatorial combinatorica combinatorics communication comparison comput computer computing concentration concurrent conquer convex coste covering designing diaconis discrete dity divide draft emans ermanent fast faster feige flow focs foundations fractional from garg geometric geometry graph graphs grotschel handbook hard holland ieee improved info interior jacm jerrum johnson journal karger karlo koneman krauthgamer lectures leighton lindenstrauss linial london lovasz markov math matousek matula maximum methods minimum mixing motwani multi multicommo nemirovskii nesterov nite north novemb olylogarithmic operations optimization other otzky ounds packing personal philadelphia philips plotkin point polynomial prelim prob probability problem problems proc programming publishing rabinovich ramanujan rates references results reversible salo sarnak satis schechtman schrijver science semide shahrokhi shannon shmoys siam simpler sinclair some spaces springer stoc sudan tardos their theorems theory trans using vazirani verlag version volume website williamson yannakakis zatloukal zwick
http://doi.acm.org/10.1145/1007352.1007445	69	The Complexity of Pure Nash Equilibria	academy according actually acyclic aliased also alternate always amsterdam analog another anteed appendix applications approximate areas argument arises assume auctions aumann awkward back basic behavior borm both bounding built cases cast cause cdam chapter choosing ciency cient circuit circuitflip class clause clauses clique combinatorial come comp complete complexity comprise computer computing congestion connections consider constructed contains convergence converges corresp counter creation defects delay delays details directly discrete discussion diversion dynamics each easy economic ecting ective ectively edges editors eforehand either eled else equilibria equilibrium ered ergate ering ermit erson ervariable establish etitive etween even example examples exceptions existence extra facchini facility fail feeding figure flip focs following form from full function functions game games gate gates general generality generalizing given going group groups guar guaranteed handbook hard hart have here heuristic higher holland however howson idea identi ieee implicitly incidentally included index indexed indexes indicates inducing inductive ings input inputs insp instance instances interact interactions international into journal just kernighan large lastly latter lemke lemma lexicographical lists literal local location long longer loss lower lyapunov matter means megen monderer more most multiset nash national necessary negatives network networks node nonatomic nondecreasing nors north notation note novel numb number oints ological olynomial omit once onding onentially onents only open optimization order ordered ordering original orlin osed ossessing otential otentials other ound output outputs outside over owers pages pair papadimitriou parallel parentheses parity partition path paths played player players posnae potential preceded preprocessed problem problems proc proceeds produced produces prohibitive proof proofs proposition prove proven punnen pure quite range rather real reconsidered reduction references refers remaining replaced replacing require resp result review rosenthal roughgarden roughly routing salesman same savani schulz sciences search seems separately sequence sequences shapley show showing shown shows siam simple since single sketch slightly smal societies soda sole solve some sort speci state stengel strategies strategy subjective such supp synonymous system table tardos technical than that their them then theory there these they this those though tijs time translate translating traveling treatment unrelated used utility valid variable variables variant verge verify vetta volume voorneveld weigh what where whether which with without witness xpnae yannakakis yields
http://doi.acm.org/10.1145/1007352.1007390	23	Visibly Pushdown Languages ∗	aided algorithms alur analysis annual appear applications approach association autebert automata automatic available balanced ball based bebop berstel boasson boolean boujjani bouquet burkart cachat calls cation characterization characterizations chatterjee checker checking chen code cohen communications comon complexity computation computer computing concur concurrency condition conditions conf conference construction context control data dauchet december dedicated draft driven duparc dynamic editor eighth elsevier esparza essays etessami european examining first formal foundations free fsttcs games gilleron gold grammars graph grappa grzegorz handbook harel henzinger horwitz http ieee information infrastructure international interprocedural interrupt jamani jcss jects jensen jhala journal jumdar knuth kozen kucera languages lautemann lecture leeuwen lille lncs logic logics lugiez machines madhusudan maler mcnaughton metayer model mops natural necula nested nite notes omega pages palsberg parenthesis poland precise press principles privacy proc proceedings processes program programming programs proofs properties publishers pushdown reachability recursive references regular reps returns rien rozenberg safety safra sagiv schwentick schwoon science security serre size software solving spain spin springer stack state static sutre symbolic symposium systems tacas tata techniques technology temporal their theoretic theoretical theory third thomas thorn tison tiuryn tommasi tools tree unboundedness univ valuations vardi veri volume wagner walukiewicz weimer winning with wolper workshop yannakakis zhao
http://doi.acm.org/10.1145/1007352.1007433	60	Approximate max-integral-flow/min-multicut theorems	algorithm algorithmic algorithmica algorithms among annals applications approximate approximating approximation aumann bogdanov bollob bound bounded bounds cambridge canadian chekuri colorability combinatorial combinatorica commodity complexity computations computer computing connection covering cuts cycles dahlhaus decomposition degree discrete disjoint dual edge editors excluded extremal forbidden ford foundations fulkerson garg geometry goldreich goldwasser graph graphs greedy gunluk ieee improved integer integral johnson journal karp khanna klein kleinberg kolliopoulos koml large learning leighton linial london lower mathematics maximal miller minors multi multicommodity multicut multiterminal network obata optimization packing pages papadimitriou path paths plenum plotkin press primal problems programming programs property rabani rabinovich ratio reducibility references revisited science seymour siam simonovits some stein subgraphs symposium szemer tardos testing thatcher their theorem theorems theory thesis through trees trevisan uniform using varadara vazirani venkataraman with without yannakakis york
http://doi.acm.org/10.1145/1007352.1007395	28	Completeness in Two-Party Secure Computation A Computational View	actually advance algorithms alice also altogether among annual anyway appendix application applications assume assumed assumption assumptions available average avours based basic basing beimel bellare boolean both cambridge canetti cannot capturing case certain characterization choose chor cient claim claims clean clear collections commitment communication communications comp complete completeness complexity computation computational computations computer computing concerns conducted conference consequences consider considering contain containing contracts contradiction contrary conversation core crep crypto cryptographic cryptography cryptology current cycle damgard demonstrates disc discrete discussing disregards distributed does door draft ecause eccc ected edded edge encryption ensures equivalence ermutations ersonal erties essential etween eurocrypt even every exactly example exchange exist existence exists fact fault fitzi focs following foundations founding fuctions function functions further furthermore game games garay general generality generate gertner given goldreich goldwasser graph guaranteed hamiltonian hand hard harnik harvard have here high honest html ieee image impagliazzo information input instances interactive israel issues istcs jority journal kannan kilian knowledge kushilevitz languages learn leaves lections legal lemma lemp levin limits loss lows luby malicious malkin math maurer mental micali minimal model more moreover most multi multiparty naor nature nding neither nisan nite nitely nition nothing notion oblivious olynomial oneway onewayness only oolean osition ossibility ostrovsky other ound output outputs pages part party pinkas plausible play predicate preliminary presentation press primitives privacy private probability problem proceedings proof proofs prop protocol protocols provable prove providing public questions rabin randomized receive reducibility reduction references reingold reject relationship requested required requirement rest results room rosen rudich salvail second secrets section secure security seeing semi send sending setting should show shown shows siam sides signing simple simply simulated simulation since society soda some soundness springer start state still stoc structure study such suppose symmetric symposium systems that their then theorem theorems theoretic theory there things this those thus tight time tolerant transfer transfers transitive trap trivial triviality under university uses validity value verlag version view viewed viswanathan volume weak weakened weizmann well were when where while wigderson will wisdom with within without working works world yield yielded zero
http://doi.acm.org/10.1145/1007352.1007427	55	Quantum and Classical Query Complexities of Local Search are Polynomially Related	aaronson addison aldous algorithm algorithmica algorithms also ambainis annals appear applied arguments barnum beals bennett bernstein bound bounds brassard buhrman cleve collision complexities complexity computation computational computer computing conference conquering cube data database decision deutsch discrete distinctness dividing durr easy element erratum existence fast foundations functions graphs grids grover hopcroft ieee information johnson journal jozsa kolmogorov laplante letters list llewellyn local lower magniez manuscript mathematics mechanical megiddo minimization minimum mosca nding neerbek nite optimal optimization ordered over papadimitriou physical polynomials power probability problem problems proc proceedings processing programming quant quantum query random randomized rapid references review royal saks science sciences search searching semide siam simon society solution sorting square strength structures symposium system szegedy theorems theoretical theory these total tovey trees trick ullman unpublished using vazirani verhoeven volume walk weaknesses wesley wolf yannakakis yves zalka
http://doi.acm.org/10.1145/1007352.1007378	14	Multilinear Formulas and Skepticism of Quantum Computing	aaronson abrams adiabatic aeppli aharonov algebraic algorithmic algorithms ambainis amme andreae arndt arrays assumption asymmetry based bell beth bohm book braunstein briegel browne burgisser calderbank cambridge caves charge chen chuang cient circuits class classical clausen cluster codes communication complete complexity comput computation computations computer computers computing cond condensed conf conjugation constant convenient cooling copp correcting correction counting cronin decemb decoherence determinant deterministic discovery discrete discussion dissipative distinct duality dynamics ects einstein emperor enchmark energy entangled entanglement eriment erimental ermanent error ersmith escu exist extravagant factorization fanout fault february fitch formulas fqma friedman functions furst gedankenexp general generation ghirardi ghosh goldreich good gottesman grangier gravity green group hamiltonians hamming heisenb hierarchy homer hooft html implementation implications implies inequalities information interacting interference janzing keller kind kitaev knill knowledge lecture leggett lett levin like limits linden linear lloyd local logarithms lond lukens macroscopic magnetic manuscript march martinez math matter measurement mechanics media methods microscopic mind mixed models molecules moore motivation multi multiple nairz nature negrevergne newsgroup nielsen noisy nonlinear oles olynomial origin osition ound oxford parity particle particles patel penrose persistent phys physics play podolsky pollett polynomial preparation press prime problems proc proceedings processing prosp quant quantum qubit raussendorf realization reason references representation research resilient review rimini roger rosen rosenbaum russian sampling saturating saxe schack schulman science search seems separability shma shokrollahi shor siam simulation sipser size slightly solution springer stability state states statistical steane stoc submitted surveys symmetry system systems tale testing theoretic theory there this time tolerant tolpygo transmission tseng under univ vazirani verlag very vidal violation wave weizmann wigderson wisdom with wocjan wolfram zeilinger zero zouw zurek
http://doi.acm.org/10.1145/1007352.1007357	51	Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus	academie adds adjacent after aided algorithm algorithms alon alpert also american analysis analytic annals annual another appendix applied applying april arose assign assignment assigns assumed available balancing beardon belyi both bowers bulgare calculations california case chains chan choice choices choose chooses choosing chosen cient circle clockwise close clustering coincide combinatorial comp complete completes comptes computer computing conductance conference connecting consider consist constant construct constructed constructing construction contained containing contains contemporary convergence counterclockwise deal decemb decomp degenerate degree design desired dessins determining directions discrete distinct divided division djidjev domain dynamic each ears ectations ected ective ectively ectral eddings edge edges either element elements elliptic encircle endow endp engineering entire equal erential erformance erforming etween every exactly except exists expanders explicit fact fiedler figure filotti fixed forbidden form forster foundations framework from function general generality genus geometry gets gilbert give given gives graph graphs grid grows guattery hagen have hexagonal horizontally html http hutchinson ieee illustrated illustration images implies inclusion indiana induces inequality institute integrated integration into journal just kahng kens koeb later least lectures lemma length line linear lipton list lists load loss made mapping maps markov math mathematical mathematics maximum mccaughan mesh meshes methods mihail miller most moving multigrid natural neighb nements netlist nite nonplanar note numb obtain obtains occurs octob oints online only order orhoods original osing osition other otherwise ound ounded over packing packings papers parallel partitioning path paths performance pieces planar preconditioners probabilistic probability problem problems procedure proceed proceedings processing produced produces producing proof prove provide quadratically question quotient quotients random randomized randomly ratio rayleigh recent recentpapers recurrence references reif relating rendus replaced representative representatives representing resasco resp restriction result results riemann rise rodin same schlag schramm scienc science sciences second segments selected separation separator septemb sequence sets seymour shaded shall share shorter show siam simon since small smaller smith society some spielman split springer stephenson steps subdivided subgraph subgraphs successive such sullivan supp surfaces surrounding survey symposium systems taken takes tarjan tech technology teng terms that their them then theorem theory there these this thomas thomassen three thus times transactions transience traversing treatment triangle triangles triangulations ucla under uniformization uniformizing uniformly union unique university unstructured using value values vector verlag vertex vertically vertices vlsi where which will williams with without works yields zero zien
http://doi.acm.org/10.1145/1007352.1007415	44	The Difficulty of Testing for Isomorphism Against a Graph that is Given in Advance	able account additional algebra algorithms alon applications approximate approximation arbitrarily association back bermond between blum boolean characterization cient close closeness closer cnrs colorability combinatorica compared comparing computer computing connection cornell correcting decisions each eared ecial edition eing elow encer erties erty etter etween european fact fischer focs fournier from function functions goldreich goldwasser graph graphs handbook here huge inter interesting interscience issue jasekaran john journal juntas kindler kluwer krivelevich large learning lemma letin loque lower luby made main make matrix method motivated narrowing newman numb numerical olynomial olynomials oolean other ound ounding parameter parameters pardalos partitions preliminary press primer probabilistic problems proc proceedings program proof prop prove question random randomized references regarding regular regularity reif robust rolim rubinfeld safra same samorodnitsky science sciences self siam soda sons sotteau still stoc structures sudan system szegedy szemer technical testing their theorem theorems theoretical this three tower treated trevisan tutorial uninformed university using values vergnas version weaker when wiley with would york
http://doi.acm.org/10.1145/1007352.1007394	27	New Notions of Security: Achieving Universal Composability without Trusted Setup	achieving adaptive agreement alon amit application archive assumptions asynchronous available barak boaz bounded canetti channels chosen cient ciphertext client coin colloquium commitment commitments communications completeness complexity composability composable composition comput computation computational computer computing concurrency concurrent conference constant crescenzo crypto cryptographic cryptography cryptology cynthia damgard danny details disc dolev dwork eccc electronic eprint erez eurocrypt exchange extraction fischlin focs foundations from functionalities functions game general generators giovanni goldreich goldwasser groth hard honest html http hugo iacr ieee integrity interactive ishai ivan jens john jority journal kilian knowledge krawczyk kushilevitz levin limitations lindell logarithmic malleable mano manuscript marc mental message micali middle model moni monitored multi naor necessary nonmalleable notions number oded ostrovsky pages paradigm party pass petrank play poly polynomial prabhakaran predicate preliminary preparation preservation privacy proofs protocol protocols pseudorandom quasi rafael rafail random ransom reactive realizing references resettable reusable revisiting richardson rompel rosen round rounds sahai schemes science secure security server setup shared siam signatures simulation stoc strict string symposium systems theorem theory time tossing transmission trusted tzmann under universal universally using version waidner weizmann wigderson wisdom with without yehuda yuval zero
http://doi.acm.org/10.1145/1007352.1007441	66	Sharp Thresholds For Monotone Properties In Random Geometric Graphs	above advanced after akad alexander alfr algorithms alternating american amount analysin analysis andrzej annals appel appendix application applications applied applies approximating arbitraril arbitrary assume asymptotic average barcelona being bejar below bernoulli bernoullis bhaskar birkhauser bollob booth boston bound bounds bourgain bruck brunswick cambridge capacity case catalunya cherno choose cluster cnica combinatorica communications complexity concentrate conclusion connectivity constant constants continuum control coverage covering critical cube debrecen december decreases density described diameter dimacs dimensional discrete distributed divided division durrett duxbury each edge ehud either electronic empirical erence erhard establish estimating even every evolution examine examples except expressions extra fleming follow following follows formally franceschetti friedgut from functional functions generalisation geometric geometry gets given godehardt gopal graph graphs grapphs gregory grid grids group gupta half have hence hereafter holroyd honor however ieee ignore imes immediate infocom information internets interscience interval intervals island janson jaworski jean jehoshua jerzy jordi josep joseph just kalai kluwer known kozl krishnamachari kumar larger largest last layout least leaves left leighton lemma length letters line longest lorna luczak magyar makes marc martin massimo matching matchings mathematical mathematics mathew mathimatic maximum mccolm mean measures meester method minimal minimax minmax models monographs monotone more moreover most move moved multigraphs must mutandis mutatis muthukrishnan network networks nevzorov note november number observe obtain only optimization order oxford pandurangan panganmala paper passant pearlman penrose percolation peres peter petit piyush point points polit positive power press prior probability problems proc procedure proceed proceedings process processes proof properties property proposition provide providence publication publicationes ralph ramon random rdinates records recursion recursive references renyi repeated report result rhode richard right ronald rucinski russo sake satis second section security segment sema sensor series sets shakkottai shall sharp sharper shift shor shown shrinking shro side silvestre simplicity simplifying since single smallest society some spanning srikant stant statistic statistics step stephen steps stochastic straightforward stretching stronger structural studies subcuboid submitted such suitable suppose svante symmetries systems taking tech technique technology than that then theory there therefore thesis this three threshold thresholding thresholds tight tomasz transactions transform transformation translations tree trees uences under unif uniform uniformly universitat university unreliable valery variables vieweg volume well when where which wicker wiley wireless with within wlog york yukich yuval
http://doi.acm.org/10.1145/1007352.1007411	41	Multi-processor Scheduling to Minimize Flow Time with Resource Augmentation	above algorithmica algorithms alon analogous analysis analyze ancient appendix approx approximating approximation arbitrary argument augmentation average avidor avrahami awerbuch azar balancing balter bansal becchetti bender bernoulli boats bound brevity chakrabarti chekuri cherno choose choosing clairvoyance clairvoyant clearly combining completing completion computer congress connection consider constant continuous critical crovella deadline denote dhamdhere dispatching easily epstein equation flow flowtime focs folklore frangioso function generalization gerkhe grove harchol help hence immediate indentical inequality interest international internet investigating jacm jaraman kalyanasundaram khanna krishnan large last lemma lemmas leonardi lifts little load machines mathematica metrics migration minimize minimizing more motwani muthukrishnan norm obtain online only optimal overload owtime parallel phillips plotting powerful preemptive probability proc proof prove pruhs random range references regev related resource rising scheduling schemes schroeder science series server servers sgall shaheen sigmetrics single smallest smalll soda spaa spaccamela speed srpt standard stein stoc streams stretch such suitably summations symposium systems takes technologies teletra that theoretical therefore thus tide time torng total under unfairness uniformly usenix using value variable variables veri vitter weighted wein where will with without woeginger works yadid
http://doi.acm.org/10.1145/1007352.1007428	56	The Quantum Adiabatic Optimization Algorithm and Local Minima	above adiabatic after again aharonov algebra algebraic algorithm algorithms also alternating anal analysis annealing annihilation anticommutation antiferromagnetic antisymmetric aperiodic appears appendix appl applications applied apply applying argument associated assume assumptions avron baake back best bhatia bound boundary bounded bounds calculations calculus case centered chain chains check checking choose cients circle circumference clarendon classic close commun commutes commuting compared complete completeness complex computation compute computer conformal conservatively considering constant constants corresponding count creation cursions davis defect defects depending derivative diagonalize diagonalized each easy eigenspaces eigenstate eigenvalue eigenvalues eigenvectors elementary energy erators erentiate erentiation error estimate evolution exact exactly example excitation expand explicit extended factor farhi fermi figure first focs following follows form foundations from gases generally give given gives goldstone grimm gutmann hall hamiltonian hand have hence here hermisson hermitian hide hinrichsen iaij implies included indeed independent induction instances integral integrals integrated integration interfaces interpreted intertwining into invariance ising jections jector kempe landau lapan large last lattice leave lemma lemmas lett level lieb linear little lloyd lundgren math matrices matrix mattis mechanics models more mosca namely necessary need nish nite norm notation note noting nucl number only onto operators order original originally orthonormal paper particular parts perturbation phys pick plane plug plus position positive power powerful preda preparation press previous princeton problem proc proof proofs proper property prove pulls quadratic quant quantum quasiparticle radius random real recursion recursively references regev required residues resolvent respectively ress result right rotation rules same satis says schultz science second section sector seiler semide show sibly similarly simon simple simulated simultaneously since single sipser soluble solution some sort springer start started statistical step subsets sums symmetric symp term terms that themselves then theorem theorems therefore these they this thus time times true under unitary universality university unpublished upper used using vacuum vazirani vector versus where which wilkinson will wish with write writing zhang zhao
http://doi.acm.org/10.1145/1007352.1007443	68	On Sums of Independent Random Variables with Unbounded Variance, and Estimating the Average Degree in a Graph	above according accuracy accurate actual additional advantages after algorithm algorithms align allow allowed alon also always analyse analysis anonymous anonymously appendix application applications arbitrarily arranged assume assuming assumption average backward basic because been before being below bethe between beyond bipartite both bounding bounds breadth break breaking case cases cause chebyschev choice choosing chosen ciently class community comparison complete completes complexity computation computational computed concentrated condition confused connect connects consider considered constant constants construct constructed contains contexts contribute contributes contribution convention corollary correspond could count counting cover covered covering current degree degrees denote depend depending derivative details determined devanur deviation disclose discovered distances distinguishing does dominated done dover dubins each earlier eccc edge edges either electronic ended endpoint endpoints ends equal equals erent error estimate estimating estimation event eventually every example except expectation expected explain expression expressions fact facts finding following follows forced formalists forward foundations four from furthest gamble general generality generally gets give given gives giving goldreich graph graphs guaranteed happen happens have head hence here hidden high higher highest hold holds however identical identify identity ignore ignored implies imply implying increase increasing independent induced inequalities inequality information interaction interscience into issues item items journal keep keeping know larger largest last later least left lemma length level lexicographic lexicographically likewise link lipton list local loquim loss lost lower lowing made make many markov maximized maximum mean means median merely merge merged method might minimized minimum model modi more moreover most moving much must name namely natural necesn necessarily need neighbors next nonconstant normalising notation note number numbered numbers observe obtain ofndegree omitted only operation operations optimality optimized order original other otherwise over pair parallel participates particular partition pass path paths perform persons place point pointer points positive possibility possible presentation previous prior privacy probabilistic probability processes proof proposition propositions prove proved publications quadratics quantities queried queries query querying question questionnaire quicker quite random randomized range ratio reached rearrangements reasonable redo references renaming represent require requires respect respective respectively results rigorous root rooted rule rules saga same sample sampling sary savage saving scanned search second section sequence sequences sets several shall shorter shortest siegel simple simplify simply simultaneously single situation size sketch smaller smallest some sometimes sort source spencer stage standard starting statement stating still stochastic straightforward stronger subcase subgraph suboptimally such summing support surplus symposium tail take taken term than that their them then there thereafter these they think this though three through thus ties time took towards tree trees trying turns under underwent unit universal unless used useful uses using values vanishes variable variables variance veri vertex vertices viewed vishnoi weakest were what when where whereas which whom wiley will willing with without words worst would york
http://doi.acm.org/10.1145/1007352.1007389	22	Using Nondeterminism to Amplify Hardness	abstract academic adam algorithms alternating alto ampli anderson andrej andrew annual applications aspects assumption atlanta average babai beaver bits bogdanov boolean boosting bounded cambridge canada carsten case cation chicago circuits coin collective colloquium combinatorica combinatorics complete complexity comput computation computational computer computing conference constant constructing core corrected cryptography decoding depth derandomizing dimacs directions distributed distributions donald donnell dover eccc edition editor eighteenth electronic emanuele exponential extended february feige feigenbaum focs fortnow fourteenth france from functions generators germany goldreich hard hardness hiding http ieee illinois impagliazzo instances interactive international ipping issue joan journal kahn kalai klivans lance learning lecture lemma leonid levin linial lipton list luca lund machine madhu march massachusetts matrices micali michael milwaukee mineola monotone montr mossel multioracle nathan network nisan nite noam noise nondeterministic notes november october oded pages palo paso pavan permanent plains predicate preliminary press problems proceedings protocols prover pseudorandom pseudorandomness publications queries random randomization randomness reducibility reductions references report reprint requires richard rocco rouen russell ryan salil science sciences seattle self sensitivity servedio sets siam silvio sivakumar somewhat space special springer stoc structures sudan symposium system technical testing texas theoretical theory time titled trapdoor trevisan trier uence under uniform uriel using vadhan variables verlag version viola volume washington white wigderson wisconsin within without workshop worst york
http://doi.acm.org/10.1145/1007352.1007367	5	Adaptive Routing with End-to-End feedback: Distributed Learning and Geometric Approaches	adam adversarial alamitos algorithm algorithms annual armed auer avrim awerbuch bandit baruch bianchi blum brendan casino cesa cient claim colt communication computation computational computer conf dates decision denote derived eared easily eiji equal equation focs following follows foundations freund from gambling global gordon guarantee have ieee induction information jority july kalai kernels learning littlestone manfred mansour maximum mcmahan multi multiplicative network nick nicol observation online outdegree pages path paths performance perosnal peter podc preliminary press problem proc proceedings proof references regret reliable rigged right santosh schapire science setting shortest side simple society symposium takimoto theorem theory thus tlog uses vempala version warmuth wash weighted while yishay yoav
http://doi.acm.org/10.1145/1007352.1007409	39	Typical Properties of Winners and Losers in Discrete Optimization	access acknowledgments addison admits algorithm algorithms allows altered alternative amount analysis annual anonymous applied approach arborescences arxiv assist assuming authors available average banderier barahona becchetti beier best between binary birkhauser blum bound bounded bounds case changes cients coef combinatorial combinatorica combining common competitive complete completeness complexity computer computers computing condition connection constrained contrast core cornput culty cycles damerow density dependence depends describes difference different discrete distance distinguishing drawing dunagan dyer easy elementary european exact example expected exponentially extend fact fashion feasibility feedback feige fifth foundations framework freeman frieze from function functional furthermore garey gaussian goemans goldberg guide hard heide http ieee incorporating indicating input instance instances integer interface interior intern into intractability inversion isolating johnson kind knapsack lemma leonardi level levin line linear logarithmic logarithmically loser lower lueker marchetti mass matching matchings math mathematics matrix measures mehlhorn method meyer minimum models motion motivation mulmuley multi multidimensional natural nding needs nition number numbers numerical obtain obtained ones only operations optim optimal optimization optimum order papadimitriou parameter particular partition paths perceptron perturbation perturbations point pointed polynomial polynomially possible presented presents primal probabilistic probability problem problems proc programming propose proved provided pseudopolynomial pulleyblank quantity racke random randomized ravi reading reciprocal referee references relationship remark remarkably renegar research resource results running salkin scandinavian schafer scheideler science section sensitivity series shortest should shows siam simplex slight small smoothed sohler solution solutions solving some sources spaccamela spanning spielman structures study subexponential subset such suggest summarize symp takes taking teng terms than thank that theory there these they this three thus time towards tradeoffs tree typically unless uriel usually value variant vazirani vocking vredeveld wads wesley which whose winner wish with work workshop worst would yannakakis yield zero ziegelmann
http://doi.acm.org/10.1145/1007352.1007361	0	Robust PCPs of Proximity, Shorter PCPs and Applications to Coding	abstract algorithmica almost alto amortized application applications approximate approximating approximation arora atlanta babai bellare biased bipartiteness bits bogdanov bound bounded bounds california canada cation cedures characterization characterizations checkable checking ciency cient cliques codes coding colloquium colorability combinatorial comp complexity computational computations computer computing connection consistency correcting deco degree dense diego ding dinur eccc electronic epsilon ergun error extended fast feige focs fortnow foundations free fully georgia goldreich goldwasser graphs guruswami hard hardness harsha holographic ieee inapproximability interactive journal juan july june katz kumar lapidot learning lemma length levin lewin linear locally louisiana lovasz lower lund montr more motwani multi nearly nexp nonapproximability obata optimal oregon orleans palo parallel parallelized pcps polishchuk polylogarithmic polynomials portland posted power preliminary preparation probabilistic probabilistically problems proc program proof proofs properties property protocols prover proving proximity puerto query random randomness raskhodnikova references reingold repetition report results rico robust rompel rubinfeld russell safra samorodnitsky sasson science sets shamir short shorter siam sipser size small soda some spielman stacs stad stoc structural sudan symp szegedy tech technical test testable testers testing tests theorem theoretical theory tight time towards trevisan vadhan vancouver veri version wigderson with
http://doi.acm.org/10.1145/1007352.1007406	36	Collective Asynchronous Reading with Polylogarithmic Worst-Case Overhead	academic access according achieving activation active adaptive adversary afek after agreement ajtai algorithm algorithms already amortized analysis anderson annual applications arch architectures aspnes asynchronous atomic attention attiya awerbuch bailey balter bartal beat been bound bounded bounding buss busy call called cardinality case certi charles chlebus ciency cient collect combinatorica communication communications comp competitive complexity composite comprehensible computation computer computers computing concentrator concurrent condensers conf conference consensus constant construction cooperative crcw data database degree delays demers despite detection deterministic discovery discrete diseases distinguish distributed dobrev dolev dwork dynamic eigenvalue entropy epidemic epoch every expanders explicit extractors failure failures fast fault faults fiat follows found foundations fouren free fresh from gafni gasieniec georgiou given gossip gossiping graph greene grif groups harchol hardware hauser hayden hebrew herlihy hurwood ieee ifip infectious information instance irish israeli iteration kanellakis karp kaufmann kempe kleinberg kluwer kowalski kutten larson last lattice least leighton less letters lewin linear list lived lncs location london long loss lynch made main maintenance making malewicz management martel mathematical mathematics memory merritt minsky model modi morgan need networks notions number numbers only open operations optimal paging parallel park pausing peleg pinsker pippenger platforms practical practice pram principles problem proc process processes processing processor product protocols purpose rabani rachman ragde randomized rapidly reach read references register registers reingold renesse replicated resilient resource respective restrict results robust round rounds rules rumor rumors russell saks scheduling schindelhauer science section selecting service share shared shavit shenker shma shvartsman siam simple simply sleator snapshots sorting spatial spreading springer stamping stamps still structures stupp sturgis style subramonian successful such swineheart symp symposium systems tarjan teletraf terry that theory there thesis this time timestamp timestamping tolerance tolerant tolerating touitou towards tromp umans unbalanced university update upfal using vadhan variables vitanyi vocking vrto waarts wait waves wigderson with woll work write zuckerman
http://doi.acm.org/10.1145/1007352.1007379	15	Exponential Separation of Quantum and Classical One-Way Communication Complexity	aaronson advice alamitos algorithms ambainis annual argument arguments babai bits buhrman cambridge cell chuang circuit circuits classical cleve codes coin combinatorica common communication complexity computation computational computer computing conference connectivity consequences cover decodable depth discrete distributive elements factorization focs foundations frankl games geometric hebrew icalp ieee information intersection jerusalem john karchmer kerenidis kimmel klauck kremer kushilevitz letters limitations locally logarithmic logarithms lower master messages model monotone newman ngerprinting nielsen nisan onential ound ounds pages physical polynomial press prime private prob probabilistic problem proceedings processing protocols public quantum query questions random randomized references related require review round sampling schulman science separation shma shor siam simultaneous solution some sons stoc symposium szegedy theorems theory thesis thomas time university vazirani vegas venkatesh volume watrous wigderson wiley wilson with wolf