http://www.informatik.uni-trier.de/~ley/db/conf/soda/soda2005.html SODA 2005 http://doi.acm.org/10.1145/1070432.1070576 116 R a n d o m p l a n a r g r a p h s w i t h n n o d e s a n d a fixed n u m b e r of e d g e s Stefanie Gerke * Colin McDiarinid 1 Angelika Steger * Andreas Wei61 * academy accepted bender bodirsky bonichon bound cambridge canadian census combin combinatorial combinatorics computing congressus connected constant course denise edges electronic estimating gavoille general generating gerke graph graphs growth grspl habib hanusse hungarian icalp info institute journal kang labeled labelled laws lint lncs mamlscript maps mathematical mathematics mationtheoretic mcdiarmid nick number numerantium osthus planar press probability prsmel publication publications random references remarks richmond sciences series some springer stacs steger submaps taraz their theory trees triangulations tutte uniformly university upper using vasconcellos welsh wilson wormald http://doi.acm.org/10.1145/1070432.1070499 53 Deterministic Network Coding by Matrix Completion according accordingly ahlswede akademie algebra algebraic algor algorithm algorithms allow also always amounts analysis annals ansactions appear applications approach assign assigned assigning associated associb ated augmenting before benefits berdan berlin bounds budach called choose chou class classification clearing closure code coding collection collections column columncompatible columns combinatorial communication comparing compatibility completion complexity computation compute computer computing consider construct construction containing contains corresponding cunningham dard define described determinants directed discrete discussion does each editor editors efficient effros egner ehoose ejficiency elementary encyclopedia entry equivalence every exactly exist find finding floudas flow following follows forafl forbidden formally fortune found from fujishige functions fundamentals gabow gauss geelen general given harvey have hnproved homeomorphism hopcroft identity ieee implies improves increase increasing increments independent infor information initial initially institute international intersection jaggi jail jain jordan journal july karger keep kleinberg kluwer koetter laurent lehman lemnm linear llvl lmmatrix maintain maintains manuscript massachusetts matching matchings mathematics matrices matrix matroid matroids maximum maxrank mixed multicast murota must nares nation network networking nmlticommodity northholland obtained omltod operations optimization otherwise ously over pages pairs pardalos partition paths perspective pivot pivoted pivots polyhedra polynomial possible practical preserve preserves problem problems proceedings pseudocode random randomized rank reduce references repeatedly report required routing sanders satisfying schrijver science sciences search section sept setting shows siam since single sinmltaneous size slight slightly some springer step steps store subgraph submitted submodular such symposium system systems technical technology that them then theoretic theoretical theory this thus time tions tmcolumn tolhuizen track transactions transformation unpublished update using vahle value values vector verlag volume will with work wyllie yeung zero http://doi.acm.org/10.1145/1070432.1070492 47 Dominator Tree Verification and Vertex-Disjoint Paths acta acyclic addison after algorithm algorithmica algorithms allen also alstrup amyeen analysis ancestors anning annual anonymous ansactions appear applications approach arcs ascending assignment august available balanced beaty boppana branchings buchsbaum case center choice cocke comments common compilers compression computer computing concatenating condition construct constructs control cooper corrigendum cytron dataflow defining dependence depth depthfirst directed discrete disjoint dixon dominance dominator dominators dynamic edge efficiently equivalence eutvpean experimental extraction fact fast fault fembed ferrante fifth find finding first fldl flow flowgraph follows form fuchs gabow general georgiadis given global good graph graphs harel harvey helpful however http identification ieee immediately incremental information interesting international iterative journal kaplan karger keith kennedy king klein languages lauridsen least lengauer lexicographically like linear list lnformatica machine maintaining manuscript march method microarchitecture minimum more necessary next nmnbering note oeorgiadis online optimal optimizing order ordering pages paper path paths pointer pointing pomeranz practice preorder preparation principles problems proc proceedings program programming proof question ramalingam ranch randomized reading reducibility reducible redundancy referee references report reps resem respect results revisited rice rogers rosen satisfy scheduling sciences search sensitivity sethi sharir show siam sigact sigplan similar simple simpler single solving some sorted spanning special speed static straightforward structural sufficient suttices sweany symp symposium syrup system systems tarjan tatjan technical techniques test testing thank that theorem theoretic theory there this thorup time tools topological transactions tree trees triantafyllis ullman union using verification version vertex vlsi volmne watson wegman werneck wesley westbrook whether which whitty wirth with would yansactions zadeck http://doi.acm.org/10.1145/1070432.1070524 73 Sparse Source-wise and Pair-wise Distance Preservers adapting additive ahnost algorithm algorithms almost alon annalen application approximate approximation asynchronous automata awerbuch ball balog barany baswana berger between bollobas bourgain chapter cohen colloq communication computational computer computing constructing construction constructions contempt convex coppersmith cost covers cowen design directed disc discrete distance distortion distributed dynamic efficiency elkin embedding embeddings extensions fast finite foundations game gavoille general geometr geometry gitterpunkte graduate graph graphs graphtheoretic halperin handbook hardy hilbert hull icalp ieee indyk institute integer international into israel jarnik johnson jour journal karp kavitha konvex kurven labeling languages large larman lectures lindenstrauss linear lipschitz lntrvduction mansour math mathematics mathematische matousek mehlhorn metric minimum near neighborhood network networks numbers oracles overhead oxford pages pairs paths patt peleg perennes pettie points polylogarithmic polylogarithmie polynomial preservers preserving press principles problem proc proe proximity ptvc references report roditty roundtrip routing saks schemes schgffer science server shamir shortest siam simple size soda space spaces spanner spanners sparse springer stretch symp symposium synchronization syrup tables technical texts theory theow thorup tilne time trade uber university upfal volunm weighted weizmann west with wright york zwick http://doi.acm.org/10.1145/1070432.1070468 28 On Geometric Permutations Induced by Lines Transversal through a Fixed Point* Boris Aronovt achieves algorithms alternative american antipodal appear appl applications applied argue arrangement aviv balls bound bounded bounds buddies buddy cells chazelle cheong choice combinatorial common completes comput computational conjecture conjectures consecutive consecutively consider consistent constant contain contained contemporary convex corresponding deletions determined different direction directions discard discarded discrete disjoint disparity distinct edelsbrunner edelsbrunuer elements every exists family fewer fixed following follows from geolnetric geom geometric geometry give goaoc goodman great have heidelberg hence hyperplane hyperplanes iiii implies indeed intersecting israel journal july katchalski katz kbuddies least lewis lies lilt line master mathematical mathematics matheumtical maximum mitchell most must neighbors next note number objects occur offer order ordering orientations oriented pail pair pairs pairwise parallel partitions permutation permutations pernmtations pick plane proc progress proof references remaining rise school sciences sensitive separating sets shape sharir sharp siam since size smorodinsky society some space sphere spheres springer stab stabbing strong such suitable suri sympos than that theory there these thesis this thus tight transversal transversals trigger trim umnber unit university upper varadarajan verlag ways wenger while whose winder with zhou http://doi.acm.org/10.1145/1070432.1070513 64 Approximating Vertex Cover on Dense Graphs algorithms approximability approximation arora assoc baker berman brenda clementi complexity computational computer computing conference cornput cover david degree dense density fujito graphs improved independent instances journal karger karpinski mach marek mathematical minimum nemhauser npcomplete nual packing pages piotr planar polynomial problem problems programming properties references results sanjeev schemes sciences structural system systems theory time toshihiro trevisan trotter vertex with http://doi.acm.org/10.1145/1070432.1070490 45 An ahuja akad algorithm algorithms alternating amsterdam applications austral bachem beitra berlin bicritical blossoms bolyai bonn budapest canad canada casopis cheriyan cliffs colloq combinatorial combinatorica combinatorics computer computing correctness covered data decomposition decompositions dept discrete disjoint ease edmonds efficiency elementary endlichen englewood factor finding finite flowers flows fsiskola gabow general goldberg graph graphen graphs grrtschel hajnal hall hetyei holland hungary idomokrsl ieee infinite karzanov keszthely kiadr korte kotzig krzl lattice lefedhetii linear little lovlsz lowlsz magaaanti matching matchings math maximum miai micali murty naddef network north ontario optimization orlin paths perfect philadelphia plummer polyhedra preliminary prentice problems proc program proving publications pulleyblank rabin rado randomization randomized rank references related rendl report schrijver sciences series sets siam skew special springer structure structures symmetric system szigeti tgglalapokkal theorem theorie theory through time topics tree union univ vazirani verlag waterloo workshop http://doi.acm.org/10.1145/1070432.1070596 132 Online Ascending Auctions for Gradually Expiring Items (Extended Abstract) adaptive agents algorithm algorithmic algorithms analysis annual approximately archer ascending aspects auction auctions awerbuch azar bartal behavior blum blumrosen bounded bounds buffer callaghan chin chrobak clearing colell combinatorial commerce commodities communication compatible competitive competitiveness computer computing conference cost curve deadlines decentralized decreasing demand demange design digital discrete economic economy efficient electronic english expiring feigenbamn ferentiated fiat foundations friedman fundamentals fung gale games generalized goldberg gonen goods gradually green hajiaghayi hard hartline hildrum horowitz http huji incentire incentive incentivecompatible information issues item items jawor jobs journal karlin kessehnan kleinberg knowing knowledge kumar lavi ldth learning lehmann leighton length limited line lotker ltajek mackie management mansour manuscript marginal market mason maximizing mechanism mechanisms meyerson microeconomic multi multicast ninth nisan nmlti olgorithms online onlineascending optimization overflow oxford packets papadinfitriou papers parameter parkes patt political porter postedprice press pricing proc protocols ptvc rationality real reducing references regret revelation ronen rudra sahni sandhohn scheduling schieber science sciences severely sgall shamir sharing shenker shoham slotted sotomayor stacchetti starbucks supply sviridenko switches symposium system systems tardos telling theoretical theory throughput tichy time transmissions tron truth truthful unit university unpublished utilities value walsh weighted wellman whinston wifi with wurman yossef zinkevich http://doi.acm.org/10.1145/1070432.1070526 75 New Constructions of (c ,/3)-Spanners and Purely Additive Spanners* acad acim across adapted additive addressed adjacent after aingworth algor algorithm algorithms allpairs almost already also alth always analysis annual answers appendix applications approximate approximation architectures assumption automata back baswana become before best between bits bollobfis bound bounded broadcasts came case cases center check chekuri choices clearly cluster clustered clusters cohen colloq combin communication compact comput computation computational computationally compute computed computing conmmnication connecting consider constructed constructing construction constructions contributes converted coppersmith cornput corollaries cowen created czechoslovak decides declares detailed diameter directed direction discrete distance distributed dobkin duplicate each easy edge edges efficiency efficient elaborate elkin erdss estimation even every exchanging executed exist existential expected explicitly extremal extrenml fact fast field figure first fixed from further gave general geometr given goyal graph graphs halperin handled have help high highest hmfinteger house however hypercube icalp identity ignored implement implementation incident indyk inform integer interested intl introduced itself joseph journal known languages least lemmas length linear link little logn made main manuscript matrix maximum maxinmm measured measures message messages might minimum model models more motwani multiplication near nearly necessary neighbor neighbors network networks nodes note number once optimal oracles over pages pairs paper parallel parameters partial paths peleg plus polylog polylogn polynomial possibility practical prague preservers principles private probability problem problems proc programming proof protoc proving publ purely quality question random randomized references require requiring research resolve respectively result roditty rooted round rounds roundtrip routing rule rules same schaffer scheme schemes section select sent shortest siam sigact significance sigops similar simple since size sketch small smolenicc soares solve spaa space spammrs spanner spanners sparse starting stoc streaming stretch such summing symp sympos symposium synchronized synchronizer syrup tables technique tells that their then theorem theory there these this thorup three through tile time total trade tree true ullman undirected unit units unpublished unweighted upfal used using values vertex vertices very volume wagner weighted wenger what when whether which with without work zhang zwick http://doi.acm.org/10.1145/1070432.1070511 62 A p p r o x i m a t i n g the Smallest k-Edge Connected Spanning Subgraph by LP-Rounding Harold N. Gabow * algorithm algorithms annual appro approximating approximation better bounds cheriyan combinatorica comput connected connectivity cornu crossing demands design difficulty directed discrete edge edges extreme factor fernandes finding flow fonlupt frank functions gabow generalized graph improved integer jain jols karger khuller manuscript matching math mating melkonian minimum multigraph naddef network networks norm notes performance points polyhedra problem problems proc programming raghavachaxi random ratio references related salesman sampling siam size smallest some spanning special springerverlag steiner subgraph subgraphs submodular supermodular symp syrup tardos theory thurimella traveling uniform unpublished vazirani with http://doi.acm.org/10.1145/1070432.1070518 68 Collusion-Resistant Mechanisms for Single-Parameter Agents* agents algorithmic algorithms american annales applications approximake approximately approximation archer aspects auction auctions balance bidding bills blum bribes budget callaghan choice clarke collusion collusive combinatorial combinatorim comment commerce competitive competitiveness computationally computer computing concensus conepetitive conference conomie cooperative cost costs counterspeculation cramton design digital discrete economic economics economies economy eeonometrica efficiency efficient electronic elkind envy evidence experimental feasible feigenbaum fiat finance financial foundations free friedman from frugal frugality games generalized goldberg goods goswami groves guide hartline hildrum ieee implications incentivecompatible incentives jain journal karlin klemperer kumar ldth learning lehmann lessons literature manipulation market mcafee mcmillan mechanism mechanisms moulin multicast multipart near nisan online optimal pages papadimitriou parameter path political press price pricing proc proe prvc public rand rebello references regulatory revelation review rings robinson ronen rudra sahai schummer schwartz science sealed sharing shenker shoham siam single spectrum springer statistique steiglitz strategyproof studies submodular surveys symp symposium syrup talwar tardos tawar tenders theoretical theory through transmissions treasury truth truthfld truthful ugality uniform uthful vazirani versus vickrey with wright york yossef http://doi.acm.org/10.1145/1070432.1070570 111 Improved Approximation for Universal Facility Location algorithm approximation capacitated chen communica cost exchange facility functions general hajiaghayi imply improve ipco lemma lemmas local location mahdian mirrokni multi networks personal problem proceedings proved ratio references scaling search standard techniques that tion together universal used with yielding zhang http://doi.acm.org/10.1145/1070432.1070479 36 Optimizing Markov Models with Applications to Triangular Connectivity Coding Stefan Gumhold* algorithms alliez amsterdam analyzer angle applied approach arbitrary arithmetic available bajaj based bijection border bounds canadian canonical ceccherini census channels chuang cleary codec coding communications compact compressing compression computational computer conference connectivity constrained context core counting data december decoding deering denny desbrun discrete driven dual edgebreaker edges editor efficient elsevier encoding encodings erlangen forum free garg generation geomet geometric geometry germany gigantic gotsman graph graphics graphs growthsensitivity guaranteed gumhold handbook http huffman icip ieee improved informatik informationsteehnik institut interface interior isenburg january journal july kannan keeler king kriegman languages large lecture machine mahaney maps marcus mathematics mesh meshes modeling models multiple neal notes november october optimality orderings pages parentheses pascucci permutation perspectives planar pless point points polygon polygonal poulalhon proc proceedings properties ptvceedings quad random real recording references regular report representations resolution reverse reversi rossignac roth schaeffer scheme schickard science september sgumhold short siegel siggraph silberstein single snoeyink sohler spirale stefan strasser strings succinct surgery sweedyk symposium systems szymczak taubin technical teehnisehe theo theoretical through thrum tiibingen time tnran topological touma transactions triangle triangular triangulation triangulations tutte university valence vceedings vision visualization westbrook wilhehn with witten woess workshop zhuang http://doi.acm.org/10.1145/1070432.1070447 11 Embeddings of Negative-type Metrics and An Improved Approximation to Generalized Sparsest Cut* alexander algorithm algorithmic algorithms algorithnls alistair annual anupam appear application applications approxilnating approximate approximating approximation arbitrary arora aspects assaf assoc aumann average banach bartal beijing berlin bound bounded bourgain chandra charles chekuri clarkson combinatorial combinatorica combinatorics comput computational computing concurrent cone congress conquer convex cuts czech david degree descent designing deza dimension discrete distance distortion divide dorit durch editor efficient embedding embeddings eran euclidean expander extending fakcharoenphol farhad fifth finite flmctions flow flows focs fractals geometric geometries geometry gnrs goemans graduate graph graphs gupta hard higher highlights hilbert hochbaum ilan indol indyk inform informatik ingo integer international into inventiones israel james jean jittat journal jourtml karzanov kenneth klmn konstruieren krauthgamer kunal laurent lectures leighton line linear linial lipschitz littlestone logk london mach majority manfred manor marie mathematicae mathematical mathematicians mathematics matou matougek matula maxinmm measured mendel method metric metrics michel monique multicommodity naor nathan newman nick nite nletrics normed optimization outerplanar pages partitionings partitions piotr planar preliminary preserving press problem problems proc proceedings programming publishing rabani rabinovich rabinovieh rain random references relaxations required robert sanjeev satish scales semide shahrokhi shin shmoys siam sinclair small soda some space spaces springer springerverlag stoc suchen symposium talwar texts their theorem theorems theory thesis thirty thirtyfifth thomson tight tree trees umesh undirected uniformly university vazirani vegas verdoppeln verlag version volume warnmth wegener weighted welzl when yair yonatan york yuri yuval http://doi.acm.org/10.1145/1070432.1070569 110 A p p r o x i m a t i n g k - M e d i a n with N o n - U n i f o r m Capacities Julia Chuzhoy* aardal acmsiam algor algorithm algorithms analysis analyzed annual approach approximating approximation approximations arya back bartal berlin bixby boyd capacitated capacities charikar chudak clustering combinatorial computer computing constant constrained constraint cook cornuejols discrete dual editors faciilty facility factor fitting foundations francis garg greedy guha hard heuristic heuristics hnproved ieee improved inedian integer international ithms jain jansen john journal khandekar khuller kmedian korupolu lagrangian lecture leonardi local location loth mahdian markakis median mercado metric meyerson minimum mirchandani moss mungala nemhauser node notes optimization packing pages pandit plaxton primal problem problems proceedings programming rabani rajaraman randomization references relaxation rios saberi schema schulz science search shmoys sonce spaces springer springerverlag stanford steiner strikes submitted sviridenko symposium tardos techniques theory thesis tree uncapacitated university using vazirani violation vitter vohmm volume weighted wexler wiley with wolsey workshop zhang http://doi.acm.org/10.1145/1070432.1070528 76 Graphs Excluding a Fixed Minor have Grids as Large as Treewidth, with Combinatorial and Algorithmic Applications through Bidimensionality acknowledgments acmsiam affect aigorithmica aigorithms aion alber algorithm algorithmic algorithmica algorithms alon also american amir annual answer appear appears applications approx approximation artificial aspects association august authors automata baker based because been berlin best between bidimensional bidimensionality bodlaender boltenhagen bound bounded boundedgenus branch brenda call cambridge carsten center chang chuan circuits classes clique closed closer colloquium combhlatorial combinatorial combinatorica combinatorics communication complexity computation computer computing concepts conference connected connection connections connectivity constant constantfactor contradict correct corresponding cover crossing david december deciding decomposable decomposition demaine dependence determine dfht diameter diestel digraphs dimitiros dimitrios directions discrete discussions disjoint djgt dominating efficient efik endre eppstein equivalence erik every excluded excluding exponential eyal fact factor families fedor feedback fellows fernau finally first fixed fomin formatics foundations fragmentation framework frances francisco free frick general generalization genus germany gorbunov graph graphs gregory grid grohe gutin hajiaghayi have helpful henning hidden highly hlternational hminor holds hongbing huernational imply improve improved improvement intelligence interest interesting international into isomorphism italy january jensen jochen journal kanj kaufmann kernels kloks known konstantin languages latin lead lecture lhctor likely linear lipton ljubomir lncs lnformatics local locally london lower lyad machine many markus martin math mathematical mathematics maximum measure mfcs michael might minimum minor minors mohammad mohammadtaghi morgan must naomi near neil niedermeier nishimura noga nonplanar note notes npcomplete obstructions obtain online optimization order otherwise pages paper parameter parameterized parameters particular paul perkovi personal philadelphia planar plane poland polynomial portal posed possible prabhakar prague preliminary press problem problems proc proceedings programming properties providing ptass publishers question quickly ragde ratcatcher ratio recently reed references refined reinhard related relation result revealing revisited richard robert robertson robin rolf rosamond routing running same science sciences search second separator separators september series sets severely seymour shang shown siam single singlecrossing sium size society soda some somewhere speed speedup springer stege structure structures subexponential subgraph such suggest surface surveys suspect symposium synzposium system tangles tarjan technique ternational than thank that thce theo theoo theor theorem theoretic theoretical theory these thilikos this thomas thomassen through tight tightest time tommy transactions transversals tree treewidth triangulation ulrike uncertain univ upper used vancouver version vertex view vmposium volume which whose width with within workshop would ymposium http://doi.acm.org/10.1145/1070432.1070482 39 UNKNOTTING Masao Hara* acta agol algebraic annals annual arthur babai bestimmung cambridge coins colorings complete complexity computational computer computing counting edition fiir games genus goldwasser group haken hass hempel interactive isotopiekriterium jersey journal knot knots knowledge kreisknoten lagarias lecture link links london manifold manifolds march math mathematical mathematics maunder merlin micali moran normalflachen notes perish pippenger press primfactor princetion princeton private probtelns proceedings proof public publish rackoff randomized randomness references rolfsen schubert sciences series siam sipser society studies symposium system systems theorie theory thiryfourth thurston topology trading university verkettungen versus welsh york zerlegung http://doi.acm.org/10.1145/1070432.1070460 21 Multidimensional Balanced Allocations Andrei Broder* academic aggregation allocations azar balanced broder carmel choices cikm computing dimensions edited efficient evaluation fraction handbook herscovici journal karlin kluwer least level load mitzemnacher mitzenmacher norwell optimal pardalos plans podc power proc process publishers query rajasekaran randomized rapidly recurrence references reif remains results retrieval richa rotim show shrinks siam sitaraman softer survey techniques that this upfal using with zien http://doi.acm.org/10.1145/1070432.1070462 23 Job shop scheduling with unit processing times Nikhil Bansal* action acyclic akers algorithm algorithmic algorithms alon alternative amsterdam anderson anmysis appl applications approach approximability approximation arbitrary assoc balls baptiste barcelona berlin better bins bmmds both bounding bounds carlier case code combinator combinatorica complexity comprise comput computer computing congestion constant cybernetics czumaj dilation direction discrete dynamic expected fast feige finding first flowshop general geometric gives goldberg gonnet gonzalez graphical graves guarantees hall hand handbooks hardness hash hnproved holland hoogeveen hurkens instances into inventory janov jansen jayram jobs jobshop john journal kimbrel kononov lawler lecture leighton lemma length lenstra linear load local logistics long longest lovasz mach machine machines maggs make makespan making management matching math method methods minimization mixed north notes number only operation operations optimal other packet paper paterson paths polynomial portions preemptive probabilistic probe problem problems proc production programming progress properties ptas publication queyranne raab randomization references require research restrict richa rinnooy routing sahni satisfiability schedule schedules scheduling scheideler scheme science searching section sequence sequencing servers sevast sevastianov shakhlevich shmoys shop shops shopscheduling short siam significant simple small solis some sons sotskov spencer springer srinivasan steger stein step steps stoc string structural submitted survey sviridenko svirideuko sweedyk symposium techniques then theory there this three tight tighter time together understand understanding wein which wiley williamson with woeginger would zipkin http://doi.acm.org/10.1145/1070432.1070541 87 Fast Convergence of Selfish Rerouting abbildung academic actions after algorithms allocation almost alpern also analysis angluin annalen annals approximation artificial assignment atomic averages awerbuh azar balls bins bounds brouwer case characterization choices circuits colas combinatorial communication competitive complexity computer computing condition conference consider contradiction convergence convex cooperative coordination czumaj decision define defining definitions dependence desh detenninistically devdatt different discrete dispersion dubhashi dynamic eighteenth either equal equations equilibria equilibrium even evenly every excluding existence exists expected fact fairness farms fast first fixed following form fotakis four from function game games general give goldberg grenager hamilton handbook icalp identical ieee implies intelligence international intuitively issues journal kesselman kluuwer kontogiannis koutsoupias krysta larger last learning least leave leaving lemma less libman like link links load local malaga mannigfaltigkeiten mansour marbach matchings mathematics mathematische mirrokni mitzenmacher move moves multi multiplayer must naapping nash national negative netw networking networks next noncooperative note nual nwdl obtain optimization orda original otherwise overloaded papadimitriou paul podc point policies policy positive possible power powers press priority probabilistic probability problem proceedings proof proofs prove rain rajasekaran random randomzied randonfized ranjan rate reaching references remains resource response restricted restricting results rewards reyniers richa richter roughgarden routing same satisfied satisfy sciences search second selfish server service share sharing shimkin shoham show siam since sitaraman smaller some spatial specific spirakis stacs structure structures study subsection such suppose survey switching symposium system systems tardos techniques telecommunication then theory there therefore these third thirteenth this thus tight tile time traffic trans transaction twentythird uber underloaded uniform useful user users using utility valiant vceedings vetta vocking vutes well where which will with workshop worse worst would wowa http://doi.acm.org/10.1145/1070432.1070568 109 On the Approximability of Some Network Design Problems access adam algorithm algorithmica algorithms amit amitabh andcut andrea andrews annual anupam application approx approxhnation approximating approximation approximations arbitrary architectures areas arora assoc awerbuch azar back baruch berlin better bicriteria bolot bound branch building bulk capacitated carr carsten cees chaitanya chandra characterization charge charikar checking chekuri cheriyan clementi cohen colference combinatorial combinatorica combining commodity communications comput computer computing conference connected constant constraints copenhagen cost cover covering current cynthia daniel david density design deterministic directed discrete distance distribution dorit dual duin edge editor electronic eran european even facility factor fakcharoenphol fixed fleischer flow flows focs formulation foundations francisco gaps garg generalized george global goemans goran graz greedy guha gunluk gupta halperin hard hardness harry heterogeneous hierarchical hochbaum hunt hzternational ieee improved inapproximability incomplete informs installa installation integer integrality integrated international issues jain jittat joseph journal kamal kamesh karger khandekar khanna khuller knowledge konjevod kortsarz krauthgamer kumar kunal laurence lecture leung link lisa location logistics luca lund mach madfiav madhu marathe maria marie martin mathematical matthew maxemchuk melkonian method metric metrics meyerson michel mihalis minimization minimum minkoff mirchandani moses motwani multi multicast multicommodity multimedia munagala mungala nagarajan naor natural naveen nemhauser network networking networks nonapproximability notes oktay online oper operational optimization ortega packet pages parallel parallelism phillips pill pirkul placement plotkin polylogarithmic prague preliminary primal primaldual probabilistic problem problems procedures proceedhlgs proceedings programming proof proofs publishing purchaser rajeev ravi realtime reaseareh references rent repetition resource results revelle robert rohit rosenkrantz roughgarden routing safra sairam salman samir sanjeev satish scandinavian schieber science seffi selected serge sharing shmuel siam sibel simpler single sinha sink slam slany solution springer steiner stoc strengthening strikes subramanian sudan sudipto sundaram swamy symposium szegedy talwar tardos theo theol theorem theoretical theory tier tight tion topological transactions transportation traveling tree trees trevisan turletti uncapacitated vardges variants verification version vertex video virus volgenant volume weighted williamson with wolfgang wolsey workshop yannakakis yossi zhang http://doi.acm.org/10.1145/1070432.1070516 66 Limitations of cross-monotonic cost sharing schemes aggregation algorithms allocation allocations amsterdam appear applications approach approximation axioms balance balanced budget cambridge chapter characterization choice coalition commerce communication computer conference cooperative core cores cost costs decision dual economic economics economies editor efficiency electronic equilibrium equitable facility feigenbaum focs forests free games goemans green groupstrategyproof herv holland implementable incremental jain journal kapov kent koenemann kohlberg laffont lagrangian leonardi lloyd location logistics makblg mechanism mechanisms median metric monotonic moulin multicast naval north operational pages papadimitriou partial personal pill population preferences press primal primaldual problem problems proceedings proof proofness public quarterly reearch relaxation research revelation rider roberts rules schaefer schema sciences sets shapley sharing shenker skorin skutella social soda steiner stoc strategy strategyproof studies submodular system tardos theol transmission type university using vazirani versus volume welfare http://doi.acm.org/10.1145/1070432.1070444 9 Computing Equilibria in Multi-Player Games about academic academy advances agent algorithm algorithms american annals annual appear application applications approximating approximation arbitrary arrow artificial auctions aumann automata bayesian behavior bits boca brown calibrated calp case cdam chapter chvgttal class cmled colloquium combinatorial commerce compact compactly competitive complexity computer computers computing conference conitzer connected constraints contributions convergence cooperative cornell corollary corrected correlated correlation czumaj debreu decision deng describe desired details devanur developed diagrams different differential doklady econometrica economic economics edition editor editors efficient electronic equations equi equilibria equilibrimn equilibrium even evolutionary exact expression fabrikant facility feldmann finally firstorder fogs following foster foundations freeman fsttcs functions further gaines gairing gale game games garey geometric give graphical guide handbook hart have holland howson idea improved independently influence informatics information integers intelligence international internet intractability introduction jain johnson joint journal kakade kearns kesselman khachiyan khan koller kuhn langford languages large latin learning lecture lemke leung librium liicking line linear lipton littman location loglogn logn london long lovdsz mahdian mansour many markakis market mathematical mathematics mehta mfcs milch models monien morgenstern multi nash national network networks neumann neural north notes npcompleteness nual number omit optimization ortiz owen pages papadimitriou paths person player players playing points poly polynomial possessing precision preparation press prices primaldual princeton problem problems proceedings processing programming ptvblem pure purestrategy randomized rationality raton reals reduction references regret repeated report representation represented representing required results rode rosenthal roughgarden routing saberi safra sandholm savani scheduling scheme school schrijver science second selfish shoham simple since singh singly sixth size societies software solutions solved solving soviet space springerverlag stengel stoc stone strategies strategy subjectivity survey symmetric symposium systems talwar technical technology theorem theoretical theory thesis third this tile time traffic tschel tucker type uncertainty university using utility vazirani vetta vohra volume weibull when with http://doi.acm.org/10.1145/1070432.1070446 10 On distance scales, embeddings, and efficient relaxations of the cut cone advances aeta ahnost alamitos algorithm algorithmic algorithms american analysis annual anupam appear applications approximate approximating approximation approximations arbitrary arora assaf assouad aumann author average bartal benyamini berlin between bound bounded bourgain bull canada characterizations chawla colloquium combinatorial combinatorica comput computational computer computing continuous course cuts dans descent discrete discussions distortion electronic embedding embeddings enflo euclidean expander fakeharoenphol finite flow flows flunce foundations fourier fractals functional geometric geometries geometry gnrs goernans graduate graph graphs grateful gupta haifa harald hilbert homeomorphisms ieee improved into ismp israel james january jittat joram klmn krauthgamer kunal lausanne lectures lindenstrauss line linial lipschitz lipschitziens london lowdistortion manuscript marcus math mathematical mathematics mathenmtical matou measured mendel method metric metrics michel naor negative newman nmtrics nonexistence nonlinear open optimization pages partitionings patrice pisier planar plongements preserving problems proceedings processes programming providence publications quotients rabani rabinovich rain random references robert sanjeev satish science semidefinite series shuchi siam sinclair small society soda some space spaces sparsest springer springerverlag squared stable stationary strongly submitted surely symposium symposiwm talwar texts their theorem theory this throughout tight tree trees type umesh uniform useful vancouver vazirani verlag volume work workshop yair yoav yonatan york yuval http://doi.acm.org/10.1145/1070432.1070478 35 Substring Compression Problems accelerating achieved agarwal ahinalp algorithm algorithms also alstrup ameter amir analysis annual appl applications approximate approximations arrays assuming automata basic been bell benedetto benson besides bioinformatics biological biology biosci block bounds brodal burrows caglioti cambridge carried cascades case challenge chen christian cleary clmt coin cole colloquium combinatorial comp comparing comparison compress compressed compressing compression computational computer computing conference consider consistent cormode currents danielle data dauchet delahaye delgrange delorme department described designing detection deterministic development dictionary dimacs discerning discrete distance distances dnacompress domain dynamic earlier edit editor editors effective efficient emerged ergun especially etficient even exact farach fast ferragina files formulated foundations free general genetic genome geometry getting goodman grossi grumbach gusfield hall handbook have henaut here hewlett icalp identification ieee imai implementation improvements improving incompressible indexing info informatics information initiated interesting international journal karp keogh konagaya kwong labeling laboratories language languages large lecture lempel leonardi letters linear locally loreto lossless macro management manning many manzini maryland matching matias matsumoto method methods metric micro miller mining molecular more mortensen moves msio multiple muthukrishnan naor natics natural nearest neighbors nevill nice notes number okazaki ollivier operations opportunistic oracles orthogonal other packard pages paper paradigm parallel parsing particular pattern patterns performance physical pointers popular possible post pratt prentice preprocessing press previously problem problems proc proceedings processing programming properties protein provided ptvceedings purpose rabin randomized range rapid ratanamahatana rauhe rddd real really rearrangements recently recomb references relating repeated repeats report research retrieval review rivals rodeh role rosenberg rourke rsings sadakane sahinalp same sato schemes science sciences searching segment sequence sequences sequential seventh shapira shown siam sigkdd significant similarity since sleeping software some sorting spire storer string strings structures studied study style substitution substring suffix switching sykt symposium system szymanski tahi tandem technical technicm techniques technology text textural than thank that theoretical theory these thesis they this thorup though tossing towards toyoda transactions trees tromp twenty universal university used using variants vishkin vitanyi vitter volume weiner were wheeler will with within witten work workshop worm years yoshioka young zipping http://doi.acm.org/10.1145/1070432.1070540 86 On Hierarchical Routing in Doubling Metrics accessing aigorithmica algorithmic algorithms alon already analysis anners another anupam applications approach approximations arbitrarily arbitrary arcs arya assume awerbuch banal because beck berlin between bounded bounds brevity bypassing cking claimed close colouring communication compact comput computing constructing construction constructions copies cowen cuts cyril data david define defined degree describe designing deza dimensional dimensionality direct directed discrete distance distances distinct distortion distributed dynamic each edge edges efficiency efficient either elements embedding embeddings environment euclidean evaluation every factor farouk fast finding first focs following follows fractals frederickson from furthermore gavoille general generality gengler geometo geometries given gives graph graphs growth gupta heinonen hierarchical hildrum hold include increasing indicate induced integer inter into intrinsic jacm james janardan joel jpdc kamoun karger keep kept kleinrock krauthgamer kubiatowicz kunal lanky large laurent least lectures lemma leonard listed lnterscience local location loss malnourished manuscript math matthias mendel message method metric metrics might minimum modify molloy moreover mount narasimhan nearby nearest neighbors nets network networks noga note number object objects obtained omit omitted open optimization order otherwise overview particular peled peleg perlbrmance phila pick planar plaxton points polynomial positive preserves probabilistic problems procedure proof rajaraman random reed references replace replaced replicated requires restricted result resulting richa robert routing ruhl salowe same scale scheme schemes sequence short shows siam sicomp sigactnews since smallest smid soda spaa space spaces spanner spanners sparse spencer springer still stoc stretch struct such suppose syst tables talwar that their then theory theprobabilistic thin three together tracking trade uiei undirected upfal verlag vertag vertex vertices vuppuluri wanner weigh which while whole whose wiley with without would write york zhao http://doi.acm.org/10.1145/1070432.1070556 100 On Approximating the Depth and Related Problems* advances agarwal algorithm algorithms amidst annu anthony appl applications approach approximate approximating arrangements arya automata bartlett brsnnimann cambridge chan chart chazelle clarkson class classification collision colloq colnputational comb combinatorial comp complexity comput computational computer constraints construction convex count covered crossings curse curves cuttings decomposition determine determining diagrams dimensional dimensionality dimensions discrete dobkin dohkin duda eatcs edelsbrunner edition editors efficient efrat erickson extended fitting found foundations gajentaan geom geometric geometry goodman halfspace halfspaces hard hart heidelberg hierarchical high holes ieee indyk internat interscience jordan kedem kirkpatrick klps lang learning lect levels lind linear linearly livne many matou miller minimum monographs motion motwani mount mulmuley nearest neighbors network neural notes objects obstacles optimization outliers overmars pach pages pattern peled points pollack polygonal polyhedra preprocessed press prob problems proc program programming providence random range references regions relatives removing reporting revisited sampling science searching separation sets shallow shape sharir shor siam sifrony spanning springer stanford stork surfaces sympos technique theoretical theory thesis three towards translational tree triangles unified union verlag vertical violated violations volume voronoi wang welzl when wiley with york http://doi.acm.org/10.1145/1070432.1070591 128 Quantum Algorithms for the Triangle Problem aaronson adjacency aharonov algorithm algorithmica algorithms almost alon ambainis amplification amplitude appear archive arguments arxiv automata bach barnum beals bound bounds brassard buhrman buhrruan cambridge chakrabarti childs chuang church classical cleve cnrs collision colloques colloquium combinatoires combinatorica communication complexity computation computational computer computing conference connectivity contemporary counting cycles database decision degree detecting deutsch dfirr dimensional distinctness eisenberg element error estimation ettinger fast finding foundations from given graduate graph graphes graphs grover hajnal hcyer heiligman hidden hnproved hoyer ieee information international internationaux journal jozsa kempe khot kitaev knill kobnogorov languages laplante length london lower magniez mathematics mechanical millennium mosca nayak news nielsen nmtrices orthogonal pages partitions personal polynomial polynomials power press principle probl problem problems proceedings programming properties quant quantph quantum query random randomized rapid recognize recognizing references regular report required rivest rosenberg royal saks santha science sciences search semidefinite series shen siam sigact simon sinmlations small society solution states studies subgroup subset symposium system szegedy szemerddi tapp technical thdorie theoretical theory time trees triangles turing undirected universal university using vazirani vishwanath volume vuillemin vyalyi walk walks watrous wolf yuster zalka zero zhang zwick http://doi.acm.org/10.1145/1070432.1070486 42 Online convex optimization in the bandit setting: gradient descent without a gradient adaptive adversarial adversary after against akedamii algorithm algorithms algorithnls analysis annals annealing annual anyxen appear applied approaches approximation arbitrary arlned ascent athena auer automatica automation avrim awerbuch ball bandit because belmont berlin bertsekas bertsimas between bianchi birge blum bodies bounds brendan calculations casino cesa chem chose colt combining completeness computation computational computer computing concave conf conference continuumarmed control convex cover david decision define dependent descent difference differentiable dimitri distributed distributions disturbances doklady efficient ellipsoids equation estimation exponentiated fast feedback finance following follows form foundations freund frieze function gambling gelatt generalized geometric give gives gradient granichin have hehnbold hoboken ieee ilxt inequalities inertia infinitesimal information input international introduction irteenth isotropic january john jyrki kalai kannan kernels khachiyan kirkpatrick kivinen kleinberg last learning leat lecture leningrad line linear lovasz loveaux machine machines manfred mathematical mathematics mcmahan measurement metric metropolis mihnan minimizing multiplieative nauk ndimensional nearly neural neurodynamic nmlti nmltiplicative normed notes observation online optimization over pajor path periods perturbation phys point polynomial portfolio portfolios position potential predictors probability problem proc proceedings processing programming programs proof random randonfized rearranging references remote required rest rigged robert rosenbluth routing russian sampling schapire science scientific search selection setting show simonovits simulated simulation since singer sinmltaneous sobolev solving sons space spall springer sssr state step stochastic struct symposium systems takimoto telescopes teller terms theorem theory this thonlas tight tile tsitsiklis twentieth under unit univ universal updates using vecchi vempala venlpala verlag versus vestn vohmm volunm walks warmuth warnmth wiley will with yoram york zinkevich zinkevieh zonoids http://doi.acm.org/10.1145/1070432.1070581 120 Greedy Optimal Homotopy and Homology Generators * acad ackermann ahuja algebraic algorithm algorithms algorithrns also amir anal annu appear appears appl applications applied argument associated atblgabla automatic bases basis because bgggbg biconnectivity boundary bounded bounds bruckstein call called cambridge canadian canonical cbms cccg chazelle chen circle classical clitt clustering coefficients colin combinatorial combinatorics comments complexity comput computation compute computer computing conf conference conjecture connectivity construct constructed control convex cornell cornput cornpute corresponding cutting cycle cycles data december decompositions defines definition detailed deterministic difficult discrete discussions disk drawing dynamic each earlier edge edges edition efficient eigenvalue eikonal embedded englewood eppstein eproceedings equations erickson even every example experiment face fails fast faster finally find finding fixed flattening flows form francis from full fully gabriel gallot generates generators genus geodesic geodesics geogr geographic geom geometry ghrist gilbert given globally gluing gortler graduate graph graphs greedy group hall hamilton hard hatcher have helpful henzinger holm homeomorphism homologieally homology homotopic horton http hulin hutchinson identifying ieee implementation independent industrial integer internat into inverse jacobi journal kaneva kapoor karger keller kimmel kiryati klein know lafontaine lattice lazarus leaves lecture level lichtenberg linear linearly loci logn loki loops magnanti mand manifold manifolds mapping math mathematical mathematics matroid matula merely meshes methods metric miller minimum mitchell mount multidimensional network nonoverlapping notes obtain often open opposite optimal optimally orientable orientations oriented original orlin other packings pair pami pants papadimitriou paper partitioning path paths pattern peled pessimistically philadelphia planar plane pocchiola pointing points polthier polygonal polyhedra polyhedron polylogarithmic polynomial possibly prentice preprint press problem problems proc properties propogation quickly randomized references regional related relatively relevant removing research riemannian rourke same sariel scaling schema schmies sciences separation series sethian sets shortest siam signature sinclair single society software sokal some space spaces spanning spectral springer stephen still stillwell straightest straightforward structures subramanian such surface surfaces sympos system systems tanaka tarjan texts texture thanks that theorem theortq theory these this thorup time topological topologically topology trajectories trans tree trees triangulated triangulations tsitsiklis twice type types undirected unfoldings university unstructured using variation vector vectors vegter verdi verlag verroust version vertex visual visualization vladimirsky weighted where which with work zigelman http://doi.acm.org/10.1145/1070432.1070504 57 Ray Shooting amid Balls, Farthest Point from a Line, and Range Emptiness Searching* about above advances agarwal algebraic algorithm algorithmica algorithms almost also amidst annu appear appl applications appls apply approximating aronov arrangements automata barequet behind bounds cambridge chazelle chen chew colloq combinatorial combinatorica comput computational computing convex cornput daescu data davenport decomposition deterministic diagrams dimensional dimensions discrete distance dynamic edelsbrunner efficient efficiently efrat envelopes erickson euclidean european exponential extension farthest find fixed found four friedman from functions geom geometric geometry given goodman goodrich guibas half halfspaces heidelberg higher ideas ieee information into kedem koltun languages lecture levels line linear lines lower machinery main matou matougek melbourne mohaban near notes nterscience number obtain orientations ovidiu pach pages parametric partition paths point points pollack polygonal polyhedral preprocessed press problems proc proe programming providence providing query random range real references related relatives reporting sampling scheme schinzel search searching semi semialgebraic sequences sets shallow sharir shaul shooting siam singly size snoeyink space spheres springer stone storage stratification struct structure such sympos symposium tagansky technique thank that their them theor theory this three throwing tight time tition trees under university upper varieties verlag vertical view voronoi welzl wiley with workshop york http://doi.acm.org/10.1145/1070432.1070598 134 On Profit-Maximizing Envy-free Pricing agents aggarwal algorithms alimonti approximate approximating archer auctions blum bulow choice clarke clearing combinatorial complexi conf cubic discrete economics economy feder frugal goods graphs hardness journal kann kumar learning ltal market mechanism mechanisms motwani muhipart multi oflcalp online optima pages papadimitriou parameter path political pricing problems proc product public references roberts rudra sandholm siam simple single springer symp syrup talwar tardos truthful with zinkevich http://doi.acm.org/10.1145/1070432.1070500 54 Network Coding: Does the Model Need Tuning? acknowledgments across admits ahlswede alexandre algebraic algo algorithms allerton along alphabet also american amount annual ansactions approach april ball below beyond bits boolean bound bounds bulletin burago capacity cauchy charles chou ciss clarendon classification clifford code codes coding colloquim comments communication complexity computational computing conference construction control cormen david december direct discrete discussion dougherty each eccc edge edition effros egner electronic eliminates england enormous eric even every exists exploration extra febuary feder fiber flow follows freiling from full functions generalization geometric goodey grundlehren hand hardy harvey have ieee increasing inequalities inequality infocom information inhalt instance insufficiency interesting introduction isoperimetric isoperimetrie ithms jaggi jain january july just kamal karger keith koetter least lehman leiserson length lgth like linear linearity loomis ludo madhu make march mathematial mathematischen medard message messages michelle model moderate most multicast muriel must network networking networks nick ning nmlticast number numbers oberfl october open operates other oxford paul peter philip pointing points polynomial press problem problems propose provided question ralf rasala raymond receive receives references related remaining requesting required results riis rivest robert ronald routing rudolf sanders sciences sebastian send sent shuo sidharth similarly sink size slightly small society solution solvability solvable soren source spinger springer stein submitted sudan suggest surplus symposium systems tavory thank that their theory therefore these this thomas time tiskin tolhuizen total toward transactions transmit transmitted undesirable unencoded upper using vector vectors verlag versus vorlesungen warwick where whether whitney wiseenchaften wish wissenchaften with work would wright yeung zalgaller zeger http://doi.acm.org/10.1145/1070432.1070555 99 How Fast is the k-means Method?* acknowledgments agarwal algorithm algorithms also analysis annals annu appear applications approximate approximation aronov arora assoc authors based berkeley boris california centroidal classification classifications clustering comments comp comput consistency coresets cornp dasgupta data david deterministic diagrams dimensions discrete discussions duda edition effros euclidean faber fast fifth found geom geometric geometry gunzburger hart http ieee imai implementation inaba information input inputs interscience kanungo karpinski katoh kenyon kmeans kumar learn least lect lectures like linear lloyd local mach macqueen manuscript math matougek mazumdar means median method methods mount multivariate netanyahu nets notes number observations other page pages pankaj paper papers particular pattern peled piatko point pollm polynomial press prob problems proc provided quantization rabani randomization referees references related review sabharwal sadri sariel schemes schutman search sets siam silverman simple some springer squares stat statistics stork strong studied sympos syrup tessellations test thank their theo theory this time together transactions uiuc unversity used useful variance variants vega voronoi weighted wiley with would york http://doi.acm.org/10.1145/1070432.1070484 40 A Constant Approximation Algorithm for the One-Warehouse Multi-Retailer Problem aardal algorithm algorithms analysis annual appear application applied approximation arkin batches bertsimas bilde bound case chart chudak citeseer complexity computational computing constant convex cornell cost covering department dependent design deterministic dual dynamic echelon economic editors effectiveness facility federgrun formulation heuristics hosten html hull improved inequalities integrality inventory item jain joint joneja journal krarup lagrangian leners letters levi lhcility linear location logistics lotsizing lower management mathematical mathematics median methoden metric model multi muriel naval numerische operations opthnization optimierungsaufgaben ordering orie pages partitioning piecewise planning plant pochet policies preparation primal problem problems proceedings production programmhzg randomized references relaxation replenishment report research retailer rounding roundy schema science shen shmoys simchi single sizing slam solutions strong structural structures study submitted symposia symposium tacility tardos technical theory thomas time trends tzur uncapacitated university using valid vazirani version vohra volume wagner warehouse whitin with wolsey zero http://doi.acm.org/10.1145/1070432.1070553 97 Complete Partitions of Graphs academic achromatic acta algorithm algorithmica algorithms almost analiz annual appl approximate approximating approximation approximations arid arora asymmetric balasubramanian balls berlin bhave bidirected bins bipartite bodlaender bollob bounded bounds budapest cairnie camb cambridge catlin center chromatic chuzhoy class clemson clique cographs coloring combin combinatorial combinatorics combinatoriea combinatories company complementary complete complexity comput computer computing conf congressus conjecture constrained contemp cook counterexample cover crab degree dependence differences disc discrete disk domatic dubhashi editor edmonds edwards efficient erdss europ european evans extremal february feige flow folding function fund gabow given graph graphical graphs guha gupta guyk hadwiger hallddrsson halperin harary hard hardness harmonious hedetniemi hochbaum homomorphisms http idge inapproximability independence inform integer interpolation interval iyee johnson join journal khanna kortsarz kostochka krauthgamer lecture lett linear london lower lund manuscript matching math mathematica mathematical mathematics maximal mcdiarmid method metody minimization minimum nabs naor negative network nman nmnber notes number numbers numerantium open optimal optimization pages parallel partition philosophical polylogarithmic portugaliae press prins problem problems proceedings process programs progress pseudoachromatic pseudocoloring ptvblems ptvc publishing radhakrishnan raman random ranjan recent reduction reed references regular repetition results robertson russian sampathkumar science september series seymour shende siam sivasubramanian society solved some spanners springer srinivasan stad stoc structure structures study subgraph surveys symposium techniqne their theorem theory thomas thomason threshold tight tire trees true university unpublished util versus vertices webpage well with within yannakakis yegnanarayanan york http://doi.acm.org/10.1145/1070432.1070542 88 Oblivious R o u t i n g on N o d e - C a p a c i t a t e d a n d Directed G r a p h s Mohammad T. Hajiaghayi* Robert D. Kleinberg*t* Tom Leighton *t Harald Rgcke§ ahnost algorithlns algorithm algorithmica algorithms allocation alloptical alon annual annum another applications applied approximate approximating approximation architectures aspnes asymptotically awerbuch awerbuctt azar balancing bandwidth bartal best between bienkowski bologna both bound bounds brebner buchbinder capacitated case challenging chekuri circuits class closing cohen commodities commodity communication competitive comput computer computing congestion considered constant constructing currently cuts data deadlock decomposition diagonallydominant directed discrete distt does dynamic edge even exploiting factor feedback fiat flow foundations from fteenth gaps garg general global graph graphs harrelson have heide hence hildrum ibuted icalp ieee important improved inax industrial interesting kaplan khanna klein known korzeniowski kpolylogn larger last least leighton leonardi limited line load local localcontrol locality lower maags machine maggs main management manuscript mathematics miller minimize minimizing minimum mlel more multi multicommodity multicuts multiway naor network networks nmnber node nodecapacitated nothing objectives oblivious obtain obtained online open optimal optimization paper parallel parameterized parekh particular planar planarity plays plotkin polylogn polynomial potential practical preconditioning presented preserve press problem problems proceedings racke rain ratio ravi reduction references resolution resource results role routing scheduling schemes schieber science seems sets shepherd siam simple since single sink sixth slight society solving steiner sudan symmetric symposimn symposium systems tardos terms than their theorems theoret theory there these they thirty this tight time tree trivial twenty undirected unfortunately universal upper vach valiant vaziranb version virtual vocking waarts weighted westermann whether with wlmn yannakakm http://doi.acm.org/10.1145/1070432.1070457 19 Approximating connectivity augmentation problems achieved algorithm algorithms appear applications applied approximating approximation archly augmentation augmenting augnmntation bang benczfir berlin better birge block blue bounded cactus chapter cheriyan comb combinatorica complete comput computation computer computers congress connected connection connectivity constant containing cosh cover covering coverings crossing cuts deduced design development digraphs dimensionm dinitz disc discrete documenta edge edgeconnectivity edges egres electronic element eswaran extra factor families fasc fischer fleiner fleischer focs four francisco frank free freeman from functions garey general generalized given graph graphs guarantees guide hardhess have hypergraph hypergraphs ieice incremental independence information international intractability invited ipco isaac ishii issue iterative jackson jain jensen johnson jord jordan jords july kann kiraly known kortsarz krauthgamer labelcovermax lectures letters level lncs local localvertex mader maintenance manuscript march matching math mathematica mathematical mathematicians mathematics mathematik maximum meet method mgorithms minimal minimum mininmm model murty nagamochi nakamura near network networks node note notes npcompleteness nutov optimal orithms pairs peleg plesnik problem problems proc processing proe program programming programruing ratio recent reduction references rehmann relaxations relaxed requirements results rooted rounding sciences setpair sets siam size small smallest state steiner stoc structure structures submodularity suggests supermodular symmetric syrup syst system szigeti tarjan than that theorem theory this trivial ttuns undirected used values vempala version vertex vetta vole volume watanabe while williamson with xxvii http://doi.acm.org/10.1145/1070432.1070600 136 Selfish Routing with Atomic Players anarchy appear atomic available behaviors capacitated catoni communication competitive correa equilibrium from harker http independent jacm jcss moses multi multiple network networks orda oughgarden pallottino paradoxes players preliminary price references roughgarden routing schulz selfish shimkin stier tardos theory topology traffic trans user version with http://doi.acm.org/10.1145/1070432.1070470 29 Approximation Hardness of Optimization Problems in Intersection Graphs of d-dimensional Boxes academic achieved acmsiam admission advance advances agarwal alavi algebraic algorithm algorithmic algorithms alignments alimonti annual annum appear appl applications applied approximability approximate approximated approximating approximation asano assignment assume ausiello axis axisparallel bafna balas battista because berman best between biocomputing bipartite bipolar bounded bounds boxes boxicity chan channel chlebfk chlebfkovg circular claw clearly clique cliques combinatorics combinatorim comp completeness complexity components comput computation computer computing conference congr connected consequence consequently cont contains contradiction contradicts covering covers crescenzi cubic cubicity dasgupta ddimensional dimension dimensional dimensions discrete dominating domination drawing duckworth eades edge edges efficient ejficient eompleteness erlebach european extended extension eytan fact factor fast finding fixed following fowler free fundamentals gambosi gavril general geom geometric geometry gives graph graphs gtuph gupta hall hallddrsson harary hardness hedetniemi hence high hochbaum horton however ieee image imai immediately impractical inapptvximability independence independent index indifference induced information inst international intersection interval intervals isaac iwama jansen john jose journal journm kann khanna kilakos kluwer known kratochvfl kreveld label layouts letters leung lewin lncs local lrwing maass manlove marchetti marriage matching matchings math mathematics matroid maximal maximum methods minimum miyazaki more morita muthukrishnan muthukrishnana naor narayanan networks nielsen nieminen nonoverlapping nordic npcomplete number numer objects observe only optimal optimization orda order orientations packing panos parameters parauel pardalos partial paterson piercing placement planar plane polynomial polynomially prentice press prisner problem problems proceedings processing progress proncipe proof proper protasi publisher rain ramaswami rather ravi recall recent rectangle rectangles rectilinear references relationship research reservations results roberts rosenstieh routing satisfiability schachnai scheduling schemes schwenk science scott seidel sets shapira shepherd showed shows siam simple simultaneous soda solvable some sons spaccamela special split springer stabbing stable straightforward such suri symposium tamassia tanimoto tarjan techniques that their theorem theoret theoretical theory there they this ties tile tiling time tollis tutte twelte union uphs using variants version visualization vlsi weight weighted which wiley with within workshop yannakakis yehuda yield york zito http://doi.acm.org/10.1145/1070432.1070510 61 Approximation Algorithms for Cycle Packing Problems akak algorithm algorithms also apply balister bollob caprara chekuri circuits closed combin combinatorica complete comput conjecture consider consisting corresponding covering cycles decomposition delete digraphs directed discrete disjoint edge edges erdss extremal forbidden fractionally from gegebener girth going graph graphen graphs greedy halle holyer hypothesis iiamiltonian induced inductive khanna knotenzahl komlss large luther martin math minimaler natur packing panconesi pancyclic paths press probab proc proof references reguliire reihe reversed revisited rizzi sachs sequence seymour siam simonovits simple since sjoint soda stoc subgraphs szemercdi taillenweite take tarsi then theory thomason ttnils undirected univ varadarajan venkataraman weakly wiss with without wittenberg http://doi.acm.org/10.1145/1070432.1070440 5 Inoculation Strategies for Victims of Viruses and the Sum-of-Squares Partition Problem acsac advances algorithms amherst analysis anderson announced annual applications applying approach approximate approximation arora aspects aspnes association authors available bailey bell berlin better birkhfiuser bisection bornholdt boston breaches cambridge campbell canada case challenges chang chess complex computation computer computers computing consortium cost crew crisp csfw definitions deployment designing different directed discussions diseases distributed domain economic economics econsec editors effect elder email embeddings empirical enough epidemics epidemiological epidemiology equilibria even evidence expander fast feige feigenbaum flow flows foundations frauenthal free from game games genome geometric gong gordon graph graphs hafner hamilton handbook hard heal hnmunization hong html ieee immunization infection infectious information inoculation interdependent internet inteuigent investment issue jiang journal july june kearns kephart kesten knight koutsoupias krauthgamer kunreuther large leighton letters like loeb look machinery management market massachusetts mathematical mathematicians measurement measures measuring miller minimum mitzenmacher modeling models much multicommodity naor network networks neural obstacles ortiz pages papadimitriou paper parkes partition partitioning pastor percolation perspective physical policy polylogarithmic press prevalence privacy problem proceedings processing propagation publicly references reliability report research review richard risk risks role satorras saul saydjari scale schieber schslkopf schuster science secm secnrity secure security siam society special spectrum springer squares stochastic stock strategies survivability symposium system systems syverson technical terrorist their theorems theoretical theory thrun towards towsley transactions transport transportation uncertainty university useful vancouver vazirani verlag vespignani victims viral virus viruses volume wang warfare white wiley working workshop worst would yale yaleu yampolskiy yang york zhou http://doi.acm.org/10.1145/1070432.1070548 93 An Optimal Bloom Filter Replacement* additionally algorithms allerton allowable almeida almost analyzable annual another applications approximate approximation area aspects automata bidirectional bits bloom bloomier bound broder brodnik cache cardinality carleton carter ceedings chazelle clancy classes cleary coding cohen colloquium communication communications compact compete compressed comput computer computers computing conference constant contribution control data dealing deletions department dependence described dictionaries dimension discrete dispersing dynamic efficient encoding errors european exact explicit facilitates filter filters finding floyd from functions gill gives gmod hagerup hash hashing have htra icalp ieee important inability indexable informatics information interesting interna international july kilian knuth lack languages lecture likely linear lookup lookups lossy loth lower main management manuscript markowsky matias membership minimal minimum mitzemnacher mitzenmacher more mortensen most multiset multisets munro nearly network networking notes nual obtain offs open optimal pages pagh paper perfect possible practice present press probing problem proceedings programming protocol queries query raman random randomization range reduction redundancy references report reporting representation result rodler rubinfeld scalable science scientific seminar sept sharing shortcomings siam soda solving some space spectral springer stacs stanford static stlin stoc structure structures stunmary suboptimal succinct support supports survey symposium system tables technical techniques testers that theoretic theoretical theory this tholey time tinm tional trade transactions trees uniform universal university usage used using variant verlag volume wegman well when whether wide with workshop http://doi.acm.org/10.1145/1070432.1070550 95 Improved Range-Summable Random Variable Construction Algorithms abstract addison advance again algorithm algorithms alon also amazing ammal amsterdam annual appear appendix application applications approach approximate approximating arbitrary area arithmetic assume authentication automata available basis because berkeley between bias binary broadly call cancel carter charikar check chen classes code codes coefficient coefficients colloquimn colmnns colton columns comp complexity comput computation computer computing conclusion conference consider consisting consists construction constructions contrary contributions cormode correcting corresponding corresponds could count counting data database decompositions defers derandomization development diagonals differ difference dimacs distance distinct dominance dual each eccc ecole edition efficient efficiently either elements engineering eport equality error estimating evaluated even every exactly existing exploited explored farach fast feigenbaum finding first form forms foundations four frequency frequent from full fully function functions further general generality generator generic gibbons gilbert given gives goldreich goldwasser graphs guha hankel hash hashing have higher histogram histograms holland hope however huge icsi identical ieee immediate implementation improve improved improvements independence independent indyk inputs international introduced items join june kasman knowledge knuth kotidis kumar languages latin leading leaves liens like limited linear linearly loss luby macwilliams maintenance makes massive matias matrix moments monomials monomiat mononfial more muller multidimensional multiple must muthu muthukrishnan naor natural nodes normale norms north note number nussboim objects ones only operation order other pairwise parity pass point polynomial polynomials position possible potential power presented previously principles probability problems proc programming programn proof random randomness range rangesthnmable rangesum rangesunmmble recall reductions reed references remains report research restricted rows same scalar science searching second section seems self show siam since sipser sivakumar sizes sketch skew sloane small soda some sorting space spaces special stimulate stoc storage strauss stream streaming streams stremns strictly structure stun subcode subgraphs sublinear such summable summary superieure survey symposium syrup syst systems szegedy table technical terms that their theoly theorem theoretic theory therefbre these this those time tracking transactions triangles triangular universal upper using values variables vector vectors viswanathan wavelet wegman were wesley where which wigderson will with work working xixd xixj yossef zero http://doi.acm.org/10.1145/1070432.1070442 7 Market equilibria for homothetic, quasi-concave utilities and economies of scale in production acts adaptive agarwal agement aggregation ahlswede algorithm algorithmic algorithms allerton analysis annals appear applied approx approximating approxinmtion arrow auction available bargaining based berlin brainard broadcasting buyers capacity case charging chou circumscribed coding combinatorial competitive complexity computation compute computing concavity cone conference congestion consensus constraint constraints control controlling cowtes debreu deng devanur different discussion dual econometrica economic economical economics economie economies economy edge edges edition efficiency eisenberg elastic elements ellipsoid equilibria equilibrium european example existence exploiting flow focs foundation fourth fsttcs full functions gale garg geometric gross grstschel have heidelberg help hence hill ieee improved increasing information inscribed intermediary interpretation jain july kapoor kelly lausanne line linear mahdian mangasarian manuscript market mathematical mathematics mcgraw mcgrawhill means method methods microeconomic model models mutuel nash network newman nonlinear norton note online only optimization oxford packing paid papadimitriou paper pari paris path planning politique polynomial practical preparation press price prices pricing primak primal probabilities problem proc production programming pure quinzi quite rate receivers references represent results returns revisions richesse running saberi safra salavatipour same scale scarf scheme schrijver sciences separable session sessions sets setting simultaneously situation social sociale soda sold solving sophisticated spending springerverlag stanford statistics steiner stoc subjective submitted substitutability telecommunications theorie theory there third this time trading traffic trans transactions trees type uniqueness unit university used utilities utility varian vazirani version walras wealth when with working yeung yiedman york http://doi.acm.org/10.1145/1070432.1070480 37 Dotted Interval Graphs and High Throughput Genotyping addition algebraic algorithm algorithmic algorithms also analysis annual applied approximate approximation approximations arcs assays aumann bargelloni better bioinformatics boguski both brandstadt chem china chords circular classes clin coloring complete complexity computer congr danio designing determine digd discrete dnas double ecol efficient efrat elsevier even exact find first fixed flanders fluorescence fluorescent garey gene general genetic genoin genome given golumbic graph graphs hadas hallddrsson harary hardness have human impossible infrared interest international intersection interval intervals irina isolation johnson joseph journal king know lecture linkage magnfis manisterski mathematics mckee mcmorris meth microsatellite miller minisequencing molecular multidimensional multiple multiplex multiplexed namely naor nomics notes npcomplete number numer oetting open optimally pages papadimitriou partanen partitioning pastinen patarnello patent perfect phase phic polymorphisms polymot polynomial primers problem problems proceedings proving question recognition recognizing references regards related remain remains repeat report reuven review roth scheduling schuler science screening seffi sellers sequence several shachnai shapira shih shmoys short shown siam sinica smallest solid spinrad split stewart strategies such survey symposium syvnen tailed tandem technical that theory there third thirteenth this topics trotter typing using variation volume wabi webb west whether wiesher with workshop yakhini yehuda yonatan zane zebrafish zohar http://doi.acm.org/10.1145/1070432.1070502 55 Pianos are not Flat: acknowledgements agarwal ahnost algebraic algorithlns algorithm algorithmic algorithmica algorithms almost amenta amidst among analysis annu another appear appl applications applying aronov attention avnaim award barriers basu berg best bmtimore boca bodies boissonnat bound bounds boxes bringing cambridge canad canny case challenging chan chapter chazelle chew cigar cigars circles clearance collision combinatorial commun communication complexity comput computation computational computing conf conjecture conn consider considered construction contacts contaimnent containment convex crete critical cylinders danny davenport ddnlaing decomposition decompositions degrees dept design diagram diagrams dimensional dimensions dinmnsions discrete discussions dissertation doctoral edition editor editors eecs eedom efficient encouragement envelopes environment erickson exact exist existing extremal ezra face faveljon first five flato following four free freedom future general generalized geom geometric geometry goodman greenwich guibas halperin handbook have helpful hidden high hopkins improving include inside intersection jeff johns jordan journal kavraki kedem kedenl koltun kreplach kreveld ladder large largest latombe lavalle least leaving lecture leven lines livne loth lower lozano lvlath magnitude manifolds mark matching math matougek megiddo micha minkowski more motion motionplanning movers moving natural near needle needles nlotion notes number object objects obstacles optimal optinml order orientations other overlays overmars overnmrs paeh pages paper parallel parametric partition paths peled pellegrini personal piano pipes placement plane planning pollack polygon polygonal polyhedra polyhedral polyhedrm polyhedron practical preparata press previous problem problems proc proe properties provided pure purely quadratic question range raton real references regions removal report research revolution rigid roadmaps robot robotics robots rourke running sariel scand schinzel schwartz search searching second segment semi semialgebraic sequences serial series sets settings shaped shapes sharir shooting siam sifrony simple single snoeyink space specific springerverlag stappen steve structure subsequent such suggesting sums super surface sympos technique techniques thank that their theory there these this three threedimensional tight time toledo topological translating translational triangles twodimensional types undertaking union univ university upper using utilize variety vegter vertical visibility volume voronoi well wesley wish with work workshop york http://doi.acm.org/10.1145/1070432.1070574 114 Sampling regular graphs and a peer-to-peer network (Extended Abstract) Colin Cooper,*Martin Dyertand Catherine Greenhill* advances algorithm algorithms also annual applied approximation aquila area areas asing asymptotic attention available berichte bipartite bollob bounds bourassa bringing building carnegie chains combinatorics communication comnmnications computer computing conference constant cont cooper degree department diameter distribution dyer entries european fast flow formula fred frieze from full generating generation given goldberg graphical graphs grateful greenhill hfformatik holt http ideas ieee improved infrastructure international italy janson jerrum journal kannan known labelled lamb lecture leslie london luczak main maintaining making mark markov markovchain math mathematics maths matrix mckay mellon mixing models moderate multicommodity negative network networks notes number pandurangan paper peer permanent polynomialtime poznarl praktische preece preprint press print private probability proc proceedings proof properties provided ptvbabilistic quickly radzik raghavan random rates references regular report research result rucifiski sampling science section selected self sequence series simple sinclair small some sons ssgrr stable steger structures surveys swan symposium tetali thank their theoretical theory these tinhofer tournaments unifo uniform university unpublished unsw upfal used vempala vigoda when whir wide wiley with world wormald york http://doi.acm.org/10.1145/1070432.1070506 59 Online Conflict-Free Coloring for Intervals algorithms alon also annu appear applications aspects assignment athreya aviv band berlin branching cambridge cellular coloring colorings combinatorial comput computational computer conflict cormen deogun discrete dissertation enjalbert equencies even fraction frequency geom geometric geometry graphs grundlehren introduction kloks kratsch lecture leiserson lotker mathematischen mayr method miiller networks notes other peled permutations plane points press probabilistic problems proc processes ranking references regions rivest school science siam simple smorodinsky sons spencer springer states sympos table theoretical tyequency university verlag vertex wagner wiley wissenschat with york http://doi.acm.org/10.1145/1070432.1070529 77 Dissections and trees, with applications academic algorithmica algorithms alliez also annotated balanced bibliography bijective bits bounded canad canonical census chains coding combin combinatorial compression comput computer conf connectivity convex dbwilson degrees desbrun determinant dimacs disc drawing edgebreaker edition electron embedding encoding encodings eulerian exact fast focs general generation genus gotslnan graphic graphical graphics graphs grid http icalp ieee information intetface into kant khodakovsky large linear maintained maps markov math mcdiarmid mesh meshes methodology mgorithms model munro near nijenhuis nmnber optimal optimm ordering orderings osthus pages parentheses perfectly planar polygon polyhedra poulalhon prescribed press prsmel randoin random ranmn representation rossignac rutgers sampling schaeffer schnyder schrsder second siam soda static steger stoc structures succinct taraz their theoretically theoreticmly theory time touma transactions trees triangle triangulations tutte using vertex visualization welsh wilf wilson with http://doi.acm.org/10.1145/1070432.1070466 26 On Levels in Arrangements of Surfaces in Three Dimensions Timothy M. Chan* agarwal algorithms amsterdam appear applications aronov arrangements berlin bound bounds budapest cambridge chan characterization chazelle circles colored combin combinatorial combinatorica complexes comput computation concave consequences counting crossings curves davenport dimensions dinmnsional discrete dissection drawing edelsbrnnner edelsbrunner eppstein erdss estvss ffiredi found four functions geom geometric geometry graph graphs guibas halving holland ieee improved inequality injective interscience intersecting intersection into katoh lect lectures lemma lenses level levels line lines lovasz lovssz manuscript many marcus math matou matougek mlmber netherlands nevo north notes number pach pages pinchasi planar plane planes point points press problem problems proc pseudo pseudoparabolas references related reverse rfiny schinzel segments sequences sets sharir simmons simple smorodinsky space springer srivastava straus surfaces survey sympos tamaki tardos their theory three tokuyama triangle triangles tverberg univ university verlag wagner wenger wiley with york zivaljevic http://doi.acm.org/10.1145/1070432.1070475 33 On the Spread of Viruses on the Internet above acknowledgment albert appear barabasi based bollobas bollobks bollobtis buckley combinatorica complex cooper degree dezso diameter discussions drinea durrett duxbury emergence enachescu equations examples faloutsos follows free frieze from general graph graphs halting internet kleinberg leading math mathematical mechanics mihail milena mitzenmacher model models networks oliver osthus phys physical popularity power preprint press probability random references relationships results review riordan robustness scale scalefree scaling science sequence statistical theory tile topology useful variations viruses vulnerability http://doi.acm.org/10.1145/1070432.1070584 122 Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group aaai acad acmsiam acta akad akade algor algorithms alon amer amsterdam analysis artificial assoc babai beals bounded bounds bovey budapest bull cambridge cayley ckenzie comb combinatorial combinatorics combinatory comp complexity computer computing conf cube databases degree diameter dianmter dixon dordrecht driscoll english erdss even exercises field finding finite focs ftung furst generate generating generator goldreich goncharov graph graphs group groups hard hetyei heydemann hoeffding holland hung ieee inequalities info inst intelligence interconnection interscience isvestija jerrum kantor kiad kluwer korf length lett london lubotsky math method miai minimum minimunl montreal motwani nato nauk networks north optimal pattern period permutation permutations phys polynomial power press probabilistic probability problems proc proof publ raghavan random randomized references rubiws russian science sequence sequences seress short small soda solutions some spencer sssr stat statistical sums symmetric symmetry that theoretical theory transitivity translation translations turan turj univ university using variables verw wahrscheinlichkeitstheorie wiley http://doi.acm.org/10.1145/1070432.1070530 78 The expected value of randoin minimal length spanning tree of a complete graph David Gamarnik * academic algorithms annals appl applied approach asymptotic avram bender bertsimas canfield coja combinatorics complex computer coms connected constant counting depth discrete edge edges electronic enumeration exact expectations festschrift fill first foata frieze geometric gessel given graph graphical graphs harary hypergraphs independent labeled lenghts lengths limit luczak math mathematics mckay method minimal minimum model moore number oghlan palmer partitions polynomial press probabili probabilistie probability problem proceedings random references sagan sanwalani science search simplicial spanning sparse steele structures tree trees tutte under unified value vertices weights with http://doi.acm.org/10.1145/1070432.1070558 101 Multicoloring Unit Disk Graphs on Triangular Lattice Points Yuichiro Miyamoto* algorithm algorithmica algorithms allocation appears approximation approximations assignment available best better bounded breu cellular channel coloring colors company computing constraints define disk engineering exists fdma feder finds frequency from good graph graphs hard heuristics hochbauln html http hunt information keisu lattice letters marathe mathematical matsul mcdiarmid metr miyamoto more most multicolo multicoloring narayanan network networks notions number online points polynomial problems processing proof proposed publishing ravi reed references reports required research reuse rosenkrantz shende simple simplicity static such suppl technical techrep that theorem there time tokyo triangular unit university utokyo various weighted werra when which with http://doi.acm.org/10.1145/1070432.1070464 25 Improved schedule for radio broadcast (Extended abstract) additive algorithms alon also analogously appear applications approach awerbuch berger between bound broadcast broadcasting centralized chlamtac chlebus chrobak clementi collision combinatorial comp comput computer computing constructions cowen czumaj decomposing decomposition detection determinism deterministic diameter discr distr distributed dlog efficient elkin emulation expansion explicit exponential fast follows foundations gaber gasieniec gibbons goldreich gossiping graphs ieee inapproximability indyk infocom into itai journal kortsarz kowalski kushilevitz kutten linial lower mansour mobile monti multi multihop network networks pages pelc peleg polylogarithmic principles problem proc radio randomization references regions related report reuse rytter saks science sciences selectors siam silvestri since single small spatial structures symp syrup syst system tdma technical that time timecomplexity topology undirected unknown wave weinstein with yale yehuda http://doi.acm.org/10.1145/1070432.1070488 44 Theory of Semidefinite Programming for Sensor Network Localization acknowledgements alfakih algebra algorithm algorithmic algorithms algosensors alizadeh anchors anderson angle annual appl applications approximation aspnes assumes available balakrishnan barvinok bctwcen belhumeur besides biswas bits boyd bsdoiu careful classical combinatorial combinatorica combinatorics communication comp completion complexity comput computation computational conditions conference conformation connected connectivity constraints continuation control convex convexity corr course data david defined demaine demonstrated dept desirable desired determine develop dimensional direction disc distance distributed doherty doiu dynamic embeddability embedding encyclopedia eren estimates estimation euclidean exploiting exploits extra farid feron find fine first flops free from fromherz geom geometry ghaoui global goldenberg goldfarb good grained graph graphs graver guarantees hajiaghayi handle have help hendrickson however important incorporates indyk inequalities infocom information input instance instances interesting interior into investigate ipsn jackson james jiawei jordan khandani langendoen laurent left like linear linial lncs localizability localizable localization london make manuscript many maps matrices matrix matroids measurements mere method methods metrics mobicom mobihou model molecular molecule moore moreover multilateration needed network networks nmdel node noise noisy notions often open optimization order pair paper park pister placed point position positioning positive preprint primitive problem problems proc programming properties quadratic questions rabay rabinovich randomization range rank reading realizability realization realizations references relationship remark report research results richard rigidity robust rural savarese savvides scheinberg secondly semidefinite sensor sensors servatius shang should shown siam socg soda solution solving some space spaces srivastava still structure studied subject system technical thank that their theoretical theory there these they thirdly this those time trajectories unanswered unique uniquely university usenix variant various volume waterloo weighted which whiteley wireless with within wolkowicz work would wsna yang yields zhang http://doi.acm.org/10.1145/1070432.1070573 113 Coupling with the Stationary Distribution and Improved Sampling for Colorings and Independent Sets aldous algorithm algorithms annual appear appears applications approach approximating approximation association berg berlin birkhfiuser bodies bounds brightwell bubley cayley chain chaines chains coloring colorings colouring colourings colours combin combinatorial combinatorics computer computing constant constantes contemporary convex core counting coupling degree discrete distribution doeblin dover dyer dynamics electron entries estimating expos fewer fini finite five flour foundations frieze generation girth glauber goldberg graph graphs groups hard hayes high ieee improved independent jerrum journal kannan kovian lattice least lecture lectures lindvall lnterbalkanique lower machinery markov martin martinelli math mathdmatique mathematical mathematics matrix maximum method mixing model models molloy negative nfixing nombre note notes orie paper path patterson percolation permanent physics polynomial polynomialtime preliminary preprint probabilities probability proceedings processes proving publications random randomly randora rapid rapidly references research revue rmmber saint sampling science sdminaire sets siam simonovits simple simples sinclair space spatial spin springer statistics steif stochastic strong structures symposium systems tats technique their theoretical theory time tree uniform union valiant vazirani verlag version very view vigoda volmne volnine walks weitz winkler with xvii york http://doi.acm.org/10.1145/1070432.1070491 46 Popular Matchings abdulkadiro about admissions algorithm algorithms allocation american assignments based behavioural bilateral bipartite chapter college combinatories computing conjecture core dictatorship discrete domination econometrica economic economics economy editors endowments european exchange extensions fieient from gale gardenfors goods graham graphs grstschel gusfield hall handbook holland hopcroft house hylland iage individuals indivisible irving journal karp kavitha london lovasz making manuscript market marriage match matching matchings matehings mathematical maximal maximum mehlhorn michail monthly nmez north operational optimality pages paluch pareto political positions postlewaite preferences press problem problems proceedings pulleyblank random rank representatives research residence roth sciences serial shapley siam sided society soda stability stable strong structure subsets symposium theory unpublished vblem versus wanted weak with yuan zeckhauser zhou http://doi.acm.org/10.1145/1070432.1070520 70 Rounds vs Queries Trade-off in Noisy C o m p u t a t i o n abaronov about above abstracts ajtai algorithms alon annals annual annum answers applied automata average bell between bits boolean boosting bound bounds broadcast broadcasting buhrman case cellular characterizations chcs checking chert circuits coding coinputation communication comnmnication comp comparison complexity comput computation computational computations computer computing conference constant contain copies coping decision design destructive deterministic dimacs discrete edition editors error errors evans fanlt fault faults faulty feige fifty finding finite flow focs foundations free from function functions gamal games gates general given gives gmlager graphs highly ieee information input interactive invasiveness ising john journal kenyon kilian kleitman known komlos kushilevitz latin leighton lelism lett liars line lower mansour mathematics maximum measure memory merging method model morphisms mossel multiple nestril network networks newman nice noise noisy note number obtain open optimal pages para parallel parity part partimly pelc peleg peres physics pippenger polynomials presence presented probabilistic probability problems proceedings process propagation quant quantum queries query questions radio raghavan random randomized references reischuk reliable research respectively restriction results robust rounds rshrig schmeltz schuhnan schulman science searching second selection selforganization series servedio seventeenth several shiloach siam signal similar simple size soda some sons sorting specific spencer spiehnan sponsored statistical steiger stoc studied survey symposium syst szegedy szemeredi that theoret theoretical theory there these this tight tile tolerance tolerant towards trade transactions tree trees unified unreliable upfm valiant vishkin wiley winkler with without wolf workshop would years http://doi.acm.org/10.1145/1070432.1070536 83 External-Memory Exact and Approximate All-Pairs Shortest-Paths in Undirected Graphs * access accessing adjacency again aggarwal aingworth algorithm algorithms algothe almost along alsparse amortized analysis another appearing applications applied approach approximate apsp arge austin belong bender block breadth bringing brodal buffer cache caches cachethe cacm call chekuri chowdhury complexity component comput computed computing conjunction constructed corollary cost cycling data decrease decreaseestimation delete demaine dense dept diameter distance distances drop each edge eecs efficient enough ensures entry exact external externaltled externm extract extracted fagerberg fast final finally first focs following follows from function gether gorithm graph graphs halperin handled heap heaps hnproved holland http icalp implemented implied incurred indices individual indyk into joth june kumar leiserson level list lists load loth made manner master matrix mehlhorn memory meyer minimum minkley motwani moves multi multibuffer munagala munro namely necessary negative neously nmltiplication oblivious obtain ofor once operation operations optimal over pack pair pairs parallel paths performed periodic phase planar potential priority problem problems proc proceeds produce prokop queue ramachandran ramachandrau ramachaudran ranade real reconstruction references related removal require required requires resulting results retrieve rifle rithm rotmd round rounds same scan schwabe search section separation sequences settled shortest single sink sinmlta slim soda solve solved solving sort sorted sorting spaa space spdp sssp stoc stores structure structures sublinear sufficiently supports survey take tech technique terms that their then theorem these thesis this through thus tile toin toma total tree triggered underlying undirected updated using values version vertex vertices vitter wads weighted weights when whenever where with without work yigo zwick http://doi.acm.org/10.1145/1070432.1070575 115 The Bin-Covering Technique for Thresholding Random Geometric Graph Properties abello above abstract academic adhoc aiello aldous algorithm algorithmic algorithms alon also analysis analyze annals annual appear appeared appel appl applications applied approximating approximation asns asympototic athos bejar berkeley best bhargava bhatnagar bincovering birkhuser blough bollobas boston bounds byproduct cambridge capacity case changes choose christensen chung cocoon combinatorics communication communications comnmnity computer computing concepts conference connectivity continuum control coverage covering craham critical dall data dataman degree density devroye diameter diaz differ dimacs dimensional disadvantages discovery disk distributed distribution dominating drawing edge efficient ellis enclosure energy enlarged estrin euclidean evolution extend extended extent factor faithful finding flaxman fleming focs frieze fundamental ganesan general generally geometric give gives globecom goel govindan graph graphs great gupta haas hall handbook high highly honor http ieee infocom information interest interesting international introduced introduction invited jaillet james john journal kleinberg kluwer koushanfar krishnamachari kumar kunmr lecture letters letting like linear local longest martin massive math maximal maximum mceneaney measurements meester meguerdichian method methods metric milcom minimal minimum mobile model models monotone more multipath multiple muthukrishnan narasimhan nath need network networking networks nmnagement node nodes notes number open operations optimization ordering other oxford packet pandurangan panwar paperrs parameters path paths pearlman penrose percolation perspective petit phenomenon phillips phys piret plane points poor potkonjak power practice presence press prob probab probabilistic probability problems proc processes proof properties publishers quality questions radio raghavan rajagopalan random randomization randora range recent references report research resilient result review rough route routing russo rutgers santi science security sensor serna sets sharp shenker show siam size small spacings spanning sparse spatial spencer spring srivastava staid statistics stoc stochastic stretch structures suitable survey symposium tabrizi tamu tantawi tarokh tech technical technique techniques tends that theoreln theoretic theory there threshold thresholding thresholds tomkins topological topology trans transactions transmitting tree tsirigos ttle understand uniform uniformly unit univ university upfal used users usual value version vertex volume what wicker width widths wiley will wireless with world would zero zhang http://doi.acm.org/10.1145/1070432.1070587 125 Optimal Random Number Generation from a Biased Coin* aaas abrahams academic addison advancement algorithm algorithms american analyze annals annum applied articles association available bias biased bits blmn blum bound branching bureau carlo carnegie chain characterizing cipra class coding coin coins collected combinations combinatoriea complexity computation computer connection construction correlated cover csfaculty cucker defined department diaconis digits dijkstra direc discrete distributions editor efficient elias encoding entropy enumerative example extracting fair fascicle finite flips forsythe from function functions general generating generation headsor highlights hoeffding hoshi html http identified ieee independent information interval iterating january klarreich knuth letters making manuscript markov marriages mathematical mathematics meeting mellon method monte more national neumann news nonuniform notes number open optimal optimality optimm optinml pages peres pergammon possibly prefixfree press probability procedure proceedings processing programming question random randomizing randomness real recent references remarks reprinted results roulette schalkwijk science sciencenews search seattle section sequence series shub siam simons smale source springer standrads stanford state statistics stout submitted symposium tails taocp technique techniques theory tions toss tossed tossing transactions traub tree troubled unbiased university unsactions used various verlag volume warren washington wesley whether with works york http://doi.acm.org/10.1145/1070432.1070523 72 Ordinal Embeddings of Minimum Relaxation: General Properties, Trees, and Ultrametrics acmsiam additiverelaxation agarwala algebra algorithm algorithmic algorithmica algorithms alon amer analysis andp annual appear application applications approach approximability approximathm approximation approxunation arbitrarilylarge arxiv aspects babilon bafna bartal between betweennes bilu bounded bounds bourgain brinkman brooklyn charikar chor classification clustering colton combinatorica combinatorics communication complexi complexity comput computational computer computing contemporary cunninghamand demaine dhamdhere diamond dimension dimensional dimensions discrete distancefimction distances distortion doiu edinburgh efficient eigenvalue embeddhlg embedding embeddings euclidean evolution evolutiona example expanders extensions extra farach finding finite fitting follows foundations four frankl from functional gegebener general geom geomet geometric geometrical geometry goodman goodness graham graph graphen graphs greedy grotschel gupta hajiaghayi halle handbook harding hierarchical higher hilbert holman hybrid hyperplanes hypothesis induced indyk information institute into intpossibility invertblg israel ithe ivansson johnson journal june kannan knotenzahl kruskal lagergren lindenstrauss line linial lipschitz london lovfisz lowdimensional lower manifolds mapping maps martinluther math mathematical mathematics matou maxov mendel method metric metrics mhthnaler model models monotone muhidimensional multidimensional multmimensional naor natur nonlinear nonmetric number numerical ociety oflipshitz ofpartitions opatrny opthnal optimizing optimumordinalembeddingcan order ordering orderp ordinal paterson place places pohtts points pointsin portland press probabilistic problem proc procedings proceedings psychological psychology psychometrika rabinovich radiation raecke ratio ravi real realization reduction references reguliire reihe relation resulting robust rodl rourke royal sachs scalhlg scaling science second series shah shepard siam sidiropoulos similarities slam some space spaces sphericity stad sudan symp symposium systems taillenweite taxonomy technology theol thesis thorup tools torgerson total trans tree trees ultrametrics univ unknown valtr vancouver warnow warren while wiss with wittenberg york http://doi.acm.org/10.1145/1070432.1070560 103 Computing Minimal Triangulations in Time accurate algorithm algorithmic algorithms anal annual appear appl applications approach arbitrary arithmetic aspects asteroidal asymptotic asymptotically becomes berry between blair bordat bouchitt bound characterizations cheung chordal claimed comp complexity comput computation compute computer computing concepts considered constants coppersmith cornput dahlhaus details disc discrete dynamically edge efficient elimination embeddings estimates evolutionary fact fast faster fill filled finding free from fujisawa gaussian given graph graphs grouping handbook have heggernes highly holland hudson implementation incremental inside instead isaac journal kloks kratsch kratseh large leeuwen less lncs lueker maintaining making math mathematik matrix mentioned minimal minimum more multiplication nettles nmltiplication nordic north numerische obtaining ohtsuki optimal optinml ordering orderings pages parra peyton pivoting practical previously proceedings progressions ptveeedings range recognizing recomb references regardless revisited rose running scheffier science separability separators sequences short siam simonet soda sparse spinrad springer strassen strictly submitted symb symposium tarjan telle than theirs then theor theoretical theory thus time todinca topology total trees treewidth triangulated triangulation triangulations triple used using verlag vertex very villanger warnow weakly which wide winograd worse http://doi.acm.org/10.1145/1070432.1070585 123 Matrix Rounding with Low Error in Small Submatrices achieving algorithm algorithmica algorithms approximation arrays asano beck berlin bound checkerboard color complexities computation computer dimensional discrepancy distribution each error extend given global have idea integral intermediate karp lecture leighton lemma less make math matrices matrix matsui notes obtain optimal pages previous problems programming proof references rivest rounding roundings routing same science section sequences show situation spencer springer strictly such sure swat than that theo this thompson tokuyama tokuyanla vazirani volume whenever wire with http://doi.acm.org/10.1145/1070432.1070594 131 Conformance Testing in the presence of Multiple Faults acyclicity aleliunas algorithms alon alur american annals annual applications applied approximate approximation architectures automata automaton based bender bounded bounds branching cambridge chains characterizations check checking chockler chow circuits clarke cliffs colloquim combinatorial combinatorics complexity comput computer computers computing conductance conformance connection consider constant construct convergence coubetis dahbura defined degree derivation derived design detection determine diagnosis diagnostic digital directed discussion distinguishing domains driven editors efficient eigenvalue englewood eppstein expanders experiments extra failure fault fill finite finitestate fischer flmctions flow flows fnlkerson follows force ford forte foundations friedman from gedanken general generation gill gobershtein goldreich goldwasser graphs grumberg hall handbook have help hennie hill holzmann hsieh identification ieee implementation improved inter introduction isdn jersey journal july karp kibernetika kluwer kohavi koufareva krivelevich kupferman languages large lawler learning least lecture lehman linn lipton logical long lovasz lower machines markov mathematical matrix maze mcgraw menon methodologies methods mihail mixing model modeled models monotonic monotonicity moore motwani multicommodity naito national networks newman nondeterministic nonreversible notes number obtain omax otherwise over pages pardmos partial peled petrenko polynomial polynomially polynomials poset prentice prenticehall press princeton principles probabilistic probability problems proc procedure proceedings proe program programs properties property protocol protocols ptvbability ptvceedings puter queries rackoff raghavan rajasekaran random randomization randomized rates references regular reif reset resuits robust rolim rubinfeld sabnani samorodnitsky science sciences section sequence sequences sequential shapira siam sinclair size small society softw software sokal sokolovskii specifications spectrum springer state states still studies subgraphs sublinear sudan super switch switching symp symposium symposiura syrup sysmposium syst systent szegedy techniques test testable testing tests that theory this three time tolerance tolerated tours trans transactions transition traversal treatment tsunoyama twentieth universal university upper user uyar validation vasilevskii verification vgramming volume walks washington what where which width will with words workshop yannakakis yevtushenko york zlog http://doi.acm.org/10.1145/1070432.1070497 51 Maximum-Likelihood Decoding of Reed-Solomon Codes is NP-hard addison algebraic algorithmic algorithms among amsterdam angeles annual approximate approximating april arora babai barg berlekamp between beyond block bose boston bound bruck case certain chaudhuri classes code codes coding cohen combinatorial complete completeness complexity comput computational computations computer computers computing connections correction correctors covering december decoding discrete distance downey dumer elsevier encoding equations error feige fellows fields fijndamental finite francisco freeman garey gemmell geometric goldreich guide guruswam hardness highly hill holland honkala iebe ieee improved inapproximability infbrmatsii inform inherent intbnn intbrm intractability irreducible johnson july karp lattice lattices learning letters linear lipton litsyn lntbrm lntorm lobstein march math mceliece mcgraw micciancio miller minimum multivariate naor noisy nonunitorm north november october optima over papadimitriou parametrized paso patent peredachi peterson plenum polynomials preprocessing problem problems proc procedures process prohl queries reading reducibility reed references regev resilient riding rubinfeld russian sciences september shoup siamj slam solomon solving some stern stoc subset sudan sweedyk symp syrup system systems thatcher theory trans uniform vantilborg vardy welch wesley whittle with york http://doi.acm.org/10.1145/1070432.1070559 102 A n A s y m p t o t i c A p p r o x i m a t i o n Scheme for M u l t i g r a p h Edge Coloring Peter Sanders * academic adding after algorithm algorithms almost along also analiz application apply approx approximating approximation asymptotics attempt august before best better bipartite boca bondy bound caprara case chromatic class cole color coloring colors combinatorial combinatorica combinatorics combined completeness computing conclusion conf could covers critical decreases degree discrete diskret distinctions edge edgecoloring edges editors elogd estimate example except explosion exponentially family feige first forests fractional fresh from further give goldberg graph graphs heuristics hochbaum holyer implement improving index information input instances interesting intervals journal kahn kashiwagi large least letters lines lncs logarithmic manuscript matchings math mathematics maximal maximum might most multigraphs murty necessary nishizeki note number obtained ofek offer onefactorization only optimal padberg pages paths plantholt polynomial possible preparation presented press problems processing programming proof proposition ratio raton real reduce references refined related remain remaining result rizzi runs russian schirra section seymour shmoys siam size small solutions solve some southeastern springer sublinear such swapping than that then theorem theory therefore this time topics tries uncolored unsolved used very vizing volume wants wieder with wolsey world would http://doi.acm.org/10.1145/1070432.1070472 30 Isomorphism and Embedding Problems for Infinite Limits of Scale-Free Graphs aanssen abello acad acmsiam acta aiello albert aldous algorithmic algorithms alrdd andrew annals appear aristotle aspects asynmtric barabasi bases berkeley bernoulli billingsley bollobas bonato borgs bound bounding cambridge cameron certain chayes christos chung combinatorial combinatorica combinatorics comnmnities complex comput computation computer computing conference conmmn connectivity constant cooper copy cyber data degree diameter directed discrete each edition eigenvalue eigenvalues eighth emergence emerging erdos estimate european evolution extracting fact faloutsos fmoutsos focs following foundations free frieze from function general gilbert graham graph graphs handbook hence http hung ieee iilx iixk independent infinite information international internet into james janssen joel john kleinberg kluwer kmnar kmnj knowledge kntato kozl kumar large laszlo laws limits llldk llxn logic lxnj massive math mathematical mathematics mean means measure measurements mechanics methods michalis mihail model models modern motwani nady nesetril networked networking networks newman nlix october oliver other pages papadimitriou paul petros phys physics power prabhakar press print probability proc proceedings process properties raghavan rajagopalan random randomized randonl ravi references reka relationships renyi results reviews right riordan robustness saberi scale scalefree scaling science sequence sets shelah side sigcomm simple sivakumar some sons spaces spencer spinger springer sridhar statistical statistics statwww stochastic strange structure symposimn symposium syrup telescoping term that this tomkins topology transform trawling tusto university upfal users using variables verlag vldb vulnerability wide wiley with world writing yields ynlixn york zklldk http://doi.acm.org/10.1145/1070432.1070481 38 Algorithms for Combining Rooted Triplets into a Galled Phylogenetic Network across agreement algorithmica algorithms american analysis analytic ancestors annual ansson appear application applications applied approximation australasian australian avoiding biconnectivity bioinformatics bioinformaties biology brazilian bryant building canterbury cats characters chor choy christchurch classification cocoon combinatorial combinatorics common communications comp company comparing completeness complexity computational computer computers computing conference connectivity consensus constrained constraints constructing crandall current dense determining deterministic dezulian difliculty discrete dynamic ecology eddhu edge editors efficient electronic elsevier evolution evolutionary experiments expressions flllly freeman froln from garey garithmic gene genealogies given graco grafting guide gusfield hendy henzinger holm homeomorphic hunting huson including inferring inforntatics international interring into intractability intraspecific jansson jiang johnson journal kannan kearney king labelled langley latin lawler leaf level lichtenberg linder lingas lncs local lowest massachusetts mathematics maximum method methods minimum mlmc molecular nakhleh network networks notes optimization ordered ostlin osttin pages partial penny perfect phylogenetic phylogenetics polylc polynomial posada pper practice press proc proe qualitative quartet rates recomb recombination reconstructing reconstruction references relational research reticulate rooted sadakane sagiv scheme science siam sieniec singapore sites solutions spanning species springer steel subtrees sung super supertrees symposium systems szymanski taxon theoretical theory thesis thorup three time topics topologies tree trees trends triples triplets ullman university uphs using variable verlag volume wabi wang warnow with wonnald workshop wormald york zealand zhang http://doi.acm.org/10.1145/1070432.1070458 20 Primal-dual approach for directed vertex connectivity augmentation and generalizations* Lfiszl6 A. V~gh Andr£sA. Benczfir Department of Operations Research, E6tvSs University, Budapest Computer and Automation Institute, Hungarian Academy of Sciences able algorithm algorithmic algorithmics algorithms also analysis andr andrs annual appl application applications approximation augmentation augmenting available benczdr bencztir bencztlr bipartite boston budapest careful cases chain choices combin combinatorial combinatorica comp compu computation computer conclusion connected connectivi connectivity consequences constrncting contemporary control could cover covered covering coverings covers cuts cycle david design different dilworth dimacs directed disc discrete diser doctoral dual easier edge efficiency efficient egres elements ellipsoid elte equivalent european existence experimentm fact fast finding first flow flows follows ford former foundations framework frank franzblau frauk from fulkerson gabow general generalizes generators give given giving goemans graham graph graphs hard have here hochbaum hopcroft however http hungarian ieee implementation information initial interval intervals into irredundant jorddn jordgn journal karger karp kirgly kleitnmn knuth kratochvil least lecture length levine longest lovfisz matching math mathemaics mathematics maximum meet method minimal minimum needed nesetril network networks notes number open optimal optimization oracle pairs parallel path polygons poser poset power press primal princeton problems proc proe prog proofs publishing pushdown question rectangles reduce references replace requirements result ring roberts rster running satisfying schrijver science sense sequential series sets siam simple since single size special splitting springer steps subsets symp symposium syrup system systems technicalreport tell than theorem theoretical theory thesis time times trends trivial tschel undirected university used vertex volume weighted while williamson with http://doi.acm.org/10.1145/1070432.1070514 65 Bidimensionality: New Connections between FPT Algorithms and PTASs acmsiam addendum alber algofithmica algorithm algorithmic algorithmica algorithms algorithnrsfor also alzoubi amer american amir annual another apexminor appear applications applicationsof approach approxbnate approxhnation approximability approximate approximation arboretum arora artificial asked aspects association ating automata automatic bafna baker bayesian bazgan becker been believe berman better between bidimensional bidimensionality bodlaender bondy borie bounded bounds branch breu building calculating calculus calif call center cesati chang characterization chen cheng chiba chudak classes clique closed closely colloquium combinatorial combinatorica combined communications complete completeness complexity computer computers computing concepts conference conjecture connected connection consequence constraint constructed cost covet crossing cutset decide deciding decomposable decomposition decompositions demaine dependence described descriptions designing diameter digraphs discrete disjoint disk distributed domh dominating downey drawing dual eedback efficiency efficient elsevier embeddings enough equivalence every excluded excluding exponential expressing extend extended extensions extent face facility fami families family fast feedback feige fell fellows fernau finding first fixed follows fomin forbidden foundaalgorithmic foundations france francisco free freeman frick frieder from fujito further garey geiger general generalizations generalize generalized generation genus global goemans graph graphs graphtheoretic grids grigni grohe guha guide gupta gutin hajiaghayi handle hard have heuristics hicss highly hism hnproved hochbaum huang hunt iiaghayi illustrates implicitly improved incomplete independent inference information inria intelligence interesting international interpretation isomoq johnson journal kanj karger kernels khannaand khuller klein kloks knowledge koutsoupias kumar languages large layerwise leedback lett letters lies light linear linked lipton lncs lnternat local locally location logic loop machinery manuscript marathe matches math mathematical mathematics maximum methods minhnumconnected minimum minkoff minor minors mobile monadic most motwani multicommodity murty naor networks niedermeier nishimura nishizeki nobuji nonlocal norishige note obtain offixed oflinkless onential online oper optimization order orsay other oxinration papadimitriou paper parameter parameterized parameters parker partial particular perkovit philadelphia planar plane polynomial ppstein predicate primal problem problems proc processing programming properties providing ptas ptass publishing ragde rant ratcatcher ravi recently recursively references refined related revisited robertson rosamond rosenkrantz roth roughgarden routing saito satisfaction scheme schemes science sciences search seattle second section seems separation separator separators sets seymour sharing shown siam simple single sissokho sium size small society spanners specifically speed speedup springer state stege steiner strong structure structures sube subexponential subgraph substantially such super surplexity swamy symp sympo symposium syntactic syrup system takao tarjan technique techniques than that thct their theoo theorem theoretic theoretical theory theoty therefore thesis thilikos this thomas through time tions tire tmewidth tovey towards tractability transactions transversals tree trees treewidth treewmth trevisan triangulation ttee uncertainty undirected unit used verlag vertex view weighted weights what whether which width williamson wireless with wmth woloszyn worksh workshop would yehuda york http://doi.acm.org/10.1145/1070432.1070455 17 Computing the Shortest Path: A* Search Meets Graph Theory admissible again algorithm algorithmica algorithms algorithnls analysis annals annual applied appraisal approach approximate arbitrary artif aspects assoc automatic average based basis better between bidirectional buckets cambridge champeaux cherkassky compact comparison comput computation computational computer computing conference connexion cormen corporation correcting cost cowen cybernetics dantzig data decision denardo determination digraphs dijkstra directed directionm discrete distance distances distributed doran dreyfus economics edges edinburgh editors enable engineering esaac euclidean european evaluation experimental experiments extensions fakcharoenphol fast fibonacci finding flow flows ford formm foundations fredman fulkerson gallo geographic geometric goldberg graph graphs gutman hages harrelson hart hashimoto heaps hearn heuristic hnai hnplementations hnproved ieee ikeda industrial information integer intelligence international inteu inteuigence inttvduction jacob journal klein label large lecture leiserson level linear lower mach machine marathe math mathematical mathematics meets methods meyer microsoft minimmn mitoh monica multi multilevel nagel name navigation near negative network networks nicholson nilsson nishimura noon note notes numer oper optimization optimized oracles pages pallottino pardalos path paths philadelphia planar pohl points positive preprocessing press princeton principles problem problems proc proceedings proe programming pruning ptvc pzvc queries radzik rand raphael reach reachability reaching real refereed references remistic report research rivest road roundtrip route routes routing santa schulz science search sedgewick setting shimoura shortest siam silverstein simple single sint society solving some source sparse speed springer springerverlag staged structures study symp symposium system systems tarjan technical technictd techniques tenmoku their theory thorup time timetable transactions transp transportation undirected univ uses using vehicle verlag vitter volume wagner weight weights weihe willhahn with workshop zhan http://doi.acm.org/10.1145/1070432.1070512 63 Partial Covering of Hypergraphs acknowledgements actualit adding algdbriques algorithm algorithms alon among analysis annals approximating approximation approximations babai better bound bull cambridge canada chicago choice choosing combinatorial comments communication complexity computational computations computer computers computing consider consists constructed constructive copies copy coraputation courbes cover covering covers ddduisent discrete discussions each even every example exists expected fact factor feige formulated fractional freeman garey graham graphs greedy groups guide hardness helpful heuristic hmperin hnproved hochbaum hypergraph hypergraphs hypetyraphs improved information interscience intractability introducing johnson journal karp kearns kepr large learning lecture left less letters like linear lund machine massachusetts math mathematics method minimization minimized modify more notes npcompleteness number obtain oper optimal optimization order packing partial permutation personal picks press probabilistic problem problems processing proof prove random ratio recursively reducibility references regular required sciences seek series show shows siam slav slavfk solution spencer springer srinivasan state stated step steps such sufficiently surprising symposium system terms tgreedy than that then theorem theory there this threshold tight time total tournament trand type uniform uniprimitive university varidstds vazirani vertex vertices vnance weighted well when whereas which would yannakakis yehuda http://doi.acm.org/10.1145/1070432.1070450 14 A Tight Threshold for Metric Ramsey Phenomena Moses Charikar* academic accepted accounting algebraic algorithms amount annual appear applications banach bartal blum bodies bollobfis borrow borrowed bounded bounds bourgain chapter choices cllnn combinatorics compensate completes computational computer computing congress contribution convex cuni decomposition discrete distortion during dvoretzky each edge edition electronic embedding embeddings enough estimate expanders fact figiel finite forthcoming fraction from geometry haifaos handbook hence hilbertian http huji hzternational indyk into israel issue ixicc jerusalem journal karloff large least lectures left length linear linial lower manip mapped mathematicians mathematics matou matougek matousek mendel mendelma metric milman most motion mypapers naor notice number online only open pages phenomena planning press problems procedure proceedings proof rabani ramsey ramseytype randomized ravid recall references results saks science second server setting show siam since slam small some spaces special springer subsets such symposium system systems task ternational that theorem theorems theory therefore this tile total type ulations upper various verlag vertices want with http://doi.acm.org/10.1145/1070432.1070532 80 Linear Equations, Arithmetic Progressions and Hypergraph Property Testing Noga Alon * acad academic academy acta acterization algorithm algorithmic algorithms alon applications approximation arbor arithmetic arithmetica aspects asymptotic beatcs behrend believe bipartite botyai brown carrying case characterization cnrs cohmm coll colloque combin combinatorial combinatorica combinatorics complete complexity computational computin computing conference connection constructions contain containing counting decide decisions design dimacs directed direction duke easily edges edition efficient elements equations erdhs error existence exponent extremal false fischer fixed focs frankl give goldreich goldwasser gradshteyn graph graphs handbook having hbles hope however hung hypegraph hypegraphs hypergraph hypergraphs icalp ieee induced integers integzuls inter interesting jacm keszthely kluwer known kohayakawa krivelevich laba lacey large larger learning lefmann lemma length light likely linear long lowers manuscript math methods most multidimensional nagle national number only paper partite partitions period points polynomials presented press primer problem problems proc program progression progressions properties property pzvducts query random randomization randomized references regarding regular regularity related resolving rhdl right robust rubinfeld ruzsa ryzhik schacht sciences seems selkow series sets shapira should show shown siam sided single skokan soda some spheres stoc struct structures subgraph subgraphs submitted sudan survey systems szegedy szemer techniques terms testable tester testing theorem theorems theory this three thus trevisan triangles triangulated triple type uniform uninformed unpublished useful volrune which whose with would york yuster http://doi.acm.org/10.1145/1070432.1070517 67 A Group-Strategyproof Mechanism for Steiner Forests* aciri agent agents agrawal algorithm algorithms annual appear applications approximate approximation balance balanced based bound budget case collide computer computing connected constrained cooperative corollary correspond cost costs cross crossmonotonic define designated dipartimento discrete dual efficiency feasible forest forty foundations fourth game games gave general generalized given goemans group http ieee immorlica informatica instance jain journal klein larger latter limitations lower mahdian mechanism mechanisms mirrokni monotonic moulin networks node nodes obtain pages pairs part particular press primal problem problems proceeding proceedings ravi recall recovery references report roina root rooted sapienza schemes science share shares sharing shenker siam sistemistica sixteenth solution spanning spans special specified steiner strategyproof strictly submodular subset symposium tardos technical technique term terminal their theory therefore third thirty this tree trees universit vazirani versus want when williamson with zwam http://doi.acm.org/10.1145/1070432.1070567 108 Network Design for Information Networks activated active aggregation agrawal algorithm algorithmica algorithms algorithmusing almost approxifunction approximating approximation approxmodular arbitrary assign assigned assigning atbulk awerbuch azar based best binary boosted bound bounded building bulk campailla case cave certain chaki cijxij cijxq clarke client clients collecting collide combining computing conand connect connecting conset consider constrained containing cost costs could cover covering creating decision design deterministic diagrams discussions dual each easy edge edges efficient element elements equating estfin every example existing expected extend facilities facility factor fakcharoenphol feasible filtering find fiyi focs following foregone forest function functions general generalized give given gives giving global goal goel goemans graph greedy gupta have here icse imation incomplete incur indicates influence ings installation instance instead integer integrated ipco jain journal karger klein knowledge kumar lagrangian levi location logistics losing martin mation median metric metrics minimization minimize minkoff modular monotone most multicommodity nected need network networks next nine nodes note obtain open optimal optimization oracle overall pages pcst penalties penalty pfibl picking picks pill pivceedings pmceedhlgs polynomial primal prize probability problem problems proc proceedgraph proceedings program proportional publish ravi references relaxation rent reward rise root rooted roughgarden round rounding running sampling saves schema separation service sets sharing shmoys show shows siamj simple simultaneous since single sinha sink sjgn slam soda solution solve solving source specified sphere steiner stoc stochastic subfor subject submodular subscribe subset super swamy systems talwar technique thank that then this tight time tractional tree trees useful using variable vazirani veith vertex vertices want when where which williamson with worse write http://doi.acm.org/10.1145/1070432.1070592 129 The hidden subgroup problem and permutation group theory aaecc abelian afline ahnost alamitos algebra algebraic algorithm algorithms altern angew annals annual appear appl applications applied architectures archive arxiv arxive babai basis beals beth bounds bruce bull cambridge canleron chuang class codes combinatorial computation computer computing contiennent correcting coset degr dianmters dihedral discrete dixon donn doubly edition efficient engineering error ettinger factoring fast final finite focs foundations fourier france friedl functions generic graduate grigni group groupes groups gsvv hidden hmlgren hoyer ieee information instances international invent ivanyos jordan journal jozsa kitaev kuperberg lanl lattice lecture liebeck limite logarithms london magniez math mathematics measurements mechanical mgorithms moore mortimer mrrs nielsen nonabelian noncommutative normal notes orbit order orthogonal over pages parallelism permutation physics polynomial prepared preprint press primitifs print problem problems proc proceedings proe ptvceedings pueschel quant quantmn quantph quantum reconstruction references regev reine report representations rockmore roetteler rstteler russell sagan sampling santha schuhnan schulman science second selection shalev sharp shma shor siam simple society soda solution some space springer stabilizer stacs states stoc subexponential subgroup subgroups substitution symmetric symposium syrup technical texts theory time transforms transitive transitivite translation uduate uniprimitive university using value vazirani veeedings verlag version volulne volume with york http://doi.acm.org/10.1145/1070432.1070461 22 Online Client-Server Load Balancing Without Global Information acmsiam algorithms annual applications approximation aspnes azar balancing call circuits computer congestion control covering discrete distributed fiat foundations fractional general line load machh math mhdmizhlg networks online oper packing plotkin problems proceedings racke references rosen routing scheduling science symposium virtual waarts with http://doi.acm.org/10.1145/1070432.1070525 74 Lower Bound for Sparse Euclidean Spanners * algorithms answering appl arya bounds chazelle complexity comput computing demaine discrete euclidean geom lanky line mount partial partialsums problem proc pstra queries range references rosenberg salowe short siam smid space spanners sums sympos theo thin tight time tradeoff ympos http://doi.acm.org/10.1145/1070432.1070590 127 Coins Make Quantum Walks Faster aakv aaronson aharonov algorithm algorithmic algorithms also ambainis amer amplification amplitude annual appear approx arxive automata bach based benioff between bhmt brassard cambridge cellular chain childs classical cleve coins computation computer contemp contemporary database decision deotto difference dimensional dirac distinctness editors eisenberg element equation estimation example exponential exponentially farhi faster finding focs formation foundations from gases goldstone graphs grover gutmann hcjyer heidelberg hypercube ieee information introductory kempe lanl lanlarxiv last lattice lecture magniez make markov math mechanical meyer moore mosca motwani nayak neil notes overview pages paul pennsylvania philadelphia phys physics press problem proc proceedings processing providence quant quantized quantph quantum raghavan random randomized references regions report rivosh robot rolim rule russell santha science search searches shenvi simulations soda space spatial spectra speedup spielman springer stat stoc subset syrup szegedy tapp taster technical trees triangle university unpublished vadhan vazirani vishwanath volume walk walks washington watrous whaley with york http://doi.acm.org/10.1145/1070432.1070436 2 Dynamic Dictionary Matching and abstract accepted acids adaptive algorithm algorithmica algorithms alignment alto american amir applications approximate approxinmte arrays automata balanced bibliographic biological biology block burrows california cambridge cell chan chang collection combinatorial communications complexity compressed compressing compression computation computational computer computing construction corasick corporation data delcher dictionary digital discrete dynamic economical efficient equals equipment experiments extended farach faraeh ferragina fleischmann foundations fredman functionality galil genomes giancarlo graphs grossi gupta gusfield idury improved improvements index indexing infbrmation information italiano jacobson journal kasif labeling lain lawler line linear lossless manber manzini matching matias mccreight method munro myers nucleic opportunistic pages paolo paradigm parentheses park pattern patterns peterson poutre press probe proceedings processing pzvceedings raman randomized references report representation representations research riyees sadakane sahinalp saks salzberg schaffer science sciences search searches sequences siam sorting south space static string strings structures sublinear succinct suffix switching symposium system systems technical text texts their theory tree trees university using vceedings vishkin vitter weiner wheeler when white whole with workshop york http://doi.acm.org/10.1145/1070432.1070434 0 Dictionaries Using Variable-Length Keys and Data, with Applications * access addison alenex almost amortized analysis applications applied arrays baker balanced benoit bidirectional bits blandford blelloch bound bounded bounds brodnick cambridge canonical cardoze carter case chuang classes cleary codeword communications compact compressed comput computer computing constant cuckoo degree demaine dictionaries dietzfelbinger dimension dimensions discrete dynamic edelsbrunner efficient elias encoding encodings england expected experinmntal faces fast finger fixed focs fotakis fredman functions garg general generation geometry graph graphs grossi hash hashing have heide higher icalp ieee indexable indexing induced information integers international jacm jacobsen journal kadow karlin kary kash keeler knuth komlos labeling lecture linear list logla lookup lower maggs maps march matching mathematics mehlhorn membership mesh meshes meshing methodology miller mininmm multisets munro nearest neighbor nmltiple note notes optimal ordered orderings packings pages pagh parentheses perfect planar prec press probing processing programruing query raman real redundancy references representation representations representing rodler rohnert roundtable sanders science sciences search searching separable separators sept serial sets shaped short siam simplicial simplifies skeleton small soda sorting space spaceefficient sparse sphere spirakis stacs static storing string succinct suffix supports system szemerdi table tables tarjan teng text that then theoretically theory therefore three thurston time topology trans transactions trees turd tzal univ universal upper using vavasis vitter volumes wads wegman well wesley westbrook where will with worst http://doi.acm.org/10.1145/1070432.1070543 89 Distributed Online Call Control on General Networks above according acknowledgments actual again algorithm algorithms allocation along american analogous analysis appendix application architectures argument association avoids awerbuch azar bartal becomes behind bienkowski border both boundary bounded bounds call calls capacity changed channel chernoff child choose choosing chosen circuit circular cluster cmcf commodity competitive computer computing concurrent condition congestion connected constructing contain corollary current cycles deadlock deadlocks decomposition defined densely depend depends desired determined determines directed discussions disjoint distributed does edge edges embedded ended ends fiat flow focs following follows form foundations from further furthermore general gives global graph graphs guaranteed harrelson hildrum hoeffding holds however idea ideas ieee independent inequalities intermediate into introduce journal kleinberg korzeniowski lemma leonardi line lmax local lower means mechanism minimize minimizing more most needed networks next node nodes objectives oblivious only optical optimization originating overall pages parallel parauel parent parentpaths paths plotkin polynomial practical previous probability problem problems proceed proceedings proof proving racke random range reaches references remains resolution resource respective respectively routes routing same schemes science section selecting similar similarly simple sink sinki solution solved some somewhat source spaa specific starts statistical stefano stoc stuns such super symposium take tardos thank that then theory there therefore this throughput thus time transform tree union until useful uses using values variables version wait waiting what which will with http://doi.acm.org/10.1145/1070432.1070452 15 The Interface Between Computational and Combinatorial Geometry Micha Sharir* advances agarwal agarwat alga algebraic algebriques algorithm algorithmica algorithms almost also amer american amidst amsterdam analysis annu appl applications appls arrangements aurenhammer autom automata backward basu berg berlin betti bility boca boissonnat bounds budapest cairns cambridge cell certain chan chazelle chew clarkson cole collision colloq combin combinatorial combinatorica combinatorics combinatorlea complexity compression comput computational computer computing conference configuration congruent constructing construction contemporary convex corn cornput cornschemes cubes curves davenport davenportyvinec decomposition decompositions delaunay delberg derandomization determine deterministic diagrams differential dimen dimensional dimensions discrete dissection distance edelsbrunner edition efficient efrat elsevier enhandbook envelope estvss etry euclidean exponential extremal fast finite fixed found four friedman functions general generalized geom geometric geometry geomof goodman gramming graphs guiba gysri halperin halving handbook hart haussler heidelberg helly high higher holes holland holyoke homologie hulls huttenlocher ieee improved incidences incremental introduction jordan kavraki kedem klein knuth koltun kreveld ksubsets languages latombe lectures length levels linearly lines livne lower lowisz manifolds many mars math mathematical mathematics matou melbourne mgebraic milnor motion movers nets nonlinearity north number numbers objects obstacles optimization order orientations ouibas overcal overmars pach partition path pellegrini piano planar plane planning plexity point points pollack polygonal polygons polyhedra polyhedral preparata press princeton probabilistic problem problems proc proin properties providence quences queries random randomized range raton real reelles references regions related research roadmaps robotics rourke sack safruti sampling scheme schinzel schwartz schwarzkopf science seidel semi semispaces sequences sestka sets shamos sharir sharp shooting shot siam sifl simmons simple simplex single singly sions small society space spaces springer srivastava stratification straus summer surfaces survey surveys sympos szemer tagansky techniques terrains their theorems theoreti theory thorn three tight topological topology towards translational transversals trapezoidal trees trends triangles triangulating trotter type under union univ university upper urrutia varietes varieties velopes verlag vertical view visij voronoi welzl wenger wiley with york zone http://doi.acm.org/10.1145/1070432.1070562 105 On the random 2-stage minimum spanning tree across aldous algorithms annual applied approximation assigmnent assignment asymptotics beveridge birge birth bollobfis buying cambridge centre combinatorics communication complete component computing concentration conjecture conjectures consider construct coppersmith cornbinatorica corresponding cost costs cover defining denote describe dhamdere discrete distributed each edge edges edition expected fields finite form foundations frieze from function functions future giant graph graphs gupta hand handling hardness have ieee inequalities infinite instance introduction istlund janson john knuth length limit linusson louveaux luczak lugosi make manuscript mathdmatiques mathematics mcdiarmid measure minimum monday montrdal must nair other otherwise over parisi pittel prabhakar preserving press private probability probabilitytheory problem proceedings programming proofs random realize reduction references regular related reserches rest rucifiski separating sets sharma singh solution some sons sorkin spanning springer stochastic structures such symposium then theory these tile total tree trees tuesday uniformly universitd university value vertices where wiley with workshop http://doi.acm.org/10.1145/1070432.1070537 84 Graph Distances in the Streaming Model: The Value of Space * achieve achieved acmsiam aggregate aingworth algorithm algorithms allows almost alon also annual application applications applying approximate approximating assume athos authors automata awerbuch bases baswana been being berger better bounds bufferalgorithm buffered bulletin callaghan cambridge center certificate certificates charged chasing chekuri clustering colloq colloquium communication complexity composition compositional computation computational computer computing concerned conference connectivity considering constant constructed constructing construction could counting covers cowen damm data denote denoted dense described diameter difference discrete distance distributed distributions done drineas dynamic easy edge edges efficient either elkin embeddings ensure eory eppstein estinmtion every explicitly fast feigenbaum final find fits foundations frequency galil generators gilbert girth given graph graphs guha have henzinger high histogram histograms ieee improved inductively indyk input inserted international italiano journal jukna jumping kannan kotidis koudas kumar kushilevitz languages large lazebnik limited linear lined list lncs maintain maintaining maintenance major massive matias matrices matrix mcgregor mgorithms mishra model models moments more moreover most motwani multiparty multiplication munro muthu muthukrisbnan muthukrishnan near neighborhood next nisan nissenzweig note obey observe only oracles order outfollowing over pages pass paterson paths peleg pointer polylog ponzio possibility press principles problems proc proceedings proe programming proof properties property provide pseudorandom ptvc pzvc queries querying radhakrishnan raghavan rajagopalan reductions references report research results revisited rounds running rutgers said science sciences selection semi series sgall shim shortest siam significantly simple since sivakumar size slower small some sorting space spanner spanners sparse sparsification sped speed speeding speedup stable states storage strauss stream streaming streams strong subedges subgraph such summaries surfing suri symposium system systems szegedy table takes technical technique techniques than that their then theorem theoretical theory there these they this thorup three thus tile time tivity transicertificates transitivity triangles twentythird university using ustimenko various venkatesh vertex very viswanathan wavelets weighted when where which while widgerson will with without woldar yields yossef zhang zwick http://doi.acm.org/10.1145/1070432.1070487 43 Adaptivity and Approximation for Stochastic Packing Problems* abiding about achieve adaptive adaptivity adds after algorithins algorithmic algorithms also amer analyses appear applications approximate approximating approximation approximations assoc assume based because benefit bounded cambridge capacity careful case cheating chekuri choosing clarke clause clauses clique comp computing condon consider construction copy cornbinatorica covering dean debaters define deterministic digit dimension dimensional each either european exactly feigenbaum fillin first focs formula frieze functions goemans good graph halld hand happens hard hardness have here hereditary hfistad hoeffding however improved independent inequmities inserted inserting inserts integer item items khanna knapsack lund marking means most motwani multidimensional need only oper order ordering other otherwise packing policies policy press probabilistic probability problem problems programs proofs properly provably raghavan random randomized references rounding rsson satisfied satisfies satisfying shor siam some srinivasan standard stat stoc stochastic strategy subset sums system target technique that then this thompson type university value variables vondrgk weighted which with within worst would http://doi.acm.org/10.1145/1070432.1070467 27 Distributions of Points in the Unit-Square and Large k-Gons (Extended Abstract) advance advances ajtai algorithm algorithmic algorithms appear area aspects average barequet bertram bound bounds brass case chebychev combinatorial combinatorica computing corresponding decide derundomizing detervministic developments dimension dimensional dimensions disc discrete distributions duke eilbronn estimation extremal find fixed fundia given heilbronn heilbrvnn higher hofmeister however hyperg hypergraphs iangle independent inequality integers interest isaac jiang journal known koml komtds kretzberg large lefinann lefmann lefnmnn line london lower mathematical mathematics mathenmtical mathenmtics might moreover needs nontrivial obtain obtained ofheilbronn only pintz points polynomial preprint present problem proc providence pure quadrangles random references results roth rsdl schmidt schmitt seam selecting sets siam situation smallest society solutions spencer structures symposia szemer theory three time triangle triangles type uncrowded unctvwded unit upper vitany where yields http://doi.acm.org/10.1145/1070432.1070449 13 Approximation Algorithms for Low-Distortion Embeddings Into Low-Dimensional Spaces abfc absolute acaddmie additive agarwma algebraic algorit algorithm algorithmic algorithms analysis annual anupam appear application applications approx approximability approximate approximating approximation aspects badoiu bafna bandwidth between bioinformatics bjdg borsnk bourgain carolinae clustering colton combinatorial comment comptes computational computer computing data demaine department dhamdhere dimacs dimensional dimensionale discrete dissertation distance distances distortion distortiou doctoral doiu drei dynamic embedding embeddings euclidean euklidische evolutionary expression extendability farach fckw feige fiber finding finite fitting foundations function fund gene geometric geometry gifford goodness graphs group gupta hamel hastad hilbert hnproved hybrid hypothesis ieee indyk institute international into isreal istuel iudyk ivansson jaakkola jber joseph journal jout kannan kedar kenyon kirszbraun kruskal lagergren leaf lecture lind line linial lipschitz lipschitzschen ljth london lowdimensional lowdistortion manuscript mapping maps math mathematics matou method methods metric metrics mgorithmic model multidimensional naor narayanan nathan nmltidimensional nmtrics nomnetric nonmetric normed notes numerical optimal optimization optimizing ordering pages paterson point points polynomial problems proceedings programming proximities psychomet psychometrika rabani rabinovich radiation real recognizing references rendus required respecting robust royal saxe scaling science sciences series sets shepard siam sinclair small some space spaces srebro symposium system taxonomy technology theory thorup time tommi transforlnationen tree trees tutorial univ unknown utgers volmne warnow with working workshop workshops zusammenziehenden http://doi.acm.org/10.1145/1070432.1070580 119 Delaunay Triangulations A p p r o x i m a t e Anchor Hulls * Tamal K. Dey t acknowledgements aided algorithmica algorithms also amenta amsterdam annu appear approximating approximation aspects attali axis based berlin bern bodies boissonnat chazelle combinatorial comments comput computer condition convergence convex crust curve data decomposition dehne delaunay design diagram dima discrete discretization distribution dobkin dutta eppstein erickson flow freie from funkhouser generic genericity geom geometric geometry giesen goswami graphical gruber guarantee guibas handbook have helpful holland image institute internat interpolation janardan lieutier line lncs manufacturing manuscript matching medial modeling models nase need nice north osada pointing polygonal proc processing reconstruction referees references report sack samples science segmentation shape shapes skeleton smid straight structures surfaces survey sympos tech thank their third triangulations uniform universit veltkamp volume voronoi wads wills with workshop zhao http://doi.acm.org/10.1145/1070432.1070546 91 An Optimal Dynamic Interval Stabbing-Max Data Structure?* Pankaj K. Agarwalt actional agarwal aggarwm aggregates algorithmica algorithms applications approach architectures arge brodal cascading chaudhuri chazelle class classification communications complexity comput computation computational computer computing conference data database dimensional discrete disjoint dynamic edelsbrunner eillcien engineering european external filtering fully geometry ieee incremental indexability indexing input international intersection intersections interval journal kaplan lecture line location logarithmic maintain maintaining maintenance management matching mathematics mehlhorn memory minimum molad mortensen most networks nonlinear nordic notes oefficient optimal orthogonal output packet parallel part planar point principles priorities problems proc queries queryanswering radhakrishnan randomized range rectangle rectangular references related reporting require rule sahni samoladas science sciences search segment sets siam sorting specific springer stabbing structures sympos symposium system systems taijan tarjan temporal that theory time twodimensional using vahrenhold verlag vitter widom with yang http://doi.acm.org/10.1145/1070432.1070561 104 Finding the Shortest Bottleneck Edge in a Parametric Minimum Spanning Tree Timothy M. Chan* agarwal algebraic algorithms applications baca berg berlin bounds chan comput computation computational computing connectivity discrete dynamic eppstein fernandez found fully geom geometric geometry germany graph guibas henzinger hnproved ieee katoh kinetic kreveld levels lower minimum near nordic notes offline optimal optimization overmars pages parametric peaks planar problems proc randomized references related schwarzkopf sets slutzki spanning sparsification springer sympos technique theory thorup tokuyama tree trees using verlag http://doi.acm.org/10.1145/1070432.1070538 85 Lower Bounds for External Algebraic Decision Trees * aggarwal akad algebraic algo algorithms algot amer annu appear arge batched betti binarydecision bound bounds briques brown cggtvv chiang combinatorial comparisonbased complexity comput computation computational computations computer cornmun data decision diagram differential dimacs discrete dobkin emga european extermdmemory external extetvzal found full general geometry georgraphic geornetw goodrich graph grove homologie http ieee information input inter introduction isvestia ithmica ithrns knudsen larsen lecture line lipton lles lower manipulation math mathematica memory milnor miltersen multidimensional munagala nauk nmmory notes numbers oefficient oleiinik ordered orithms output papers petrovski practice preparata press primitives princeton problems proc processing procopiuc ramaswamy ranade real references related russian science searching segments series sets shamos showing siam sorting springer springerverlag sssr steele struct suel surfaces sympos syst systems tamassia theoretical theory thorn topology trees tsay under university vari varieties varying vengroff verlag version visualization vitter workshop york http://doi.acm.org/10.1145/1070432.1070463 24 Approximating the Average Response Time in Broadcast Scheduling acmsiam algorithms alon analysis annual arid bartal bellare bipartite broadcast broadcasts bundations combinatorial computer conference cost dependent discrete editor edmonds ejficient erlebach european fairness fine first flow focs foundations gandhi graphs halt handbook hardness ieee inapproximability integer ipco john joseph kalyanasundaram khuller leung longest lysis maiden maximum method minimizing models muthukrishnan networks oblivious online optimization parthasarathy performance press probabilistic proc programming proximation pruhs rain randomness references response rompel rounding sampling scheduling science sgall siam single sons source spencer srinivasan symposium time torng unsplittable velauthapillai wait when wiley wireless http://doi.acm.org/10.1145/1070432.1070474 32 The influence of search engines on preferential attachment albert algorithms annual application approach association attachment balls barabasi bins combinatorics computer computing conf cooper degree discrete dominate drinea eigenvalues emergence engines feedback fenner flaxman foundations frieze general googlearchy graph graphs heavily high hindman impact intrnl johnson kleinberg kotz kumar linked measurements meeting methods midwest mitzenmacher model models modern networks page political politics popularity preferential probability proc proceedings raghavan rajagopalan random references scaling science search sites sivakumar soda stochastic structures symp their theory tomkins tsioutsiouliklis undirected upfal vertices wiley with york http://doi.acm.org/10.1145/1070432.1070572 112 The cover time of two classes of random graphs academic albert aldous aleliunas algebra algorithms alon annual appear applications approach approximate approximation asymptotic barab bollob bound brown cambridge carlo certain chain churchill combinatorial combinatorics combinatoriea complex complexity computer computing conjecture connectivity cooper counting cover degree diameter discrete edition eignevalue emergence european every exercises feige feller finite focs formula foundations free friedman frieze from gebeite generatingfunctionology graham graph graphs groups grtschel handbook hard higher hill hochbaum holland ieee integration internet introduction iordan jerrum jonasson journal kaxp labelled lecture lipton london lovsz lower markov mathematical maze mcgraw method mihail monte networks north notes number papadimitriou press probabilistic probability problems proceedings process proof properties rackoff random references regular riordan saberi scale scalefree scaling science second sequence sequences series siam sinclair sixth society soda sparse spencer state structures symposium taken temperley theory tight time tools topology traversal tusan universal university upper variables verw visit volume wahrscheinlichkeitstheorie walks wiley wilf http://doi.acm.org/10.1145/1070432.1070496 50 LP Decoding Achieves Capacity algorithms allerton alon alphabets analysis annual approaches arguments barg based belief bell berrou between bound bounds burshtein capacity check chicago chung ciss codes coding comm communication communications complexity computationally computer computing concatenated conf constant construction control correcting corrects covers cycles david decodable decode decoding defined density design disc discrete distance effective efficient efficiently error errorcorrecting errors expander explicit exponents february feldman finite focs forney foundations fraction gallager general generalized gilbert glavieux graph graphical graphs guruswami hlformation hlternational holographic htternational ieee improved indyk inform information institute international irregular isit isita italy iterative john journal june karger koetter kschischang length letters like limit linear lineartime linkoping list lnfo lowdensity lower lowrate luby malkin manuscript march massachusetts math mathematical meeting message miller minimum mitzenmacher models near nearly networks november october optimal over page pages parallel parity parma passing personal proc proceedings product programming proietti proofs propagation pseudo pseudocodewords rail references relation relationship reliable reznik richardson roth science sciences september serial servedio shannon shokrollahi siam sipser sized skachek smaller soda sons spielman springer stein stoc submitted sweden symp symposium system systems tech technology telatar theory thesis thitimajshima tolerant trans turbo turbolike under unique university urbanke using varshamov vontobel wainwright weight weights wiberg wiley with within workshop york http://doi.acm.org/10.1145/1070432.1070534 81 The Relative Worst Order Ratio Applied to Paging* access accommodating achlioptas adversary aigorithmica albers algorithm algorithmica algorithms american amortized analysis annual anomalies applied based beating belady bell best better beyond borodin bounds boyar breslauer caching certain chrobak clairvoyance coloring communications competitive competitiveness complexity computation computer computers computing conference david department discrete dual editor efificiency epstein european experimental fast favrholdt fiat fifo foundations generalization giel graham graph guided heuristics holdt influence irani italian johnson journal kalyanasundaram karlin karp kenyon kohrt koutsoupias krumke larsen line list lncs locality lookahead loose luby manasse manuscript markov matching mathematics mathenmtical mcgeoch measure medvedev multiprocessing nielsen ninth noga online order packing paepe pages paging papadimitriou phillips powerfnl princeton problem problems proceedings pruhs raghavan rambau random randomized ratio reference references relative replacement report reservation rosen rudolph rules scandinavian scheduling schieber science sciences seat series server siam sleator snoopy society speed standard statistical storage stougie strongly studies study symposium system systems tarjan technical than theoretical theory thesis torng tunction unified university update virtual vohnne volume weighted with workshop worst young http://doi.acm.org/10.1145/1070432.1070505 58 Space-Time Tradeoffs for Approximate Spherical Range Counting Sunil Arya* Theocharis Malamatost above access algorithm algorithms allows amer analysis annu annual answer answering aoorithms appl applicaotherwise applications approach approximate approximation apptvximate arya associate associated balfspace ball balls bard because berg berlin between binary body bounds callahan cambridge case cell cells centered change chazelle clustering complexity comput computational conand constant construct constructed containing convex cornput corresponding count counts cuttings data decomposition deis described details determine diagrams different dimensions discrete discuss discussion distance dlog dominated each easily edition efficient error essentially exceeds factor fields fixed fldl floor found fredman from function funke geom geometric geometry germany given gupta handled handling have here hierarchical hypercube ieee implies increases inside inspection integer janardan komios kosaraju kreveld largest last layered leaf leaves linear lower majhi malamatos manufacturing math matou modification motwani mount multidimensional near nearest nearly need neighbor neighbors netanyahu next nnimann node obtained only optimal optimization overmars pach pages parumeters peled point points polytope polytopes potential precompute press problems proc process proe properties queries query quirements radii radius raghavan ramos randomized range real recall reconstruction reduce references remains remedy repages replacement responsible results same satisfy schwarzkopf searcbassuming search searching secacm section selection separation sets shootneighbor show shows shrinking siam siiverman silverman similar since size slightly smallest smooth some space spaceanswers sparse specified splitting springer staid standard stored storing struction structure suitable summarizing suppose surface symp sympos szemeredi table takes test that then theorem theory these they this time tion tions total tree university used uses valid value verlag version visited voronoi weight weighted when which with works worst york http://doi.acm.org/10.1145/1070432.1070493 48 Online Topological Ordering acknowledgement acyclic algo algorithm algorithmic algorithms almost alpern also amortized analysis analyze annual approximative aspects assoc authors been bender berkeley between bihnes bodlaender boretum bound bounded case circuits cole comp competitive compilation compiler complexity comput computational computer computing concepts conclusion conference correlation dagstuhl david debugger demaine depth dietz different directed discrete discussions done dynamic edge edges efficient empty european evaluation experimental farachcolton fibonacci fiir first fredman general germany gives graph graphs hans have heaps helpof here hoover implementation improved improvement incremental indicating informatik initially input inserting insertions institut institute international into ithms journal june katriel kelly kenneth known language lecture lett line linear lira list lncs loth lower mach maintained maintaining march marchetti minors mklog naani nanni network nlog nlogn node nodes notes number observe obtained omohundro online only open optimal optimization order ordering over pages part partial pearce peaxce performs pettie planck press previous priority problem problems proc process ramalingam ramalinganl references report reps research result robertson robust rohnert rosen running saarbrficken sather science search seminar separately seth seymour show shown siam simplified sleator solved sorting spaccaanela spaccamela special springer still strnctured sven sweeney symposium tarjan taxjan technical thank that their then theor theoretic theory there thiel this tight time topological topologically total tree trees treewidth under upper uses verlag volume whether which while width wish with work worksh workshop yield zadeck zito http://doi.acm.org/10.1145/1070432.1070549 94 Efficient Hashing with Lookups in two Memory Accesses access adler ahnost algorithmica algorithms allocation allocations along also american analysis animal anna annual appeared approximation argue argument aspects assoc assumption automata azar balanced balancing balls before berlin bins book bound bounds broder cachefi case chakrabarti chapter choices christoph class clog cole colloquium combin comput computer computing concerned concurrent consistent constant construct constructing core corollary cuckoo cycle czumaj czunmj delay deletions devroye dictionary dietzfelbinger dimitris disks dynamic earlier edges edited efficient egner ehnd eighth emergence endre enough enropean essential even every existence exploiting extend fast find finding following fotakis foundations fredman friedgut friedhehn frieze functions further giant given graph graphs guarantees handbook handle hans hash hashing have heide hnprove holds icalp idea ieee iendly ihnenatl implementations independent infocom information instead international janos journal journm kalai karlin komlos korst kurt languages large lecture lemma letters linear lines load logarithlnic loglogn logn lookup lookups lower maggs makes martin math mathematical maximum mehlhorn memory meyer michael mitzenmacher monotone morin most multiple negligible next note notes number obtained october only outlined over overhead pages pagh paper parallel pardmos part paul perfect perfectly peter philipp pittel power preliminary probabilities probability proc proceedings processes processing producing program property published rajasekaran random randomization randomized randonfized rasmus rasnmssen real redundancy references results richa riley robert rodler rohnert rolim ruing same sanders scheideler science sebastian second section setting seventh shape shared sharp show showed shown siam simple simulations since sinmlations sitaraman sixth size small society soda some spaa space sparse speed spencer spirakis springer springerverlag stacs stated stemann stenmnn still stlin stoc storage storing struct stun subgraphs subnfitted such sudden summation survey symposiuin symposium szemeredi table tables tarjan technical techniques that theorem theoretical theory thesis thirty this threshold time total tree trees triple true truly ture twenty uniform universal university upfal upper used using verlag version volume weidling when which while will with without witness woelfel workshop wormald worst http://doi.acm.org/10.1145/1070432.1070485 41 Sharing the cost more efficiently: Improved Approximation for aain agrawal algo algorithm algorithms along also amit anupam applications approxilnating approximate approximation arbitrary assume assumption awerbuch azar bartal baruch becchetti better between bulk carnegie case choice clearly cole collected collide company complete completeness comput computer computers computing constant constrained cooperative cost define definition degree design difference docs dual each efficiently ensures equivalently exist factor feigenbaum final follows forest foundations francisco freeman from games garey general generalized gnpta goemans going group guide gupta have ieee improved indicates interfering interfete jcss johnson joutvzal klein knmar ksnemann kumar least length leonardi lower math mechanisms mellon metrics minimum more mrob mtdticomnlodity mukicommodity multicast multicommodity need negative nemann network networks notice observe obtain ochen october only order other pages paid papadimitriou particular polynomial polynomialtime presence primal problem problems proceedin proceedings proof prove ptvceedings quasi ravi recall references rent residual restate rithm roughgarden science sciences share sharing shenker show shows siam simple simpler since slack software steiner strategyproof stretch strict subgraphs such suffices symposium system technique technology terminals theorem theoretical theory there therefore thesis this time total tractability transmissions tree trees units university uwaterloo vazirani vceedings wanted when which williamson with yair yields yossi http://doi.acm.org/10.1145/1070432.1070554 98 Two Algorithms for General List Matrix Partitions algo algorithm algorithms annual appear applications applied aspects aspvall bang bisplit boolean brandst brasil bulatov cambridge cameron certain closely colored coloring complete completeness complexity computer conservative constraint current dantas dimacs discrete downey edge edges efficiently eschen extended feder federal fellows figueiredo finding fixed flee follows formulas formulated free graph graphs gravier hammer hell hierarchy hoang homommphisms homomorphisms huang ieee informatics information instance ithm ized janeiro journal klein kohayakawa letters lics linear list logic lozin math matheinatics mathematics matrix motwani nally negetf nning only oxford pactable parameter partition partitions parts perfect pesc piscataway plass press problem problems proc processing quantified rairo reed references related report research rutcor rutgers satisfaction science siam skew soda some springer sritharan stable structural stubborn submitted symposium taljan tech technical testing theoretical theory thre three time tractability trigraph truth tucker ufrj universidade university vblem vblems verlag will with york http://doi.acm.org/10.1145/1070432.1070531 79 Girth Restrictions for the 5-Flow Conjecture abelian academic academy acta amer appear beineke boolean bratislava canad canada celmins chromatic class colmuble colouring combin combinatorics comenian complexity conjecture connected constructions constt contribution covers cubic cycle cycles cyclically decomposition dekker department discrete edge edgeconnected european families finite flow flows formulas from graph graphs gwups have hypothetical informatics institute integral isaacs jaeger kochol koehol math minor monthly nontrivial nowhere nowherezero optimization order petersen polynomial polynomials press problem problems reduction references rnphs sciences selected sharks slovak slovakia small snark snarks superposition tait tech that theory thesis topics trivalent tutte uctions univ university waterloo which wilson without york zero zhang http://doi.acm.org/10.1145/1070432.1070578 117 Provably Good Moving Least Squares adamson alexa alexander algorithm amenta anders anderson annual applications approximating approximation association august basis beatson behr belyaev bern bloomenthal boissonnat brian brien brooklyn bruce brunett building carr cazals chen cherrie choi claudio cline cloud cohen comlmter complex computational computer computing construction coordinates crust cubes curless daniel data david davis defining derose digital discrete distance duane duchamp dynamic editor editors estimating eurographics evans fast fedkiw filtering fingsof first fleishman fredric fright from fulk functions gelfand geometric geometry gert ginsberg ginzton good goswami graph graphics greg gross guibas hamann hans harvey high hnplicit homeomorphic hong hoppe huernational hugues ieee images implicit implicits independent international interpolating interpolation intersecting introduction isotopic james jean jeremy johannes john jonathan journal jules july june kari kaufman keiser kobbelt koller kolluri large leekha leif leonidas level levin levoy liusen lorensen lucas machinery marc marching mark markus marshall matt mccallum mcdonald mesh meshing method methods michelangelo mitchell mitra modeling models morgan mueller multi natural naveen neighbor neighbour nguyen niloy nina noisy normals objects ohtake optimization osher oudot pages partition pauly pereira perspective peter point points polygon pottmann power procee proceedings processing progressive project provable provably pulli radial range ravi reconstruction references registration rendering representation resolution richard ronald rusinkiewicz sampled samples sampling samrat scanning scientific sean seidel shachar shade shape shen shewchuk siggraph silva simple sixteenth sixth smooth solid soup springer springerverlag stanley statues steiner steve stuetzle sunghee surface surfaces surlaces surt symposium szymon tamal theory thirty tony trans transactions translormation turk twentieth unity unorganized using variational vegtel verlag visualization volumetric voronoi werner william with workshop york youg yutaka zhao http://doi.acm.org/10.1145/1070432.1070503 56 A Constant-Factor Approximation Algorithm for Optimal Terrain Guarding above acknowledges ahnost algorithm algorithmica algorithms amsterdam annual appl approximability approximation banos binational bose bronnimann canad canadian castro chains chen cheong claim comput computational computer computes conclusion conf conference congress consortimn constant covers cqopt decomposition dimension discrete editors efrat eidenbenz elsevier estivill exploits failed foundation from galleries gallery gaps general generalize geom geometry ghosh gmlery gonz goodrich grant guard guarding guards handbook hard hardness have holland ieee ifip illunfination inapproximability industry inform international iopt israel katz keil latombe lett lnform locating lsrt lund method methods ministry mitchell mobile monographs monotone moshe most nding nilsson nite north notable observation open optimal oxford pages partially peled placement polygon polygons polyhedral press problem problems proc process proe program proof publishers randomized recent references results rourke sack science sees sells sensor sept series shermer shop siam silnple simple slmrmer some special stature strongly structure supowit support supported switzerland sympos symposium terrain terrains that then theorem theorems theoretical theory there thesis time toussaint trade trans university urrutia using visibility widmayer york zurich http://doi.acm.org/10.1145/1070432.1070441 6 Marriage, Honesty, and Stability Nicole Immorlica* aaron addison admissions agents algorithm algorithmic algorithms alvin amel american amir analysis annual application applications approach approximate archer ariel aspects assignments association auctions authority autres avec average based bodin boris cambridge case christos chung college combinatoires combinatorial combinatorics computation computer computing concrete contents cost course design disc discrete distributed donald dubins econometrica economic economics economist economy elliott engineer engineering evolution experimentation feigenbaum first forthcoming foundations freedman from gale game graduating graham gusfield hebrew high higher husbands ieee incentives institute interfaces interns irving issues jewish joan john johnson journal june knuth kotz kunal labor lawrence leurs likely lint lowest machiavelli management marilda market marriage marriages martin matching matchings math mathematical mathematics mcvitie mechanism mechanisms medical modeling models modern mongell monthlv monthly montrral motwani national nisan noam number oliveira oneparameter operations oren osborne pages panken papadimitriou parameter patashnik peng peranson physicians piaw pittel placement political press presses principles probability probldmes problem proceedbzgs proceedings program rabbi rabbis rahul rajeev random redesign references relations religion research residency residents review revisited robert ronald ronen roth routing rubinstein rush sami science scott september sethuraman sets shapley shenker siam sided single slam solutions some sons sorority sotomayor stability stable stables strategic structure structures study symposium table talwar tardos tech their theoretic theory third tools truthful unequal union univ universitt university vmposium wesley wiley wilson with http://doi.acm.org/10.1145/1070432.1070582 121 Controlled Perturbation for Delaunay Triangulations Stefan Funke* Christian Klein* Kurt Mehlhorn* Susanne Schmitt* algorithm algorithmica algorithmisch algorithms amsterdam analysis annual appear appeared application applications arith arithmetic arrangements available cambridge canadian cccg cgal cgta circles clarkson classroom classroomexample combinatorial computation computational computations computer computing conference congress construction constructions controlled correct daniel data delaunay determinant deutlhard diagrams discrete effective efficient eine einfiihrung elsevier evaluation exact examples focs fortune foundations four fourresults from geometric geometry graphics gruyter guibas halperin hohmann holland home htlp html http ifip iher implementation incremental integer january jiinger journal karasick kettner klein knuth leda leiserowitz library lieber master mathematik mehlhom mehlhondftp mehlhorn modeling molecular mpisb nackman niiher north numerische orientierte page pages perturbation pion platjormfor polyhedral polynomial preliminary press problems proceedings raab random randomized rational references reinelt results robustness saarlandes safe sampling sbang scheme schirra science seidel sharir shelton shnplex shor smoothed socg spherical spielman surfaces swept symposium tactic takes teng theory thesis time towards transactions triangulation triangulations types universitat university using usually version volume volumes voronoi walter with world zepf http://doi.acm.org/10.1145/1070432.1070588 126 A New Look at Survey Propagation and its Generalizations Elitza Maneva* achiloptas algorithm algorithmic algorithms amer analysis analytic annual appear applying artificial arxiv associated aurell belief beliefs berger berkeley berlin books boufkhad bounds braunstein broader capacity chapter check chvatal class codes coloring combinatorial communication comparing complexity computational computer cond conditions condmat conference considering constraint cook cores decimation decoding density department diluted discrete dubois dynamics efficient eighteenth equations equilibrium european exploring exponential extended families family february field fields flour focs formulae franco franz freeman friedgut from generalizations gets gibbs glass glauber goerdt gordon graph graphical graphs greedy html http hyperbolic ieee importance including index info insight intelligence into introduced jordan journal june kaporis kenyon kirkpatrick kirousis kproblem lalas lanl lanlarxiv lattices lecture lectures leone literals local logic look loopy mandler maneva manuscript markov martinelli math mean measures mechanics message methods mezard mick millennium model models monasson mossel mrfs naive neccesary nordahl notes novel odds online optimization paalchenko page pages parameterized parisi parity passing pennsylvania peres performance personal phys pittsburgh plotkin preprint probabilistic probability problem problems procedures proceeding proceedings propagation properties provide proving published pure random ranging recovers reed references related relative relaxation remark replica report representation richardson role rosenthal saint satisfaction satisfiability science scienceexpress sciences september sharp showed side significance smoothness soda solution some spin springer stat statistical statistics stoc sufficient survey surveys svenson symposium system systems talagrand tatikonda technical technology techreports that theorem theory these threhsolds threshold trans trees ttps typical uncertainty under understanding unpublushed urbanke variational various vega volume wainwright walks weigt weiss well with yedidia zard zecchina http://doi.acm.org/10.1145/1070432.1070547 92 Self-Adjusting Top Trees* abcwpz above acar adapt adjusting ahuja aigorithmica algorithm algorithms also alstrup alternative although altrup always ambivalent among amortized analysis annual another apmentation appear appendix application applications applied approach around arranged authors automata base based basic belong bent between biased biconnectivity binary blelloch bleltoch bottom bounds cally careful case cases center child children circles circular clockwise cluster cohen colloquium comp completely complexity complicated composed compress compresses computational computer computing comt connectivity considering constant constraints contains contraction contractions contrast copenhagen corresponding counter currently dashed data degree demonstrates department deterministic devised diameter diameters diku direct directed directly disc discrete discussions disjoint divide does dynamic dynamizing dynanfic dynanfileaves each early ederickson edge edges effect eliminate encouraging equivalent essarily euler even example executed exist explicit expose expression fact factors fashion features fifteenth figure final finally first flflly flow foster foundations four frederickson from full fully further general generalized globally goldberg graph greatly grigoriadis happen harper have helpful henzinger here history hohn holm however http huproved icalp ideas ieee imple implementation implementations implemented imples imposed incidence indeed independence initial instead interested interesting interface internal international into investigating joint journal just keeping king languages large largest layer leaf leaves lecture left leftmost level lichtenberg line link links lists little logarithmic logn looking main maintaining mapping math mathematical maximm maximum median mented meth middle might mikkel miller mimicking minimizing minimum more much must need needed neither network nfinimum nlore nmkes nmximum node nodes noncrossing note notes noticed observe obtain obtained occur once only operation operations order ordered original orlin other overhead pages paired pairs parallel part particular partition partitioned path paths performing phantom pick plications polyb polylogarithmic possible power practical presented proaches problem proceedings proe programming proper proves question rake rakes randomization randomized rather rectangles reduce reif relationships relax remarkable remarks replace report represent representation represented required requires ress result results right rightmost room root rooted roughly rounds same science sciences search self sequence shaded showed shown shows siam similarities simpler simplex simplification simplified simplifies simplify single sinlptification sleator slow smallest solution some something spanning splay splice springer starting static strucreferences structnres structure structures subsequence subtree such support supports symmetric symposium system taljan tamassia target tarjan tatjan technical thank that them themselves then theorem there these they think this thorup three tile time titions tool topology tours towards transfornmtion translated tree trees ture twice umut unbounded unique unit university unlikely update updates used using verlag versely version vertex very vittes volume well when where whether which white will with work worst would http://doi.acm.org/10.1145/1070432.1070593 130 Testing Hierarchical Systems above actional acyclic addison after ahuja algorithm algorithms also alur apfelbaum appendix applications arbitrary arising around ascending assume automata automated autotestcon base because been bell blaha booch both bound bounded bounds calculation called canceling case cases changing charts checking children chinese circulation circulations claim coll collapsed collection combined comnmnication comnmnieating complete complex compute computed computer computes comu conclude concurrency conf conference coni connected consecutive consider constraint constraints construction constructive constructs contaimnent containment containnlent contains converting corresponding cost coupling cover coverage covers cozl criteria criterion cycle decrease decreasing define defined definition degree depth depths descending deserve design dethis developed different dinur directions direeted each eddy edge edges edmonds eliminate enforce engineering ensure ensures enter entering equal equalities erty establishes euler every exactly example exhibiting extended extension extensions fact feasible feature fewer figure finite first flat flow flows following follows formalism fractional from functional further generation give grabowski graph graubmann guide gullekson guruswami hall hand hard hardness have hence here hiera hierarchical holzmann http hypergraph hypothesis icdi ieee ifall ifcl ifmj iimjl implies imply imum increase induction inductive inequality instance integer international intl investigation ioai ipai ipdi isdn iteration iterations ixmj ixmjl jacobson johnson journal kannan khot labs language languages least less level linear lncs lorensen loth lower lxmjl lyjl machines magnanti marked matching mathematical message methods mgorithm minedges mininmm minsince mnount model modeling models module modules most multilayered must network networks nmst nodes noting number object obtain obtaining oncc only open oplp optf opti optimal optimization optt order ordering oriented orlin other others otherwise output outputs pages pair path paup peled possible postman premerlani prentice preprocessing principles problem problems proc procedure proceedings process produces proe progr program programming proof prop properties property proposition protocols puted quantities rchicm real redberg refer references referred regev removal removed repeat requirements results rigorous rooted rudolph rumbaugh satisfied satisfies satisfy scending science selic sends sequence sets several show shown shows sider since sinfilar single sink sists size smaller solution some source springer state statecharts states step stoc strictly strongly studied substitute subtree such summation supernodes suppose survey systems takes technical term test testing thai than that then theory there therefore these this those thus tight timal time tools topological tours trans transition tree tutorial types ubet ueufc under unifiecl upper used user using value variable variables verify verlag vertex vertices visual vopti ward weak wealth were wesley what when where which wiley will with work would yannakakis http://doi.acm.org/10.1145/1070432.1070599 135 Improved Recommendation Systems* agree define differ follows fraction from given goodness have hence least most other predicate preferences probability their threshold type user users using vector with http://doi.acm.org/10.1145/1070432.1070522 71 Distributed Approaches to Triangulation and Embedding accessing acmsiam albrecht algorithmic algorithms analysis applications applied approach approaches approximation architectures areas arxiv assouad based bbundations beacons behavior bhattacharjee bhatti bhirud bounded build bull bypassing california castro chan claffy close combinatorica communications compact computer computing cond conference conformation construction coordinate coordinates copies cornell costa crippen crowcroft dabek dana dans decentralized deployment descent dimensional discrete distance distances distortion distributed dynamic dynamical electronic embedding embeddings environment estimation fast finding finite fomenkov foundations fractals france francis free friends from gavoille geometric geometries geometry global graphs growth growthrestricted gupta guyton harris havel heinonen heterogeneous hierarchical hilbert hildrum host hotz htternational htternet huang huffaker ieee ieeesynzposium indyk infocom information intemet interdomain international internet invited israel janain joseph kaashoek karger kleinberg kommareddy kostic krautbgamer krauthgamer kubiatowicz labeling largescale ldmaps lectures lehman lerman lighthouses lightweight linial linite lipschitz lipschitziens lisa lnternet locating location london macroscopic maggs manuscript math measured measurements mendel method metric metrics molecmar moore morris name naor navigating nearby nearest neighbor neighbors nets network networking networks node note object objects organization overlay palm parallel pastor path peer peled peleg percacci perennes performance phys pias pittel plaxton plongements plummer positioning practical predicting print properties property protocols proximity rabinovich rajaraman random rchitectures references replicated report representations requirements resilient restricted rhea richa rodriguez root routing rowstron ruhl rumor satorras scalable scale schemes schwartz science search selected selection september servers service services sets shankar shavitt siam sigcomm simple sirer slam slivkins small some southern space spaces spreading springer stribling subsets support survey symposium symposiunz system systems talwar tapestry tech technologies telecommunications testing their theo theory thesis topological topology transactions triangulation univ universitext urgain usenix using vahdat vazquez verlag vespignani vishnumurthy vivaldi vmposium wexler wilbur wiley with wong workshop ymposium ystems zhang zhao zhou http://doi.acm.org/10.1145/1070432.1070535 82 Strictly Convex Drawings of Planar Graphs abstracts account acketa algorithm algorithms amount appl area behaves better bound bounds case chrobak comb combinatorica comes comput connected constants convex coos course digital dimension dimensions discrete disks dragan draw drawings easier edges embedding embeddings equidistant example fact felsner figure fraysseix from gebert geodesic geom gons goodrich graph graphs grid harder hardy have hubert imre included increases indicated insert integer inteligencia intermediate internat into introduction jgmos jiirgen jovisa kant known lattice lecture london lower make marek math mathematics maximal michael modified much needs norihide notes number numbers only optimize order oxford pach permissible perturbation pictures planar plane points pollack polygons polytopes posita practice proc proof proved publications realization references representations richter ricky roberto rough schnyder science siam single spaces springerverlag square stefan subgrid sympos take tamassia theory three tokushige trotter tutte umehi walter which worst would wright zunic zunid http://doi.acm.org/10.1145/1070432.1070438 4 T o w a r d s a C o m p l e t e C h a r a c t e r i z a t i o n of Tries * Gahyun Park t Wojciech Szpankowski * adaptive addison address algorithm algorithmiea algorithms analysis analytical annals applications applied approach asymmetric asymptotic asymptotics autocorrelation average based branching cambridge case class combinatorial combinatorics completing computer conference controlled csli density dependency depoissonization details devroye digital discrete distributions dumas election electronic evolution expansions external fast final flajolet full fundamental gourdon growth gusfield harmonic height ieee information introduction iyansforms jacquet janson john journal kirschenhofer knessl knuth leader lemma levels like limiting lookups lund mahmoud markovian massachusetts mathematics mellin method model nilsson note number observe omit paper papers path paths patricia pittel point prefix press probabilistic probability problems prodinger proof radix random reading references related results reznik ruler saddle science search searching sedgewick selected sequences sigmetrics some sons sorting srinivasan stanford step string strings structures study suffix sums symmetric szpankowski theorem theoretical theory thesis this trans tree trees trie tries under university using varghese variance wesley wiley with words york http://doi.acm.org/10.1145/1070432.1070566 107 An Improved Approximation Algorithm for Virtual Private Network Design Friedrich Eisenbrand* access acknowledgement alamitos algorithms amit andrews annual applications approximation architectures awerbuch azar beach better between bound brightwell broadband bulk capacity comments commodity communication communications community computer computing conference constraints cost design designing discrete discussions domination dreyfus duffield fingerhut flexible florida flow focs foundations goyal graphs greenberg gupta hose ieee improved infocom italiano joint journal kleinberg kumar least like management many math matrices merive miami mishra model multicommodity network networks nonblocking online optimization oriolo pages paper press print private problem proceedings protocols provisioning ramakrishnan rastogi references report reserving resilient resource restoration robins roughgarden science shepherd siam simpler single site society steiner suri symposium technical technologies thank theory this traffic tree turner upper useful virtual volume wagner with would yener zelikovsky zhang http://doi.acm.org/10.1145/1070432.1070454 16 Multiple-source shortest paths in planar graphs algor algorithms alstrup ambivalent appl application applications approximate arxiv boas bounded cellular compact comput connected connectivity cycle data decomposition dictionaries digraphs disc disjoint distances driscoll dynamic edge edges embeddings emde eppstein fakcharoenphol fast finding flow flows focs forest frederickson fully graph graphs grid hassin holm hzform iher information italiano jcss khuiler klein lattice less lett lichtenberg linear lipa lipton logarithmic maintaining maintenance making math maximum mehlhorn menger miller minimum naor near negative networks oracles order ordered pairs paths persistent planar plane preserving problem problems process reachability references repeats ripphausen sarnak schmidt separator separators shortest siam simple slam sleator small smallest solving space spanning strings structure structures syst system tamassia tarjan than theorem thorup time trees using vertex wagner weight weighted weihe westbrook with yung zoglvl http://doi.acm.org/10.1145/1070432.1070494 49 All Maximal Independent Sets and academic algorithm algorithms appl arboricity ariyoshi arrangements avis beck bomze bounded budinich byskov case chen chiba chromatic clique cliques clustering cocoon coloring colouring colt comb combinatorial combinatorics complexity comput computational computer computing conf convex degree discrete dynamic enumeration finding fukuda generate generating geom graph graphs handbook hulls hypergraphs independent inequality internat kluwer last learning lecture listing loth math matula maximal maximum mishra nishizeki notes number optimization ordering pardalos pelillo permutation pitt pivoting polyhedra problem proc proe publishers references reverse science search sets shirakawa siam smallest stix subgraph syrup szekeres takahashi tanaka theory time tomita tsukiyama verlag vertex wilf worst http://doi.acm.org/10.1145/1070432.1070552 96 A Spectral Heuristic for Bisecting Random Graphs algebraic algorithm algorithmic algorithms alon anal analysis appl applications applied approximability approximation arora average behavior between bipartite bisection bisections bollobds bollobhs boppana bounds carson case challenge chaudhuri chen circuit climbing colorable coloring combinatorial combinatorica combinatorics comp complete complexity comput computation computing condon crpc develop dinfitriou discr donath dongarra dyer eigenvalues eigenvectors electronic element embeddings exact expander expected feige finds finite flaxman flows focs formulas foster frieze garey geometric good graph graphs hahn handbook hard high hill hnpagliazzo hoffman hypergraphs ieze impagliazzo institute integrated ipco istics janson jerrum johnson kahale kang karp karpinski karypis kaufmann kennedy kilian kluwer krauthgamer kumar laplace layout leighton lengauer linksping llstrsm lower luczak math matrices matrix mcsherry meshes methods metropolis mfcs minimum model mohar morgan nato nmlticommodity ofek paderborn parallel part partition partitioning performance planted plmmr polylogarithmic polynomial pothen press probability problem problems proc proe prop proving random randora references relations report rucifiski sabidussi satisfiable schloegel scientific scott second semirandom sensen siam simon simplified simulations sipser slam soda solution some sonie sorkin sparse spectral spielman springer stoc stockmeyer structures survey symmetry system technique techniques teng teubner theoret thereby thesis time universit university using vazirani weizmann white wiley winners with works http://doi.acm.org/10.1145/1070432.1070443 8 On the Polynomial Time Computation of Equilibria for Certain Exchange Economies algorithm also analysis appear applied approximating arrow circumscribed colell collinear competitive complexity computation computing converging correspondences debreu demand discussion dokl economic economical economics economies econonlika ellipsoid ellipsoids endowments english equilibria equilibrium erlikh evaluation excess exchange february finding focs green gross identical informational inscribed jain journal khachiyan kibernetica kibernetika kirman koch linear mahdian market matekon matematicheskie math mathematical mathematics method methods metody mgorithm microeconomic microeconomie microsoft model models nemirovski nenakov newman nmdel norton optimum oxford paper path point polterovich polterovieh polynomial preferences press primak problems proc programruing review russian saberi seattle solution solutions solving soviet spivak stanford studies substitutability tarasov theory time translation university utilities varian whinston with york yudin http://doi.acm.org/10.1145/1070432.1070519 69 A Multiple-Choice Secretary Algorithm with Applications to Online Auctions adaptive ajtai algorithm algorithms amer analysis appl applied argument asset assoc auctions best between choice class commerce conditional conditioning conference counts discrete distributed dokl dominated dynamic dynkin each easy electronic elements estimating examine exceeding expected extensions find first freeman from full generalizations geometrically gilbert hajiaghayi have having hypothesis improved induction inequalities information instant japon karlin kennedy kleinberg kleywegt knapsack least lies limited management markov math maximum mean megiddo models modified mosteller multichoice multiple number online open optimal optimization optimum pages papastavrou parkes policy press probability problem problems proc process prophet random recalling recognizing references removing review rules saafio sakaguchi satisfies science secretary selected selling sequence shows slam stadje statist stoch stochastic stochastically stopping studies supply ternat that their thus turn type value variable variables variance waarts which whose with http://doi.acm.org/10.1145/1070432.1070476 34 Analyzing and Characterizing Small-World Graphs * ablex adva advances algorithmic algorithms analysis analyzing around aspnes balancing ball barriere benjamini berger between biskup blbh bollobas butterfly christophe chung clusters collective comm comp complexity computing constant contacts coppersmith cycle cycles delivery demers diamadi diameter disc discrete dist dodds dynamic dynamics eclecticism efficient electron emulation erdos experimental factor fault finite fixed fraigniaud freenet gamarnik gavoille gividan global goel gossip graph graphs growth ieee improve infocom inform informally information journal karp kemper kleinberg know kochen kranakis krizanc kteinberg lntr load location long longrange lookahead main malkhi manku martel matching math mathematicas message milgram model models most muhamad naor nature neighbour networks neural nguyen nips node nodes norwood other paul peer percolation performance perspective phenomena phenomenon plus podc princ probab probabilistic problem proc processing protocols psychology publicationes qyadeoffs radius random randomized range ratajczak ratio recurrence references relations renyi report resource restrict role routing scalable science search shah shrinks siam size small smallworld smmlworld social some sparse spatial stoc stretch strogatz structures study submitted subtree sviridenko symp syrup systems tech techreport theory tile today tolerant trans ucdavis using viceroy watts where wieder with world zhang http://doi.acm.org/10.1145/1070432.1070473 31 A d v e r s a r i a l D e l e t i o n in a Scale Free R a n d o m G r a p h P r o c e s s * Abraham D. Flaxman t Alan M. Frieze t academy aiello albert alex algorithmic algorithms american analyses annals annual appear approximation attachment automata based baxab baxabasi berger berlin between biometrika bollob bollobas bollobfi bollobfis borgs brief broder certain chayes christos chung class classical colloquium combinatorica combinatorics competition computer computing concentration conclusions conference connectivity cooper coupling debrecen degree degrees deletion diameter discrete distribution distributions dynamics eigenvalue eigenvalues elias emergence erdss evolution expected fabrikant faloutsos follows foundations free frieze functions general generative geometric graph graphs handbook hayes heuristically history ieee induced international internet intl jeong kleinberg koutsoupias kumar languages laws lecture leee lemma line lognormal london maghoul massive mathematicae mathematical mathematics mcdiaxmid measurements methods mihail mitzenmacher model models national nature network networks notes offs optimized order oxford papadimitriou paradigm part penrose philosophical power practice preferential press princeton probabilistic proc process programming properties publicationes raghavan rajagopalan random randomization randomness references relationships results riordan robustness royal saberi scale scalefree scaling science sciences scientist sequence series sigcomm simon sivakumar skew small society souza spectra spencer stata stochastic structure structures symposium techniques theory thus tomkins topology trade transactions tusan undirected university upfal vera vulnerability watts where wide wiener wiley willis with workshop world worlds yule http://doi.acm.org/10.1145/1070432.1070586 124 C a n t h e T P R 1 s t r u c t u r e help us to solve t h e algebraic e i g e n p r o b l e m ? accelerated algebra algebraic algorithms analysis appendix applications approach approximating arrow baltimore bard belgium bgpa bini center characteristic city companion complex computation computations computer computers computerwetenschappen computing department durand edition eigenproblem eigensystems eigenvalue electronic equation expressing factorization factors fast fiedler figure figures finding form fortune gemignani generalized golub graduate head hessenberg hnproved hopkins ikebe initialization international into inverse inverses issa italy iterated iteration iterative johns journal july katholieke kerner leuven like linear loan malek maryland mastronardi math mathematics matrices matrix murphy nearly numerical numerische optimal orthogonal parallel perturbation philadelphia pisa pmrwa polylog polynomial polynomials power press proc program realization reduction references report robust root rootfinding rosholt science secular semiseparable sequential siam similarity stable stewart submitted symbolic symmetric symp syrup technical theory transactions transforms univariate universiteit university using vaillancourt vandebril vvma wang with xooox xxxx xxxxx york zerofinding zeros http://doi.acm.org/10.1145/1070432.1070498 52 Collecting Correlated Information from a Sensor Network aaron adaptive adler angelos anica antonio appear approach approaches april arbitrarily assignments asymmetric august available awarded bajcsy balakrishnan balazinska beferull best binary bose bounds brest brmation capacity censorship channel channels cheng chou circumventing code codes coding coleman colloquium communication communications complexity compressibility compression computer computing concatenated constructions consumption consuumption conventional convolutional correlated correlation cristescu data david december decoder dense design distributed distributive duarte eduardo effros encodings energy entire faith feamster feeney fich focs france francisco frias from garcia gathering georghiades ghazizadeh ghodsi girod globecom greg harfst hari hidden hlformation holanda hotlink ieee improved infocom information infranet inspired interdependence interface international intl investigating ipsn issue ixth john journal july karger krizanc kusuma laber langerman ldpc lena leonardo letters liveris lnjbrmation lorazano lower magazine magdalena maggs many march marco markov masters medard melo micah microsensor mitran mobicom morin multi multiple multiterminal narayanan network networks neuhoff nick nilsson noiseless november october pages paper papers parallel partitioning petrovic practical pradhan problem proc proceedings processing protocol protocols questions ramchandran rate reaching reducing references region related routing saberi samuel scaglione schonberg sciences scientia security selected sensor september serial servetto side signal sirocco slepian snowbird some source sources special stankovic stoc structural student surveillance symp symposium systems tamu ternational theoo theory thesis three topics toronto trans transport turbo usenix using version vetterli watkinson wireless with wolf workshop xiong ystem zhao zhong zixiang http://doi.acm.org/10.1145/1070432.1070597 133 Near-Optimal Online Auctions adversarial advice agents alamitos algorithm algorithms allowed analysis annual application approximation archer armed auction auctions auer bandit bayes benefit best bianchi blum boosting bounds case casino cesa competitive computation computational computer computing conference contributions curve decision demand digital discrete dresher editors efficient expert fiat foundations freund from full fyeund gambling game games general generalized goldberg goods hannan hartline haussler helmbold hildrum ieee incentivecompatible information journal kalai karlin kleinberg knowing kumar learning leighton line littlestone majority manfred manuscript mechanisms multi multiarmed muth natural nick nicol nicolb nonstochastic nonuniform observations october online ooldberg pages paper parameter partial particular payoffs peter play postedprice prediction press princeton problem problems proc proceedings proe rather references regret repeated rigged risk robert rudra schapire science showed siam smoothed society symposium syrup tardos theory these this truthful tucker university value vempala volume warmuth weighted with wolfe wright yoav york yossef http://doi.acm.org/10.1145/1070432.1070579 118 Manifold Reconstruction from Point Samples algorithm algorithmicapplicationsof algorithms also amenta amentaand annu annual applications applies approach approximate approximation approximationfrom arya attali basis bern boissonnatand bound bregler briefly called cambridge captures case cases cazals changes chapmanand cheng choi combinatorial complexityof compnt compttt comput computational computed computer conf conqmt consists constant constants correctness cost cotnput could crust curve decimating decimation delaunay denser depending detection determined dimension dimensional discr discrete distance distoriongeometricembeddings does done edelsbrunner edelsbrunnerand enforce enforces eppstein error estimated even example experimentation extended extends extension exudation facello fitting fixed flat framework from functions funkeand geom geometo geometric giesen global globally good goswami graphiczd guiding hall hiding hnage homeomorphic hzternat ieee incident included includes indyk intelligently intrinsic jottrnal known kumar langtbrd large larger learning leekha length lieutier lnternat local locally london loth lower manifold manifolds martinetzand massachusetts menger metric models more mount multidimensional natural nearest nearlinear need neighbor neighborhoods neighborinterpolationof netanyahu networks neural nonlineardimensionalityreduction nonlinearmanifold numerical ocacm omohundro optimal over overall parameter piocessing pointson potentially prec preprocessing press problem proc proceedings proof radius rain ramos ratio recognition reconstruction reconstructionby references relaxed relevant remains reporting restrictive result running same sample samples sampling scaling schulten science searching section shah shape siam silva silverman similar simplealgorithmfor simpleprovablealgorithmfor simplices size skeleton slightly sliver sliverexudation slowly smaller smoooth smooth smoothcase somewhat speech step steps suffices surface surfacereconnstructionin surfaces sympos symposium system take techniques tenenbaum teng than that then theorem there these they this threshold throughout tier time topologypreservingnetworks triangulatingtopologicalspaces triangulationof undations uniform uniformity used using variant vision visual voronoifiltering wagner weighted while with without would zhao