http://www.informatik.uni-trier.de/~ley/db/conf/soda/soda2003.html
SODA 2003
http://doi.acm.org/10.1145/644108.644134	19	140	adjacent aleliunas algorithm algorithms alteration annual appear appendix application applying approach approximate approximation become bollob both bound bounds brief calculation cambridge carlo case chain chebychef chernoff clog clogn combinatorica combinatorics common complexity computer computing constant contain cooper counting cover crawling cycles debrecen definition degree delete detail dist distinct edges edition either event exists expander expected expressions feige fenner finding first fixed follows found foundations frieze from give gives graph graphs greater hamilton have hence hochbaum ieee immediately implies indicator induces inequality integration into isolated iterating janson jerrum jonasson karp keko least lemma lipton logc loglogn logn lovdsz lower luczak markov math maze method minor mixing moment monte moreover most much neighbour neighbours nloglogn note nphard observe oglogn part partition paths positive press probability problems proceedings proof properties property prove publ question rackoff random range references results rucifiski science second sequence sequences sets setting similar similarly simple sinclair sloglogn stoc straightforward strong structures studied such suppose symposium than that then there therefore third this thus tight time total traversm treatment typical unimodal universal university upper value values vard vertex vertices very visited walk walks when where wiley write
http://doi.acm.org/10.1145/644108.644198	70	537	algorithms approximability approximating approximation arora back banyans bartal charikar clustering complexity computational computer computing discrete dlvkkr eccc erez euclid euclidean european facility fernandez foundations geometric geometrical graphs greedy guha hamming hardness improved journal karpinski kenyon khuller kouiopoulos linear location median medians meets metric nearly other petrank polynomial problem problems rabani raghavan references related report scheme schemes science siam smith spaces spanners strikes symposium theory time trevisan vega when
http://doi.acm.org/10.1145/644108.644191	64	499	access after aggregation algorithm algorithmic algorithms alon analysis andrews annual appear applications approximating approximation arbitrarily arbitrary awerbuch azar baratz bartal becomes better both broadcast bulk cacm called canonical chekuri choose chosen clearly communication computer computing connect constant continues copies copy cost data density design deterministic discard discrete distance distinct distributed does during easy edge editors efficient embedding estrin extra fact factor fake follow foundations from function gets govindan guarantee guha heidemann hierarchical hold ieee impact installation intanagonwiwat internet issue khanna leader lemma light little manuscript martingale matched matching method metric metrics meyerson multiset munagala naor network networks ninth nodes obtain optimum original other outlined pages pair peleg pick placement power principles probabilistic problem problems proc proceedings process property protocols random references remaining same science section selection sensitive sensor since single sink solution source sources spaces spanners special spencer step steps symposium that then theory there these this tree trivial unnecessary violate weight which wiley wireless zero zhang
http://doi.acm.org/10.1145/644108.644142	25	192	above according accuracy again algorithm algorithms alignments alimonti allowedl alloweds allowedt alon also analytical analytically andd andso application applications applied appropriate approx approximate approximating approximation approximations area areas argument arkin around artificial assisted assumptions attention auctions available axis axisparallel bafna beginning behind being berman biology both bound bounds case cases chandra characterization characterized check checked claim claw clique clla close collect coloring combinatorial complexity computational computer computing concave conditions consequently consider considerations considering constraint coordinates corner corners corresponds course cover creasing cubic current deal decreases decreasing degree depending derandomized derivative derivatives determination different discr discrete discussed discussion distance divide does done each easily easy endpoints enough equal equivalent estimate every exact expressions fails feige file finally find finding first fixed focs focus follow following follows formula formulas four free from function functions general give gives graph graphs greedy halld handl hard hardness hassin have having here heuristics hhstad hochbaum holds horizontal however http hurkens icient ideas implies improvement inbothcasesd increase increases increasing independent inequality instance intelligence international interval into issue january journal kann land large largest last lecture left lemma lemmas lncs local lower make manuscript margin math mathematics maximum mazqmum means might minty molecular monotonicity nakamura narayana negative nonoverlapping nordic note notes notice number observation observe obtain obtained obvious obviously ones only optimal optimization otherwise outputs over packing paragraph parameters partial partitioning please point points positive possible prelim present presented prespecified prevails previous problems products program proof proofs properties prove proven proves proving range ranges ratio ravi reaching reason recall rectangles recurse references remainder required revision right round rsson safe same sandholm satisfaction schrijver science search second section sections separately sets show shown siam similarly simple simplified simultaneously since size small smallest soda some special springer square squares stable starts subareas subsequently subsquares succeed success such suffices sufficient suppose survey systems takes tamura term terms test text that then theorem theoretical there therefore these they third this those through thus tight together transfer treat treating true turns under unsuccessful until upper used using value values version vertex vertical very vohra vries wads want weight weighted when whend where which whole width wigderson will winner with within workshop worst written zero zuckerman
http://doi.acm.org/10.1145/644108.644252	113	853	addition advantage algorithm algorithms almost alphabctandcpcndent alphabet amir amount analysis annual apostolico appear application approach artd august benson berman bird calil citeseerr coding combinatorial common communication comp comparisons complexity compressed compression compresssed computation computer computing conclusion conference constantspace data dimensional editor efficiency efficient extra farach farada fast february files finger first fully galil gasieniec georgia have highly html http ieee image images independent individual information inplace institute journal june karpinski knuth landau larmore lempel lempelziv lncs lossless matching memon morris nato neuhoff number obtainable october optimal pagcs pages paper park pattern periodicity personal plandowski pratt presented print proc proportional ptth randomized rate references report runlength rytter sampling scanning science sciences search sequences sequential series shende siam size sleeping smallcr snow sokol some space springer string strings strongly symposium system technical techniques technology texts theoretical theory this thorup time trans twodimensional tytter used utah variable volume with witness words
http://doi.acm.org/10.1145/644108.644170	48	384	absence accessing acta addison additional addressable afips algorithm algorithms allows alphabet also alternative amos analysis annals annual anthony antony applications applied approach approximates architectures area aspnes august aumann aware balakrishna balanced based begun bender benefits bergen berkeley bertinoro bhattachaxjee binary bobby boon briandals bujor burlington butterflies butterfly california cambridge canada candidate castro cdhr censorship charlie chilean chord chosen class clustering communications company complex computer computing conclusion concurrent conditioned conference consider consolation constructing content control copies copy cost dahlia data datar david define defined design desirable devroye diamadi dictionary dimensional direction directions directory discrete disruptions distance distributed donald done down draws druschel dynamic editors edward emulation environment european every examine example expected exploit exploiting fault faults faulttolerant fiat field file finally finding first fixed formance formerly fortunately foundations fourteenth fourth francis francisco frans fredkin freenet from future gabarr gauri geographical germany gilbert given gives gnutella good graph graphs growth handley happen hari harren have heidelberg hellerstein hildrum hits hkrz hope http huebsch ifip implemensituation imposed informatica information infrastructure inserting interesting international internet interval into iptps issue italy itcom james january jared john joint joseph july june karger karlsson karp keleher keys kirschenhofer kirsten knuth kubiatowicz lads large largescale lecture length less limit lists locality location logarithmic longer lookup loth make malkhi manitoba many march mark mart martinez martlnez massachusetts matthew matthias mayur mechanism mechanisms membership memory messeguer metrics michael middlewarc miguel moni monterey montreal montvale morris multi munro naor napster near nearby nearest neighbors network networks ninth node nodes norway notes november number object objects october often only open optimized order ordering other overlay pages papadakis parallel participates particular passes pastry path patricio paul peer peerto perfor performance perhaps pete peter platforms plaxton poblete practice press principles probabilistic probability problems proceedings prodinger programming properties proximity publication publishing pugg pugh queries query rajaram random randomly range ransearch ratajczak ratnasamy reading reduction references regarding relative reliability remain rene repair repaired replicated report resistant resource resources restricted richa richard rise robert rome routing rowstron ruhl ryan saia satish scalabale scalable scale scandinavian science scott search searches searching september service seventh several shah shenker shoek siam sigcomm silaghi similar simplicity skip small society some soon sorting sourceforge sources spaa spie springer stoica storage stores straw structure structures study submitted such support swat sylvia symposium systems tapestry target tation technical terradir test than that thau their them then theorem theoretical theory these things thirteenth thirty this through time tolerance tolerant trees trie twenty ultimate unified university update used usefulness using usprobability variable vectors version viceroy volume wego wesley western where which while whose wide will william winnipeg with workshop would yonatan zhao
http://doi.acm.org/10.1145/644108.644231	96	747	accordance adler alavi algorithms allow amotz anderson angles appl applications asymmetric automata automation balanced based behave benkoski berlin between bound boundary bounds buffer cambridge case christchurch chrobak chwa coll combinatorial combinatorica come competitive comput computation computational computer conflicts consequences course crete csirik curved david december degrades delay difference discrete eades edition edward ellipsoid environments eppstein escape euclidean evasion exact facets fairness fekete find francisco free freund gale game geom geometry graph graphs greedy guibas have hinrichsen hisashi icalp ieee improve imreh indor interesting international intruder isaac janardan john joseph july koga kyung landa languages latombe lavalle lect lecture leeuwen lick like line lion literature littlewood logistics london loss lower main malaga math mathematician method methuen minimization minneapolis miscellany mobile monticino more motwani multiprocessor naor naval noga norm norms notes optimization orejas packet park parsons plane policies polygonal polyhedral polytope press problem proc programming proof published pursuit queuing randomized references region rendezvous research respect revised robotics sang scheduling schrijver science search searcher searching section seen seffi sgall shimon siam simple sivadasan small soda sohler solution somehow sophisticated spirakis springer springerverlag steven striking style survey suzuki switching symposium syrup takaoka tendency that them theorem theoret theory thief this those toward tschel university using verlag visibility visibilitybased vscking weisinger well widmayer with woeginger would yamashita yong zealand
http://doi.acm.org/10.1145/644108.644150	32	253	after agement ajtai alphabet already also annual answer approximate arrival asking been both bound bringing bruce build chance clearly completeness comput computation computing concreteness conference constant counting data datasets define does each efficient element elements entire error errors estimate event fairly falls find fist fixed following from getting given greenwald gurmeet have hence here however international inversions items jayram just keep khanna kumar large largely limited lindsay line logz made main maintains make management manall manku maximum medians memory michael mikl munro note online only order other over pages pass paterson picked picks piers point position power probability proceedings process prove quantile quantiles queried queries query rajagopalan random ravi read reading references requirements rest result retained return returned returns routine sampler samplers sampling sanjeev section seen selection sense shall should sigmaintains sigmod singh sivakumar smallest some sorted sorting space sridhar statistics storage store stream such suite summaries symposium taking techniques that then theoret theory there these this till total union updates upon used value values ways when where which will with would
http://doi.acm.org/10.1145/644108.644189	63	489	abadi abelian alexander alexei alfred algorithmic algorithmica algorithms almost amnon annual appear appliations application applications applied architectures archive artur bach based beals beaudrap bennett berkeley bernstein bits black blum boneh brassard cambridge chao character charles circuit circuits classical cleve communication complexity computa computation computational computations computer computing conference convolution correction coset cryptanalysis cryptographically cryptography cryptology damg daniel discrete edition efficient eigenvalue ekert emanuel encyclopedia equation eric error estimating estimation ethan ettinger evaluation extensions factorization fast feigenbaum fields finding finite foundations fourier fourth friedl from functions gadiel gauss generate gglbor gilles gorithmica grigni group groups hales hallgren handbook harald hcyer hidden hiding hoyer icient ideal ieee improved information instances international ivan ivanyos jacobi jeffrey joan john journal katalin kitaev knill lawrence lecture legendre leonard lidl linear lipton lisa logarithms magniez manuel mark martin mathematical mathematics matrices measurements mechanical menezes micali michaelangelo michele miklos monica mosca myoung nasa niederreiter niel ninth nonabelian noncommutative normal notes number oorsehot oracle order orthogonal over pages parallel paul pell peter polynomial power pranab press prime principal problem problems proceedings properties protocol pseudo quadratic quant quantph quantum query random randomness reconstruction references representations residues richard robert rudolf russell russian santha schulman science scott sean second secure separations sequences seroussi shallit sharp shift shifted shot siam silvio simon solvable solving some springer stabilizer states strengths strong subgroup subgroups sums surveys symmetric symposium tashma testers their theory thesis third thirteenth thirty time tion tolimieri trans transform transforms twenty umesh using vanstone vazirani verlag version volume watrous weaknesses weighing wire
http://doi.acm.org/10.1145/644108.644115	4	37	adaptive aided algorithms analysis annual approximations areas august automation aware benini bogliolo circuit codesign communications competitive computation computer conference cosense demers design devices discrete dorit dynamic dynamically effects efficient electronics embedded empirical energy europe evaluation fidelity first fixed foundations from gupta hard hardware hidra hochbaum holding hong http ieee integration international irani ishihara journal june karlin keshav large latency level lowpower lund management manasse mcgeoch micheli model multiple networks online over owicki pages parc phillips policies potkonjak power priority problems proceedings processors projects publication publishing quan raghunathan ramanathan randomized real reduced references reingold rockwellscientific saran saving scale scheduling science selected shenker shukla siam simunic slides software spanos srivastava stanford states strategies submitted survey symposium synthesis system systems task techniques test thesis time transactions uniform university utilization variable very virtual vlsi voltage wireless with workshop yasuura
http://doi.acm.org/10.1145/644108.644154	35	266	ahlswede algebraic algorithm algorithms allgemeinen appear approach approximation august available bang bern beyond bounds budapest carr circuits coding computational computing conforti congressus connected connectivity cutting decomposing decomposition design disc discrete disjoint dual edge edmonds egrevdry electronic facility factor factors finite fitting flow frank fund graph graphs greedy group grstschel hannover hassin homepage hougardy hungary hypergraph hypergraphs ieee increasing independent information into issn jackson jain jensen kirby koetter kriesell kurventheorie lengths letters local location lond loth mahdian manuscript markakis martin math mathematical matroid maximum mddard menger meta minimum mixed nash network networking number numerantium online packing pages partition paths petingi planar plane plassmann preserving problem problems proc processing programming prsmel published quarterly randomized ravi reconstructing references report research respect results revealing rodriguez rounding rounting routing saberi sect sets siam simple soda spanning standards steiner stoc symposium syrup technical theory transactions tree trees tutte university unpublished vazirani vempala vlsi wagner weismantel williams with yeung
http://doi.acm.org/10.1145/644108.644128	14	109	according actual additional adjacent advances agaxwal algorithmic algorithmica algorithms allocation allocations along already also always amsterdam analogously appendix appl applications apply approach artificielle assume assure balanced basch beach been before begin berlin between black block both boundary bounds brooklyn brumberg building canadian case cases castro chain chains chazelle circles clearly closest collision column combin combination combinatorial combinatorics combine combining communication comp complexes comput computational computing conf connecting consideration consistently corner corresponds define defined deformable denote depict depicted descendants described details detection difficult directions discrete dissect dissects distinguish does drawn during dynamic each edelsbrunner edges either elsevier empty equivalently estivill every exactly experimental facing fall figure filled first fisk floodlight floodlights follow following follows formulate found francisco free from further furthermore galleries gallery generalization geodesic geom geometry given goodman goodrich grey gringi guarantees guard guarded guards guibas handbook handled hanover have hershberger holds hollow ieee iift ikti illuminating illumination implies imply includes indeed inform inside instead intelligence intern intersection into invariant invoke invoking inward irti itself jointly journal kinetic kingston kirkpatrick largest least left lemma lett lights lncs located long maintain maintained maintaining middle mitchell monitor monitored monitors monotone most motion mounrains mountain mountains necessarily necessary neither news next noncolliding notation note observe obtain once only open opposite optimal order orientations oriented orthogonal other otherwise outward outwardfacing outwardlacing outwards pairs part particular partition partitions parts paths personal philadelphia place placed places planar plane planning pocchiola point pollack polygon polygonal polygons possible press problem problems proc process processed processing proof properties proposition providence pseudo ramaswami range ready recall redondo references reflex relegate remains remove replace resp respect respectively rest results revue right robot robotics rourke rules sack saskatoon scheme second section sees segment segments sharir shooting short shortest show sigact similarly simple simply since slightly snoeyink souvaine space specifically specified speckmann springer streinu subchain subdivision subset subsumed such sufficient suppose sweeping syrup tamassia technically that then theorem theory there therefore they this those three tilings tonssaint topologically treat triangle triangles triangulations ubuubg ubvuba upper urrutia used uses using vabv vary vbug vegter vertex vertices visibility visible vision visited watchman weaker well were which while whose will with workshop yields zhang
http://doi.acm.org/10.1145/644108.644121	9	86	achieved anarchy appear aspects best between braess capacitated case class computer congestion dent engineers equitraffic flow flows functions hring indepentheorem institution jahn journal latency length librium linear manuscript most murchland netcivil network networks operations optimal optimum paradox particular price proceedings ratio references research restrictions road roughgarden routing schulz sciences selfish some springer standard system tardos theoretical topology traffic transportation uncapacitated user volume wardrop with work worst
http://doi.acm.org/10.1145/644108.644240	103	801	algorithms alper among approximate ashish assume away before between bounded case cases closed clustering computational computing conclude consider contain contains core dimensional dimensions discrete distance does doiu enclosing every exists farthest from geometry goel half have high hyperplane hyperspheres ilci implies induction indyk joseph kasturi kumax lemma less llci manuscript maximized mihai mitcheu most move note orthogonal otherwise peled pick piotr piyush point problems proceedings projective proof proximity reductions references sariel saxiel sets siam since smallest space step such symposium than that then theory there this thus using varadaxajan vaxadaxajan viiici when ylldmm
http://doi.acm.org/10.1145/644108.644253	114	863	acids adachi adiabatic algorithm algorithmic algorithmica algorithms american among analysis appear application applications approaches approximate approximation assembly badger ball barbara based benedetto bennett berry best between bioinformatics bioinforrustics biol biology block boore bork brown bryant bull cabbage caglioti california carefully chain challenge chen combinatorial commented common communication comparative comparison complexities complexity compression comput computation computational computer conf conflict construction content cormode correction counting curr december declaration definition delahaye detection dissimilarity distance distances document dokl draft early edges edition emerging energy entropies estimating eutherian evol evolution evolutionary exact exchange faster fitch fitz forms free from gdcs gene general genet genetic genome genomebased genomes genomics german germany gibbon given grumbach hammer hannenhalli hasegawa homology house html http human huynen ibid ieee independent individual inequalities inference info inform information inst institute integrity international interpretation into introduction inversion issue janke januari jiang john joining kearney kececioglu koel kolmogorov koonin kwong language lecture length lett letters likelihood linking little living logical london loreto macroorganisms makes manage maps margoliash math maximum measure mechanisms method metrics minimum mitochondrial models molecular molphy monogr more movements muchnik murata muthukrishnan nadeau nations nature nearest neighbor neighbors normalized nucleic okada open operations opin order orders overview paradigm paterson patternhunter pevzner phylogenetic phylogenetics phylogeny phys plenary pnylab practical problems proc process programs proteins quantitative read recomb reconstructing recovering references report research resolution resolving reversibility review revision rights rivals romashchenko royal sahinalp saitou sankoff santa science scientific search segments sensitive sequence sequences series shannon shared shen snel society soda software soviet space special springerverlag stat statistical statistics stoc strings summary supported symmetry symp tahi takenaka theory three time tongue tool trading transactions transformation transforming translate transmission tree trees trends tromp true turnip ucsb united universal university varre verashchagin vereshchagin version vishkin vitdnyi vyugin waddell wang wareham warnow westerman whole with wooley yianilos york zhang zipping zurek
http://doi.acm.org/10.1145/644108.644165	44	347	above after algo algorithmic algorithms almost alon also analysis annual appeared applications apply approach approximation arbitrary aspects assistantship assmnption associate assume basic beck before between bolyai both bound built call called chromatic colloq coloring combinatorics combining complicated component components computer computing condition connected connecting consider constant containing contains contribution contributions copies core corresponding czumaj define defined definition denote department details determine directed directions discrete discussions disjoint domain during each earlier easily edge edges either ejen elementary equation equations event events every expander expected experiment extensions exteusions fact fellowship finite first fixed focus following follows formed foundations frieze from further furthermore general gets given gives going graph hajnal have having heads helper helpful holds hypergraphs iazl ibin ieee ieji ilnp independently inequality infinite integer introducing ipsi isqi ithm kifil klfll know last least leighton lemma length less letting lfjl like local lodha lovdsz lovisz main many math mike mmual molloy more must necessarily negative note number oicient only open order other otherwise papers parallel partitioning path performing positive possibilities possible preliminary prize prlz probability problem problems proc proof proper property prove proved purpose qieqi questions random recall reduced reed reference references related required requirements research results routing satisfiability scheduling scheideler science section separate sequence sequences sets setting siam since sions small solution solutions some splitting srinivasan step stirling structures stun sufficiently suggestions supported suppose symp syrup tags technical than thank that then theorem theory there therefore these this those thus toronto tree trees true unique uniquely university uniyorm upper used useful using variable variables vdevc version vertex vertices very vievc virtually where which whose with work would yields zttl
http://doi.acm.org/10.1145/644108.644110	0	Optimal Parallel Selection	access affine ajtai algorithm algorithms annual applications applied approximate approximation architectures attention august azar beats blum bound bounds bringing bucket chaudhuri chong cole coloring combinatorica combinatorics comparison complexity comput computation computer computing concentrators conf conference construction constructions cook data dependent deterministic dietz discrete dwork edge efficient eigenvalue english erew exact expanders explicit fast ffirer floyd foundations from hagerup heap igarashi improve inform information informatsii integer international jimbo journal koml lain lecture letters like linked list lower machines magulis maruoka matching mathematical mathematics multiselection notes obtained optimal optimally optimization original parallel parallelism partition peredachi pippenger pram pratt prefix probabilistic problem problems problemy proc proceedings processing proof raghavachari raman ramnath random rank ranks recursive references regular reischuk richard rivest sciecne science sciences searching selecting selection shen siam significantly simplifies simuttanous small snir sorting spaa springerverlag steiger symposium system szemer tarjan thank that theory time transformations translation transmission upper valiant wagner wigderson with without would write zukerman
http://doi.acm.org/10.1145/644108.644241	104	803	acknowledge acta aeta afra algorithm algorithms animation annu annual anthony applications approx approximate approximation arbitrary aurora authors autom based betke bodies boundaries bounding bounds bourgaln broadway brown cambridge cameron canny centrally classes clip cohen cole collide collision comments comput computation computed computer conf configurations constrained constructed convex december dept detection differentiable dimensional discrete discussions distance dobkin dops dudley dynamically edelsbrunner editor efficient efficiently entropy environments erickson estimating exact fast forum four from generates generators geometry given gottschalk graduate graph graphics grimsdale guibas have heidelberg held helpful hierarchical hierarchies hubbard huber ieee including incremental interactive interference interior internat intersect intersection iserles journal july june kirkpatrick klosowski large lectures leeuwen leonidas lindenstrauss location london loth maintaining manocha math mathematics mcmullen merl method methods metric milman mirtich mitchell monotone number numeriea obbtree objects open optimal optimization other overmars pages palmer philip plane point polyhedral polyhedron polynomial polytopes ponamgi press proc proe projections proposed questions rapid referees references report robot robust salowe scale science selection sensitive separation september sets siam siggraph sizes slope society solving some sowizzal space sparse sphere springer steiger stolfi structure sturmfels subdivision such symmetric sympos symposium system systems szemer technical terms testing texts theoret theory this time trans trees university useful using verlag visualization volume volumes well wish with work wright york zhang ziegler zikan zomorodian zonoids zonotopal zonotope zonotopes
http://doi.acm.org/10.1145/644108.644214	83	646	ageev algorithm algorithms analysis annual appear applications approximate approximation approximations approxlmation asymmetric atsp authors automata barvinok belmont beloruss berlin best between blum book bound bounded breslaner calif case chichester circuit close colloquium colourings combinatorial common comparison comput computation computer computing considered constraints constructing could covers crete cycle cycles december discrete discussions distances distributed does edge edgeconnected edited editors eliminate elimination engebretsen error estimate even example explicit fearon fernando finding fiorini fisher foundations fractional germany gimadi goemans graph graphs greece greedy guarantee guided gutin hamiltonian hand hardness hassin helpful holt however inequalities informatik instance institute international interscience iser jiang john journal karpinski know known kosaraju kotov koval kser languages lawler lbeck lecture leeuwen lenstra lett like linear lncs london long lower many markus math mathematics mathematik matroids maximum maxinmm mekh metrics most negative nemhauser networks nlan notes obvious open oper optimal optimization orejas ormation other page papadimitriou paper park paul periodic pitman point positive problem proc procedure proceedings process programming promising property publication publishers punnan question rather references relaxation research result rinehart rinnooy rotations rounding russian sale salesman science section serdyukov series shmoys short shortest showing siam siebert siim solution sons spirakls springer springerverlag stacs stein strings strongly subject subtour superstring superstrings sweedyk symposium tarhio thank that theoretical these they this tour tours traveling travelling trier tromp turner ukkonen unfortunately univ unlverstitt valid value vestnik vishwanathml weak weaker weight wiley wilson winston with without wolsey worst would yannakakis yorkmontreal
http://doi.acm.org/10.1145/644108.644243	106	823	above adjacent after algorithm algorithms aligned along also angle annual appendix applications approximation april assume axisall base been between boomerang bound bounded call circular clearly clone collision complexity computational connecting consecutive consider contained containing convex corresponding corresponds cost counting current cuts cuttable cutting demaine detection discrete done dumitrescu during each edge edges eight ends erickson figure following form from generality generates geometry glass gons guibas have hierarchies implies incidentally include included initially interior intersections kaplan least length lines logn loss manuscript middle midpoints minimum most next none note numbered objects only overmars pach pairs paper perform performing perimeter piece point polygon polygons proceedings proceeds process produced proof properties rectangle references remains remark removed round rounds satisfy sensitive separation sequence siam similar since stage stages stolfi submitted such supporting symposium takes tardos tenth terminates that themselves theory these third this those tile time tone total triangle triangles ttle updated upper used vertex vertices welzl when which while without zero zhang
http://doi.acm.org/10.1145/644108.644215	84	655	aktt algorithms annual appear approximation archer arora asano blum building capacitated chalasani chapter charikar chekuri christofides combinatorial complete computer computing conference coppersmith covering discrete edge eleventh elsevier epsilon failure faster first focs foundations fourteenth garg general goemans gonzales gupta haimovich improved integer ipco john journal karakostas katoh khuller kleinberg kumar latency methods minimum naor networks ninth optimization pages plane points polynomial problem problems proceedings programming pulleyblank raghavachari raghavan ratio references resilient rinnooy routing sahni salesman scheme schemes science seventh siam soda sons spanning stoc stougie studies sudan symposium tamaki theory thirty time tokuyama tours towards traveling tree twenthsizth twenty vehicle version vertices wiley williamson
http://doi.acm.org/10.1145/644108.644178	54	434	abfc agarwala algorithmic algorithms analysis annual application applications approximability aspects bafna between bourgain carolinae colton comment computational computer computing coordinate department dimaes discrete dissertation distance distances distinguish doctoral easily efficient embedding embeddings euclidean evolution farach faxach finite fitting foundations function geometric geometry goodness hastad hilbert html http hybrid hypothesis ieee indyk institute into inverting isreal ivansson journal kannan kruskal lagergren lecture lectures lind line lipschitz lowdimensional lowdistortion mapping math mathematics matou mdsdescription merical method metric metrics multidhnensional multidimensional narayanan nonmetric notes numerical observation optimizing pages paterson points proceedings proximities psychometrika psyehometrika radiation real references royal rutgers scaling science shepard space spaces special springer symposion symposium taxonomy technology theory this thorup tree univ unknown using verlag with years
http://doi.acm.org/10.1145/644108.644123	11	97	additional algorithm algorithms allocation approx approximation assume average bellare best better break chromatic coffman color coloring completion computation computing consider constraints data dedicated delay denote disks distributed edge edges eeei efficient enough file finish finished finishes garey gives goldberg golubchik graph hall halldorsson hartline have hochbaum http incident induction information into johnson karlin khanna khuller kortsaxz lapaugh lemma line math mathematics migration minimiz minimize modifying most multigraphs need needs nhiv nishizeki objective offline only operations ordered parallel partially parts pigi pina placement polyhedron possible programming proof prove queyranne recoloring references research resource saia scheduling schulz sets shachani shachnai shmoys should show siam simple since slightly soda structure sums tamir tasks technique than that then theorem theory thurimella time times transfers vertices wece wein wilkes within ykim
http://doi.acm.org/10.1145/644108.644230	95	737	annual approach approximating assoc associative case choose cohen community company comput conditioned conference cover covering covers diagnosis discrete fasttrack feige fiat file fractional generalization gnutella greedy harnessing here heuristic hornets http information integral international kaplan kazaa largest latent leave lovgtsz mach manuscript math mathematics morpheus musiccity mutual natural network networks open oper optimal overlays peer previous problem proceedings query ratio references replication results search semantics sharing shenker sigcomm source strategies supercomputing system technology that this threshold trial trials unstructured wego with
http://doi.acm.org/10.1145/644108.644228	94	735	aardal algorithm algorithms also analysis analyze analyzed appear approach approx approximation approximations arrive arya back case charikar chudak combinatorial comp constant constraint dual dualfitting extending facility factor fault fitting focs garg gave gives greedy guarantees guha hence heuristics ieee improve improved ipco jacm jain jcss khandekar khuller lagrangian local location mahdian markakis median metric meyerson minimum munagala other packing pandit primal problem problems proc references relaxation requirement requirements results saberi same schema search shmoys siam soda stoc strikes submitted sviridenko tardos this tolerant uncapacitated uniform using vazirani violation vitter with zhang
http://doi.acm.org/10.1145/644108.644155	36	275	algorithm algorithmic algorithms american annual applications approaches approximating approximation arbitrary bandwidth bartal bollob bornstein cambridge ccgg charikar charikax chekuri cheung combinatorial computer computing cover covering deterministic directed discrete dunagan embedding embeddings euclidean even feige flow foundations garg goel group guha ieee inform informatics khuller konjevod kortsarz latin left manuscript median mendel metric metrical metrics minimization motwani multi october optimization packing pages path planar polylogarithmic preliminary press probabilistic problem problems proceedings process raghavan ramsey randomization randomized ravi references related rounding salman science siam spaces springer srinivasan steiner symposium systems task theorem theoretical theory these threshold tree trees type university vempala version york zosin
http://doi.acm.org/10.1145/644108.644153	34	257	abstract algorithm algorithms annual approximating approximation arbitrary bartal calinescu ceedings charikar chekuri cknz class classification combinatorial combinatorics complexity computing conference constant cunningham cuts dahlhaus dallas discrete embedding estimation european extended extension extensions factor formulation fourth from geometric graph gupta improved integer ipco johnson journal karger karloff karzanov khanna klein labeling linear metric metrics minimum multiterminal multiway naor optimal optimization pages papadimitriou problem proceedings programming rabani references rounding second seymour siam similarity soda stein stoc symposium tang tardos techniques terminal texas theory thirtieth thirty thorup tree twelfth twenty yannakakis young zosin
http://doi.acm.org/10.1145/644108.644194	67	517	administration akademii algorithm algorithms amsterdam annual approximation associated berlin bonn boulala bounded business certain characterizations chvfital combinatorial combinatorica completeness computer computers computing conference consequences covering coveting discrete doklady editor edmonds electronic ellipsoid fast fleischer fonlupt foundations fractional freemann fujishige functions garey generalization gerards graduate graphe graphs greedy guide heuristic holland ieee indtpendants integer international intersection intractability iwata johnson journal karp khachiyan linear matching math mathematics matrices matroid method minimizing mixed nauk ninth north ofnp oper operations optimization packing padberg pages papadimitriou parallel paralltle perfect perfectness plotkin polynomial polytope polytopes preserve press problem problems proceedings program programming property randomized references report research rounding russian school schrijver science sequential series shepherd shmoys siam solving spille springer sssr stfie strongly stschel subgraphs submodular symposium tardos technical theory time transformations uhry university vazirani verlag volume weismantel which with without workshop york young
http://doi.acm.org/10.1145/644108.644232	97	754	able above additive after algebraic also anything approach arbitrary argument around assumed ball basic below binary block bound bounds cannot case centered choice close code codes codewords combinatorial comes computation concatenate concatenated concatenation consideration consisting constant construction contain contains contribution correspond corresponding could crucial decodability decoding desired desires dimension disappears distance divides does earlier elements encodes encoding enough essentially euler evaluation evaluations every example exist existed exists expect fact family field finding finite first fixed focs following fraction from further goldreich good guaranteed guruswami hamming have help here highly holds however idea ieee independent inear infinite infinitely inform inner integer integers into invertible johnson just know land large larger learning least lemma length lfold limits linear linearly list made main maps message messages more multiplicative must need noisy normalized note number only ordering other outer outline over overall parameters paul perfect pick picked plus point polynomial polynomials positions power powers prime primes primitive proc proof properties property queries radius random realizing reed references relation relative representation resulting root roughly rubinfeld shows since size slack small solomon some specific stad starting stoc string subgroup subset such sudan suitable super tailor technical thank that then theorem theory there these this those thus tools trans under unity upper used using vbin vectors viewed were where which whose will with words zimmermann zuckerlet
http://doi.acm.org/10.1145/644108.644213	82	638	academic ahuja alexei algorithms analysis anders applications approx approximability approximating approximation approximations aspects asymmetric atsp bluer bodo bound bsckenhauer carr case center chandran christofides combinatorial combinatorics complexity comput computing cornput cover covers cycle cycles david directions discrete distances editor editors elvsevier european experimental feige flows frieze galbiati graham gregory grstschel gutin hall handbook held heuristic heuristics hromkovi improved inequality james johnson karp klasing kluwer lawler lecture lenstra lewenstein lower lowisz lyle maffioli magnanti manthey markus math maxim maximum mcgeoch metric michael minimum moshe network networks nicos notes operations optimization orlin page pages papadimitriou parametrized performance prentice prenticehall press problem problems proc punnen ravindra recent references report research results richard rinnooy robert salesman santosh seibert shankar sharpened shmoys short siebert soda some spanning springer stacs steiglitz sunil sviridenko symp syrup syst technical theoret theory thomas threshold towards traub traveling travelling trees triangle unger variations vazirani vempala vijay volume watson weixiong wiley williamson with without workshop worst yannakakis zhang zverovitch
http://doi.acm.org/10.1145/644108.644187	61	472	academic acknowledgements additionally advances against algorithm algorithms also anonymous asiacrypt asymmetric attack attacks august avenues average berlin best better between blakely bollob boneh bound bounds boyd breaking cambridge camenisch choose choosing chor class coalition code codes coding colin collusion collusional collusions column columns combinatories comments communication computer conclusions conference conjecture constructing construction constructions content coordinates crypt crypto cryptology csisz daad data decoding defined degree desmedt devise digital directly discrete dissertation documents does editor efficient eric error eurocrypt example extend extremely factor feedback fiat finally fingerprinting fingerprints first focus following forgiving francis francisco from fumy gaps general given grant group guruswami have helped helpful however hugh hypercube ieee important improve improved information international introducing issue kilian known ksrner larger lehman leighton length lesley like lindkvist linksping list lncs logc long lower madhu matheson meadows memoryless messages more multiplicities multiplicity naor next note okamoto only open other paradigm pfitzmann pointing possible practical presentation press problem problems proceedings proven provided purdy question randomly rates references remains repeat resistance resolves resolving resulting results rivest robert secretly secure security september shamoon shaw should signatures silverberg smith some springer springerverlag staddon starting still subgraph sudan support supported symposium systems take talai tarjan than thank that their then theorem theorems theory these this thomson tightened times tina total tracing traitor traitors transactions types university unknown upper used useful users using values varying venkat verlag very waidner waiter walker when whether wide williams with work would yacobi york zane
http://doi.acm.org/10.1145/644108.644233	98	756	above adelman adleman agarwal akademia algebraic algor algorithm algorithms american analysis applications arithmetic arora babai basic biswas blum bounds brown budach cambridge case characterization chari check checking chen chinese coej coming common complexity composite comput computational computer computing conference consider constant corollary correctly cryptography demillo derandomization designing determinants deterministic deuringheilbronn dimacs direct directions dirichlet discrete distinguishing distributed divide divisors easy editor efficient element establish exponential fact factor fast field find following follows form fortnow foundations free from fundamentals heart heath helps hence here icient identically identities identity ieee implies inequality infinitely information interactive interesting inversion irrational isolation journal just karloff khanna klivans last least lemma letters lewin lfunctions linnik lipton lond lovasz lower lund matching matchings math mathematical mathematics matrix means methods michell monomial motwani mulmuley multiple multiples multivariate need nisan note number numbers observation order other over perfect phenomenon polynomial polynomials pomerance powers press primality prime primes probabilistic problems proc processing program programs progression proof proofs protocols pspace raghavan random randomness randomnessoptimal records reducing references regions related remaindering remark result ribenboim rohatgi rumely sbornik schwartz science seems series shamir siam small society some spielman springer srinivasan such sudan symposium systems szegedy testing that their theorem theoretic theoretical theory there these thesis this tighten time towards twoprover unique university vadhan value vazirani verification verlag very where which will with work works zero zippel
http://doi.acm.org/10.1145/644108.644179	55	444	accurate additive algorithm algorithmica algorithms almost annual applications applied balanced based beyer biology brodal build bulletin colourations complexity comput computational computer computing conference constructing constructions converging covering csiir data determining disk distance efficient erdss estimation evolution evolutionary experiments fagerberg farach fast finding from generates greedy harmonic hein huson icalp intelligent international inverting irss journal kaaman kannan king labs lawler leaf letters lingas logs markov mathematic mathematical method mode model molecular nettles nodes optimal osglin ostlin pages parach pedersen phylogenetic proceedings provably random randomized reconstruct reconstruction recovering recovery references report robust science siam singh smith soda splitting stacs steel stoc structures suffice systems technical theoretical thousands through tree trees triplets tutorial under using warnow waterman with zhmag zhou
http://doi.acm.org/10.1145/644108.644203	74	565	access accesses accessing accurately acharya acknowledgements adaptive aggarwal alan alenex algorithm algorithmica algorithmics algorithms alok alpern also amitabh analaysis analysis anlaysis annual anthony anurag appear architectural ashok asplos association associative associativity assuming atom august austin author automata averages based because been bender block blocks bowen building cache cacheconscious cached caches calder cambridge carter chandra charles chatterjee chilimbi clearly cliffs code coffman collection colton common computation computer computers computing conclusions confercnce conference congress conscious constant cormen customized data dealing decision demaine denning department described design designed direct discourage discrete discussions effective efficient eighth eleventh engineering englewood environments ephraim erik especially eustace evaluating example expand experimental experiments explain external factor factors farach fast feel feig first focused found foundations frigo full fully garbage generational goal good guided hall hansen harald have heaps helpful here hierarchical hierarchy hill hollander however huican ieee ifip ignored impact implement implementation improving indexing influence initiating international introduction investigation itai james jeffery jersey john jose journal karl kenneth king klots kubricht ladner lamarca language languages larry larus layout leiserson level like limited little machinery madison main making mapped mapping marc mark martin massachusetts massive mathematical matteo maximizes memories memory michael might model models more multilevel multiple notices numerous oblivious only operating operations optimal pages paging parallel partitioning performance permutation peter pettis placement pointer positioning practice precise predicting prentice press priority proceedings profile program programming prokop queues ramachandran random rather realistic reasonable references research results richard rivest robert ronald ross sandeep sanders science search selker sequences setassociative shen show shown shriver siddhartha sigmod sigplan simulated smith snir sorting sridhar srivastava structure structures studies study suggest suggesting suggests support surveys symposium system systems than thank that theory these thesis they thomas through tools towards transactions transfer traversal traversals trees trie trishul turn twentysixth uniform university used useful using viii vitter vldb washington weighted well when which wisconsin with work workloads works workshop would xiao zhang
http://doi.acm.org/10.1145/644108.644166	45	357	above alan algebra algorithm alon also amer analysis appears applications approach approximation area artificial assignment assoc auton available average between binomial bipartite bounded brace case chen choices chvgttal clause clauses coefficients collectors colorable coloring comments comp complexity conclusion conditions connected containing cook correctly coupon cover crawford crossover dimacs discussion does each edge edges efficiently eigenvalue eigenvector encouraging even example examples experimental exten extend fiege focs friedgut friedman frieze generates generation goerdt graph graphs greedy hard hardcourt have helpful http hypergraphs icalp ictcs ieice implementation info instance instances intelligence interesting intersect ipco john jovanovich kahale kahn kaporis kirousis koutsoupias lalas levin linear loan logn luis mach made making many math matlab method minimal moderate more motoki narrow necessary negations order over papadimitriou permute point practice presented prob probabilistic probability problem problems proc procedures proofs properties proving publishing pursue random recognizing recommending references regular relations report resolution results sasson satisfiability search second sharp short simple since size sized solution sons spectral spectralsat spencer stamatiou stoc strang study sufficient szemer szemerddi technical technique testing thanks that theorem there third threshold thresholds trans tree trees uehara unique universal unsatisfiability unsatisfiable vamvakari variable variables ways well which wigderson wiley with work workshop zito
http://doi.acm.org/10.1145/644108.644209	79	609	aaecc aigorithmica algebraic algorithm algorithmiea algorithms amidst amsterdam analysis andconquer annu anonymous appl applications apply applying armstrong barrier barriers base basic bibs binary bryan cabello calls caltech chains chazelle class cliffs clms cole comments complexity comput computation computational computer computers computing conference construction continuous count course creating cutting cuttings data discrete disjoint divide dragging each editor editors efficient efficiently efrat elsevier englewood euclidean european every first found funnel geom geometric geometry given grigoriev guibas hall handbook hershberger hierarchical hill holland homotopic homotopy http hyperplanes ieee implementation implicit includes input inside internat ions jerrum jordan kaufmann kobourov layer layouts lecture leiserson length leven like linear link lists logn london loose loth lubiw maley mantler maryland matou mattson mcgraw mehlhorn methodology minimum minimumlink mitchell monotone mora munkres network networks north notes number obstacles optimal optimization path paths people phase pinter placement planar plane points polygon polygons polytime prentice preparata preprocessing presence press problems proc produced proe promote proof publicat publishers range rectilinear referees references respectively rfilling richards river rockville routability routing sack science search searching second segment semi sergio series service sharir shortcutting shortest siam siegel simple simplex single slissenko snoeyink spends springer step steps storb structure such suggestion sympos take takes tarjan tbund test testing tests thank their theorem theory there these third thpp time times topology total transactions triangulated triangulating type urrutia valuable vertices visibility vlsi volume ways when which with would xmonotone yehuda
http://doi.acm.org/10.1145/644108.644206	76	583	aichholzer alex american appear asymptotics aurenhammer barcelona bound bounds brodsky combin combinatorial comp complete crossing discrete drawings durocher electron electronic ellen franz geom gethner graph graphs hans jensen krasser math mathematical monthly number oswin pages paper paul problems proe rectilinear references research richard spain stephane syrup theory toward upper
http://doi.acm.org/10.1145/644108.644177	53	424	acknowledgments algorithm algorithmic algorithms amer application applications approximating approximation approximations arbitrary assaf assoc attractive bartal better blum bollob borodin bounds bourgain burch charikar chekuri chung combinatorial combinatorica combinatorics competitive comput computer cover diameters directed directions discrete discussions distortion eigenvalues embedding embeddings feige fiat finite flavor focs fruitful future garg garner general geom geome geometric geometry goel graphs group guha halperin hilbert indyk integrality israel johnson journal konjevod kortsarz krauthgamer lead linial lipschitz london lower mach manuscript math mendel metric metrical metrics more multi naor number online optimal pages pgth phenomena plotkin polylog polylogarithmic probabilistic problem problems proc rabinovich ramsey ramseytype ratio ravi references related research results robi saks science seem settings small soda some space spaces srinivasan steiner stoc system systems task their theorem this threshold tomkins tree trees type unfair wang
http://doi.acm.org/10.1145/644108.644238	102	791	acad algorithms annual area bandwidth batching broadcast broadcasting carter client communication communications computer computing conf conference data demand diego directions discrete distributed dynamic efficient engebretsen euromedia exploiting fast gibson harmonic hybrid icccn ieee imielinski innovations international january journal juhn ladner limiting long metropolitan mmcn more multimedia nearly networking networks nisgav ondemand optimal paris patt perfectly periodic pfixis podc policies popular press principles problems proc protocol protocols pyramid receiving references schedules scheduling scheme server service shahabuddin shamir sheu siam simple sitaram soda spie sudan symposium systems trans tseng using video videoon viswanathan windows
http://doi.acm.org/10.1145/644108.644163	42	330	addison aldous algorithms american analysis analyzing annals annual appear appfications applied approximation arrays asymptotic available bafinski berkeley birkhoff boca bounded bounds cafifornia cambridge certain chains chapter combinatorics comparison complexity computational computer computing constant contingency convex coste counting cryan cubes dantzig decision department diaconis differences dimensions discrete dyer dynamics eigenvalues enumeration european faces facets feds fixed flow foundations four from full geometric geometry glauber goldberg goodman graduate graham graph greenhill hadley handbook http hypercube ieee improved international jerrum journal kalai kammn klee knapsack lecture lectures linear london many margins markov martin massachusetts math mathematical mathematics mcdiarmid method methods mixing morris morrison mount multicommodity note notes number oangolfi operations pacific papers part paths physics poly polynomial polytope polytopes posium press probability problems proceedings programming questions randall random randomization rapidly rates raton rectangular references research reversible rourke rowed rows saloff sampfing sampling science sciences series sets sinclair skeletons society solutions space spdnger spencer spnnger statistics steele stroock structure structures symnumber symposium tables techniques tetali texts thehedra theorems theoretical time transportation truncated university varaiya vedag veinott version vertex vertices volume volumes walk walks warwick wesley with witzgall workshop york ziegler
http://doi.acm.org/10.1145/644108.644193	66	508	afrati algorithm algorithmica algorithms annals appendix approx approximation assume average bampis becchetti belongs berman brucker caching chekuri choose clairvoyance class completion complexity computer computing conjunction convenience coulston dates deadline denote denotes derive desired discipline discrete drawn each else execute fline flow following follows foundations from hall have ieee index inequality irani jobs journal kalyanasundaram karger kenyon khanna largest lemma lenstra leonardi less logistics logp machine math mathematics millis minimize minimizing more motwani mziyi natarajan naval nonclairvoyant nordic notational online operations optimality optimizers page pages phillips powerful preemptive problems processing production proof pruhs quarterly queyranne random randomized references release remaining research result rules satisfies schedule scheduling schemes schrage schulz science shmoys shortest siam since single skutella smallest smith soda spaccamela speed stage stein step stoc strictly sviridenko symposium techniques than that their then theoretical theory time torng total various weight weighted weights wein with works xiyi ziyi
http://doi.acm.org/10.1145/644108.644138	22	168	acknowledgments alber alekhnovichand algorithm algorithmica algorithms alon annual answering anual appear applications berlin bodlaender bodlaenderand bounds branch branchwidth call canada case catalunya chang circuits clique cnica colloquium combin combinatorica complexity computation computer comset comspringer concepts data decomposability decomposition decompositions degenerate dekker demaine discrete dominating domination downey eccc efficient electronic excluding exponential fellows fernau fields finite finland fixed focs fomin foundations free fundamentals geelen gerards germany graph graphs grateful hajiaghayi hans haynes hedetniemi hicks hlineny ical ieee improved international isaac kanj kernel kloks lecture linear logic manuscript marrobin math mathematgorithms mathematiof matroids maximum mfcs minor minors monadic most navian niedermeier notes obstructions ordering over parameter parameterized parse perkovic planar polit problems putational puter quasi questions quickly razborov reduction references refined related report rice robertson routing satisfiabilratcatcher scandiory science search secondorder separators seymour seymourand siam slater some spain speed speedup springer surface swat symposium taiwan tautologies technical technique their theoretic theory theproblem thesis thilikos thomas three tractability transversals tree trees tseitin turku universitat university upper vancouver variants verlag well whittle width with workshop york
http://doi.acm.org/10.1145/644108.644152	33	255	acmsiam algorithm algorithms annual appl arithmetic aspects based become becomes bemd block blocks blocktfiagonal california case columns components comprises compute computes connected cost cplex defined diagonal directed discover discrete elements elimination entries epstein equations exact factorizations fields finite first following form francisco gerhard graph graphs ieee imple information integer irtner january jill john leah linear lpex machines matching math matrices matrix methods modular module modules ninth noga online over pages perfect permutation proceedings programming randomized rational references rose scheduling seiden sgall siam solving sparse steve strongly structure study such symposium tarjan tenth that then theory transactions uniform vertex wiedemann with woeginger zero
http://doi.acm.org/10.1145/644108.644143	26	202	achieve adversarial algorithm algorithms also amitabh amitabha amos analysis andrew anna annual applied armed assigning auction auctioning auctions auer bagchi bandit based best bianchi bids bound buckets case casino cesa chaudhary combining commerce compatible competitive computation computer computing condition conference constant context could data demonstrated digital discrete does each electronic factor felix fiat fixed focs focused foundations freund gambling garg generalized generated give given giving goldberg goodrich goods hartline have hildrum ieee incentive information international items jason karlin kirsten kumar large larger lavi learning limited line littlestone lncs long lower maintaining majority manfred manner mechanisms michael multi necessary nick nicolo nisan noam note notion online open optimal pages perform performance peter power price probability problem problems proceedings quite rahul ratio reasonable references requires revenues rigged robert schapire science sell seller sequence sequences siam simply slightly small smaller soda some soon springer standard still stoc structures such suggest supply symposium techniques that theory this truncated unknown using valuation verlag vijay volume wads warmuth weighted well when whether which while with within workshop wright yoav yossef
http://doi.acm.org/10.1145/644108.644147	29	223	abbadi accuracy achlioptas adaptive adding after aggregate agrawal ajtai akll algorithm algorithms almost alon also alto american analysis annual appears appendix applying approach approx approximate approximating approximation approximations arora attention attributes automata azar badoiu both bound bounds broder carlo cauchy ccti cctiif center charikar chert class clustering colloquium colton columns combinatorica competitive complexity computation computations computer computes computing conference connection constant context coordinate core corresponding counting crtc currently data databases defer define delavega denote dense design differnce digi dimacs dimensional dimensionality dimensions discrete discrite distance distributions domeniconi drineas dynamic each effect efficient efficiently eigenvalues elements embeddings entry equal equivalently error essentially expectation expectations external fast faxach feigenbaum fernandez fiat finally finding first flajolet following follows foundations fourier frequency frequent frieze frobenius from full furedi generators gibbons gilbert gionis goal goldreich goldwasser golub graph graphs guha gunopulos hashing have henzinger here hhta hhtai hhtaii high histogram histograms hoffman hopkins iath ieee iiaa iiab iiai iiaii ilall illustrate improve independent indyk inequality instances interesting international inversions investigate investigated investigating issue items izta iztai jayram johns kannan kanth karger karlin karpinski kerenidis kiiaa kleinberg kliaa kmanan kollios komlos kotidis koudas kumax languages large larger lath layout learning left lemma limited lines llall llsll loan loss loth lower main malntanance many martin massive mathematical mathematics matias matrices matrix maximum maxzet mcsherry meaningful memory mention mitzenmacher model moments monte montecarlo motwani mplement multi multiplication munro muthukrishnan near nearest neighbor norm note nothing nphard oiaa only optimal order orthogonal over pages palo particular partitioning pass passes paterson peled permutations perturbation polynomial power presented press previous probabflistic problems proc proceedings programming projection proof property proposed prove pseudo queries raghavan rajagopalan random randomized range rank read reader real received recent recommendation reduction references regularity remind representations research respect result results returns running saia saks sampling scheme schemes schwartz science search searching second section seek seeking selection sequential series sets shim should siam sigmod significant similarity similarly since singular sivakumar small society some sorting space sparse sparser special spectral spent srhj srii stable statement states stems step storage strauss stream streaming streams structures substituting succinct symmetric symposium synopsis syrup system systems szegedy technical technique testing than that theorem theoretical theory there these this through thus time tsotras university used using values variable variables variance variances variant vector vectors vega vempala version vertices vinay vishwanathasa visualization vldb vlsi when wielandt wise with writing years zbkj ztci
http://doi.acm.org/10.1145/644108.644216	85	665	annalen annual ball balog combinatorics computational computer computing concepts convex conway david digraphs disc geometry graph hull imre integer international june large larman lncs mathematische north pages planar points press probability proceedings references science shortcutting symposium theoretic thorup workshop
http://doi.acm.org/10.1145/644108.644188	62	480	ability acceptance achieved acknowledgments after again algebraically algorithm algorithms alon also appear appendix applications approximation april association babai basis beals because before bennett bernstein between binary bits blum body bounds brassard buhrman bulletin cambridge cannot case ceedings characterizations characterize characterized checkers chuang claim classical cleve colorability combination combinatorial communication complexity comprise computation computations computer computing comszegedy concludes conjecture connection consider considering constant constraints conversely correcting cosets database decisions degree dent depend discrete discussions distinct distributed does door efficient either empty ences entered equation ergiin erty european exact exactly executing execution exists expectation extends factorization fast fischer focs follow foundacan foundations fourier friedl from further gives goldreich goldwasser graph graphs greater greatest group grover handbook have having hence heyer hidden hold holds hope however hoyer ieee implies imply including independence independent indepenof induction information input inputs instance interesting introduction ipel israeli istcs itai journal kannan kluwer know krivelevich kumar language languages large lead learning least lemma linear linearity linearly logarithms loop lower luby magniez manner manuscript matrix maximal measure mechanical mentioned minimum monomiais monomials mosca most multilinear must natural nevada newman nielsen note number numerbeals observed only open opens order other pages paper parallel partition passed pointers polynomial polynomials port possible power press prime primer private prob problem problems proceed proceedings program programs prohabilistic proof properties property propproceedings prox puter quan quanical quant quantum queries query question randomization randomized rani references regarding register regular remain requires research restricted results rise robust ronitt rubinfeld same sampling santha science sciences scitum search self separation several shor show siam simon simple since size soda solovay some spot state steps still stoc straightforward strengths subgraphs subroutine subspace such sudan suggested surxe symposium system systems szegedy technical test testable tested tester testers testing than thank that then theorems theoretical theory there therefore they this three thus time tions toward trevisan trivial understanding unified uniformly uninformed university uric using uuvv variable vazionly vazirani vectors vishwanathan weaknesses what when whether which will wise with wolf world yebzj yiijl ylia york
http://doi.acm.org/10.1145/644108.644133	18	132	above acad advanced again aiello akad albert algebra algorithms allow always amer amsterdam analyze aout appear appendix applications arbitrary arguing arising arxiv asin assoc assume assuming azuma barab barabglsi based bases before bianconi bollob bollobfis bolyai boundary bounded broder buckley calculating calculation cambridge case cases caused certain characteristics chung claim clear cocoon coefficients collecting collective colloq combinatorica combinatorics combining commun competition completeness complex complicate comput cond condition conf consider considering constant constants contribution contributions convenience cooper couaboration course debrecen degree degrees dependent derivation details diameter difference different dimensional disappears distribution distributions dividing does dominates dorogovtsev downwards dynamics each easy edition effect eger emergence equation equations erdss every evolution evolving exactly expansion experiment extracting fact factor faloutsos field finding first fixed focs follows form formulae free frieze from general gilbert give graph graphs have having here hoeffding hoku holds holland implies include increasing induction inequalities inside integer interchanging interested internet introduce isoperimetric iteration itself jeong jlnos just keep kleinberg kmnar knowledge kumar kutat large last leading linear linearity loop maghoul magyar makes martingales math mathematics mean measurements mechanics mendes metabolic methods might model models much multiscalin natl nature need needed nested networks newman north note noting observing obtain oltvai only organization osthus part phys physica popularity positive possibility power powerlaw preprint press probability proc process proof proves provided publ raghavan rajagopalan random rather recurrence reduce references relation relations relationships relatively returning right riordan said same satisfy scale science scientific sealing second seem sends sense separately sequence setting shall show shown sides sigcomm sight similar simple since sivakumar skipping small solution solving some spencer starts stata statist statistical step stochastic straightforward strogatz structure structures studies sums suppose take that their then theorem theory there therefore this through thus time tombor tomkins topology turn tusngtdy unique university unpleasant upfal used using values variables verify vertex vldb watts weighted when where which while wide wiener wish with without world writ write zero
http://doi.acm.org/10.1145/644108.644221	89	699	about access ackermann adding addison addition ajtai albers algo algor algorithm algorithms alitvec also alstrup altivec altivecpem amounts amram ancestor andersson announced another appear apply arbitrary architecture arithmetic aspect atomic augment beame being between binary bits boas boolean both bound bounded bounds brdat brodnik carlsson case cell challenge change chazelle closest combining comp compilers complementing complexity comput computational computed concurrent constant containing contr cornput corresponfunctions crcw current data decision defined dence design deterministic developer dichotomous dictionaries dietz dimacs directly discouraging discussions disjoint dissatisfying docs does dominators dynamic each earlier easy edition efficient emde erode even evironments examining example expected exploit fact faster feeling fich field fields first floating focs following follows fredman from full fusion gabow generalize geometry getting gives global great hagerup hall hardware harel hash hashing have having heaps hence here hopelessly however http husfeldt icalp ieee ihler immediately implefor implement implementation implemented implemention implicit implies improved increasing indexing inform information instruction instructions integer integers intel interesting interestingly intes into inverse just kaas karlsson kernighan koml komlds language large lauridsen left length lengths lesson like linear list lncs lower made maintain make manual manuals marked mask massachusetts math mccreight mehlhorn ment miltersen minimum modern monotone more motorola multimedia multiplication munro nathan necessary need nilsson nlogn note notices number offer only operain operations optimal order ordered other over overall pack packing packsignbits pages parallel particular paths pdfdb pent pentium perfectly perspective pick point pointers pointing positive powerful practical practice pragmatic pram predecessor prentice pretty princiles priority probe problem problems proc processor processors proe programming proof query queue queues quite radix raman rams randomized rank rather rauhe reading real really reference references represent representation result returned returns right riis ritchie rithm ross saks search searching seems selected sethi sets shift shifting shifts shortest should shown shuf shuff siam signlocal sigplan simultaneously single slingerland slow soda software some sort sorting source space spanning sparse special standard start static stoc storing straightforward stroustrup structure subset such suffices sufficient supports surpassing syst system szemerddi table tarjan technical techniques technology than thank that them then theor theorem theoretic theory there this thorup thos tight time tions tools trans transdichotomous tree trees trivially tstad type ullman undirected unfortunately union unpackleastbit upper uses using vector vectors viewed volume wads warned weights wesley when where whereas will willard wires wise with without word words works worst would writing zijlstra
http://doi.acm.org/10.1145/644108.644167	46	364	achlioptas alamitos alan alberto algorithm algorithms amer andreas andrei annual anscience appl approximaposenato approximation austin avoiding beach berlin bertoni bohman bollob borgs bound bounding broder bruce campadelli chayes christian communication component comput computer concepts conditions david differential dimitris discrete dror ehud electronic equations fdlv february fernandez fgraph formulas foundations fourth friedgut frieze gadgets gets giant goemans goerdt graph graphs gregory howard icient ieee imieee improved inapproximability ipco jacm janson jennifer jeong joel johan karloff lecture lectures lewin linear livnat luca madhu malvina manuscript math maximum mean method miami michael michel mick modern myopic necessary nicholas notes nual odds optiannual optimal paola paso personal pittsburgh press probab probabilistic problem problems proc proceedings processes programming properties proved random reed references results roberto rounding satisfiability scaling science second semidefinite sharp siam side some sorkin spencer springer stad stamatiou stoc struc structures svante symposium system techniques theoretic theory threshold thresholds tion transition trevisan tssw tures unpublished unsatisfiability upfal upper using value vamvakari vega wenceslas williamson wilson window wormald yiannis york zwick
http://doi.acm.org/10.1145/644108.644135	20	148	acad acta algorithms almost annals annual appear aronson asymptotics baker bipartite bollob bollobds cambridge chance class combinatoria combinatorial combinatorics computing connected cooper cycles degree discrete edited edition erdss evolution exercises existence factor fenner foundations frieze graph graphs hajnal hamfltonian hamilton hamiltonian holland hungar ieee inst journal karonski karp least lecture london lovdsz matchings math mathematical mathematics matrices maximum mckay minimal minimum nerds north note paul pittel prescribed press problems proceedings proposals publ random references regular revisited robinson second series sipser society sparse structures sums symmetric symposium temperley theory tribute university walkup with wormald
http://doi.acm.org/10.1145/644108.644186	60	470	acmsiam algorithms amos annual associated bounds broadcast chernoff collection colorings compute consider corresponds crypto dalit degree dependency discrete disjoint each edge efficient encryption equitable extend fiat gafni graph hoeffding indeed independent independently index integrating jeff jessica lisa lncs lotspiech methods moni naor note observe only overlapping pemmaraju probability proc receivers references revocation schemes selected sets size springer sriram staddon stateless subsets symposium that this traceability tracing variables where yiqun
http://doi.acm.org/10.1145/644108.644251	112	851	after against algorithm algorithms alphabet alphabets alphbetindependent also amir applications arrays baker being benson bird breslauer build built cacm cambridge character compressed construction continuations defining dial dictionaries dictionary dimensional each economical ending every extract farach first focs focus following follows forest form from galil generalization giancarlo gusfield hence icalp independent index large least length lexicographically line linear location manber matched matches matching matrices maximal mccreight method modified most myers nodes note obtain optimal ordering over parameterized park path pattern period periodic portion prefix press proceeds queries read references remainder remains removed rotations rows search seek sequences shortest sicomp space square stage stoc strings such suffix suffixes take takes task their theory this those time topological tree trees trie truly unbounded uniform university using weiner where with
http://doi.acm.org/10.1145/644108.644139	23	178	algorithm algorithms analyzed applications approach approximation back callaghan center closure clustering cohen cole completeness comput computer cormen cornuejols data deng discrete dual editors estimation facility faster fitting focs framework francis freeman garey goemans golin graphs greedy guha guide hamburger hariharan heuristic hill icalp implementation improved indyk infocom internet intractability introduction intrumentations italiano jain jamin john johnson khuller kuehn leiserson lewenstein lncs locating location loth lowe mahdian management markakis mcgraw median metric mettu mirchandani mishra motwani nemhauser networks online optimal padmanabhan pages part placement plaxton porat press problem problems proc prograom proxies quick random reachability references replicas rivest saberi science server shavitt size soda sohraby sons space sparse stoc streams strikes sublinear survey system tansel technique theory thorup time transitive uncapacitated using vazirani voelker warehouses wiley williamson with wolsley zhang
http://doi.acm.org/10.1145/644108.644192	65	506	acad algorithmic algorithms also annual appfication application applications approximating approximation approximations asano assume berlinheidelberg bertsimas boundary bounded caract combination combinatorica comput computer construction convex covering define definition dependent deterministic digital discrepancy discrete distributions doerr editors enumeration equivalent extremal fact following foundations generality ghouila good guarantees halftoning hoffman houri hull hyperedges hypergraph identity ieee improved incidence independent inequalities integer integral katoh kruskal kuhn lecture left level linear loss matrices matrix measure notes obokata oper otherwise packing pages paris point points polyhedra polyhedron probabilistic proc proceedings programs proof proofs properties provably raghavan randomized recall references related risation rounding schnieder science sets siam since sketched springer srinivasan submatrix such symp symposium syst systems technique that theorem there thompson thus tokuyama totalement totally tucker under unimodulaires unimodular verlag vohra volume with without
http://doi.acm.org/10.1145/644108.644118	7	66	acmsiam added adds afeasible affect algorithm algorithms allowed annals annual approxmcft aronson augmentation balas ball bounded capacities case chain change clausen combinatorial comeu communication compensated computer computes constructing convex cook correctness corresponding cost costs denote department discrete does down dynamic editors efficient elsevier essential evacuation faster figure fleischer flow flows ford foundations fpas fractional from fulkerson gale garg hall handbooks hoppe horizon idea increases increasing instead integer invoking iteration jaillet journal june klinz lecture length lexicographic long longest lost magnanti makespan management mathematical mathematics maximal method michigan minieka minimum modification modified modifies most mouma mulficommodity multicommodity nemann nemhauser network networks notes number odin odoni operations optimization order other over packing pages parallel path paths personal polynomial powell previous problem problems proc programming proof proportional prove pubhshers quickest rain reducing references report research residual resulting return rounding routing runs schulz science seres shortest show simpler simplex since sketch skutella some spnngerverlag springer starts static stochastic successive survey symp symposium tardos technical that then theorem thesis this thus time transient transshipment universal universally university until value vedag version wilkinson with woeginger yields zadeh zero
http://doi.acm.org/10.1145/644108.644127	13	100	algorithm algorithms amanatides annu appl application approximate areal august axis ballieux berg berman binary bound case chazelle chin comput computer convex cornput dasgupta dice discrete dumitrescu evaluation fast february feiner fuchs generation geom georgia graph graphics groot hyperrectangles improved information institute interactive kedem light lower march merging mitchell motion muthukrishnan naylor near object operations optimal overmars pages parallel partitions plane planning polyhedra polyhedral precision priori proc real recipe rectangles references report results school science segments shadow shaxir siam siggraph simple slice sources space structures surface sympos tech technical theory thibault tiling time tracing tree trees university using utrecht visible volume worst yields york
http://doi.acm.org/10.1145/644108.644237	101	781	acknowledgments addison addressable advice aggarwal algorithm algorithms always antonio aoac appear applications april area aspects august authors balakrishnan basagni based berkeley bhagwat bisdikian bluctooth bluenet bluetooth bluetrrees boston bray butterfly cables characterization chlamatac chord clustering combinatorial communications computing conference connect connected construction content dekker dept design dialm discrete distributed dynamic emulation enable enabling fault fleming formation forming francis from global group guide guttag haas hall having hawaii hnadley http hunter ieee infocom infrastructure inouye insider intel interest international internet introduced johansson joseph journal june kaashoek kapoor karger karp kubiatowicz lamaire location lookup malkhi marcel maryland method methods miklos miller mobihoc mobile momuc morris multimedia muting naor network networking networks number open peer performance perkins personal phane podc pravin prentice principles problem proceedings racz ramachandran ratajczak ratnasamy references report revealed routing salonidis sarkar sawn scalable scatternet scatternets sceiences schiffer segall service shenker sigcomm special specification stoica sturman symp symposium system tapestry tassiulas tech technical technology texas thankful thomas tober tolerant topologies topology turanyi ubeda univ valko vector viceroy wallis wang wesley wide wireless with without workshop york zaruba zhao
http://doi.acm.org/10.1145/644108.644200	71	539	acmsiam aeta agarwal aggm algorithm algorithmic algorithms although among annual answer antipode appear appeared applications approximate approximating approximation arriaga asymmetric based bentley binary borodin bounds chosen clustering colton combining comp complexity computation computational computer computing concepts concerns convex convexity curse dasgupta data database diameter different dimensional dimensionality dimensions disc discrete distortion distributions dynamic each efficient egecioglu embedding embeddings eppstein erabeddings erators euclidean european existence extrema fagin farthest fast faxach feller finding finite finocchiaro firstly foundations frechet from function functions furthest fuzzy gabow gaussians general geom geometric geometry gionis give given goel guibas hamming handbook hausdorff high higher holds implies imply important improved independently indyk information into introduction invited israel jams john johnson journal kalantari kleinberg kushilevitz learning letters lind lindenstranss local logn lower manuscript mathematics mathematiea matougek maximum means metric metrics milman minimum mixtures motwani multimedia multiple muthukrishnan nearest neighbor neighbors ninth norm normed norms obtain obtained open operation ostrovsky other pages paper pellegrini point points positive possible preliminary principles probability problems proceedings processing product products projection proximity pseudorandom queries rabani random rank reduced reduction reductions references related removing required restricted restrictive result results rise robust sahinalp scaling schechtman science sciences search searching second seen sequence sets setting several siam similar similarity somewhat sons space spaces spanning sphere square stable stream subquadratic such sufficient suri symposium system systems tarjan techniques tends than that their then theory thirtieth this those time towards trees twentyninth uniformly unit varadarajan vempala version well wiley with would
http://doi.acm.org/10.1145/644108.644248	110	834	academic acmsiam advances algorithm algorithms algorithmsfor amer annual anwendung appear appl applications bene berlin bipartite blocking bounds carpinelli chung clos cole color coloring combinatofics comput computer computing connecting connects cross determinantentheorie discrete distrib edge electronic eleventh engineering euler fishburn francisco gabow graphen graphs heterogeneous hopcroft hwang ihre information interconnection internat kariv konig lower match math mathematical mathematics melen mengenlehre monotone muhigraphs muhirate multigraphs multirate network networks nonblocking nonblockingfor ofmulticonnection parallel partitions portland press princeton proceedings properties providence rasala rate rearrangeability rearrangeable references ross routing science sense siam soda split springer stage stoc strictly submitted switching symposium taipei telephone theoret theoretical theory thirtysecond threestage traffic tsai turner uber using wang wide widesense wllfong york
http://doi.acm.org/10.1145/644108.644157	37	285	acid algebraic algorithm algorithmic amenta appear applied based baxndorff bern book both bound boundaries buddha called cambridge characterization choi combinatorial complex complexes complexity comput computation computational concept conceptually construction contains context critical defines definition delaunay destroyed detecting determined diagram diagrams dimensions discr discrete disks distance does done dynamical easier edelsbrunner elements eurographics example facello family fatty figure filtering flow flowcomplex from function functions future generation geom geometry giesen gramicidin grasp grove grow hand have here homeomorphic implementation implemented inspired introduced involved jensen john know large larger leekha left liang macromolecules manifolds math mathematics maxima mesh middle model moment monographs more morse munkres namely neither nielsen opening openings other outside parts performs perseus pocket pockets point points practice present presented press proc proceedings proe protein proteins publishing pure receptor reconstruction references restricted right saddles sampled science scientific seconds siersma similar simple simplicial some sparc stable suggests suited surface surprising surprisingly sympos symposia system takes than that their theorem theory there think this though thus topology triangulation trivial turned ultra undersampling university upper used using visualized voids voronoi weighted well were which with work workstation world
http://doi.acm.org/10.1145/644108.644196	68	523	about adding additional adjacency algorithmic algorithms also although analytic andxjwithl annual applicalower approach approximate assume attach attempt average based before below berlin best between block bound bounded bounds called case clearly combination combinatorics communication comparison complexity computational computed computer computing concluding conic consider considered constant constraints construct constructed construction contradiction coordinate coordinates cormode corresponding cpsv cuts ddimensional degree deza difference difficult discrete distance distinct distortion dobkin document earlier easy edges edit efficiently eigenvalue eigenvalues embeddable embedded embedding embeddings equal equation estimations exchange exist exists expander expansion experimented factor false final finding first follow following follows formulated foundations from front geometry gerequire goal good graph graphs guarantee guruswami have hypercube ieee ijzi ilxi ilxill ilxjll ilxn ilzill implied induced infeasible instead into intuition journal known kronecker label large laurent least lectures length lengths less linear linial lipton llxill london loop lower made make matching matlab matou matrix means memory method methods metric metrics minimum most moves much multidimensional muthukrishnan natural nearest neighbors nmetric nodes norm notably obtain obtained ometry only operations optimal otherwise over package pages pairs paper particular paterson path polynomial power press problem problems procedure proceed proceedings program programming proof proposition proved provide provided provides purpose rabinovich reference references refused regular represented requires result resulting rotate roughly sahinalp satisfy scaling science sdppack search second self semi semidefinite sequence shortest show siam since some space specifically springer springerapplying square statement still string strings subgraph such suppose symbol symposium than that their then theorem theory there therefore this thus time tions true turned underlying unfortunately used using variables vectors venkat verlag vertices vishkin weaker where which with witha would xill xjll zero
http://doi.acm.org/10.1145/644108.644212	81	628	algorithm algorithmic algorithmica algorithms approximating approximation approximations automata azar bandwidth baveja berlin cambridge cheriyan circuit circuits colloquium combinatorial combinatorica completeness computer computers computing conference connectivity constraints cuts directed disjoint edge even faster flow flows focs forest fortune foundations fractional frank freeman garey garg good graph greedy guide guruswami hall hardness hawaii hicss holt homeomorphism hopcroftand improved inapproximability integer integral international intractability introduction ipco john johnson journal karloff khanna kleinberg kolliopoulos konemann korte languages lawler layout leighton linear mathematics matroids minimum multicommodity multicut multicuts near network networks operations optimal optimization other outline packing pages path paths polynomial preliminary prentice primaldual problem problems proc proceedings programming programs proofs provably prsmel rabani raghavanand rajaraman randomized references regev related research resuits rinehart robertsonand rounding routing schrijver science sciences seymour shepherd siam simpler sons spnngerverlag springer srinivasan stein steiner stoc strongly subgraph survey switching symposium system systems tarjan technique testing theoretical theory thesis thompson trees unsplittable using vazirani verlag version vlsi wang west wiley winston with wyllie yannakakis
http://doi.acm.org/10.1145/644108.644204	75	573	academic addison again aided akers algorithm algorithms allow allows alternative amortize amortized analysis annual appendix application applications approach assigned automation automaton available base based bdds beconsideration been beerel bell belong belonging berlin best beyond biichi binary bloem bolic boolean boric brayton bryant burch caleulational call called calls cambridge case cases cause chapter charge charged charging check checking chosen clarke code colorado comparative complexity component components computation computed computer computers computing concerned conclude conclusions conference connected consider constant construction cormen corresponds cortadella cost costs could cudd currently cycle cycledetection cycles data decision deftnition depth dequeues design detail detected detection deter determined determining diagram diagrams dill dimi discovers distance double during each editors efficient element emerson emptyness encountered enqueue entered entering entire enumeration equal ever example executed executing execution execuv expensive explicit exploiting explosion expression fabio fact fair ffvy figure finally find finite first fisler fmcad follow following follows formal forward foundations fraer fragments from function functions gabow gentilin graph graphical hachtel hardin have hence here heuristic heuristics hierarchy high hksv hmps hopcroft however howu http hunt hwang hypothesis ideas ieee immediately implicit improve improvements induction inductive information input interesting introduction invocation iscc isvl iteration ivvl johnson journal keeps kind kluwer kurshan lake large lascc least lecture leiserson lemma length lics line linear lines lncs logic logn loop machines macii main make manipulation markovin mass maximum mcmillan meinel memory methods mining model more moreover mores most mucalculus nato nets never newg node nodei nodej nodes notes number obdd observing obtain obtained often only onto optimizations optimize otheras ously over overall package pages parameters pardo particular pastor pcpn pefia perform performance performed performing petri point possible preliminary preprocessing presented press previ previous previously priori priority probably problem problems proc procedure proceed programs proof proofs proposed propositional prove publishers purposes queue quickly ranjan ravi reach recursive reduced reducible references relative release report representation results return returned rivest routine sanghavi sangiovanni science sciences search second section series sets setting several shukla siam singleton sizes skel skeleton solve solved some somehow somenzi specialized spine springer srbsv sscc state states step steps street strongly structural structures study subroutine such sufficient suggests suitable suppose symamortized symbolic syms syrup system systems tacas take tarjan technical technique that then theobald theorem theory there thesis they this those three through thus time tion tools transaction trivial ullman under uniud upon used using vardi verification verlag verno version vertex vincentelli visit vlsi volume wesley when where which while will wise with within would yang
http://doi.acm.org/10.1145/644108.644250	111	841	acknowledgments adding addressing adds adjacent algorithm algorithms algs allowing alphabet alphabets alphanumeric ando applications approximate array arrays baeza based bell bits block bytes coded compressed compressing compression comput consecutive constant construction corollary data databases dictionaries documents economical edition efficient employ encoding every experimental fast ferguson ferragina file files first fixed focs fsttcs giga given gonnet google graphs grossi help however html http hybrid identify ieee images immediately improve improvements index indexable indexes indexing indices inform informat information instead inverted isaac jacobson just kary kaufmann kunihiko left leftmost length lgle like line lnhh locate lossy lower luczak managing manber manzini matching mccreight method moffat morgan morrison moura multilevel multisets munro myers navarro nearly nested neubert nlglgn obtain occupies occupying occurrence offs opportunistic optimal order other over pagh patricia patricias pattern point polylog portion practical processing provide query raman redundancy references refinesearch replace representations requires restrict retrieval retrieve sadakane scheme search searches searching second segment segments self sequence siam silva size small snider soda space sparse srinivasa static stoc storing string struct structure structures study sublinear suboptimal succinct suffix suffixes symbols systems szpankowski tables takes terms text that theorem theory these this time tool trade trans tree trees until using value venkatesh vitter where with witten would yates ziviani zobel
http://doi.acm.org/10.1145/644108.644220	88	689	abiteboul acmsiam aeta algorithm algorithms alstrup analysis ancestor ancestors annual appeared applications approximate architecture aspects bordelais breuer classes codes coding cohen combinatories common compact comparison computer computing concepts conference connectivity construction data database decomposition depth diestel discrete distance distances distributed dynamic european fast finding first flow focs folkman foundations fourteenth fourtythird functions gavoille gavoiue generalized graph graphs halperin harel hereditary huffman ieee implicit improved induced informatica information informatique international journal kannan kaplan katz khatib korman labeling labels laboratoire linear linked list lncs localized maintaining mathematical mathematics methode milo minimum naor nearest networks ninth optimal oracles order other pages parallel paul peleg perennes pods preliminary preserving principles proceeding proceedings prooceedings proximity queries ranhe rauhe reachability recherce redundancy references report representation representations result routing rudich santoro scheme schemes science search seperated seventeenth seventh shabo short siam simple small soda spaa split springer stacs stoc structures survey symposium systems tarjan technical their theorectical theoretic theory thirteenth thorup transactions trees tsakalidis twelfth twentieth twentyfifth twentyfirst unexpected universal verlag version vertexes vertices volume well workshop zwick
http://doi.acm.org/10.1145/644108.644176	52	414	advanced algorithms almost alth annual approach approximate approximation august awerbuch berger bollob cambridge chandra chew clique closure cohen communication compact complete compression comput computat computation computational computer computing conference constructing construction constructions covers cowen crete delaunay digraphs discrete distance distances distributed dobkin edition elkin fast feder foundations friedman gavoille general geometry good graduate graham graph graphs greece halperin hffer high hypercube ieee interscience island issue january john joseph journal july labeling linear locality mathematics modern motwani narasimhan near nearlinear neighborhood network nevada newport october optimal optimization oracles overhead pages pairs parallel partitions paths peleg perennes philadelphia piscataway planar polylog polylogarithmic preserving press principles private probability proc proe proximity publication ramsey random reachability references results rhode rothschield scheme schemes science sciences second sensitive series shortest siam soares sons spanner spanners sparse sparseness special speeding spencer springer stoc stretch studies supowit symp synchronization synchronizer syrup system texts theory there thorup time transitive ullman undirected university vegas verlag washington weighted wiley with work xviii yannakakis york zwick
http://doi.acm.org/10.1145/644108.644246	108	830	able above access aggaxwal algorithms alloptical annual approach april arbitrary arcs areas assign assignment bandwidth banerjee call cambridge cannot carrying case chords circle circular collection coloring colors communication communications complement complete complexity computer computing consists construct contains coppersmith demand demands discrete each easily easy efficient einstein either enough equal example exists fiber fibers finally fishburn fixed fortune foundations from full garey generalized given graph graphs green group hall handled have here however ieee improved induction instance interval intervals into january johnson journal kaklamanis kumar large length lengths like linesystem link lucent make mathematics meeting mihail miller minimization minimum moadms more mukherjee necessary networking networks node note number oadm only optic optical optimizing orders orientation other packed packing pages papadimitriou plus practical prentice presence problem proceedings proceeds proof raghavan ramaswarai reduced reduction references required research ring roughly routed routing satisfied satisfy scheduling schieber schwabe science seen selected siam since solved sons speaking split such sudan sufficient sweldens symposium take than that theorem theory they this three together total translation trees unsplit upfal wavelength when which wiley wilfong winkler with without would york zhang
http://doi.acm.org/10.1145/644108.644202	73	555	academic accessing achlioptas acmsiam addition adversary afrmky algorithm algorithmica algorithms amortized analysis applications architecture arks associative benevolent bitreversal borodin brehob buffers cache caches caching cambridge carter case chatterjee chrobak communications comp competitive computation computer courtois decomposability department direct dissertation dual dumir efficiency efficient enbody eviction fiat file focs fully gatlin guided hardware icalp ieee implementation improving information irani jouppi journal karlin karp larmore letters line list locality luby manasse mapped matching mcgeoch memo multiple noga note online optimal pages paging path performance permutation peserico prefetch press princeton problem proc proceedings processing program queueing randomized reference references restricted rhaghavan rudolph rules sanders schieber science sciences sequences server seznec siam skewed sleator small soda stackelberg strongly submitted symp system tarjan theory through torng towards unified university update volume weighted with yaniv york young
http://doi.acm.org/10.1145/644108.644130	16	128	about acknowledgments algorithms aluffi appl archive barnett based behaviour bern bius boundary bowers brief cambridge cerebellum circle comp computing conf conformal context continuous conversations data dense description dimensions elevations eppstein exploring factors flat focus function functions geometry gives graphics graphs harmonic helpful hierarchies higher http human hurdal hyperbolic idea ieee include information interpolates interpolation interpreting iversen lamping large like limit lncs london mapping maps math meshing multivariate munzner natural neighbour nice open optimal papex pirolli points pommerenke press proc proportional quasiconformally questions reconstructs references rehm rottenberg sample samples shaper sibson space springer stephenson steve structures student summers systems technique texts thank that there transformation univ vavasis verlag version viewing visualization weight weights what wiley workshop would
http://doi.acm.org/10.1145/644108.644161	41	320	abstract acknowledgments additively algebra algebraic algorithm algorithmic algorithmique algorithms allerton also analysis angelier annu antipolis anton appl application applications applying arcs arithmetic aurenhammer averages become boissonnat burnikel cagd cambridge cells cgal circle classes closest coefficients combinatorial commun communication comp comparison complexity comput computation computing conf conic considering construction control convex core cost culver curves degree design devillers dfmt diagram diagrams dimensional discs discussions double driven drysdale early edition effective efficient elliptic emiris euclidean europ exact filter filtering fortune from fronville fruitful fundamental generalized geom geometric geometry graduate granlund graphes helped http hulls iher illustration implement implementation improve incremental input inria intersecting intersection intersections interval issue karavelas keyser klein krishnan leda letting library like line liotta little manipulation manocha manual march mathematics measurements mehlhorn meiser methods mioc model models monique mourrain mpfloat multiple number olivier open optimal oxford pages pair paper paris partially perrucci personal pion planar plane platform point points power precision predicate predicates preparata press prisme problem problems proc proceedings properties proximity queries random real references release results robust running saarlandes scheduled segment segments sequences shared sharir shea siam simple sizes sophia spec special spheres springer sturm such sugihara support surfaces sweep sweepline sylvain sympos syrup systems table tamassia tech technical teillaud texts that theory these thesis this times topology types under universit universitar university useful using various verlag versions visibilitd voronoi weighted well work working workshop would york yvinec
http://doi.acm.org/10.1145/644108.644207	77	589	acknowledgements algorithm algorithms appl application between cambridge chet cole common comput computing curves distance down faster geom godau gusfield hirschberg howard implementing internat introducing journal lingeshwaran longest matching morris networks obtain palaniappan polygonal press problem references scott sequences slowing sorting strings subsequence thank trees university
http://doi.acm.org/10.1145/644108.644117	6	56	acad accepted acmslam adaptive adding addition algorithm algorithms allow american amount analysis anderson annals annual another appear applications applied approach approximate approximations arbitrary arcs associated association asymptotic asymptotics august avram bauerle bellman berlin bertsimas bigstep bottleneck brownian cambridge capacity capture case chen class column combinatorial combinatorica commodity communication computed conference consequences constant continuous control copy corollary cost covered craddock customer define depends differential discrete discretization discretizations distance duality dynamic each edge editor editors efficiently ellipsoid embed entry eoep estimate evacuation even exactly expanded exponential faster filipiak find first fleischer fleming flow flows fluid forms framework from fundamentals gamarnik general generation given hajek harrison here heterogenous heuristic hierarchical high holding hoppe icularly identify implies important improve improvement including infinite infinitedimensional instantaneously institute integer international interval jersey john journal kelly labefing label last lectures linear lions lovhsz maglaras makespan management mandelbaum manner manufacturing manuscript massachusetts mathematical mathematics method meyn minimizing model modeling modelling models modification modify moments motion multiclass multicommodity multiplicity nash needed network networks node november number nummlzmg objective ogier only open operations optimal optimality optimization over oxford pages part particular path performance permissible perold phllpott policies polynomial populations practical practice predecessor preparation press pricing princeton probability problem problems proc proceedings processing programming programs properties publication pullan queueing quickest reducing references relaxations representing research restricted review ribixa ricard routing scale schedufing scheduling scheme schrijver section semidefinite separated september sequencing sethuraman shop shops shortest show siam simple since skutella society solution solutions solve solved solving some sons source spaces spfinger spnnger springer stability stanford stateconstrained stochastic subroutine such suggest suggested suppose symp systems tandem tardos technology that their then theory there these thesis they this time times tracking traffic trajectory transported transshipment tschel tuple university usage used usefulness using variables vectors veflag verlag vertex visits volume weiss which wiley will williams with within would york zachary zero zhang ziedins
http://doi.acm.org/10.1145/644108.644172	50	404	acyclic ailpairs algorithm algorithmics algorithms allowed allpairs among amortization amortized amsterdam analysis annual application applications asudin atlanta barrier based baswana beach biconnected bound breaking california canada case charges china closure combinatorics components computer computers computing concepts conference connectivity constant cormen cost dags data decremental delete deleting deletion demetrescu depth digraphs directed dynamic dynanfic edges edition efficiency essentially even experimental extend eyal finding first flow foundations frigioni fully gabow general georgia graph graphs guilin hariharan helpful however ieee implicitly improved information insertion insertions international introduction italiano journal keeping king leeuwen leiserson letters like linear maintained maintaining maintenance mathematics matrix miller montrdal more nanni netherlands obtain open operation optimal pages path paths possible poutr preceding precisely presented press problems proceedings processing qudbec query reachability redondo reduction references remain remarks retrieval rivest roditty running sagert saving science search second sharir shortest siam simple space stein still strong structure study symposium tarjan their them theoretic theoretical theory there thorup through time total transitive trick unchanged vancouver vera volume while whose will with workshop worst york zaroliagis zwick
http://doi.acm.org/10.1145/644108.644160	40	313	adaptive addresses advantage aggarwal algorithm algorithms alliez already andreas angle annoying annu appear appendix appl application applications arrangements atsuyuki authors ball barry been beginning being boots boundary bounded building canad cases cgal change changing cheng chew chichester choice choose choosing circumscribing class code coded coding coefficient college comparison comput computation computational computin computing concepts conf considered considering const construction convex cope coplanar corresponds cospherical could creation creationo dartmouth data definition degeneracies degenerate delaunay deletion dept detecting determinant devillers diagram diagrams dillencourt dimension discrete discussions duality each ears edelsbrunner edges efficiency encouraging erickson especially even existing expected explicit exudation fabri facets faceuo fact february finite flipping form forming four funke future geom geometric geometry giesen giving graph group guibas hand handle handling hanover have heller herbert html http hurtado icate implicit improvements improving indexing infinite inform informal input inria insertion instance internat issue jack jeff joachim john kernel kokichi kurt last lazy lead leading leaving lett lexicographical linear look made math maxless meaning mehlhorn meiser members memory meshing mficke michael modeling monique monomial more most must nature null objectoriented okabe olivier ones onunbounded order ordering orientation oriented other otherwise outside package pages perturb perturbation perturbations perturbed perturbing pierre pion point pointo points polygon polygons positive positively possibility precondition pred predicate preliminary previous prisme problem proc process proe quality realizability reconstruction references refinement reliable removal removing report reported require research result results return returned rrrt saxe scheme section seen seidel shang shor side simplicity simulation since sliver slower snoeyink some sons space spatial special sphere spheres stefan step straightforward students such sugihara supposed surface sylvain sympos tamal technical technique teillaud template teng terrain tessellations test tetrahedron than thank their then think this time tool trans triangulation triangulations unbounded undersampling unify unique urrutia used user users using vertex vertices very voronoi weighted when whether wiley wing wish with world would zero
http://doi.acm.org/10.1145/644108.644235	99	761	adaptation aiello algorithm algorithms allocation analysis annual approach architecture atmforum available avoidance believe best bharghavan black blake bolot borodin bounded buffer cambridge campbell carlson citeseer clark class comment committee communications competitive computation computing congestion core davies december delay detection differentiated differentiation diffserv diot directions discrete dovrolis draft early equivalent fact flow floyd forum from gateways general guaranteed html ieee infocom internet jacobson jean july kesselman lazar liao loss lotker magazine management mansour marie model models nandagopal networking networks nichols online order overflow packet packets pages patt peering performance policies press problems proceedings proportional providing provisioning queue rajagopolan ramanathan random references relative rosen scheduling schieber semret serve service services shamir siam sigcomm simple sivakumar specification stateless stiliadis stoica sviridenko switches symposium technical that theory traffic transactions turner uniform university venkitaraman version wang weiss will without wroclawski yaniv zhang
http://doi.acm.org/10.1145/644108.644247	109	832	above academic according algorithm algorithmica algorithms among analysis annals appealing appl applications approach approximating approximation arbitrarily assignment barry based been boost bounded bounds case cell chvatal colbourn color colored colors combinatorial company completing complexity concavity conditional constraint could covering decision define denes derandomize describe design developments discrete dual each easy enumerative exactly expectations expected extension extensions finally find follows formulation fractional francisco freeman from function geometric goemans gomes grstschel hence hublet ieee implementation implies improved incorporated inner integration interesting international interpret involved keedwell kumar latin least left lightwave likely linear manner matching matchings math maximum means most note occurs oper optimal optimization original overlap packing pages pair partial plotkin possibly press primal probabilities probability problem problems procedure proceed proceedings product programming promise proof randomized recently references relaxation result rounding routers rule russell satisfiability schrijver select selection shmoys shop show siam similar solution solving speeding springerverlag square squares straightforward striking success such sundaram tardos tech techniques that their theorem theory these this tight uncolored upper used values version very where which williamson with within work workings would yields york
http://doi.acm.org/10.1145/644108.644226	92	717	algorithm algorithmica algorithms alon althsfer alzoubi annual approximability approximating approximation arthur available awerbuch babai based belonging bounded chen clustering combinatorica comments comput computer computes computing connected connectivity constructing construction control cover covering decompositions degree diameter discrete distributed dobkin dominating dual efficient every factor fast feige files following foundations frieder from geom geometry given graduate graph graphs guha hailan hardness helpful html http ieee independent infocom instances integer internal issue itai joseph journal july khaled khuller kumar lack lectures length liestman linial luby lund manuscript mathematics matou maximal message minimal minimization minimum mobihoc mobile most multi needed neighbors neighbour networks news note november nprkumar number ophir optimal optimization pages pair parallel partitions peleg peng postscrip primal principles problem problems proceedings programs properties rajagopalan rajaraman randomised randomized referees references results routing saks samir scheme science sets siam sigact simple size small soares soda spanners sparse special springer stoc stretch subgraph suel survey symp symposium systems telecommunication texts that their there threshold time topology trevisan uiuc using vazirani vertex vertices weakly weighted wireless with within yannakakis yuanzhu
http://doi.acm.org/10.1145/644108.644148	30	233	aboulnaga across addressing aggregates algorithm algorithms alon also alternating alternatively analagous applications approximate approximating approximation array assumed azmlyze best between bound bucket buckets building careflfily cauchy certainly challenge chaudhuri comnmnication complexity computation conclusions conference consider considering construction context contributes cost could data database dependence designing determine different disappears distribution distributions does domain dynamic each embeddings equally estimation every factor fast finds first focs forced frequency from full general generators gibbons gilbert give given giving gorithm guarantees guha have hence hierarchical histogralns histogram histogramming histograms histogrmns however icalp incremental indyk inequality instead integer involved item jagadish jcss kotidis koudas lamina lemma length level likely long looking madison main maintenance maps march massive matias method models moments muthukrishnan naor nisan note optimal other over pair period persist pods point poosala possible prefix prevent principles private probability problem proceedings processing profile programming pseudorandom quality quartic queries query range ranges rangesum real reasonable references reingold representations results runs runtime schwarz section seems selecitivty self sets sevcik shim sigmod signal signals size small soda space spacebounded srivastava stable statistics stoc strauss stream streams structures subproblems suel suitable summary symposium synopsis systems szegedy technique tecthfiques that thesis this throughout thus time transformation tuning twice ultimately used variety varying viewed vldb which wisconsin with without
http://doi.acm.org/10.1145/644108.644116	5	47	about acknowledgement acknowledgment algorithm algorithms amortized analyis analysis annual borodin cambridge communication communications competitive complexity computation computations computer computing delay dooly dynamic efficiency faster foundations game goldman guessing information journal karlin kenyon letters line list measure noga offline online other paging practice press private probabilistic problem proc processing proe randall randomized references rules science scott seiden selden sleator stories symposium tarjan theory towards unified university update woeginger yaniv
http://doi.acm.org/10.1145/644108.644145	28	215	above acceptable achieves additional address agents agreement algorithmic algorithms already always american amortized analysis anna appear applied applies approach approximation approximations archer areas auction auctions automata available baliga basic been behavior below better beyond bidders bids blum borodin bound bulow byzantine cambridge case choice clarke coding collel combinatorial comeptitive commerce communications compatible competitive computation computationally compute computer computes computing conference consensus consumer core cost costs counterspeculation cover deeper demand deshmukh design desirable devries digital discrete distributed double easier econometrica economic economics economy efficiency either electronic elements equal equation estimated estimator european example extractor faculty fairness fast faults feasible feigenbaum fiat finance following formally former foundations frugal functions games general generalized generals generates given gives goldberg good goods green groves guide halevi hand hard hartline have hershberger hildrum http ieee incentive incentives independent information ingredients internet ishai jacm journal karlin kellogg klemperer know known krauthgamer kumar kushilevitz lamport lang languages learning lgth like list literature lose loth lower malkin manuscript market mass mathematics maxket mechanism mechanisms microeconomic more moulin multicast multipart multiparty multiple myerson namely natural near network nisan nissim normal note numeric online operations optimal other outcome outcomes oxford pages paging papadimitriou paper parameter path payment pease performance political presence press price pricing private problem proc profit prog property public reaching recently references relationship research revenue review roberts ronen routing rudra rules science sealed secure segal selfish several sharing shenker shostak shown siam similarity simple simulation single sium sleator solution some springer strategyproof structure submitted submodular successfully such suggests suri survey surveys symp sympo symposium syrup table tardos tarjan taxdos teams tenders that theory there these this thomas tied trans transmissions truthful university unknown unpublished update using value values verlag vickrey vohra well when whinston wiley winners with wonder would wright yaniv york yossef
http://doi.acm.org/10.1145/644108.644137	21	158	acad academic acta acyclic acyclicity addendum algorithm algorithmic algorithms ancestor ancestors annual appear applications arcs arrangements arrived aspects been blum boland booth bound bremdst cambridge canad certificate charged checking chordality circuit circular classes combinatorial common comparability comput computer computing consecutive consists contains corneil cost decomposition described diagram diagrams different dirac discrete during edges elimination encountered even figure find finding finite first forest found four from fund gallai geometric given gives golumbic graph graphen graphs habib hamburg hard hasse have higher hungar hypergraphs identification iher illustration incident included incremental induction interval intervals jacm jcss joining journal korte label labeled leaf least leastcommon lecture leda left lekkerkerker lempel length line linear lineartime links lueker mark marked math mathematics mcconnell mehlhorn mhhring modular monographs most must ninth node notes number olariu ones order orders orientation orientierbare other parent partition partitions path paths paul perfect performs permutation pivot planarity platform pnueli press previous proceedings property real recognition recognizing reconstruct reduce references refinement rejection reliability representation result results returned right rigid root rose science search searches second selectively show siam similar simple since software some sort sorts spanning spinrad start starts stewart such suppose survey switch symposium takes tarjan test testing than that theoretical theory these this those thus time topological transitiv transitive transitivity transposed traversed tree trees ultimate undefeated univ university until upward used uses using vertex viennot violation wasserman which with yannakakis yeidls yields
http://doi.acm.org/10.1145/644108.644113	3	28	achieved advanced aggregation algorithms also analogous analyzing andreae answer appear applications approximation arnold associated asymptotic automata bandelt bender berlin between carmel case cases charikar chekuri chen clearly close cohen colloquium colton combining compares comparing computer conclusions conference contain correlation critchlow data database denote depending desirable development diaconis different disarray discrete disjoint distance dwork edward elements equivalent evidence exact extreme fact fagin farach farchi feedback feel finding fmin footnote footrule form frequent from gibbons given graham group guarantees halfway have herscovici identical includes index inequalities inequality information institute international interpretation interval into introduced items journal kendall kmin kumar languages lecture letters life linear lists london loth maarek maps matching mathematical mathematics measure measures methods metric multiple naor natural near nice normalization normalized notes notion number obtain opposite order pages parameterized parametrized partially pattern performance possible practical preferable probability proceedings processing programming properties pruning question rank ranked real references relationships relaxing relevant report representation research retrieval robust royal same schemes section sense series shown siam sigir situations sivakumar society softer some spearman springer static statistical statistics stockmeyer streams systems there therefore these they this three thus triangle turns value values various verlag version very viewpoint vision weighting when where which wide with world would zero
http://doi.acm.org/10.1145/644108.644159	39	305	additively algorithm algorithms also among amsterdam another appl applications assuming attali aurenhammer between biology bius boissonnat boots bound bounds case cell cells chichester chiu coincides complexity comput computation computational compute computed concepts conclusion constructed constructing convex coxeter dedicata delaunay devillers diagram diagrams dimension dimensional dimensions doubly duquesne edition editors elsevier equivalence erickson federal first from geom geometriae geometric geometry gives handbook holland hull hulls image imai institute internat intersection introduction inversion invert john jorge jsrg klein linear lower modeling molecular msbius next nielsen north objects okabe optimal origin output pages paper planar point points power presented problems proc project projection properties proportional proved publishers references relations relationship rfidiger saarbriicken sack science sensitive siam single solid sons sphere spheres step subsection such suggested sugihara suitable surface swiss symposium technology tessellations then theorem theory thesis this tial tight time triangulation under unit urrutia using vorono voronoi weighted which wiley will with worst york yvinec zfirich
http://doi.acm.org/10.1145/644108.644164	43	340	affine algebraic algorithm algorithms alon also appendix apply assume because better bounds buck cases comb combinatorial combinatorica communication complete completeness comput conclude consider construction contains definition degree determined diffusers disc distinct dividing each efficient efficiently element elements equivalently every existence exists expanders explicit field find finite first focs follows from furthermore gabber galil graphs hence here however implies impossible include induction inequalities integer irreducible isoperimetric jimbo later least linear lubotzky maruoka mentioned meth milman morgenstern most multiple needed nonzero observe obtained obviously other over personal phillips polynomial polynomials positive power prime proof proofs proposition ramanujan references regular results ring rood root roots sarnak siam simple since size sized some such superconcentrators suppose that then theoret theory there this transformations unique valiant well where which with write yields
http://doi.acm.org/10.1145/644108.644242	105	813	about achieve acta active actually addison advances agarwal aiken algorithm algorithmica algorithms also among amortized analysis angular annual another answer answered appendix applications apply approach approximate approximating approximation april arguments arithmetic arya automata because been behavior bentley berg berlin between bichroto binary block blocks boca boundedo bounding bounds callahan calling cambridge canadian case cause centers chazelle classical closest colloquium column complete complexity components composite computation computational computations computer computing cone cones conference connected connection constant constructing construction contains context coordinates corresponding could create cube cutting czumaj data database dealing degree design despite diameter different dimensional dimensions discrete discuss discussion distances dynamic each easy edelsbrunner edge edges efficient efficiently elsevier emst entire eppstein equal erickson error errors estimate estimates estimating estimation euclidean european examined example extensively extrema fast faster filtering find finds fined finkel first fischer follow following forest foundations from fully functional functions gblock gbtock geometric geometry geormetric given goldreich goldwasser good gout graph graphics graphs greater greedy gudmundsson handbook harvard have having heide here hierarchical higher hoey however identical ieee image implement implemented implementing important improve improved indeed induced informatica information input international investigated january journal july june kdimensional keys know kosaraju kreveld kruskal languages lanky large later learning least lemma lemmas levcopoulos level linear logarithmic lower lueker made mafic make management many matou maximum meyer minimal minimum mitchell mjournal model most mount multidimensional multiplicative narasimhan nearest neighbor notice november number nunimum observation obtain obtained often only optimal oracle oracles oriented orthogonal others otherwise overmars pairs paper papers parameter performance perhaps play point points polylogarithmic predicate present presented press probability problem problems proceedings processing programming property provides quad quadtree queries query queryanswering randomized range raton reading real realtime references related relative relatives report reporting required requires retrieval role rourke rubinfeld running runs ruppert salowe samet scences schwarzkopf science search searching second section seidel seminal shamos short show siam sigactnews similar simplex simplify since single slam small sohler solutions some space spaces spanner spanners spanning sparse spatial spirit springer staid standard still stla storage strothmann structares structure structures studied subgraph sublinear such summarize summing support supported supporting supports survey symposium testing than that then theorem theory there therefore thesis they thin this time times tree trees trevisan triangular undirected union university used uses using vaidya verlag vertex very viable weight weights welzl wesley which whose widely willard with within worstcase zero
http://doi.acm.org/10.1145/644108.644182	57	456	aarhus above abovementioned algorithm algorithms approach bipartite bound brics checked checking chromatic coloring colourability colourable complexity computer constraint data denote department depending discrete dklrsl edge eorxiv eppstein exact faster from graph http improved independent lawler lecture lett madsen maximal mentioned most nielsen note notes number pages polynomial problem proc process proof references research running satisfaction science series sets siam size skjernaa small space springerverlag structures subgraphs symp tara theorem time university using volume whether which with worksh
http://doi.acm.org/10.1145/644108.644112	2	18	academic achlioptas aforementioned algorithm algorithmic algorithms allgemeine also amer american analysis annalen annual anonymous applications approximate approximating approximation approximations association asymptotic authoritative avner bandelt bandwidth berlin bounds bulletin cambridge carlo characterizations charikar checkers chepoi clarendon combinatorial comments completes comput computation computer computing conclude conference conn connection correctness curse cuts decisions deerwester deza dggz dick dimension dimensional dimensionality discrete discussions distortion dodis dumais eatcs editors embedding embeddings environment ergiin european event extensions fast feature feige finding finite fischer foundations frieze from furnas geom geometric geometry giesen goldreich goldwasser goswami graphs guruswami hadlock handbook happens harshman haven helpful hilbert hoffman hyperlinked ieee improved indexing indyk information into iron johnson journal july kannan karp kleinberg kluwer kobbi kortsarz kumar landauer latent laurent learning least lehman lind lindenstrauss linial lipschitz lower magen manhattan mappings math mathematische matrix matroid mcsherry menger metric metrics metrik milman modern monotonicity monte motwani nati nearest neighbors newman nissim normed november october optimization oxford oxley pages pardalos parnas polynomials press primer probability problems proceedings program proof properties property proves providence publications rabinovich raghavan rajagopalan rajasekaran random randomization randomized rank raskhodnikova rectilinear references reif rejects removing respecting reviewers robust rolim rubinfeld sahai samorodnitsky samples schechtman science selection semantic shape siam society sources space spaces spot springer springerverlag sudan symposium system testing their then theorem theoretical theory this towards trees uber uninformed university untersuchungen utilitas valuable vempala verlag viswanathan volume which with york yossef zhao
http://doi.acm.org/10.1145/644108.644132	17	130	achieved actually alexander algorithms already always annals applied arbitrarily argument automata backtracking baeza based become being binary black botmds bottom bound bounding bounds canonical care characters circles clear cmbs collation collations column combinatorial common computer conference conjecture conjectured consider construct constructed contain control convergence corner corneven could counter counting define department determine deterministic diagonally differences differs does dominated dynamic entries evidence exactly expected expezted extent figure finally first forests from fully gavald give given gray guaranteed high horizontal however implement industrial information input journal just knowledge known large larger last left length lines longest lower maintain make match matched mathematics mean method mgorithm minimized move navarro needed next note notion obtain obtained optimization options order overcounting page pages pair pairs paper particular paterson plot plotted points possible probability problem produce programmed programming propagate proven quences random rate rather reads reconstruct references regional rejects right rightmost rule same sankoff scheihing science sept sequence sequences series shown similar since society solution state states steele string strings structures subseof subsequence subsequences such suffices suggested suppose systems table technique that their themselves then theory these thesis thin this through tight trying unfortunately university upper using value values various very warwick well were what when which will with yates yields
http://doi.acm.org/10.1145/644108.644227	93	725	algorithms approximating approximation cheriyan comput computing connected cost discret edge improving matching math minimum proc references sebs siam size smallest spanning stoc subgraph subgraphs symposium szigeti theory thurimella vempala vetta
http://doi.acm.org/10.1145/644108.644144	27	205	agents alem amsterdam analysis appear approximately approximation archer auctions callaghan cave choice clarke combinatorial commerce compatible competitive conf content cramton digital econometrica economics editors efficient electronic elsevier fiat focs frugal generalized goldberg goods groves handbook hardine hartline hildrum incentive incentivecompatible incentives karlin lavi lehmann line majumdar manuscript mechanisms multieast multipart nisan online parameter path pricing public rapid references restricted revelation shoham soda spectrum stoc tardos teams telecommunications truth truthful unpublished vogelsang wright yossef
http://doi.acm.org/10.1145/644108.644120	8	76	admits algorithm apply blmy cardinality closest comp derive derived directly distance first following from graph irootst ition leading lemma logk message namely ordered output pair path pieces procedure properties references roots rounds schedule send shortest source subsection terminals their this together tree vector vertex
http://doi.acm.org/10.1145/644108.644183	58	458	algorithm also applications approximation believe better bollob colored coloring combinatorial conjecture current degenerate editors equitable equitably existence factor form graph graphs hajnal improving interested isand journal open problem proof proportional providing questions references result series szemer that theorem theory thought trees values vertex with
http://doi.acm.org/10.1145/644108.644210	80	618	actional actions adding agarwal alan alcom algointerval algorithm algorithmica algorithms allerton alon also amortization annual answered application applications april arge asano automata base basic bentley bernard boas brown capability cascading case center chazelle cheng chiang colloquium communication computation computational computer computers computing conference control daniel data december decomposable dele deletions density department derick design dietz discrete distance doing drafts dynamic earlier efficient emde erickson esprit external february fifteenth file focs foundations fractional franco fredman geometric geometry george good guibas harvard hiroshi ieee iher imai implementation indexing information ings insertions intersection intersections itai janardan january jeff jeffrey join journal july june kaas konheim kurt languages lars leonidas less letters linear list lueker maintain maintaining management march mark mathematical mehlhorn memory michael michiel minimal minimum multidimensional multivariate newsletter october operaory optimal order ordered orrthogonal orthogohal orthogonal overmars pages pankaj paper paths paul performed persistence peter point preparata press priority prob problems proceed proceedings processing program programming project queries query queue queues rajeev raman randomization range rank ravi rectangles references relational relatives report reporting research restriction review rithms roberto rodeh science sciences search searching second segment selection septem sequentially shamos shortest siam sleator smid society some space spanning sparse springer statistics stefan structrees structure structures structuring subset such symposium system systems table takao tamassia technical technique technology than that theorem theory theto this time tions transactions transdichotomous tures university using vitter volume wads willard wood workshop worst york zijlstra
http://doi.acm.org/10.1145/644108.644111	1	10	acmsiam algorithm algorithms alon annual arbitrary best blum bolts bound bradford cambridge charikar comparison competitive computer computing concluding contrast cost costs currently discrete element even fagin faster fiat finding fleischer foundations function functions gupta guruswami hartline have hong ieee information kannan kleinberg known komlos kumar letters lime lower matching maximum mohr monotone motwaniand naor nuts ostrovsky page press priced problem proceedings processing query raghavan randomized references remarks reported result rocke sahai science selection siam slrategies sorting strong structured symposium szemeredi that theory this under university unrestricted with yasuhara
http://doi.acm.org/10.1145/644108.644171	49	394	achieve algorithms allpairs almost annual apasp approximate approximation association balances baswana better between both btoc choose closure cohen computer computing connectivity data datastructures decremental deletion dependence described desired digraphs distance distances dynamic edge edges edith even factor first focs follows foundations fully halperin hariharan henzinger however improved journal king large line machinery maintain maintaining monika more noted oracles pages pairs parameter paths pick problem proceedings query rauch refer references report reporting science section separated shiloach shortest should siam simultaneously small stoc stretch structure structures suitable symposium table that then theory these thorup thus time transitive under update used valerie value vertices whereas which will zwick
http://doi.acm.org/10.1145/644108.644181	56	454	addison advanced algorithms annual application appngximation approximating automata book ceedings chefiyan colloquium combinatorialalgorithms company computer computerscience conquer cuts david directed divide dont editor foundations garg graphs hard hochbaum howard ieee international joseph karloff languages lecture mihalis multicuts multiway naveen node notes pages problems proceedings program programming publishing rabani reading references science shmoys symposium their vazirani vijay volume weighted wesley yamlakalds yuval
http://doi.acm.org/10.1145/644108.644225	91	709	acad academic acta algorithm algorithmic algorithms appl applications arikati arithmetic asteroidal berlin boland brandst classes clique comb comparability complexity comput computing connectivity coppersmith corneil cutsets decomposition decremental discr dominating dordrecht dynamic efficient fast finding finite fund gallai golumbic graph graphen graphs hayward huang hungar inst intervals journak kelly kshler lect lekkerkerker lett line linear math mathematics matrix mshring multiplication nato notes olariu order orientbare pair pairs perfect philadelphia phys press proc progressions rangan real recognizing rectangular references reidel representation rival separators siam spinrad springer star stewart survey symbolic tarjan theory thorup time transitiv triangulated triangulating triplefree triples weakly whitesides winograd without york
http://doi.acm.org/10.1145/644108.644129	15	119	aaag active aggarwal alberts algorithm algorithms almost andm angle antipolis appears applications approximating apunderstanding arbitrary area arrangements asymptotically average bajaj barequet barequetandm based belonging berg between bkos black boissonnat boissonnatand bottom bounded branching budmerice cases cell cells cheng choi christiansenand clearly close communications comp complex computation computational computer computers conf construction consuming contained contour contourdefined contours conversion coquillart correspondence counterintuitive coyle crashing crete criteria cross curve cycles data definition definitions delaunay demonstrated dennehy development diagram diagrams dickerson diff dimensional disc discrete disih displayed displays distance distation double down edges element empty entries eppstein erickson event every example examples experimental experiments extended felkel figueiredo figure figures file finding fitting forum frame framework from fuchs full fully functions ganapathy gartner geiger general generalized geometry germany good goodrich graphical graphics graphs grey guesses handles height here heuristic hogan horizontal human ieee image implemen improved improvement indeed input inria interactions interface interpolated interpolation into invoked jones journal kedem kehtarnavazand keppel ketttarnavaz last layer less line linear lines lungs medical method meyers microsoft middle modeling models more mosaics most motorcycle multilevel multiple negligible nested note novel number numbers obdrzalek objects obtained offset oliva omitted optimal other output overall overlay overmars painter pair pairwise pami paper parallel park part pattern pelvis performance perrin perspective pessimal piecewise planar play playing plexities polygon polygonal polygons polyhedral pool practically problems proc procedure processing provide proximated quadratic raising recognition reconstructed reconstruction references relations report representation required research result results ring roofs running scanners scenes schwarzkopf science search second seconds sectional sections sederberg seen semantic sensitive setting shaded shantz shape shapes shapmo sharir show shown shows siam simar similarly simple simplified since single size skeleton skeletons skinner slice slices sloan slovakia solid some sophia specific spring springer stages statistics step steps straight structure successive surface surfacer surfaces sweep swept symbolic symm syntactic syrup table taken technical technique than that their these thick thirty this three thus time times tool topology total trans triang triangles triangulated triangulation type uehm universal uselton using vankreveld verlag very view vigneron vision visual voronoi wang welzl were which while wire with wolfers zyda
http://doi.acm.org/10.1145/644108.644201	72	546	abello above acta addison advanced aggarwal algorithm algorithmica algorithms along american amortized application applications arge aspects austin based bayer below berlin blocks blogn blum borodin bound bounds brodal buffer buffers cascading case chaudhuri chazelle child comer communications comparison complexity computational computer computing constant containing cost data database databases dealing degree delayed dept described dominated down each edition editors efficient eighteenth elements european exists external factor floyd follows fractional from general geometry guibas handle handling height imply implying improved indexability indexes indexing informatica information input internal journal june kept knudsen knuth large larsen leaf lecture letters levels like logl logn logs longman lower lynch maintaining maintenance massive matches mathematical mccreight memory miltersen minimum miranker models most moved multidimensional needed node nordic notes offs only optimal ordered ordering orem organization output overflowing overflows pages pagter papers partial path pratt press principles problems proc proceedings processing programming propagated providence queries query radhakrishnan randomized range reach rebalanced rebalancing references related remaining require required result resulting rivest root samoladas scandinavian schemes science sciences search searching selected selection sept seven showing sibeyn siga sigact sigart sigmod since single society sorting space springer stacs standard stay structures structuring subtree such supporting surveys swat symposium system systems tarjan technique teenth texas that then theoretical theory there thesis this time topmost trade tree trees twodimensional ubiquitous university update updates using verlag visualization vitter volume wads wesley when whenever which will with within workshop
http://doi.acm.org/10.1145/644108.644236	100	771	adaptive admission adversarial aiello algorithm algorithms allan analysis andrews anycasting appear approach approximation arbitrary array arrays arrivals awerbuch azar balancing balter black boda borodin bounded bounding bounds brinkman broder buffer buffers butterflies cambridge case chains chaotic combinatorial combinatorica communications competitive competitve comput computation conductance congestion congestiontdilation constant contention continuous control convergence criteria deflection delays densely differentiated disjoint distributed dynamic editor efficiency embedded expanders factor fast fdilation fernandez finding flow focs frieze gallager gamarnik general generalized generalizedprocessor global graphs greedy hahne harchol http hypercubes ieee infocom integrated invited jobshop journal kamath kesselman kleinberg lapid leighton line local lotker machines maggs management mansour manuscript markov memory message methods mihail mitzenmacher models multicasting multiple nature network networking networks node note oblivious online optimal ostrovsky overflow packet palmon paper parallel parekh partridge paths patt plotkin poisson policies press proc processor proe protocols queue queuing rabani raghavan rajagopolan real references resolution results richa routing schedules scheduling scheideler schieber services shamir shared sharing shortest simple single smoothing soda spaa srinivasan stability stamoulis steps stoc strategies streams sudan sviridenko switches switching system systems tardos thank theory throughput time topology traffic transactions treatment tsitsiklis universal university upfal veres vscking williamson with wolfe yaniv
http://doi.acm.org/10.1145/644108.644219	87	679	adjacency adler algorithms alpert analysis applications applied approach approximate approximation archive array auto balanced bell benchmark best better between bits blandford blelloch both bounded broder bureau canonical census chiang chuang circuit codeword collective communications compact compressing compression computer computing conference connectivity contest creating critical data depth design direct discrete dissection document download drawing dynamics edge edgebreaker efficient elias encoding encodings fast feocean figure file first flow focs fogs garg general generalized genus gigabytes google googlei googleo graph graphics graphs high html http ibml ieee includes index indexing information ings integers international internet into irregular ispd jacobson journal karypis kaufman keeler kumar lecture leighton likely line linear lipton list lists litow lncs lucent maghoul managing maps march mathematics maxflow meshes methodology mfcs miller mitzenmacher moffat morgan multicommodity multilevel multiple munro naor nature nearest neighbor nested networks notes number numerical optimal order ordering orderings orderly otherwise overall packings page pages parentheses part partitioning performance physical planar present problems programming project quality raghavan rajagopalan raman references reordering report representation representations results rose rossignac scan scheme science search seconds seems semi separator separators sets shaw short siam small soda space spanning sphere springer stata static strogatz structural structure succinct suel suite summarizes symposium table tables tarjan technical teng theorem theoretically theory through thurston tiger tigerua time tomkins torwards tradeoff transactions trees triangle uniform universal unlabeled vavasis verlag visualization volume walshaw watts westbrook when wiener with witten workshop world yuan
http://doi.acm.org/10.1145/644108.644158	38	295	adjacent aius always analy angle appendix application assume assuming ated ball between bisector borouchaki bounded cait calf called center centered cheng choices claim clearly clit cohen comput condition conforming consecutive consider constant constants contradiction contrary control cover created creation ctit definition delaunay denote discrete distance does dsin dsmq edelsbrunner edge element elements equivalent exudation facello fact facts finite first follows former from gable generating geom george given graded guarantee have hence hermes holds hole however html implies implying impos inequality infinitely intersect intersecting intersects into itsino larger launay least lernma less lies line lines manuscript many maximized meshes meshing method midpoint miller minimum most mount murphy next note numer observe onal orthog orthogonal orthogonality otherwise outside overlapping placement plane point poon proc proof protecting prove quality radii radius ratio reach references refinement respectively right ring rrit same satisfied scheng separated shaped show siam sible since sliver some sphere spheres split stants steiner strategy substituting such suffices suppose sympos take talmor tecting teng terminate tetrahedralization than that then there therefore this thus touches triangle triangulation triangulations true using verdiere verify volume walkington weighteddelaunay well when whenever where which width with yields yvinec
http://doi.acm.org/10.1145/644108.644169	47	374	absorb acta actually adapt adapted addison adel adjusting adjustment algorithm algorithmica algorithms allow allows along already also although amortized analysis analyzed annual appear appendix applications aragon architectures ascend assumes atlas auxiliary available avoid balanced bayer been between bigger binary booth bound bounds break brief brodal brown capability carefully case catenable catenating catenations cell cells changes cmucs code cole college comes compact comparison complete completerightleftspine computer computing concision conjecture constant constraint contains control cookbook courant cstr data database degree deletions demonstrated descend descending design designed details dichromatic discrete discussion dissection documented doubled doubly during dynamic earch edition efficiently ejficient element else ended example exception existing explicitly extend extendrightlefts extendrightleftspine extra fact fast fetching finally finger forward forwardfingersearci forwards forwardsubtreesearch foundations framework froit from front fronw functional graphs guibas hall hand handle handling hands have here heterogeneous hopcroft however huddleston ieee iflrps iflrpsl implementation improve improvement includes increment indexes indicates informatica information inforrnatica insertion insertions instances instead institute into invariants inverted involved irpsl join joins journal just kaplan knuth kosaraju landis large left linear list lists lncs localized logarithmic logd maintenance makedeque many maryland mathematics mccreight mehlhorn mentioned merging modern modified most much multiple next nloglogn node nodes note number obtaininitfinger offset only operation operations optimal ordered organization other ours overhead overmars pages paper parent park part particular performance pine plass pointed pointer pointing polygon position possible power prentice prepend present presented preserving previous princeton proc process proe programming proof propagation property proven provide pseudo pugh purely push pusn pusr queues rain randomized rather realized reassembling recent redundancy reference references reflect relax relaxing report representation representations represented representing require rest restore return right roberts root rootedsearch rpsl science search searches searching section sections sedgewick seidel self showed shown siam similarly simple simply since size skii skip sleator slight smaller some sorted sorting soviet space spine spines splay split splits splitting springer springerverlag storage store storing straightforward structual structural structure structures suitable support symposium tarjan technical technique than that their then theory there these thesis they this thus time tree trees triangulating tsakalidis turn ubtrees ubtreesearch ullman under university updated upon used uses using utilize verlag view volume wesley when which while will with works worst worstcase written yjeft york
http://doi.acm.org/10.1145/644108.644149	31	243	adapted advances algorithm algorithms alon analysis annual appear applications applied approximate approximating approximation asilomar atomic atoms based basis baut best candes chen coifman complexity comput computational computers computing conference constructive daubechies decomposition dept dictionaries dimensional donoho editors efficient entropy fast fitting frequency function greedy hardness harmonic high http ieee jcss krishnaprasad kushilevitz lars lectures lnfform mallat march matching math matins methods moments multiresolution nearest neighbor nisan nonlinear orthogonal ostrovsky pages pati philadelphia press proc proceedings processing pursuit pursuits rabani rabut randomness recursive redundant references regard rezaiifar ridgelets saunders schumaker search selection siam signal signals space spaces stanford stastistics stoc surface system systems szegedy temlyakov term terra theory thesis thiele tilings time timefrequency trans transactions university vanderbilt villemoes walsh wavelet wavelets wickerhauser wigderson with zhang
http://doi.acm.org/10.1145/644108.644218	86	670	account actual after algorithm along amortized analnications analogously analysis andrew appear applying arbitrary assoc assuming case cases causing child choose choosing chunks commufor comput computer computing conclude consider contribution cost data definition delete deletion denote denotes dictionary difference discuss each empty evaluate fast finally first focs following follows foundations franceschini frederickson from generality gianni gives giving greg grossi have heapsort hendra here heuristics hypothesis ieee implicit increase initial insert insertion inserts intermediate into ivir journal keys lact leaf level linda lognloglogn loss mach maximal modified munro negative node nodes number observe ogous operation operations order organizing pagli path possible potential present problem produced proof prove references rest resulting results roberto science sciences search section self sequence should siam since situation sorted split splits splitting stop structure structures suitably supportof suppose suwanda symposium system tables taking that them this time treated trees update what where williams with without
http://doi.acm.org/10.1145/644108.644208	78	599	able acknowledgements adding addition additional again aleksandrov algorithm algorithmic algorithmica algorithms always apex applications applied approximation april archive arxiv assoc baker based biconnectivity bonnington bound bounded breadth canonical case ccrsuch characteristic choice choose citations classical closed combinatorial compgeom complete complexity comput computational computb computing conclusions connectivity constant constructing construction cotree cutset cutting cylinder data decomposition decompositions depend described deterministic diameter disconnected discrete disjoint disk djidjev dover dynamic each edge edges edition efficient efickson embedded embedding embedexcludes encoded eppstein exclude excluded excludes existence explicit faces factor families family february find first forest form forming found foundations from fully function further galil general generalized generally genus geometry given graduate grant graph graphs grohe gross group grows guarantee half have henzinger holm however htmi html http implemented implicitly important improved incident incorporated input instance interesting into isomorphism italiano january jeffe july june king lemrna letting lichtenberg linear lins lipton little local logarithmic loop loops mach maintaining maintenance make many maps march math mathematics method methods minimum minor minors more most near need nhristo node note number observations only operation optimal optimally order orientable other others overall packings papers part particular partitioning paths peled planar planarity poly polylogarithmic previous print problems proc proceedings produces proof properties prove publications pubs randomized rapidly reduce references related relies removed removing represent representation representing research result resulting results schema sciences sense separator separators sets several showed showing shown siam since size sleator small solutions some spanning sparsification special spencer spfinger spielman springer stillwell structure subgraph subgraphs such supported suppose surface surfaces symp syrup systems tamassia tarjan tatjan teng term testing texts that them then theorem theory there these this thorup tighter time toms topological topology tree treeour treereduced trees treewidth tucker uiuc union used vedag vegter verlag vertices warwick were westbrook which width with work would yung
http://doi.acm.org/10.1145/644108.644197	69	527	academic alexander algorithm algorithmic algorithmica algorithms alistair alon andr andrzej annpam annual anupam appear application applications approximate approximating approximation approximations arbitrary arboretum ashish aspects assoc aumann awerbuch azar baker bartal baruch berlin bernhard bienstock bodlaender bound bounded bourgain brenda bulk certain chandra characterization charikar chekuri circle circuits clyde combin combinatorial combinatorica competitive complete complexity comput computational computer computerscience computing concurrent conf connected conquer cuts daniel david design deterministic deza diestel discrete distance distortion divide dorit douglas editor editors embedding embeddings eran euclidean farhad february finite flow flows foundations frank game garg geometric geometry goel goran graph graphs group guha gupta halin hall hans hard haruko help hilbert hochbaum homotopic ieee ilan indyk into introduction israel jean jifi jiirgen journal karp khauna konjevod korte kserver laurent layout lectures lhszl linial lipschitz london lower mach maciej manuscript marie mathematics mato matula maximum measures median methods metric metrics michael michel minimally minimize minors monique monma moses motwani multicommodity nathan naveen neil network newman nodes noga notes number okamura oxford packing pages partial paths paul peleg philadelphia piotr planar plotkin polylogarithmic preliminary prentice preserving press prismel probabilistic problem problems proc proceedings proskurowski ptas publishing rabani rabinovich rajeev ravi really references reirthard richard river robertson rounding routing saddle saks sanjeev satish schrijver science serge series seymour shahrokhi shmoys siam sinclair small smel sndipto some space spaces spfinger springer springerverlag steiner studies sudipto survey symposium syntactic syslo their theorem theoretic theoretical theory towards tree trees treewidth twentyeighth unpublished upper verlag version vlsi volume welsh west width with yair yonatan york yossi yuri yuval