http://www.informatik.uni-trier.de/~ley/db/conf/stoc/stoc2003.html STOC 2003 http://doi.acm.org/10.1145/780542.780620 58 Sublinear Geometric Algorithms∗ additive advances agarwal alamitos algorithmic algorithmica algorithms along amer american angle appl applications approach approx approximate approximating approximation argument arrangements assumed autonomous barequet because berlin binary boundaries bounding cambridge cation chazelle checkers checking chen chosen cient ciently claim clarkson classes combinatorial completes complexity comput computation computational computer computing consisting constant constructions contemp convex curve czuma delaunay determining devroye diagrams diameter dimensional dimensions disc discrepancy discrete distance distances dobkin dudley dynamic each easy ectively edges endp ensure entirely entropy eppstein erback erentiable ergun erickson etween euclidean everything extrema extrinsic fact fast figure folding follows formed fortnow four from functions geodesic geom geometric geometry given goodman handb higher icalp ieeee implies incident including intersection jcss kannan karia kirkpatrick kumar lemma less levels lies line linear location made magen makes mapping math mathematical mathematics matou mehlhorn method metric minimum mitchell mobile monographs most mount mucke mulmuley naher nevigation newman nition normal note numb objects observation obviously oints olygonal optimization orary order output over papadimitriou path paths peled perception plane planes pogorelov point points pollack polyhedra polyhedral polyhedron polytope polytopes preprocessed preprocessing press problem problems proc programming programs proof property providence putting queries random randomization randomized randomness range ravi references relatives resp rubinfeld saias same sampling schilz schirra schorr schrijver searching seel seidel sensitive separation sets setting sharir shor shortest shows siam simple since smal socg society soda sohler some spaces spanning spot springer stoc structures sublinear summing surfaces surv term terrain testing than that them theorem theory there therefore this three time together translations tree trees triangulations tschel tutorial uhrig university varadara veri verlag version vertex view viswanathan volume voronoi where which whose with within without ziegler http://doi.acm.org/10.1145/780542.780545 1 Classical Deterministic Complexity of Edmonds’ Problem and Quantum Entanglement accepted accessible addison advances algebra algebras algorithm algorithms amer annual applications approximate approximating around arxiv ation balls bapat barnum barvinok beauzamy berlin bipartite bombieri bound bounds bureau certain chistov cient cients circuit classical colloq combinatorial communication comp completion complex complexity comput computation computational computing conference conjecture convex corollary decompositions degot derandomizing determinant deterministic dimensional discrete discriminant discriminants distinct doubly edmonds egorychev ekonomica electronic entanglement enumeration error estimates estimator exponential extremal factor falikman forster geom geometric geometry grotschel gurvits hawaii identity ieee impagliazzo implies inequality informational insights integral introduction issac ivanyos journal kabanets karpinski lanl largest laur linear linial lovasz lower many matching matematicheskie math mathematics mathl matrices matrix maui maximally maximum means method methods metody minc mised mixed modelling modules montgomery monthly national nature neci nemirovski nemirovskii nite nonnegative norm number operational optimization over permanent permanents personal phys polynomial polynomials positive preprint priori probabilistic problem problems proc products programming proof proving publication quant quantum random reading references report representatives research result reznick robust russian samorodnitsky scaling schrijver semide separable sharp simply sixteenth solution springer standards state stochastic strongly structures submitted symbolic symp system technical tests theoretic theory time topological unbiased unbounded unclassi valued variables verlag volume volumes waerden wesley wigderson with within yianilos york yudin zametki zeilberger zvonkin http://doi.acm.org/10.1145/780542.780578 26 Random Knapsack in Expected Polynomial Time academic adding algorithm algorithms allocation analysis appendix applications applied assume atri average balas because between birkhauser borgwardt bound bounds brzank capital case cient combinatorial completeness complexity comput computational computer computers computing conditioning consequence copenhagen coster cryptographic cryptology dantzig denote density difference diku dimensional discrete disjoint dominating dyer dynamic effects element enumerative equality equation equations estimated estimation european event events every exact expected exponentially expression extremum factor fayard finally finding first follows formal freeman frieze garey goldberg guide hand handbook have hence hold horowitz however impagliazzo implementations improved increase inserted integer interface into intractability item johnson journal joux kluwer knapsack lagarias lamacchia large last left lement lemma line linear lueker management marchetti martello math mathematics maximizing methods most multi multidimensional naor need nemhauser ness next number observe odlyzko operational operations optimization optimum order overlap pardalos partition partitions pisinger plateau polynomial probabilistic probability problem problems proceedings programming proof provably prove publishers puech random references research rewrite right sahni saving schemes schnorr science second secure sets shang show siam simplex single slightly small smoothed solution solutions solving spaccamela spielman stern stoc structures subset substituting symposium takes teng term terms that then theory these thesis this thus time toth trends ullmann university upper using usually variable variables verestim weingartner were where wiley with would yields zemel zero http://doi.acm.org/10.1145/780542.780621 59 Distinct Distances in Three and Higher Dimensions∗ academic advances agarwal algebra amer aronov arrangements binatorics bollob bolyai budap chazelle chung circles clarkson combinatorial combinatorica combinatorics como complexity comput computational computing crossing curves determined deterministic dimensions discrete dise distances distinct eared earlier edelsbrunner eighty elekes encer erdos etween euclidean extremal favourite friedman geom geometry graph guibas hard higher homogeneous hung improvement incidences katz kely koltun lectures lemma lems manuscript math mathematical mathematics matou mikl monthly note numb oints ounds pach paul periodica plane press probability probe problems proc products random references ries sampling sets sharir society solymosi some spheres springer studies submitted sums symp sympos szemer tances tardos theorems theory three trotter unit unpublished verlag version versus view welzl wiley york http://doi.acm.org/10.1145/780542.780640 74 Two Applications of Information Complexity abandon ablayev abstract addition additional advice algorithm algorithms alice already analog annual appendix application approach approximation ascertain back background based basic beame beating below between bits blum boolean buhrman cambridge carlo cases chakrabarti choose chor circuits classes coin collective combinatorica common communication complete completely complexity computation computational computations computed computer computing conditional connectivity consider continue cost cover crew cult data decision definition denote denoted depth details determined deterministic direct directional discrete distance distribution distributions distributive divergence done easy ected editor elements entropic entropy equality erent error erty etter etween evaluate evaluates evaluating evaluation evaluations event example extended fact facts following former formulae found foundations from function functions furer game general generality given governed hartmanis have heiman hellinger help hemachandra here hromkovic ieee impagliazzo improved included independent indicate inequality information informational input inputs interpreted intimately ipping jayram jensen john joint jority journal karchmer kullback kumar kushilevitz languages latter lawry leibler letters limitations limited linear linial list logarithmic loss lower lows machines majority makes manner many matching mathematics measures mentioned message metrics micali model modulo monotone monte much mutual newman nisan nondeterministic nondirectional nondirectionality notions numb obtain obtained once ones only optimal oracle order orlitsky osition ossibly otherwise ound ounds outline ower pages pair pairs party paste prams press privacy private probabilistic probability problem proc processing proofs prop properties property proposition protocol pythagorean query questions quite random randomized randomness read rectangular recurrence recursive recursively references related relates relationship remaining require required reverse root saks same sample sampling santha satis schnitger science separate shannon siam siblings simultaneous since sivakumar sketch snir solution some sons space standard statistical statistics stop straightforward stream structures subadditivity subtree subtrees survey switch symposium tardos ternary than that their then theoretical theory these this thomas threshold thus tools total transactions transcript transcripts transfer tree trees triangle ullman under uniform university used value variable variation versus vlsi were when where whereas which wigderson wiley wirth with without wolf yannakakis yehuda yossef http://doi.acm.org/10.1145/780542.780588 33 On the Fractal Behavior of TCP academic addison aimd aligned almost also analysis appendix argument assume available axis baccelli balakrishnan barnsley base because behavior boda boston both boulder canada cascades case cases centered chaotic chapter choose chosen citeseer close closed company complete conf congestion control corollary cult data deal delicate denotes discrete dover dumas dynamics equation ethernet even everywhere fairness falconer feldmann finally following follows fomin fore fractal fractals francisco freeman from geometry gilbert given goal guillemin have hence here hnfer hold hong however html http huang hypotheses icir ieee impact implies imply include induction inductive infer infocom integ integral internet introductory investigating iteration john kolmogorov lanman later leland lemma length lerton limit long lustrated mandelbrot markovian match mathematics mckeown mimics model models multifractal nature networks nonnegative numbered omit omitted ones only open order padhye part parts performance periodic pick press proc proof proofs prove proven proving publication publications reading real recalling references respectively rest results ribeiro robert role satis says scaling self short side sigcomm similar similarly simple since sons square statements stevens study such suppose symposium taqqu tedious that then there therefore they this those three true under uses vancouver variability veres versions vols want wesley where wiley willinger wilson with workshop wright york http://doi.acm.org/10.1145/780542.780571 21 Time-Space Tradeoff Lower Bounds for Integer Multiplication and Graphs of Arithmetic Functions ablayev ajtai algorithm algorithms also appear applications applied arithmetic available beame binary bollig boolean borodin bound bounds branching bryant carter cient classes closest communication comp compl complexity computation computational computer computers computing cook csit decision determinism diagrams dietzfelbinger discrete driven edition electronic exponential focs functions general gergov graph hagerup hard hash hashing homes html ieee implementations independent informatik information input integer jainen jayram journal jukna karpinski kata lecture letters limited linear lower machines mansour mathematics memory mfcs model monographs multiparty multiple multiplication nearest neighbor networks nisan nondeterminism nondeterministic notes obdd oblivious once optimally ordered pages pair parity penttonen philadelphia ponzio primes problem problems proc processing program programs publications rams random randomized razborov read references reliable report reports representations restricted restrictions root saks science sciences sequential siam size smolensky sorting space springer stacs stoc strongly super system technical technique tests theoretical theory time times tiwari tradeo transactions trier types under unitrier universal universit users using variables various versus vlsi volume waack washington wegener wegman wise with without woelfel http://doi.acm.org/10.1145/780542.780593 37 Sampling Lower Bounds via Information Theory achlioptas algorithm algorithms analysis application applications approximating approximations asymptotically average azar based batu berkeley bhattacharyya bits bounds canetti carlo cation ciency cient classi close clustering common communication comp complexity compression computation computations computer conference cover data dence depth discr disp distance distributions divergence division drineas ectral edition elements empirically entropy erconcentrators ersers erties estimating etitive even extractors fast fiat focs fortnow frieze goldreich golub graph graphs gutman hardness hopkins ieee information intervals jcss john johns kailath kannan karlin kerenidis kullback kumar large leibler letters loan lower manuscript massive math matrices matrix mcsherry measures monte multiple nding newman nisan observed optimal ounds pages pass pattern press private proc processing prop radhakrishnan raghavan random randomness rank recognition recommendation references regarding rubinfeld saia sampling science selection sequential shannon shma siam siegmund signal sivakumar smith soda some sons springer statistics stoc systems technology testing tests that their theorems theory thesis third thomas three toussaint transactions trevisan universal university vempala verlag vinay white wigderson wiley with yossef http://doi.acm.org/10.1145/780542.780618 57 Pricing Network Edges for Heterogeneous Selfish Users academic advanced agents ahuja algorithms analysis anarchy annals annual applications archer areas arrow assignment asymmetric bailey beckmann bellcore bergendor border braess brouwer bureau cambridge carstensen chapter civil cole commerce communications complexity computer computing conference congestible congestion constrained coop cornell cost crowding current dafermos data demand designing discrete dodis economics ects editors elastic electronic endent engineers equilibrium erative fixed florian flows focs foundations fourth framework frugal game games general generic hager hall handbook hard hearn help hirsch holland honor ieee indep institute internet intriligator journal kluwer large larsson link lower mackie macmillan magnanti management marcotte marginal mason mathematical mathematics mcguire mcknight mechanisms memo michael milchtaich mirrlees modeling models much multiclass nagurney nash national nding network networks nguyen nonatomic nonlinear north oints ology onential operations optimal optimization orlin ortation ounds pages papadimitriou papers paradoxon parameter parametric pardalos path patriksson patterns peressini physics pigou point preliminary prentice press price pricing problem problems proceedings programming publishers ramana references research resources road roughgarden routing schmeidler science sciences selected sensitivity septemb series shortest siam side smith solving some sparrow springer standards statistical structures studies sullivan symposium system tardos tarjan taxation taxes theorems theoretical theory thesis through toll tolls transp transportation trends truthful uniqueness university unpublished unternehmensforschung user users varian vavasis verkehrsplanung verlag version volume wardrop welfare winsten with yale yildirim http://doi.acm.org/10.1145/780542.780599 42 Optimal Oblivious Routing in Polynomial Time algorithmic algorithms allocation also annual applegate applications architectures arrays aspnes awerbuch azar balancing borodin brebner changing chapter circuits cohen combinatorial combinatorica communication comp computation computer computing conference congestion croft deadlock demands distributed domain editors ercub etitive fiat focs fundamental general geometric global good grotschel hypercubes intra introduction jectives journal kaklamanis krizanc leighton leonardi line load local lovasz machine maha making mansucript measuring merging minimizing models morgankaufmann network networks oblivious ologies online optimization ounds pages paral parallel plotkin proc proceedings proofs provably publishers raghavan randomized references resolution resource robust rocketfuel rounding routing scheduling schemes schrijver sciences sigcomm sorting spring springer state stoc symposium system technique theory thompson tight tradeo trees tsantilas uncertain understanding universal valiant verlag virtual waarts wetherall with woeginger york http://doi.acm.org/10.1145/780542.780641 75 Bounded-Concurrent Secure Two-Party Computation Without Setup Assumptions adaptive against applications arguments assumptions attacks barak barrier based beaver beyond black blind bounds canetti chaum chosen cient commitments communications completeness complexity composable composition computation computational computing concurrent conference construct contracts crypto cryptographic cryptography cryptology digital dwork essential eurocrypt even exchange fair fischlin focs foundations functions game garay general generate goldreich goldwasser honest ieee immoral impagliazzo interactive internet jority journal kilian knowledge kushilevitz lempel levin limitations lindell lncs logarithmic logartihmic lower luby mackenzie manuscript mental message micali multi multiparty naor necessary note oblivious ostrovsky pages paradigm party payments petrank play poly prabhakaran preliminary presence proofs protocol protocols racko random randomized references requires resettable richardson rivest rogaway rompel rosen round rounds sahai scheme secrets secure security sicomp signature signatures signing simulation springer stoc their theorem transfer universal universally unpublished untraceable verlag version wigderson with without zero http://doi.acm.org/10.1145/780542.780626 63 A Stochastic Process on the Hypercube with Applications to Peer-to-Peer Networks accessing addressable algorithms allocations alon applications architectures area azar balakrishnan balanced berkeley broder butter choices chord chvatal cient communication computing conference content copies discrete distributed distribution druschel dynamic editors emulation encer environment ergeometric ersonal estry fault francis greg handbook handley heide hildrum ifip infrastructure international internet jaraman jasekaran jczak ject jects john joseph june kaashoek karger karlin karp kluwer kubiatowicz large leware location lookup luby machine malkhi mathematics memory method meyer midd mitzenmacher morris naor nearby network novemb ower pages paral pardalos pastry platforms plaxton pram press principles probabilistic proceedings random randomized rata ratnasamy references replicated results richa rolim routing rowstron scalable scale service shenker sigcomm simulation sitaraman sons stoica survey symposium systems tail technical techniques theory tolerant upfal viceroy wide wiley zhao http://doi.acm.org/10.1145/780542.780562 14 Linear Time Encodable and List Decodable Codes able above accomplishes according added adding addition adjacency adjacent after again ahead akes alekhnovich alex algebraic algorithm algorithms allerton alon alphab alphabets already also alternatively amnon anal analysis analyze annot annual appendix appl application applied apply appropriately approximate approximately april argue arguing argument arguments assume assumed assuming assumption asymptotically august authors average based basically beyond bigger bleichenbacher bound bruck bunch calculations cally cannot cardinalities care case cases cauchy certain changes channels chinese choice choosing chung cient ciently claims cleaner clear clearly close clude codes combinatorica combining comes communication comp complement complexity computation computational compute computed computer computing concatenated concerning conclude concluded condition conditions conference consider consistently constant constants construct construction constructions containing contradiction control convention converted coordinate coordinates copy correcting correction corresp created crux daniel data david decodable decode decoding decomp decreasing degree deleted denotes density desired dimensional diophantine directly discrete distance distribution does done drops during each easier ecause ecomes ectral edge edges edmonds eginning eigen eigenvalue eigenvalues eigenvectors eing electronics elements elias elow encodable endence engineers enough ensure enters entries equal equals equation equations equivao erasure erform erimetric erimetry error erties erty establish estimating etween eurocrypt even exact exactly execution expander expansion explicit extend extending extractor fact factor fairly fast feng finally firstly focs following follows foundations fraction from functions fundamentals furthermore geometric gitit given gives goals good graph graphs guarantee guruswami half have here hich high holographic however ieee ignore imaginary imagine implicitly implies imply improved include increasing indeed indices induced indyk inequality information initial instead institute international interpolation into intuition investigate isop iterating iteration iterations iterative january jection jehoshua joseph journal jumping june just keep keeps know known krakow kuczynski laboratory lanczos large larger largest last later latter least leaving lecture lemma lemmas lently less limits linear lipton list lncs lower lubotzky luby made madhu main make makes many massachusetts math matrices matrix matter maximize maximizes means method michael might minimum missed mistakes mixed moni more moreover most move much multiple multiplication must namely names naor near nearly necessary need needed negligible networks newly next nguyen nite node nodes noga noisy nonnegative norm notation note notes nothing numb observe obtain obtained october olynomially once onding onds onents only onto optimal order orthogonal osing osition ositions ositive ossible other otherwise ound ounded ounding ounds outside over owing padded pages pander parameters part particular partitioning peter phillips pick piotr plugging poland polynomial polynomials positions positive power precedes precise precisely presentation pretend pretty previous probability procedure proceed proceedings proceeds process progress proof proofs prop prove proved provided pseudo quantitative quantity quarterly question radio ramanujan random randomized rate readable reader reading really reason recall reconstructing record recovery recurrence reed references regular relation remain remaindering remaining remains remarks remove removed remover removing replace report represent research resp result resulting returns richard right ronitt ronny roth routing rovided rubinfeld ruckenstein running runs runtime sarnak satis satisfy schwartz science second seek semide sense september setting several shma should show showing shown siam side sigal similar simple since sity size sized slack small smaller soft solomon some soon sorted space sparse spectral spectraldecode spielman split springer stage stages start starting step steps stoc stop stress subgraph subgraphs subsection subset such sudan suitably summarize supp symmetric symposium take takes task technology term terminates termination terms than that them then theorem theory there therefore these thesis they thing think this though thought through thus till time times together tolerant total transactions true turn under unique unit unpadded until used using value various vector vegas venkatesan verify verlag vertex vertices very view want well were wescon when where which whole will with within wlog words work would wozencraft wozniakowski wrapping zero zuckerman http://doi.acm.org/10.1145/780542.780553 7 Quantum Time-Space Tradeoffs for Sorting ∗ aharonov algorithm algorithms also ambainis applications arguments automata beame bennett bernstein borodin bounds brassard buhrman cambridge channels chuang circuits classical collision complexities complexity computation computational computer computing conference cook cormen crep database decision distinctness dual durr einstein element elements fast fich foundations general grover heide heiligman ieee information international introduction josza journal kitaev kolmogorov languages leiserson lett linear loquium lower magniez measures mechanical meyer minimum mixed model nding near neerb nielsen nisan optimal ordered orting ounds pagter peres phys podolsky press problems programming quant quantum randomized rauhe references reisch rivest rosen saks santha schnitger science search searching sequential siam sorting space state states stein strengths survey symposium telep theoretical theory three time trade tradeo tree unique university unknown upfal vazirani weaknesses wigderson with wolf wooters http://doi.acm.org/10.1145/780542.780577 25 The Threshold for Random k-SAT is 2k ln 2 − O (k) ability achlioptas acta algorithm algorithmic algorithms amer analysis analytic annual appl applications approximating arti asymptotic automat available bdds berlin biere boufkhad braunstein brownian bruijn chao checking cheeseman cial cient cimatti clarke clause computer concerning conditions conference conjecture constraint crato davis demb discrete distributions domain dover drunkards easy edition encoding endent envelop erties european extensions formulae formulas foundations franco friedgut frieze from generalization germany gets gomes graph greedy growing gsat hang hard heavy heuristics http hung ijcai indep inform instance intel international joint kanefsky kaufman kautz kirousis know kranakis krizanc lalas large lecture ledge levesque ligence literal logic long mandler math mcallester mechanics method methods mick microsoft mitchell model moderately monasson moore morgan motion national nature necessary news notes octob odds oints olic optas order oris ositional pages parisi paths paull peres phenomena phys planar planning plans preprint principles probabilistic problem problems proc procedure prop propagation publications pushing putnam random really reason reasoning reed references representation research rosen satis satisfaction science search selection selman sharp side simple solution solving some springer stamatiou statistical stewart stochastic structure structured structures suen survey symb symposium tacas tailed taylor testing theory thick threshold thresholds tight typical unit unsatis version views volume walk where without wormald york zard zecchina zeitouni http://doi.acm.org/10.1145/780542.780597 40 Simpler and Better Approximation Algorithms for Network Design access adam albert alexander algorithm algorithmic algorithmica algorithms amit amitabh amos analysis andrew andrews annual anupam applications approx approximating approximation approximations arbitrary arie atlanta aviv awerbuch azar bartal baruch bell branch broadband building bulent bulk capacitated chaitanya cheriyan chiu communication competitive comput computer computing connected constant cost data david design designing discrete distance distributed dual edge exible facility factor fiat fingerhut focs formulation foundations gabriel garg general generalizations generalized global goran goyal graphs greenberg guha gupta hassin hierarchical ieee improved incomplete incrementally information informs installation integrality interconnection ipco israel jacobus james jennifer jonathan joseph journal kamesh karger khandekar khuller kleinberg knowledge konjevod kumar kunal least letters line link lisa lncs location lowe management maria matthew merwe metric metrics meyerson minkoff mishra model multicommodity munagala mungala natural naveen network networks nicholas nonblocking optimization pages paging partho pawan placement plotkin preliminary prim primal private probabilistic problem problems proceedings processing provisioning rabani rajeev ramakrishnan rastogi ravi refael references rent resource review robert robins rohit roughgarden ryan sairam salman samir science serge seventh shaped shortest siam sibel sigcomm single sinha sink some spaces star steiner stoc subhash subramanian sudipto suri swamy symposium system talwar tamir technical theory thesis timothy tree trees turner university version virtual volume ward with yair yener york yossi youngho yuping yuval zelikovsky zhang http://doi.acm.org/10.1145/780542.780570 20 The Computational Complexity of Some Julia Sets academic addison analysis applications barnsley beauty berlin blum boston braunschweig chaotic chichester cient city classroom complex complexity computable computation computational computer computing devaney dimension dynamical dynamics edition engelking enumerable everywhere exchange falconer foundations fractal fractals general geometry heldermann images introduction john julia jurgens kamo kawamura logic machine mandelbrot mathematical mathematics metric milnor models part peitgen physica press pure quarterly real recursively redwood references richter saupe science series sets shub sigma smale sons spaces springer subsets systems takeuti their theoretical topology turing variable vieweg volume weihrauch wesley wiley york zhong http://doi.acm.org/10.1145/780542.780548 3 Better Streaming Algorithms for Clustering Problems ajtai algorithm algorithmic algorithms alon analysis appl application approach approximate approximating approximation approximations arora arya based callaghan center charikar chekuri cherno cient cluster clustering combinatorial complexity computation computer computing conference constant constraint could counting data datasets diameters dimacs discrete distributions dual dyer dynamic eddings erence euclidean example facility factor fast feder feigenbaum focs frequency frieze garg generators geometric gilb given graphs guha hakimi henzinger heuristic heuristics histogram histograms hochbaum icalp improved incremental indyk information inversions jagopalan jain jaraman jayram jcss journal kannan kariv khandekar khuller korup kotidis koudas kumar lagrangian large letters lindsay local location maintenance manku manuscript massive math mathematics matias median medians metric mettu meyerson minimize minimum mishra moments motwani mount munagala muthukrishnan narasimhan network oblinger online operations optimal order ossible ound ounds outliers packing pandit panigrahy parnas part pitt plaxton plotkin primal problem problems proc processing pseudorandom quick raghavan random reductions references related relaxation research retrieval roblems sampling scheme schemes science search series shim shmoys siam sigmod simple sivakumar small soda space spaces sparse stable statistics stoc strauss stream streaming streams sublinear such szegedy tardos techniques testing theoretical thorup time triangles unpublished using vazirani violation viswanathan vitter wald with yossef young http://doi.acm.org/10.1145/780542.780560 12 Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument access accordingly adaptively algorithm almost alphab alphabets also always ambainis america amplitudes annual answer answers appendix applies approximating aspects assume assumption automata average averaged averaging babai barrier beaver beigel beimel below better bility binary bipartite bits bitvectors both breaking brie buhrman cambridge carries case cell chain chapters checking choice chor chuang ciency classical cleve close code codes codewords communication complete complexity computation computational computations computer computing conditional conference connection consider consists constant control converse correcting correctors cryptography decodable decoder decoding definition denote density describ deshpande details dimacs directions disjointness distance distributed each earlier eccc efore either enables encoding encodings entanglement entropy equal equations equivalent erator error ership essentially established etween even exist exists expander exptime extend extensive extractors fact factors familiarity fano february feigenbaum first focs following follows form fortnow fourier from function functions gasarch gemmel generators getting given gives gkst going goldreich good hadamard half hamming have hence hiding highly holds holographic icalp ieee ignore immediately implies index individual inequality information inner input instances interaction interrogation into ishai jain journal just karlo katz kavitha klauck kushilevitz larger ldcs least lecture lemma length letters levin linear lipton local locally lokam longer looks loss lower luca machine makes matrices matrix measuring memb mentioned miltersen model modi modify more most multi must mutual nasa nayak nearly need negation neumann nielsen nisan nition nonbinary nontrivial notation note notes notion notions obata obtain octob olylogarithmic olynomials onential only optimal oracle oratories orms osition ound ounds outcome output outputs over pages polishchuk povm predict predicting predicts preliminary press price private prob probability probawith procedures proceedings processing product products proof proofs prove pseudorandom publishable putting qcqc quant quantum qubit qubits queries query radhakrishnan random randomized randomness raymond recovered recovery reduce reduced reducibility reduction references reingold relative remark replacing represent representation reprove require resilient retrieval returning returns roughly rubinfeld rule same satisfy scheme schemes schulman science second section self server sets shma show siam similar simplicity simulators since sipser size smooth smoothness some somewhat spielman split springer state stated states steps stoc string strings subadditivity subsets subsystem success such sudan suggested switching symb symposium system systems szegedy takes tapp technical testing that their then theo theorem theoretic theoretical theory there these this through tight time together transactions translates trevisan turn under university unless uses using vadhan venkatesh version very viewing volume weaker well when where which wigderson will with without works workshop xors zuckerman http://doi.acm.org/10.1145/780542.780636 71 Space Efficient Dynamic Stabbing with Fast Queries abstract algor algorithms also alstrup ancestor andersson announced applications approach arithmetic arxiv beame bentley berg binary boas bounded carnegie cation cient classi combined comments comp comput computational computing corp corr data decemb deering design deterministic dictionaries dispatching dynamic edelsbrunner emde enumerating extended faster feldmann ferragina fich focs forest fredman fusion geometric geometry graz grid group hagerup hinden hler http husfeldt ieee ietf implementation infocom information informationsverarb inst internet intersecting intersection intervals ject journal kaas klee kreveld languages less letters linear logarithmic lookup marked matching math mccreight mehlhorn mellon method miltersen multi multiplications muthukrishnan nato network notices oating oint onential optimal order ordered oriented orthogonal ository ound ounds overmars overview packet pages pagh predecessor preserving priority problem problems proc processing protocol queries queue queues rauhe rectangle rectangles references related request research scaling schwarzkopf search searching series sets siam sigplan sorting space springer standard stoc string structures sublogarithmic surpassing syst tarjan tech technical techniques than theoretic theory thorup tight time tradeo trees univ university verlag version willard with without working xerox zijlstra http://doi.acm.org/10.1145/780542.780598 41 Meet and Merge: Approximation Algorithms for Confluent Flows algorithm algorithmic algorithms alon annals annual applications applied approximate approximation athreya aumann balancing bicriteria bounded branching broadcasting cambridge canada canadian chen cherno class college combinatorial combinatorica combinatorics commodity communication computer computing conference covering croft data dehne department design designing dimacs ding dinitz directed discrete ecial editor editors encer endence erences erschatz evaluation evans fairness feller flows ford fortune foundations fulkerson garg geometry georgia goemans good graphs group gupta homeomorphism hose hunt ieee indep infocom information introduction ising issue jacm jaraman journal july june karp kenyon khuller kleinb konjevod kumar lecture leighton limited linial load london lorenz marathe march mathematics maximal mcdiarmid meet merge method methods model montr motwani multi multicommodity nahrstedt network networks northeastern notes novemb olylogarithmic optimization orda ounded ounds pages peres premium press princeton private probabilistic probability problem problems proc proceedings process processes proofs provably provisioning rabani rabinovich raghavachari raghavan random randomized rastogi ravi references review rosenkrantz rounding routing sack santoro schmidt schulman science serv shavitt siam siegel siemons sigcomm silb single some source springer srinivasan statistics steiner stoc structures subgraph sundaram surveys symposium tardos technical technique their theorem theorems theoretical theory thompson through tree trees uent university unsplittable vidyashankar virtual volume wang whitesides wiley with workshop wyllie yener york young zhang http://doi.acm.org/10.1145/780542.780622 60 Cutting Triangular Cycles of Lines in Space∗ agarwal algorithm algorithmica algorithms almost annu appl applications appls arrangements berg berlin binary cambridge catmull characterization chazelle cient clarkson combinatorial comput computational computer counting curved cutting cycles davenport decomp dept depth dimension dimensions discrete display dorward edelsbrunner enkov found four fuchs gaifullin generation geom geometric geometry graph graphics guibas hidden ieee internat interscience isotopic ject kedem koltun kreveld lecture lectures line lines ljubljana location manuscript math matou modeling naylor nite notes oint optimal orders ositions other ounds output overmars pach partitions paterson patterns peled planar pollack preprint press priori proc quasi random range realizable references removal rods sampling schinzel schumacker schwarzkopf searching segments seidel sensitive sequence sequences series sharir shooting shor simple skop snoeyink solan solid space spaces spaggiari springer sproull structures subdivision surface surfaces surv survey sutherland sympos their theory thesis tight transactions tree university utah utec verlag vertical visible weaving weavings welzl which wiley york http://doi.acm.org/10.1145/780542.780612 52 Touring a Sequence of Polygons algorithm algorithmica algorithms annu appl applications approach approximate approximation asano baumgarten berg bespamyatnikh bound canadian canny chazelle chin choi cient clarkson classes clause comp comput computation computational computer conf constructing corrigendum cutting dimension dimensions discrete dror dynamic edelsbrunner elsevier euclidean fast figure finding found general geodesic geom geometric geometry given grigni guibas handbook hershberger higher hirata ieee inagaki incremental inform information inside internat international intersection introduction jung kapoor keeper kirkpatrick kreveld lecture left lett letters leven limited linear literal location lower lter manuscript mehlhorn mitchell most motion network nilsson notes ntafos obstacles optimal optimization optimum order overmars pages papadimitriou path paths pedestrian plane planning plate point polygon polygonal polygons precision preparata problem problems proc process processing pseudo queries rectilinear references reif right robot route routes sack safari science sciences sellen sensitive shamos sharir shoot shooting shortest shufflers significant simple snoeyink solution space splitter springer subdivisions submitted suri sympos take tarjan techniques theory three through time tokai transactions triangulated triangulations under university urrutia using vaidya verlag visibility walk watchman with worlds york zookeeper http://doi.acm.org/10.1145/780542.780566 17 Integer Priority Queues with Decrease Key in Constant Time and the Single Source Shortest Paths Problem access addison ahuja algorithm algorithms alternative andersson announced applications arithmetic arxiv assoc automation beame binary boas buckets cherkassky cient comm comp comput computation computer computers computing comrie connection corr crcw decision denardo design deterministic dial dichotomous dijkstra driscoll dumey dynamic ected edition emde equivalence etween faster focs forest fredman fusion goldb graphs hagerup hall heaps hollerith http icalp ieee implementation improved indexing information integer kaas kernighan knuth language less lett linear lists lncs logarithmic machinery machines massachusetts math mehlhorn memory methods minimum monotone network news note notices numer oating oint ological onacci onential oper optimal optimization order ordered ordering orlin ositive ository ound ounds owers pages parallel path paths pram prentice preserving priority problem problems proc programming pruning queue queues raman random rapid reaching reading recent references relaxed research results ritchie route search searching second sets shortest shrairman siam sigact sigplan silverstein single soda sorting source space spanning stad standard stoc surpassing syst systems tabulating tarjan technical than their theoretic theory thorup time trans trees undirected users uses volume weights wesley willard with word zijlstra http://doi.acm.org/10.1145/780542.780567 18 A New Approach to ∗ Dynamic All Pairs Shortest Paths achieves algorithm algorithmica algorithms already also amortized analysis annual aspects ausiello automata baswana birkh business case closure complexity computational computer computing conclusions connection constant cost data date dates dating decrease decreasing decremental demetrescu details deterministic digraphs dijkstra distances doing dynamic dynamization each edge edges eration erations erformed erforms etween evaluation even extractions fakcharoemphol faster fixup focs foundations fredman frigioni from full fully furthermore gazit generalization generalized given graph graphs greene hariharan have heaps henzinger highway icalp ieee implemen implies improved incident increasing incremental insert inserted inserting international italiano journal king klein knuth languages least length linear lncs london loquium loubal made maintain maintaining malaga marchetti math mathematics mathematik mention methods minima minimal more most murchland nanni near nearly negative network nevada note numb numerische observe onacci only operations optimization original otentially ounded ounds overall pages pairs parametric path paths phys planar preliminary presented previous problem problems proc procedure programming quadratic ramalingam real record reduced references remarks replaced reps require research rodionov rohnert same school science sciences semi shorter shortest simple single source spaccamela space spain stacs stoc structure structures subramanian supp symposium system take tarjan technical than that their then theoretical theory this time trade transitive transp trees uniform unit unsmoothed update usage user uses vegas vertex weight weights which will with within http://doi.acm.org/10.1145/780542.780582 29 A Tight Time Lower Bound for Space-Optimal Implementations of Multi-Writer Snapshots adaptive advanced afek algorithms alla amos anderson annual anonymous april architectures asaf aspnes asynchronous atomic attiya august available bounds boxer burns chen cient comp complexity computation computer computing concurrent condition consensus contention correctness counting danny data dating decemb distributed dolev erations eric exclusion faith fast fatourou fich free from full fundamentals gadi gafni gawlick gorbach hagit heon herlihy hill hundreds implementations improved information inoue international irit israel israeli james january jayanti jeannette jects jennifer journal july kaufmann king languages letters linear linearizability lived lncs long lower lynch made masuzawa mathematical maurice mcgraw memories memory merritt michael michiko model moran morgan multi multiprocessor mutual nancy nobuki nonblocking octob ophir optimal osite ossibility ound ounds pages panagiota paral pazi pram prasad principles proc proceedings processing programming rachman rainer randomized reader references registers requirements results ruppert sciences septemb shaham shared shavit shirazi shlomo siam simple simulations slow snapshot snapshots space structures symposium synchronization system systems taubenfeld technion theory time timestamping tokura topics toshimitsu totally toueg touitou trade transactions unbalanced using version volume wait welch wing workshop writer yadin yang yehuda yong http://doi.acm.org/10.1145/780542.780602 44 The Worst-case Behavior of Schnorr’s Algorithm Approximating the Shortest Nonzero Vector in a Lattice about acceptable ajtai algorithm algorithmic algorithms almost always angewandte annual association basis before berlin birthday body bound case cases cates ceptable certi chapter chosen ciently cients coef colloquium complexity computable computational computer computing conjecture conjectured convex corresponding density different disproof easy eccc electronic factoring following follows foundations four from furst generating geometry greater gruber hard have here hierarchy holds holland however http ieee implies inequality instances integer journal june kannan kumar lagarias large largest last lattice lattices lekkerkerker lemma lenstra lovasz machinery math mathematics mathematik mertens methods minkowski most nition nonzero north notion number numbers odlyzko omit operation others polynomial polynomials probability problem problems proc proceedings programming proof properties publ random rational reduction references reine research results review reviews riele sampling schnorr science sequence sequences shortest show siam sieve similar sivakumar smaller solving some stacs start statement stoc subset succinct suitably summarizing symposium term than that their then theorem theoretical theory there therefore third thirty this time traub trier upper using vector which with http://doi.acm.org/10.1145/780542.780610 51 On Metric Ramsey-Type Phenomena academic adic algorithm algorithmic algorithms alon amer anal analysis annual appl applications approximating approximation arbitrary archimedean assoc association ball banach bartal between binary blum bodies bollob borodin bounds bourgain chains chung codes combinatorica competitive comput computer computing conference construction convex decomposition dekker diameters dimacs discrete distortion dvoretzky edition eigenvalue eigenvalues electronic embedding embeddings euclidean expanders explicit extensions figiel first foundations funct functional geom geometric geometry girth graham graph graphs hakone halperin hilbert hilbertian homeomorphisms inapproximability indyk internat into ioannina isometric israel japan jerusalem john johnson karlo krasikov krauthgamer krawtchouk lebesgue lecture lemin lindenstrauss linear linial lipschitz litsyn london lower mach magen manasse mappings maps markov math matou mcgeoch mendel metric metrical metrics milman modern motion multi naor networks nilli nite nonexistence notes online optimal pages path planning polylogarithmic polynomials press probabilistic probability problems proc proceedings pure rabani rabinovich ramsey randomized ravid references results riesz rothschild saks schemes science second series server siam sized sleator some sons space spaces spencer subsets sympos symposium systems task theorem theorems theory tolerant trans transforms tree type ultrametric uniform volume wiley with wolfson york http://doi.acm.org/10.1145/780542.780645 78 On the Sample Size of k-Restricted Min-Wise Independent Permutations and Other k-Wise Distributions above addison algorithm algorithmica algorithms alon also appeared appendi applications applied arrangements arrays asymmetrical authentication automata babai balanced behavior both bound bounds broder cambridge carter chakravarti charikar chaudhuri choice chor claim closed columns combinatorial combinatorics completely completeness complexity compression comput computer concluding concrete conditions construct containment could course cryptographic cuni derandomization derivable derive design designs determinant determined developed documents each easy edition element entries entry equality existence experiments extraction fact factorial families family fast finite focs following follows folt form forms formula foundation fourth fractional freidmann frieze from functions general generalization generators geometric given goldreich graham hands hash have holds html http identity ieee immediately implies incidence independence independent indexed induction injection institute international itai itoh jakovi john knuth lecture letting limited lint lower lows luby math mathematics matous matousek matri matrix maximal method mitzenmacher models mulmuley nally naor nauchnyh nite nition nonsingular norin notes notice npoly obvious only open order osaka other pages pairwise paper parallel part partially patashnik pdmi permutation permutations polynomial pomi positive preliminary preprint preprints press probabilistic problem problems proc proof properties property proposition pseudorandom pyair random randomized rank recall references regarded remarks replication report resemblance resilient respectively restricted result robustness rows rudich russian sample sankhya science second semide seminarov sequences several show simple since sintcehgetrhsamf size smolensky society soda solved some sons space spencer springer srivastava stad statist still stoc strength structure structures such suppl surv symbols syst takei taking tarui technical technique that their then theory therefore third this total tsetlin type univ universal using variables vector version wegman wesley where which wigderson wiley wilson wise with yung zapiski zero znsl http://doi.acm.org/10.1145/780542.780556 9 Management of Multi-Queue Switches In QoS Networks accept according additional adversary after aiello algorithm algorithms also always analysis andelman annual appropriate architectures arrive arrives association automata balanced bipartite birman bolot borodin calculation cambridge case chain changes chapter chrobak clearly comp competitive computation computing conclude constructs corresp csirik delay denote describ deterministic diot discrete distrib distribution during each ecause ected eginning ehavior erentiated erformance etitive every exactly fairness following follows free freund from further gail hahne hand hantler hence icts ieee imreh indicates indicator inequality infocom inputs international internet jacm jagop jean journal karp kesselman koga landa languages last least line loquium loss lotker lower machinery management mansour marie markov matching memory minimization models most moving multiprocessor naor nearly next noga numb olan olicies olicy onds ones online optimal other ound ounded over packet packets pages paral patt press previous principles probability problem proc proceedings programming proof prove provide provides queue queueing queues queuing random randomized randomly ratio references result rosb rosen same scheduling schieb selected sequence sequences serv service services sgall shamir shared siam sidi simple since size state states staying sviridenko switches switching symp symposium systems that theorem theory therefore this throughput time total toward transmits transmitted uniform unit units university value variable vazirani where which will with woeginger yaniv http://doi.acm.org/10.1145/780542.780604 46 Lower Bounds on the Efficiency of Encryption and Digital Signature Schemes adaptive against applications assumptions attacks author available based basing bellare berkeley bits blum california chosen ciency cient collision collisions comp complexity computational conjecture consequences constructing constructions core crypto cryptographic cryptographically cryptography cryptosystem cryptosystems digital directions discrete door dual dwork encryption ermutation ermutations essential etween eurocrypt finding fischlin focs from function functions gamal general generate generic gennaro gertner goldreich goldwasser hard hash hashing hellman hides ieee impagliazzo inequality information interaction interactive international kahn kannan lamp lectures levin limits logarithms lower luby making malkin malleability message micali naor necessary oblivious osition ossibility ounds partial practical predicate predicates probabilistic proof protocols provable pseudo public random references reimer reingold relationship resistant rivest rogaway romp rudich saks scheme sciences secret secure sequences shoup siam signature signatures simon smyth statistically stoc street strong system technical tetali their theorem theory thesis toward transactions transfer trap trevisan universal university uowhfs version viswanathan which yung http://doi.acm.org/10.1145/780542.780581 28 Work-Competitive Scheduling for ∗ Cooperative Computing with Dynamic Groups absence academic accomplishing ajtai algorithmica algorithms allocation also amortized analysis annals announcement applications aspnes asynchronous aware awerbuch babaoglu balancing bancomat bartal borodin brief case chlebus ciency cient ciently communication communications comp complexity computation computer computing conference consensus coop data date david davoli decision decomp dilworth disc discrete distributed dolev during dwork dynamic ears editor eration erative erformance etitive example failures fast fault faults fiat focs foundamentals foundations fragmentable georgiades georgiou group groups halp icdcs ieee information international issue journal kanellakis karp kluwer kutten line list load loquium luby making malewicz management marzullo mathematics mavronicolas mayer mcgeoch mergeable merging message montresor network optimal optimally ordered osition ower pages paging papadimitriou paral partially partition partitionable passing peleg performing podc powell practice preliminary presence press principles prisco problem proc proceedings processors publishers rabani randomization randomized references resilient resource restartable rules russell saks scheduling science segala services sets shavit shvartsman siam sirocco sleator soda special spirakis stoc structural supp sussman symposium system systems tardos tarjan tasks theorem theory time tolerant value version volume waarts wigderson with woll work yannakakis young yung http://doi.acm.org/10.1145/780542.780613 53 Well-Separated Pair Decomposition for the Unit-Disk Graph Metric and its Applications about academic addison again agarwal aingworth algorithm algorithmica algorithms allows almost also among annu annual application applications apply approach approximate approximating approximation architectures arikati arya assignment ball balls because between bhagwat bichromatic body bound bounded bounds breu calinescu callahan center chekuri chen chew chiang cient clark closest clustering colbourn collision combinatorial communications compact complete comput computational computer computers computing conclusion conference consider constant constructing construction conway decomposition deforming delaunay demand dense density destination detection deterministic developed diameter digraphs dimensions direct directly discrete disjoint disk disks distance distances distributed dsdv dynamic edelsbrunner editors elds enable eppstein erickson erlebach estimation euclidean european exact example extend extended extension extensions factor fast faster fault following found foundations fourth frequency furthest generally geom geometric geometry gives govindara graph graphs gudmundsson guibas hale hard have here hershberger high higher highly holds however hunt ieee imielinski immediately impossible improved improvement increases indeed induced infocom interested internal intersecting intersection introduction jansen johnson june kirkpatrick klein kluwer known korth kosara lack lanky lead leaves lemma levcopoulos linear list lukovszki maheshwari maltz marathe mathematics matrix mead median method methods metric metrics miller minimum mobile most motwani mount multidimensional multiplication multiplicative narasimhan nearest necklaces needed neighbor neighborhood neighbors network networking networks ngyuen nite node notable number obstacles obtain only open optimal oracles originally outline packing pages pair pairs pairwise paper parallel path paths pattern people perkins planar plane point points polynomial possible potential preprocessing presented previously problem problems proc proceedings property protocols proximity pspace publishers quadratic queries radhakrishnan radii randomized ratio ravi reachability recognition reduce references relative respect results rosenkrantz routing royer russel salowe schemes schwarzkopf science seidel separated separator separators sept sequenced serna sets several short shortest shown siam sigcomm similar size small smid smith solutions some source spanner spanners spanning sparse stearns still stretch supowit survey sympos symposium systems tamassia technique techniques teng that then theorems theory there thin this thorup tight time tolerant toussaint tree trees triangulations trivial unbounded undirected uniform unit unweighted upper using vavasis vector vlsi volume washington weighted well welzl were wesley when where which will wireless with without workshop wormald york zaroliagis zhang zwick http://doi.acm.org/10.1145/780542.780574 23 Learning Juntas aaai algorithm algorithmic andv annual arithmetic arti avoid bernasconi beyond blum blumer boolean bshouty cial cient circuits classes combinatorica communication communications computation computational compute computer computing conference constant coppersmith depth discrete distribution distributions ehrenfeucht examples extended fall features feldman fischer formulae foundations fourier from functions gathen hard haussler helmbold hierarchy ieee information integer intel jackson journal juntas kalai kearns kindler klivans kucera langley lattices learnability learnable learning letters ligence linial machine mansour marchetti mathematics matrix membership monotone more multiplication nineteenth ninth nisan nlog noise occam pages personal polynomial polynomials proceedings processing progressions protassi quasi queries query razor references relevance relevant research respect roche safra samorodnitsky science sciences selection servedio siam sloan spaccamela statistical symposium system tamon testing theoretical theory third thoughts time tolerant transform twelfth under uniform using valiant values verbeurgt warmuth winograd with workshop http://doi.acm.org/10.1145/780542.780625 62 Consistent Load Balancing Via Spread Minimization according achieve achieves adopted algorithm algorithms also amer amsterdam analyzed annual answers appl applications approximation arbitrarily arises assignment available based beck boston cached caching cambridge capacities capacity case cases clear clearly close coffman combinatorics comp comparable compared compares computing conditions conjecture consistent correct counting cult department desirable deviations directions discrepancy discrete distributed each easy eecs elsevier ending etitive etween evaluated except existence fact feasible fiala from further garey generalized graham greedy guess hall handbook handle hard hashing have heterogeneous hochbaum however http indicated instance integer interesting jects johnson karger know large lehman leighton lenstra levine lewin library limit line linearly logarithmically lower machines magnitude makes making master math measure minimization minimize minimizing model more motwani multi multiples networks nition nontrivial normalized notion obvious oint open optimal oses ossibility other ought ound ounds packing panigrahy parallel particular paso presented press presumably probably problem problems proceedings programming prop protocols proved publishing quantity questions raghavan random randomized rather ratio ratios references relieving required roughly scalar scheduling science seek seen setting shmoys should similar single size sizes solution some spencer spread standard standp still such suitably survey susp symposium tardos that then theorems theory there thesis this throughout tight trans trees trivial tschel university unnormalized unrelated varable variable vary vectors version weighted what when where which wide widely with world worstcase would york zero http://doi.acm.org/10.1145/780542.780549 4 Approximation Algorithms for Hierarchical Location Problems aardal acknowledgments algorithm algorithms also analysis annual appendix applying approach approximate approximation arguing arti arun arya assignment assignp associated assume assuming assumption august author back base bioinformatics cantly case cases center charikar claim close clustering combinatorial comments complete computational computer computing condition conference consider considering constant dasgupta data demaine dendrogram denote details diagram discrete discussed distance dominated double ealing earlier editors elongs equal equation equivalently error established even expression extension facility factor finally first follows foundations fourth from function furthermore garg gene general ghosh gonz good greedy guarantees guha guig hamel have heuristic heuristics hierarchical hochbaum holds identity ieee immediate implies improve improved incremental index indicated induction intel intercluster interesting international interp jaakkola jain jansen january joseph journal joydeep july khandekar khuller kivinen last latter leaf learning lecture lemma leonardi less ligence like local location mahdian mathematics maximum median ment metric mettu meyerson minimize minimum modi more most munagala next nice note notes novemb obtain oint oints online operations optimal optimization order ordering ossible otherwise othesis ound ounds over pages pandit parent performance plaxton preceding problem problems proceedings proof prove provides quick ramgopal ratio ready real references regarding research rest result reverse rewritten running sanjoy science sciences search second section septemb shmoys siam signi since sloan some spaces springer srebro step strikes such suggesting summation supp symposium system tardos than thank that their then theorem theoretical theory there third this thorup three thus time times uncertainty unique unless using valuable vanishes vazirani venkataramani version versions vinayaka volume where which with workshop would xiaozhou zhang http://doi.acm.org/10.1145/780542.780630 66 Extractors: Optimal up to Constant Factors abstract algorithmica algorithms applications arch babai beaver bits blum capalb chor ciency codes colloq combinatorica communication complexity comput computable computational condensers condensing conductors constant constructing construction constructions correcting crypto cryptology cryptosystems decodable decoding degree developments dimacs directions dist eatcs eated ective eigenvalue elec entropies entropy eprint error ersp erties expanders explicit extended extracting extractor extractors families feigenbaum focs fortnow from function functions general generator generators goldreich graph hashing hiding impagliazzo instances interactive july katz kerenidis lemma length less levin linear lipton local locally loss lossless lower luby lund model muller multioracle nisan nondeterministic numerical oblivious onential optimal ound ounded ounds pages probabilistic problems proc procedures proceedings product prop protocols prover pseudo pseudorandom quality queries query random randomness recent reducing reduction reed references reingold rubinfeld safra sample samplers sampling seed self shaltiel shma siam simple simulating size source sources space stacs stad stoc storage structures sudan survey syst technical testing that these time tiny trade trevisan umans unbalanced unbiased using vadhan waves weak wigderson with without wkshp wolf zuckerman http://doi.acm.org/10.1145/780542.780644 77 Testing Subgraphs in Directed Graphs academic algorithms also analysis annals annual applications approximation association bermond bollob bolyai bounds bulletin characterization chromatic cnrs coloring column combinatorica combinatorics complexity computation computational computer computing connection core czuma decisions diestel discrete duality duke edition editors eighty european extremal fischer focs forbidden fournier frieze functional generalized geometric geometry goldreich goldwasser gowers graph graphs handbook hell homomorphisms hypergraph hypergraphs icalp ieee inter israel jasekaran journal kannan kluwer koml large learning lemma loque lower math mathematical mathematics matrices measure mikl nesetril number pardalos partitions paul polynomials primer probabilistic problems proc proceedings program properties property publishers quick randomized references regarding regular regularity reif reinhard robust rolim rubinfeld science second siam simonovits small society sohler sotteau springer studies subgraphs sudan supersaturated symposium szemer testing theorems theoretical theory three towards tower trevisan type uniformity uninformed vergnas verlag with without york http://doi.acm.org/10.1145/780542.780633 68 Uniform Hashing in Constant Time and Linear Space∗ abstract access addison algorithm algorithms allocations almost alon analysis annual applications arithmetic aspects assoc asymmetry automata azar babai balanced balancing barrier bellare berenbrink beyond birthday broder carter case charikar chor cient cking class classes closed combinatorica comput computer computing conference constant crypto cryptology cuckoo czuma data dietzfelbinger dynamic edition eigenvalues european evaluation expanders expansive extended extraction extremely families fast focs foundations fredman friedman frieze functions goldreich gonnet good graphs handbook hash hashing hastad heavily heide helps high icalp ieee independent indyk integer international itai karlin knuth koml krawczyk languages lecture limited linear linial load loaded locality loquium mach mass matias maximal memory meyer miltersen mitzenmacher motwani multidimensional notes pages pagh parallel performance permutations petrank pippenger polynomial preliminary preserving press primes problem proc proceedings programming properties pseudorandom publishing quality raghavan random randomized randomness reading real references reliable report resilient rodler rudich sasson schmidt science searching second security shared siam siegel simple simulations size smolensky sorting space spaces sparse springer stacs stateless steger stoc storing structures symposium system szemer table tardos technical their theoretical theory time tiny trade tradeo under universal universality university upfal variables vempala verlag version volume wegman wesley wigderson wise with without woelfel worst york http://doi.acm.org/10.1145/780542.780614 54 Alpha-Shapes and Flow Shapes are Homotopy Equivalent ∗ again algebraic algorithm algorithms along alpha also amenta annual applications aronov assume balls barndor basu bern book bottom case cation cell characterization choi choose ciently closure combinatorial completely complex comput construction contained contains copy covered critical crust curve data deformation delaunay describ detecting diagrams dimensional discr discrete distance done dual each edelsbrunner elements eppstein equivalence equivalent ersistence esides establish explicit facello festschrift figure finally flow found function functions generalizing geom geometric geometry giesen glue goodman graphical graphics grove have homeomorphic homotopy ieee image increasing index information interior internat into jensen john kirkpatrick lack leekha left letscher liang local ltering macromolecules maps math mathematics maximum middle modeling models more morse mucke munkres nielsen nishes nite nition note ockets oint oints ological ology once onto oundary pach perseus pictures plane point present proc proceedings processing provides publishing pure reconstruction references retract retraction ricky right saddle science scienti second seidel sequence sets shap shape shapes sharir show shows siam siersma simple simpli skeleton small soda space spaces springer states structure subset surface sympos symposia symposium technique that theory third this three thus trans undersampling union used using values verlag vertex voronoi where whole with world wrapping zomorodian zoom http://doi.acm.org/10.1145/780542.780635 70 Dynamic Rectangular Intersection with Priorities adding adjusting algorithms approach balance bent berlin biased binary buddhikot capability case cation class classi communications comput computational computer computers data decomp dimensional disjoint dynamic edelsbrunner erformance erlog fast feldmann further general geometry gupta here high ieee ifip infocom intersection intervals intriguing ispan jcss journal layer linear lueker maintain matching mathematics mckeown mehlhorn mention most multi muthukrishnan network networking networks nievergelt ones osition ounded packet pages part protocols questions range rectangle references reingold related require research restriction results routing rule sahni search searching self sets several siam sleator sorting space speed springer structure structures suri switching symposium tarjan techniques there time tradeo trees using verlag volume waldvogel which willard with worst http://doi.acm.org/10.1145/780542.780638 72 Lower Bounds on the Amount of Randomness in Private Computation algorithms alon amortizing applications beaver bits blundo boolean canetti characterizing chaum chor circuits combinatorics communication completeness complexity computation computational computations computing constant constructions crep cryptographic cryptography cryptology damgard disc discrete distributed edition encer extracting extraction fault feige focs franklin friedmann functions galdi game goldreich goldwasser graus harvard hastad icalp ilan integers jcss john jour journal kilian kushilevitz linear mansour manuscript math mathematics mental method micali minimal model modern multi multiparty naor nisan numb ostrovsky over party perfect persiano play podc privacy private probabilistic problem proc proofs protocols pseudorandomness random randomness recycling reducibility references resilient round rounds rudich santis second secure sensitivity shma siam size smolensky sons springer stoc survey terms theorem theorems tolerance tolerant totally tradeo unconditionally university vaccaro verlag wigderson willey yung zero http://doi.acm.org/10.1145/780542.780634 69 Almost Random Graphs with Simple Hash Functions aarhus academic access algorithm algorithmica algorithms analysis applications april arithmetic bollob bounds brics buchmann carter case cell chen cient classes closed closest combinatorica comm complexity comput computable computer constant courant cucko czech daoud databases department diestel dietzfelbinger displace distributed dler double dowitch dynamic editors evaluation expanded exploiting extremely family fast festschrift focs fotakis functions ganzinger geburtstag graph graphs gunter hagerup hash hashing havas heath heide high hotz html http icalp ieee independent informatik institute integer jainen jewski journal karlin karp kata large limited linear lncs london lower luby lueker machine manuscript matias mehlhorn membership memory metho meyer minimal molo more optimal optimally ostlin pagh pair papers paul penttonen people perfect performance pippenger polynomial practical pram press primes probe problem proc proceedings random randomizable randomized randomness real redundancy references reliable report research rohnert sanders scheideler schmidt science shared siam siegel simulating simulation simulations space speed spirakis springer stacs stemann stoc storage syst tables tarjan technical their theoret theory these time trade tradeo under uniform universal university upper variables verlag wads wegman wise with without wormald worst york http://doi.acm.org/10.1145/780542.780576 24 Generating Random Regular Graphs adjusting algorithms alon appendix applications argument assume asymptotic bender bollob cambridge canterbury combin combinatorial combinatorica combinatorics comput concentration conditions conjecture consider consideration constant degree degrees edges eigenvalue eled elled english enumeration erwolfach european expressed fact fast following form formula friedman functions generating generation given graph graphs here inequalities jerrum lecture length lipschitz london math mckay methods models multivariate need nition note numb olynomials optimization order path preprint present presented press probab probabilistic processes proof prove quickly random references regular restrictions routine rucinski sandwitching satisfy second sequence sequences short shows similar sinclair statement steger structures submitted summary surveys that theorem theoret theory they this triples uniform univ verify where with wormald http://doi.acm.org/10.1145/780542.780600 43 Primal-Dual Meets Local Search: Approximating MST’s With Nonuniform Degree Bounds ∗ accomplish after again agrawal algorithm algorithmica algorithms american analysis annual applications approximating approximation birds boston bounded choosing chopra cient claim claimed collide communication comput computer computing conf conference constrained control cost degree denotes design designing directed discrete dual edge editor equivalently following follows forest foundations from fsttcs furer general generalized goemans graph guara hand hard hochbaum hunt improved incident increases inductive iteration iterations jective journal klein krishnan kruskal least left lerton letters lncs local loop main maintained many marathe mathematical matter method minimum multi ndegi nemann network networks node normalized notice november number observe obtain only operations optimal optimality orem other pages performance polyhedron polynomial potential primal problem problems proc proceedings proof proves publishing raghavachari ravi references remains required research right rosenkrantz running salesman science section shortest show showing siam side single small society soda software spanning springer steiner step stone subtree swap swaps symposium technique technology terminates that then theoretical theory there therefore third this through time traveling tree trees twenty volume well when where which will williamson with within http://doi.acm.org/10.1145/780542.780603 45 New Lattice Based Cryptographic Constructions abstract academic advances ajtai alamitos algorithmic algorithms annalen annual appendix applications applied assumptions atlanta average banaszczyk barbara based basis boston calc canada case cient cients claim claims collision compact complexity comput computation computational computer computing conference connection crypto cryptographic cryptography cryptology cryptosystem cryptosystems cyclic decryption distance dual dwork eccctr electronic eliminating engineering equivalence errors ettinger extended factor factoring focs following form foundations fourteenth free from functions generalized generating geometry goldreich goldwasser halevi hard hash hashing hermite hidden ieee impagliazzo improved improving instances international island kluwer knapsacks lattice lattices lecture lenstra loquium march massachusetts math mathematics mathematische mean micciancio montreal more moreover most naor nerurkar noncommutative normal notes novemb ntru numb number olynomials omitted ounds pages perspective pipher portland probability problems proc proceedings proofs provably providence public publishers quantum rational reduced reduction references regev reports rhode ring santa schemes science secure series several shortest silverman some springer stein stoc subgroups subset symp symposium technical than that then theorem theorems theory this transference using vancouver variable variance vector verlag volume with worst http://doi.acm.org/10.1145/780542.780550 5 Approximation Schemes for Clustering Problems (extended abstract) acknowledgements agarwal algorithm algorithmic algorithms alon also analysis appear applications applied approaches appropriate approximate approximating approximation arbitrary arora assign assigned assigning assignment back badoiu ballard barber bartal beck biology bisection broder cambridge carl charikar chicago cient close closest closure cluster clustered clustering clusters color combinatorial comp compactness complete computational compute computer computing conditions conf connection consider constant constructed containing content core cost current data deerwester denote dense disc discrete disjoint drineas dual dumais each eccc ective edge element elements entropy equitz equivalence error euclidean exact exactly exhaustive expression facility factor faloutsos fashion fernandez flickner focs following foundations frieze from furnas garg gene geometric glassman goes going goldreich goldwasser gonzalez graphs greedy group groups guess guha guttmann hafner hard hardness harshman hassin hcut ieee image improved indexing indices indyk information initially instances intel international into israeli istcs jain january jcss ject jiang journal july kann kannan karger karpinski kenyon khanna khuller kleinberg lagergren landauer large larger largest latent learning ligent location manasse march math matrices median medians metric mini minimization minimizes minimum mishra multi multisets mutually niblack number oblinger operators optimal ostrovsky otherwise pages pair panconesi papadimitriou parameter parnas partition peled petkovic pitt point points polynomial possible power press primal problem problems proc procopiuc property ptas querying rabani raghavan random randomized recursively references related relation remove removed replacement representative sahni sample scheme schemes schulman science search segmentation semantic sequences sets shamir sharan shmoys siam size sizes small smith society soda spaces stephani stoc strikes sublinear such sudakov swain symp syntactic system systems take taking tardos testing than that their theorems theoretical theory through thus time topics transitive uniform union university using value vazirani vega vempala vinay vision when where whether which wide with world yannakakis zhang zweig http://doi.acm.org/10.1145/780542.780580 27 Server Scheduling in the Lp Norm: A Rising Tide Lifts All Boat accumulating addison algorithm algorithmica algorithms alon analysis ancient annual apache approach approx approximation arrive arrives aspects augmentation average avidor awerbuch azar balancing balter bansal becchetti bender borodin bound cambridge case chekuri clairvoyance clairvoyant collection comp competitive computation computer computing connection consider critical crovella dark deadline design dhamdhere discrete docs down each easily edmonds epstein erties etitive european every except execution fact fault featuring finally first focs following follows foundations frangioso gehrke general gives grove hall hand harchol harmonic have help hence here http httpd identical ieee implementation improved instance internet investigating jaraman jobs journal kalyanasundaram keep khanna knuth konemann krishnan kurose least leonardi line load lower machines mean minimize minimizing motwani muthukrishnan netcraft networking next nish nonclairvoyant nonclairvoyantly norm numb observe observing online operating optimal other ound overload owerful pages parallel park particular phillips preemptive prentice press processor prop pruhs quantities random references related release relevant resource resp robin ross round scheduling schemes schroeder science servers sgall shaheen shares show siam sigmetrics simultaneously since single sinha size sizes slowdown soda spaccamela speed srpt stacs stein stoc stretch such supp survey symposium system systems tanenbaum technical technologies texbook that theoretical theory there this thompson throughout thus time times tolerant torng under unfairness uniformly university unix usenix using veri vitter weighted wein wesley which whose with woeginger yadid yaniv http://doi.acm.org/10.1145/780542.780586 32 Modified Log-Sobolev Inequalities, Mixing and Hypercontractivity alon amer american anal analytic appl aspects bakry beckner berlin bernoulli between bobkov chains chung comb combin comm comp concave concentration conditions convexity cost coste cover decay diaconis diameter diameters discrets distance distributions ecole eigenvalues elements emery entropy erconcentrators ercontractive ercontractivit erimetric erties flour frieze from funct functional gaussian generalized geom geometric gibbs graph graphs grigor gross group hayward higher higuchi houdr inequalities inequality information inhomog integrability ising isop japanese john kannan kernels laplace latala lect lectures ledoux lieb logarithmic manifolds markov math mathematical mean measure measures miclo milman minaire model models modi mohar monographs nite notes oleszkiewicz olev onential oration orie ortation osition phase phenomenon poincar poisson preprint probab probabilit probability probl proc products prop providence quastel random reach references related representations riemannian saint salo sampling semigroups shashahani siam society some sons sortie springer stationarity statistics stroock subadditivity surveys tetali theory thomas time transition transp usion usions utilisation walks wiley york yoshida http://doi.acm.org/10.1145/780542.780565 16 Short Path Queries in Planar Graphs in Constant Time adjacency ahuja algorithms ambivalent annual applications april assume automata bounded check chen child children chrobak compaction computation computer computing connectivity constant construction counter data decrease degree delete deleted denote depth directed djidjev during dynamic each edge edges englewood enough eppstein eration erations erent erform extension flows following frederickson from girth going graph graphs hall have implies incremental information initial international isomorphism journal languages list lncs loquium magnanti matrices maximum most network numb order orientations orlin ounded outdegree outgoing pages pair pairs parents path planar prentice problems proc programming proof queries ramalingam reaches recall recursion recursively references related remove science shortcut shortest siam smallest spanning springer stored structures subgraph symposium takes than that theorem theoretical theory three time trees volume where whether whole with http://doi.acm.org/10.1145/780542.780628 64 Polylogarithmic Inapproximability∗ algorithm algorithmica algorithms annual approaches approximability approximating approximation approximations arbitrary arora bartal cation characterization charikar chekuri cheung circuits combinatorica communication company complexity comput computing conquer constant constraint cover covering degree deterministic directed discrete divide domatic eared eddings editor erin error etition even fakcharoenphol feedback feige fractionally garg goel graphs group guha gupta halld halp hard hardness hochbaum integrality june khanna khuller konjevod kortsarz krauthgamer lund manuscript median mendel metric metrics minimization minimum motwani multi multicuts naor neighb numb olylogarithmic ordering orhoods ound packing pages parallel path preliminary private probability problem problems proof publishing ratio ravi references related richa rounding rsson safra satisfaction schieb schwartz sets seymour siam soda some spaces spreading srinivasan steiner sudan symposium szegedy talwar techniques test theorem theory threshold tight tree trees trevisan veri version wang williamson with yannakakis york zosin http://doi.acm.org/10.1145/780542.780629 65 A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover acta algorithms amortized amsterdam annual approximability approximate approximating approximation arora asymptotic automata based bellare biased bits cation characterization checking cherno ciency clique cliques colorable coloring combinatorial combinatorics complexity computational computer computing cover covers decemb degree dinur discrete eccc editors eing electronic elsevier ergraph ergraphs erin etition factor feige fglss focs foundations fractional free goldreich goldwasser graham graphs guruswami halp handbook hard hardness holmerin icalp ieee improved inapproximability instances integral interactive international jacm january johnson journal july june khot languages loquium lovasz lund march math mathematica mathematics measure minimum motwani novemb observations optimal optimization ortance othesis ounded pages parallel pcps probabilistic problem problems proc proceedings programming proof proofs prove query ratio reduction references regev report results safra samorodnitsky science sciences siam smyth some stad statistics stoc sudan symposium system szegedy technical tests theorem theory threshold trevisan tschel uniform using veri vertex with within http://doi.acm.org/10.1145/780542.780585 31 Evolving Sets and Mixing algorithms alon amer anal annual appear appl application approach approximating atlanta available average behavior benjamini berlin between birkh bolyai boston bounds budapest cambridge cayley chain chains cheeger chung cluster clusters combinatorial combinatorica combinatorics computer computing conductance conference congress convergence cornell coste coulhon counting critical decay diaconis diagonal edge eigenvalue eigenvalues eighty erdos examples exclusion expanders faster fields fill foundations fourier funct generalization generation geometric ggstrom graph graphs grenoble grigoryan groups growth heat houdr html http inequalities inequality inst international invariants isoperimetric isoperimetry jerrum jonasson journal kannan kernel lamplighter laplacians lawler lecture lectures lower manuscript march markov math mathematics mathieu matroids meeting mihail milman mixing montenegro morris mossel nash nite nonreversible notes paul percolation permanent pittet press probab probabilistic probability proceedings process processes product products random rapid rates references relationships remy salo science sectional siam simple sinclair sobolev sokal spectrum springer stationarity stochastic stud super superconcentrators survey symposium tetali theoret theory time tracts trans treatment type ultracontractivity university unpublished user volume walk walks with woess http://doi.acm.org/10.1145/780542.780590 35 A Sublinear Algorithm for Weakly Approximating Edit Distance algorithm algorithmica algorithms annual approximate berkeley bits burlington california cannot chang chosen cient cole comes communication complexity computer computing consider cormode deleting deterministic discrete distance distances distinguish distribution distributions document does dynamic ected edit eginning eighteenth eleventh eling ending etween event every exchange faster following foundations francisco from happ hariharan high ieee input into introducing journal keyword landau lawler least lemma location louis masek matching minmax missouri most muthukrishnan myers namely ninth notice obtained ossibly over pages pair pairs paradigm parallelism paterson patterns press principle probability proceedings produces proof proves queries query random randomly references reveal sahinalp saint science sciences searching sees serial shift siam simpler society string strings sublinear symposium system that then theorem theory therefore time together using vermont vishkin when where while with york http://doi.acm.org/10.1145/780542.780639 73 Cell-Probe Lower Bounds for the Partial Match Problem access addison advances ajtai algorithms alice along also always analysis annual appendix apply applying approximate argument arrangement associative asymmetric averaging barkol beame borodin call cambridge case cell chakrabarti charikar chazelle cherno chromatic cient clearly coins combinatorica communication completes complexity computation computed computer computing conference consider consists construct continue convert curse data design deterministic dimensional dimensionality dimensions discrepancy each element entries erplanes every example exists fashion following follows foundations fraction from function good greedy hamming hardness have having high horizontally implies independent induction indyk information international intersection intersects into kleinb knuth kushilevitz least lemma location logic long loquium lower lvov machines match matrix measure meiser method miltersen model monochromatic most motwani multiparty nding nearest neighb nisan norm obtained oints only orthogonal ostrovsky othesis ound ounds pages pairwise panigrahy partial partition parts picking point predecessors press prob probabilistic probability problems proc process product programming proof proofs protocol prove query rabani random randomness range rectangle rectangles rectanno references related removing respect retrieval rich rivest safra same satis science sciences search searching select selected sends sets should show siam since size software solely sorted sorting space spaces split splits stanford step structures subset such suppose survey symposium system tables taking technology that then theoretical theory there thesis this thus tight time total towards tradeo true under union university using variables vertically weight wesley when where which whole wigderson will with workshop http://doi.acm.org/10.1145/780542.780552 6 Exponential Algorithmic Speedup by a Quantum Walk abramowitz adiabatic after aharonov algorithm algorithmica algorithms also ambainis analiz appendix automata bach beaudrap bernstein cambridge cellular character childs choose chromatic chuang church cient class classical cleve closer communication complexity computation computer computing conf connectivity construct constructed contain decision describ deutsch dimensional discrete diskret distance dover each eatedly efficient eigenvalue ekert element elian entrance equation ercub erence estimate estimating estimation etween every example exit exponentially fact factoring farhi faster first follows foundations from functions gasses gauss generation goldstone graph graphs grigni group groups gutmann hallgren handbook hidden hypercube idea ideal information instances international ivanos jozsa kemp kitaev knowledge known lattice level lloyd lncs logarithms london magniez mathematical measurements mechanical metody meyer moore mosca move nasa nayak neighb nielsen nonab normal numb oint other pages pell personal phys polynomial power press principal principle problem problems proc proceeds processing quadratic quant quantum queries query random rapid reaches reconstruction references representations require russell santha schulman science sciences separations sept sequence seroussi sharp shifted shma shor siam simon simulations simulators solution solvable some stabilizer start stat state statistical stegun step steps subgroup such sums supp symp symposium system takes that then theory this time total traverses traversing trees turing undirected unique universal university unpublished using vazirani vertex vertices vishwanath vizing walks watrous where which whose wigderson will words york zero http://doi.acm.org/10.1145/780542.780563 15 Reconstructing Curves in Three (and Higher) Dimensional Space from Noisy Data algebraic algorithm alphab annual based bleichenbacher choice ciently claim claims codes complexity computer computing conditions constructions contradiction correction decodable decoding degree desired directly error errors expander eyond first foundations from furthermore geometric guruswami have ieee improved indyk information journal kiayias kmax least less linear list manuscript maxj montreal most near next nition number octob optimal ound over pages polynomial probability problem proceedings proof provided queb reconstruction reed references required restricted satis science section smaller solomon solves sudan symposium than that theorem theory this time transactions unique vegas verify weighted where with yields yung http://doi.acm.org/10.1145/780542.780573 22 Boosting in the Presence of Noise abbreviation aborts access achieved additive after algorithm algorithmica algorithms alogrithm also alternate always among analysis analyze annals apparent aslam assigned associated assume bagging balanced based black blum boosting bucket buckets calculation call case cation check cherno chosen ciency ciently claim coin comes coming comparison computation computer concavity condition conditioned consequently consider constructing containing contains corresp cover decatur decision dietterich disjoint distribution does drawing drawn draws during each earlier easily easy eated ecause ective either eled element elements empirical endent endently ensembles equal equation equivalent erformed erimental error establish estimate every exactly example examples execution explicitly fact fall falls first flip following follows fool foolable foolproof fraction freund friedman frieze from funce functions generality give good greater guaranteed hand happ hastie have heads hence here hits hold holds hole imagine immediately incorrect increase indep indicate inequality information instances interval intervals into invokes jority journal kannan keep kept labeled large largest leaf learning least leaves lemma lemmas less limitations line linear logistic long loss lowest lter machine merge merging methods misses more most multiset must need negative nish nishes noise noisy note nothing numb observe obtained occurrences occurs often oint olynomial omitted onding only oosting oracle order orts ositions ositive ossibly other otherwise othesis ound ounds output outputs overall part particular pigeon polynomials precisely presentation principle probabilistic probability proof proved provided putting quantities query random randomization rate rates recall reducing references regression reject rejected rest result resulting results right same samples satis satisfying says sciences second seen sequence show shows similarly simulate simulation since sized sketch some space standard statistical statistics step straightforward subsequently such supp sure system tails tedious tell terminology test than that them then theorem there these they things this three threshold thus tibshirani time times tion tolerance tosses total trees true uncertainties uncertainty under union unique used uses using value values vempala veri verify version view violator vote weak weight weights were what wher where which whose will with without words would write written http://doi.acm.org/10.1145/780542.780592 36 New Degree Bounds for Polynomial Threshold Functions abound algorithm analysis angluin annual approximate approximating approximation aspnes attributes beigel boolean boosting bounded bounds bruck buhrman cambridge cheney circuit circuits classical cleve closed colloquium combinatorica communication communications complexity computation computational computer computing concept conference constant decision degree depth discrete donnell eccc edition eigth electronic expanded expressive forty foundations fourier fourth freund from functions furst gate geometry goldmann halfspaces hard harmonic hierarchy hill hypercube information intersection intersections introduction irrelevant israel jnal jority journal kearns klivans krause learnability learnable learning letters linear linial littlestone lower maass machine mansour mathematical mathematics mcgraw method michigan minimization minsky newman nisan oracle pages papert paturi perceptrons polynomial polynomials power press problems proceedings processing pudlak quantum queries quickly rational real references reingold report rudich saks science sciences separation servedio siam sieling slicing solving some spielman structure symposium system systems szegedy technical theory third thirty threshold thresholds time transform trees turan twenty under university valiant vazirani vereshchagin voting weak when wigderson york http://doi.acm.org/10.1145/780542.780595 39 Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds ability addison advances agrawal akademia algebra algebraic algorithm algorithms andreev angewandte annual another applications approximation arbitrary arithmetic arora arthur association assumption assumptions babai benedek berlin biswas blum boolean boppana budach buhrman cate cation certi chandra characteristic characterization chari check checking chen chicago chinese chistov cient circuits classes clausen clementi cnfs coding collapses combinatorica common completeness complexity computation computational computations computer computing conference constant conversion deciding demillo depth derandomization derandomizing designing detecting determinants deterministic divisionen divisors door dress easiness easy editor elds electronic element eleventh entropies equivalence erfect ermanent error eurosam evaluation every exptime extracting extractors factorization fast feasible first focs fortieth fortnow forty foundations fourier fourth free functions fundamentals games gathen general generator generators given goldreich grabmeier graph graphs greatest greenwich grigoriev group hard hardness hardnesses hierarchy hirschfeld ibarra icalp identities identity ieee impagliazzo improved information interactive international interp into inversion irrational isolation journal kabanets kaltofen kannan karlo karpinsky kayal klivans learnability lecture lemma length letters lewin line linial lipton loquium lovasz lower lund machinery manipulation mansour manuscript massachusetts matching matchings mathematik matrices matrix melkeb merlin method methods micali moran more motwani mulmuley multivariate natural near ninth nisan nite nonisomorphism nonrelativizing notes numb olation olynomial olynomials onential optimal orov othesis ounds over pages papadimitriou parallel paturi pratt preliminary press primality prime primes probabilistic problems proceedings processing program programs proof proofs protocols prover pseudo pseudorandom pspace publishable pudl random randomization randomized randomness rank razb reading reducing references reine reingold related remaindering remark requires research rohatgi rolim roth rudich safra saks satis saxena schwartz science sciences search second seed separations seventeenth shaltiel shamir siam simple simulations singer size solutions sparse spielman springer srinivasan stoc straight strassen succinct sudan symbolic symposium system systems szegedy tested testing tests that their theoretical theory thesis thierauf third thirteenth thirtieth thirty time toda towards trading transform trap trevisan twenty ucsd umans under uniform unique unless vadhan valiant vazirani veri verlag vermeidung version volume wegman wesley wigderson with without witness work zane zero zipp zuckerman http://doi.acm.org/10.1145/780542.780554 8 On the Power of Quantum Fingerprinting ∗ acknowledgments algorithmica ambainis appendix babai based basic better bipartite bits bound bounds buhrman cambridge case characterization characterize cherno choose class cleve closely coin common communication completes complexity computational computer computing conceivable concerning conclude consider constants converse develop easily embedding estimating even example exist exploited from func function functions games give given gives graph graphs have hence ieee implies improve improvement improving including inequality information interesting kimmel kushilevitz leading least leftmost lemma letters lower made mappings mentioned messages model must need needed newman ngerprinting nisan nition number observe only open other otherwise pages paper physical poly possible power presentation press private probability problems proc processing proof protocol protocols prove public qbit qbits quantum question questions random randomized recall references related remark restrict review rise round said satisfy section similar simultaneous some spaces step such suggestions symp szegedy techniques thank that then theorem theory there therefore this those threshold tion true unit university valuable vector vectors verify watrous where which will with wolf yaoyun http://doi.acm.org/10.1145/780542.780546 2 Adiabatic Quantum State Generation and Statistical Zero Knowledge aaronson ability adiabatensatzes adiabatic aharonov algorithm algorithmic algorithms alon also applegate applied approach approximability approximate approximation birkjauser born both bubley carlo cerf chain chains character chbaum childs chuang cient ciently classical cleve cliques collision combinatorial combinatorica combinatorics complete complexity comput computation computer concave concepts controlled corresp counting creating cryptology decision deotto discrete distributions dyer ectral edition eedup eigenvalues eighty elian encer english entries equals equation equivalent erdos erence erent erformance ermanent etween evolution example expanders extensions factorization farhi faster finding focs free frustration functions general generation goldreich goldstone goldwasser graph graphs grotschel ground groups grover gutmann hadamard hallgren handb hard haystack help helps holland honest ideal improved information instances integrable integration interactive isomorphism jerrum john journal july kannan kato kitaev knowledge kobler kushilevitz landahl landau lapan lattice letters lifshitz limits linear little logarithm logarithms longer lovasz lower lundgren markov math matrix measurement measurements mechanics messiah metho micali miklos monte more mosca near need needle negative nielsen north numerical onential optimization ositions ound ounds ower paths paul pell peres perfect pergamon phys polynomial powerful preda press prime principal probabilistic probability problem problems promise quadratic quant quantum racko random references roland rudolph sahai sampling satis schoning science search searching second shifted shma shor siam simple sinclair sipser soda solvable sons spielman spin spitzer stabilizer starr states statistical stoc study survey system systems szonyi that theorem theory thesis this time translation trees turan universal unpublished vadhan vazirani veri version vigo walk walks watrous willey with zero http://doi.acm.org/10.1145/780542.780584 30 Randomly Coloring Graphs of Girth at Least Five absence acknowledgements advisor algorithm algorithms also annual anti applying area argument arguments babai balls bins bipartite bollob bolyai brightwell bubley cambridge cayley chains chicago choosing coloring colorings colouring colourings combinatorial combinatorics computer contained contemporary coupling cycle cycles degree denote details discussions distribution dobrushin dubhashi dyer dynamics easily edges editor encouragement endence endent ensures eric established estimating every extension fact february ferromagnetic following follows foundations frieze from full generation girth glaub graph graphs greenhill group hayes helpful high hrough ieee implies improved included indep independently interfere introducing jerrum journal laci lemma length like listening lower manuscript many markov markovian math mathematical maximum methods mixing model models molloy motwani much negative neighbors numb number occupancy octob once ounded ounds over pages particular path patient phase phys physics potts press probability proceedings progress proofs prop proposition proving raghavan random randomized randomly ranjan raphs rapid references regular salas sampling science setting short similar simple society sokal springer statistical structures studies study symposium tail technical technique thank thanks that then theorem theorems theoretical theory this thus transition tree uniform uniqueness university valiant vazirani verlag version vertices very vigoda volume winkler with would http://doi.acm.org/10.1145/780542.780608 49 A Tight Bound on Approximating Arbitrary Metrics by Tree Metrics abstract aggregation algorithm algorithmic algorithms alon also annual application applications approach approximate approximating approximation approximations arbitrary archer athens august aumann aviv awerbuch azar bafna bandwidth bartal based beach better blum bourgain bulk burch caching calinescu case cation chao charikar chekuri circle circuits classi clustering combinat combinatorica communication comp comput computational computer computing concurrent conference conquer constant construction control coop cost covering crete cuts decomp design deterministic directed discrete distortion distributed divide each earthmover easy ected ecting edding eddings edge editor eighteenth elds eling erative etitive euclidean even excluded extended extension factor fakcharoenphol favorite feige fiat florida focs following formulation foundations fractionally fteenth game garg geometry give gives goel graph graphs greece group guha gupta harrelson help herlihy hersonissos hierarchical hilb hsts ieee improved improves infocom information instrumentation inte integer internet into iscc israel jamin jaraman journal july karlo karp khanna klein kleinb konjevod korup labeling lancia lecture lectures leighton lerton letters linear linial linois lipschitz list london lower manuscript many markov mathematics matousek median mendel metric metrical metrics miami mimimum minimum minors mobile most multi multicommodity naor network networks newman ninth nite note notes numb oints ology olylog olylogarithmic olynomial online optimum osition ound ounds outerplanar packing pages pairwise park partitioning paso path peleg personal placement planar plaxton plotkin practical preserving press previous principles probabilistic problem problems proceedings processing produces program programming programs queueing rabani rabinovich raghavan random ratios ravi really references relationships reshef resp result rosen rounding routing salman scheme schieb science sciences server seymour shavitt show siam sigcomm sinclair small soda some space spaces spanning spreading springer steiner stoc stretch structure such symposium system systems talwar tang tardos task terminal texas that theorem theoretic theory third thirtieth thirty this time tirthapura tomkins tracking translator tree trees twelfth twenty unfair uniform users using various volume wattenhofer west with zhang zosin http://doi.acm.org/10.1145/780542.780616 55 Reducing Truth-telling Online Mechanisms to Online Optimization able accept accepts admission after algorithm algorithmic algorithms analysis anyway applied approximation archer arrives assumption auctioning auctions awerbuch azar bagchi based blum case change chaudhary choice choices circuits claimed clarke collecting combining commerce comp compatible computing conference consider construct control cost could countersp customer customers dagstuhl data decrease dense design deterministic digital discrete distinct does duration each earlier ecause econemetrica ected eculation ehavior electronic eliminated equal etitive even exactly except extension extensions fact fails feed feigenbaum finance first focused follows from frugal function garg generic gives goel goldb goodrich goods groves guarantee guarantees handle happ hartline have henzinger hildrum hold ideally identical incentive incentives increase international interval journal kumar lavi least lemma like line lipton made main maximal means mechanism mechanisms memb minimum modi multicast multipart must nisan numb observing obtained obtains online original otential otherwise pages papadimitriou part path plotkin price prices pricing prize probability problem proceedings proof public publish published quite random randomized ratio references refuse regarding regardless rejected rejects remove request requests ronen routing sale salesman same scheduling sealed selective seller sense sharing sharting shenker show siam simply since singh some still stream streams structures supp survey symp symposium take tardos teams tenders that their then theorem theorems theory there these they this throughput tomkins transactions transmissions trees true unchanged unknown valuations value various vempala vickery virtual waarts wads weight were what when whereas which will with workshop would wright yossef http://doi.acm.org/10.1145/780542.780544 0 Hidden Translation and Orbit Coset in Quantum Computing∗ aaecc abelian above accepts accomplished addition adiabatic aharonov algebra algorithm algorithmic algorithms also american annual appendix appl archive article assume babai base basis beals beth between bijection buhrman calling caltech cambridge carlo carry cases characterization cheung chuang cient class classical cleve coding come comp completes complexity comput computation computational conclude conditions consists constant cooperman coordinate corollary coset course decision decomposing degree degrees denote denotes dent describe determinant digital digits directly discrete discussion disp distinct distinguish distributed does done dual each either element elements encode enough ensure equation ettinger every exist exists expected express extended extension factoring fast fermat finkelstein focs following follows form found fourier fraction from full function functions generalization generated generation given gottesman graduate greater grigni group groups hallgren hand have hidden http hypothesis identi identify identity implies independent indepenp inductive information injective inner input inputs instances integer introduction itself ivanyos kitaev knowledge lagrange lanl least lecture lemma less lett linear linearly little lncs logarithm luks madhu magniez mapped math mathematical mathematics matrix maximum measurements mechanical modulo monomial monte mosca most multivariate never ngerprinting nielsen nite nomial nonabelian noncommutative normal notation notes number observe obtain obtained obvious only orbit orthogonal other otherwise over pages partial particular pduction people permutation phys physics polynomial polynomials polynomip polyp positive power preskill press previous prime print probability problem problems proc proceedings product proof proper proposition proved puschel quant quantum ranges rank rather reconstruction reduces references repeating report representations represents required rest review roots russell same sampled samplingf santha satis says schulman schwarz scienti search second section seress shift shma shor siam signatures similarly simon since sion size society soda solution solvable solve solved some spaa span stabilizer standard state statement statistical stoc studies subgroup subgroups subroutine subspace substitute such sudan suppose symmetric system szemer taking technical term terms than that their then theorem theory there therefore these they this thogonal time times tinct together total transforms translation tteler uniformly university until using value variable vazirani vector vectors verd version viewed volume watrous wellknown when where which whose with wolf words world zero zippel http://doi.acm.org/10.1145/780542.780558 11 The Online Set Cover Problem absolute algorithm algorithms almost alon analysis annual approximating approximation augment augmentation avrim awerbuch azar blum change chapter chawla combinatorial commitments comp comput computation computational computing concluding conference constant cover covering covers dagstuhl describ deterministic discrete dynamic each earing edition editors encer erformance erties etitive etter every existence face fact factor families family feige fiat fractional freund game greedy here heuristic html http identify imply increased information interesting johnson jority journal july kalai learning leighton line lists littlestone machine making mathematics method obtain obtaining online oosting operations optimal optimality pick prediction probabilistic problem problems proceedings prop ratio real references remarks research sake schapire search second section showed siam simply some springer state static step subsets surveys symposium system that theory this threshold time tools trees uncertainty useful warmuth weight weighted wiley winner with withs woeginger workshop york http://doi.acm.org/10.1145/780542.780643 76 Approximate Counting by Dynamic Programming adding aldous algebraic algorithm algorithms american annals annual appendix application applications approximate approximately approximation arbitrary arrays association assume assumption back basel berkeley birkh calculated california carnegie case chains chung cients clearly column columns combinatorics complete complexity computation computed computer computing consider constant constraint contains contingency contrary convex coste count counting cryan davis decide decision defer department determine determined diaconis ding discrete discussion distinguish dyer each efore efron encer endence equivalent estimating etween even extended finally first follows form fortunately foundations fpras frieze from gangolli general generate generation given goldb graham greenhill harvard hence hernek however ideas ieee implied imply improved indep inequalities information instance integer integers integrating international interpretations inverse issue ists jerrum journal july kannan knapsack largest lecture lemma loera lutioan mapping margins markov martin mathematics mellon method mildly mixing more morris most mount multidimensional must need note notes numb obviously oint olynomial onential optimization orarily ounded ounds perkovic polynomial preprint probability problem proceedings proof provided question random randomization rapidly rectangular reduce redundant references return rowed rows running salo same sample sampling science section select selecting sets since sinclair solution solutions springer square stage statistic statistical statistics steele structures sturmfels submitted sums supp symposium table tables technical techniques temp testing that them then theoretical theory there these thesis this thus time traceback tracing truncated uniform unimodular unique university unless user using varaiya variables vazirani version volumes walk walks ways when where whether which with workshop would york zero http://doi.acm.org/10.1145/780542.780589 34 On the Limits of Cache-Obliviousness across acta addison agarwal aggarwal algorithm algorithms also amortized analysis annual applications arge assume automata average baase based bayer bender bilardi binary block brodal brown cache canada case characterization ciency cient cole colton communications comparison complexity computation computational computer computing danner data date dealing dehne demaine design dictionary discrete disjoint distribution duan dynamic each ectively edition editors engineering equally ermutac ermutation ermutations european external factor fagerb farach fast following follows foundations frigo funnel gelder general generate generated geometry given graph have heap height hierarchies hierarchy holds hollandminkley huddleston hwang iacono icalp ieee increase indexes informatica input institute internal international introduction jacob journal june knudsen languages large larsen layout least leiserson lemma less likely linearly list lists lncs locality loquium lower maintaining maintenance massachusetts massive master mccreight mehlhorn memory merging montr most multidimensional multilevel munro mutations note numb oblivious onential optimised oral ordered organization ortability ossible ound output over pages paging peserico predecessor preserving press priority problems proc programming prokop queue rahman ramachandran raman range references related representing resp rules sack santoro scanning science search searching sept sets siam similarly simple since size sleator small society sorted sorting springer structure structures surveys sweeping symp symposium tarjan technology temp than that then theory there therefore thesis third tions total trade traversals traversing tree trees uniform using vitter volume wesley where whitesides with workshop http://doi.acm.org/10.1145/780542.780617 56 Near-Optimal Network Design with Selfish Agents agents agrawal akella algorithm algorithms allo analysis anarchy anshelevich applications approximating approximation auctions bala behavior bounds case cation ceedings charikar chekuri cheung cking collide comp computing constrained coop cornell cost cover creation czuma dasgupta design directed disciplines dutta econometrica emans endent equilibria equilibrium erative etitive fabrikant facility farms feige feigenbaum focs forest formation full game games general generalized goel goyal graphs greed guha heidemann heller heterogeneous ieee improved indep infocom internet jain jcss journal karp klein koutsoupias krysta luthra making maneva manuscript mavronicolas model moses multicast nash near network networking networks oblivious ology optimal pages papadimitriou papadimitrou paper performance price problem problems proceeding ravi references robins roughgarden routing sarangi scheduling schulz series server service seshan sharing shenker siam sigcomm societies soda spirakis stability stackelb stacs steiner stier stoc strategies switch tardos tech technique theoretic threshold tight transactions transmissions tree trees unpublished user vazirani version vetta virginia wexler when williamson with work working worst zelikovsky http://doi.acm.org/10.1145/780542.780561 13 ∗ Optimal Probabilistic Fingerprint Codes advances algorithms american amsterdam annual applied asymmetric attacks berlin blakley boneh chor chung cient codes collusion collusive combinatorial combinatorics crypto cryptology data desmedt digital discrete documents electronic elsevier error erties eurocrypt fiat fingerprinting forgiving frameproof franklin graham guessing guth heidelb hiding holland ieee information international journal kilian kurosawa leighton lindkvist linkoping lncs london long lower mathematics matheson meadows mechanics messages naini naor ngerprinting north northholland optimum ounds peikert privacy probability proc proceedings prop public publishing purdy references resistance safavi scheme schemes science secrets secure security sequential series shamoon shaw shelat siam smith soda springer springerverlag staddon stinson studies symposium tarjan technology theory thesis traceability tracing traitor traitors transactions tzmann verlag wagner wang watermarks york zane http://doi.acm.org/10.1145/780542.780605 47 Non-interactive and Reusable Non-malleable Commitment Schemes adam amit apply barak binding boaz buus canetti carl charles cient coin commitment commitments complexity composable computation computational computing consequences constant constructing course crandall crescenzo crypto cryptographic cryptography cryptology cynthia damg danny dolev dwork earlier eurocrypt expansion factor fischlin focs from function functions giovanni goldwasser hiding hybrid ideal illegal impagliazzo impossibility interactive ishai ivan jesp john jonathan journal katz know leable ledge like limits lindell lncs marc micali midd model modifying moni multi naor necessary nielsen numbers ostrovsky paradigm party perfect permutations perspective pomerance prime proc process proof protocols provable pseudorandomness racko rafail random realizing references restrictions richard roger romp round rudich russell sahai schemes secret secure security series shared siam signatures silvio smith springer statistical steve stoc string systems this those tossing trapdoor universal using verlag version with yehuda yuval http://doi.acm.org/10.1145/780542.780557 10 Constant Factor Approximation of Vertex-Cuts in Planar Graphs ababei aided algorithmic algorithms alon amir analysis annual appl application applications approximate approximation arti aspects based bazargan bisection call characterization cial cient circuit combin combinatorica company comput computations computer computing conference conquer cuts cutsize cycle decomposition delay design designing diestel digraph discrete divide edge edition editor element even excluded expert faster feige finding foundations garg good graph graphical graphs hard hochbaum ieee image inform intelligence international isoperimetric jones karp karypis kaufmann klein knowledge krauthgamer lauritzen leighton lett lipton local logical machine malik math mathematics mcilraith mean meshes miller minimization minimum minors mohar morgan multi multicommodity nding near nearest neighbor network nite normalized numbers objective october optimal packings pages park partition partitioning partitions path pattern phillips planar plotkin polylogarithmic press principles probabilities problems proc process publishing quotient ratcatcher reasoning references representation robertson routing royal saran science second segmentation selvakkumaran separator separators seventeenth seymour shmoys siam small society spectral sphere spiegelhalter spielman springer statistical structures symp symposium systems tarjan teng their theorem theorems theory thomas thurston trans treewidth triangulation twice uncertainty uniform vavasis vazirani verlag vertex with within works york http://doi.acm.org/10.1145/780542.780568 19 A Fast Algorithm for Computing Steiner Edge Connectivity acta agrawal algorithm algorithmica algorithmics algorithms annual application applications approach approximation article available bang bicategories branchings breach building cactus calgary carcass cataloging center certain chain cient classes clustering cole collide combinatorial combinatorica computer computing conference congress connected connectivity constrained cuts data design dinits dinitz directed discrete disjoint distribution dual dynamic edge editor edmonds eeding erations factor family faster fleischer forest foundations frank fridman from functions general generalized goemans good gordon graph graphs grotschel handb hariharan ibaraki ieee implementation increasing incremental information international ipco jackson jain jensen journal karzanov kernel klein lawler letters lewenstein library line linear local lomonosov lovasz maintaining maintenance management math mathematics matroid matroids mihail minimal minimax minimum mixed monma nagamochi national nding network networks olyhedra optimization orescences original orlin oset packing pettie porat preserving press primal problem problems proceedings processing programming ravi references representation representations research rigidity russian rustin same scandinavian science siam spanning sparse steiner stoer structure structures studies subgraph submodular subset survivable symposium systems tarjan technique their theorems theory third time tong translation trees twenty vainshtein vazirani vertex washington weighted westbrook when williamson with workshop york