http://www.informatik.uni-trier.de/~ley/db/conf/soda/soda2007.html
SODA 2007
http://doi.acm.org/10.1145/1283383.1283496	111	A Rigorous Analysis of Population Stratification with Limited Data.	achlioptas acknowledgements after aggregating agreements ailon algorithm algorithms alkes always analysis andrew anne annealing annual anthony arbitrary arora asso assume average avrim bansal bisection bisections blum boppana breaking canny carnegie carson case charikar chawla ciation cience classification classified classify climbing cluster clustering collab commerce comp computer computing concentration concepts condon conference constant contains convergent correctly corrects correlation croft dasgupta data david defer dekel delightful dels development dification discussions disjoint distributions donnelly draft dubhashi each ectral edges eigenvalues electronic every examine factor filtering finds first focs following foundations frank from full gaussians genetics genome genotyp given graph graphs gregory guruswami have heavy here high hill ideas ieee imbalance impagliazzo inconsistent increases increasing inference information international iteration iteratively jagopalan jerrum john jority july june kannan karp kleinb kumar learning least lemma many mark maximizing mcsherry measure mellon michael mixture mixtures moses most multilo nancy nature neighbors newman next nick node nodes note onents opulation orative pages panconesi paper partition partitioning partitions paths patterson place planted plenge prabhakar previous price principal pritchard privacy probabilistic probability problems proc proceedings produce programming proof qualitative raghavan random randomised ranking ravi reclassify recommendation references reich remaining research retrieval richard round rounds routing russell sandler science second semidefinite shadick shamir sharan shows shuheng side sigir similar simulated since soda sorkin sridhar start starts stephens stratification structure structures studies suppose swamy symposium systems tailed thanks that then theoretic theory thesis this ties tomkins topic tsur unexamined university uses using vempala venkatesan version very wang weinblatt when where wide wirth with workshop zhou
http://doi.acm.org/10.1145/1283383.1283386	2	Optimal dynamic vertical ray shooting in rectilinear planar subdivisions.	agarwal algorithm algorithmica algorithms amortization annual applications approach arge assumption aviv baumgarten belong boas bounds brodal buchsbaum cading case cation chan cheng chiang computation computational computer computing constant control data deletions demaine density dept design diagrams dietz different dimensional discrete divisions doing dynamic dynamization each efficient eliminating emde endpoints exists external ezoid fine focs forest foundations fractional fredman fully general geometry georgiadis giyora good goodrich grid guaranteed have horizontal iacono ieee implementation implementations improved information insertions international intersection interval israel janardan journal jung kaas kaplan langerman layes less letters line linear location logarithmic machine management maps master mathematical maxima mehlhorn memory method mihai minimum model molad monotone mortensen naher necessarily number oint open operations optimal order ordered orting other oting pages paper papers paths patrascu persistence planar point pointer preparata present presented preserving press priorities priority problem proc processing query question queue raman randomization range recent rectangular rectilinear references response results retroactive rochester science sciences segment segments sequencially shooting shortest siam slope slopes small soda solution space spanning stabbing static still stoc structure structures sublogarithmic supports symposium system systems tamassia tarjan than that theoretical theory there thesis this threedimensional time timothy transdichotomous trap trees under unified university used vertical vitter voronoi where whether willard with works worst zijlstra
http://doi.acm.org/10.1145/1283383.1283500	115	Geometric and Topological Guarantees for the Wrap Reconstruction Algorithm	absolute abstract account algebraic algorithm algorithms amenta analogous analysis appear appears applications approximation argument assumption axis balls based bern better boissonnat both boundary bounded cambridge cazals chapter choi circumradius close combinatorial complex complexs computational computeraided conclusions conv critical crust currently curve curves daniel data delaunay depends described design dimensions direction discrete distance done edelsbrunner edition editors effective effort embedded enclosed enough eppstein epsilon equivalent even every example extended fact federal filtering finite fixed flat flow found from full functions further general generalize geometric geometrically geometry giesen goodman graphical grove guaranteed guarantees handbook hatcher have higher homeomorphic homotopy however image institute international interpolation intersects jean john journal known kolluri kumar leekha less lies lieutier manages manifold manifolds mathematical mathematics medial modeling models monique more move much natural needed neighbour open output pages particular point points possible power press processing produces proof provable prove proven pure ramos reconstruction references relative relies remains removing required requires resolving restrictive result results rourke sadri same sample sampling says second sets shape showing similar simple simplices skeleton small smooth soda space springer structure subset surface surfaces swiss symposia symposium technology teillaud than that then theorem theory thesis this topolgical topologically topology transform triangle triangulation type unclear under understanding uniform unions university unstable variant verlag version very voronoi weighted what whether which with within work wrap wrapping zurich
http://doi.acm.org/10.1145/1283383.1283465	80	Approximate Shortest Paths in Anisotropic Regions	abvd again aleksandrov algorithmica algorithms along american annual approximate approximating approximation around automation axis balls based below berlin bound burago case charge chew complex computational computing conclusion conference consecutive convex cost course critical degenerate delimited denote determining diagrams different differential dimensional direction directly distance division does dover dyrsdale ectifiable edge edges editors ellipses elsevier embedded eneralize energy entry ethz even example exit faces figure finding fixed flows follows formed from functions generalize geometric geometry given goes graduate graphs guggenheimer handbook have however ieee infinity inherited integer interior international intersects introduction ivanov journal know lang lanthier lecture left lemma length linear link links maheshwari math mathematical mathematics metric minimizing mitchell most movement network nishizeki node nodes notes number olyhedral optimal optimization order other outside over pages pair papadimitriou path paths planar planning point preparata presence presented problem problems proc proof properly redundant references reflective region regions reif respecting right robotics sack section sellen shamos shortest show simplicial slide society spaces springer studies subdivisions subpath such summing surfaces symposium take terrain terrains than that then theorem theory there through thus times transactions transversal triangles turn types unit urrutia vertex vertices volume voronoi weighted well when where
http://doi.acm.org/10.1145/1283383.1283457	72	A simple storage scheme for strings achieving entropy bounds	above according accounts achieve achieves acmsiam actually additionally additive after algorithm altos analysis applications approach april arithmetic attainable barbay because being bell binary bits block blocking blocks boosting bound bounded bounding bounds burrows bzip chile class close coding completeness compressed compresses compressing compression compressors compute computer conclusions consideration considerations constant context contexts corporation cost count data decode decoding deeply denote dept dictionaries digital distinguish divided documents does dominates drives each easy edition effective either encoder encoders encoding encodings enough entropy equipment every explicitly exposition family ferragina find first frequencies from full future giancarlo gigabytes given golynski gonz grossi group gupta have hence here high icalp identifies ieee illustrated images improvement increases indexable indexed indexes indexing individual individually information interesting into jansson journal kary kaufmann kinen known labeled lempel length linear lncs locate longer lossless lower machinery managing many manzini miltersen modeler moffat more morgan most multi multisets munro namely navarro needed notation note number observe obtain occupancy occurrence occurs optimal order ordered other over pair paper passes point possible practice preceding problem procs proof proposed publishers query raman range rank references refers related relations remaining report representation represented represents research result results room sadakane same scheme science sciortino second section select selection semi semistatic sequences show showing shown siam simplification since size small soda solution solutions sophisticated sorting space squeezing srinivasa stated static statistical storage storing string strings structures successful succinct summation summing sung supporting symbol symbols table tables technical term terms text textual than that their then theory there therefore therein think this time times transaction transform trees turn ultrasuccinct uniquely university unlike upper usable uses using usually variable vein vitter volume well wheeler whenever where which whole with within without witten written
http://doi.acm.org/10.1145/1283383.1283499	114	Reconstruction Using Witness Complexes	acknowledgements algorithm algorithms amenta amer annu application applications approximation attali authors available axis based bern boissonnat boundaries bourgogne carlsson cazals chazal cheng chew choi clarkson clouds cohen compact complexes comptop comput computational computers computing conditioning confidence coordinates curvature curve curved darpa darrell data december definition delaunay diagrams dimension dimensionality dimensions discrete distance edelsbrunner editors einheitskreisscheibe element embedding engineering estimation euclidean feature federer figueiredo filtering finding found framework from function funke gelegenen generation geom geometric geometry giesen given global golin good goswami graham grant grants graphical graphics guaranteed guaranteeing harer high homeomorphic homology html http ideas ieee indyk inria institut internat interpolation invited issue journal july kolluri kumar langford learning least leekha letscher lieutier linear lipschitz locally manifold math matiques measures mederos medial mesh meshing methods metric mileyko mindestabstand minimum models monthly moving nachr natural nearest neighbor niyogi noisy nonlinear november october oudot pages papers partially persistence persistent pirl point pointbased points poon practice preparation preprint preprints press problem proc processing provable provably published punkten quality ramos random reconstruction reduction references report research rineau roundtable roweis samples sampling saul science searching separation sept september sets shakhnarovich shape shewchuk short siam silva simple simplification size smale solids solution space special squares stability stanford steiner submanifolds support surface surfaces survey sympos symposium technical tenenbaum thank theory topological topology trans triangulation triangulations using velho vision volumes voronoi weak weinberger what wish with witness witnesses yvinec zhao zomorodian
http://doi.acm.org/10.1145/1283383.1283484	99	Optimal Scale-free Compact Routing Schemes in Networks of Low Doubling Dimension 	abraham achieved algorithms allow annual appear applications approach approaches approximate architecture asymptotically available aware awerbuch balakrishnan better bounded bounds bypassing chan chord column communication compact computer computing conference constant cowen data destination dhts digraphs dimension dimensional discret discrete distance distances distortion distributed dobzinski doubling eilam embedding embeddings estimation even factor foundations fractals fraction fraigniaud gavoille general genus geometries goldberg graphs growth gupta hanusse have hierarchical http icalp icdcs ieee improved incur independent international internet ject journal july kaashoek karger konjevod krauthgamer land large lecture lncs locality localized location lookup lower maggs main malkhi manuscript math mathematics memory metrics minimum monographs morris name nameindependent neighbors networks news node nodes notes offs open optimal oracles overview pages pairs papers paral partitions path peer peleg philadelphia planar polynomial press principles problem problems proceeding proceedings reachability references relaxed require richa rings routing scalable schemes science sensitive separators service siam sigact sigcomm since slack slivkins small society source space spacestretch sparse springer stoica stretch structures symposium tables talwar theory thorup thrackle trade trees triangulation upper using version volume with zhou zwick
http://doi.acm.org/10.1145/1283383.1283391	7	Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems	agarwal algorithmica algorithms almost analyzing annual applications approximating approximation assignment assignments austrin automata available balanced charikar colloquium combinatorial computer computing conference core csps deletion dicut directed discussion donnell eccc erations extending factor feige finding foundations games goemans gowers grothendieck hardest hast html ieee improved inapproximability inequality influence integer international ipco israel japan journal kcsp khot kindler languages lewin linear livnat makarychev manuscript march matsui matuura maximizing maximum might mossel nesterov nonconvex online optimal optimization osium other outperforming papers paral pcps positive power problems proceedings programming programs proof prover quadratic quality random references relaxation research results round rounding samorodnitsky satisfiability satisfying science semidefinite society some stad symp systems techniques theory trevisan uncut uniformity unique using value variable variables williamson wirth with zwick
http://doi.acm.org/10.1145/1283383.1283469	84	Speed Scaling for Weighted Flow Time	active adversarial adversary after albers alberto algorithm algorithmic algorithms alive allocate allocated allocating alper also always appear approximate approximation architectural architectures area argue arrivals arrive assume aware bansal basically batch batches becchetti before best blmsp blocks bose bound bounding bounds brooks budget bunde buyuktosunoglu calculations cambridge challenges choice choosing class classic clearly combinatorial competitive computer consider constant constraint constraints construction contain continuous contradiction cook corollary could dates david deadline define demers denominator derive describing design desired divide divided does dynamic each easily eliminate energy energyefficient entire equal equation equivalent erating error even expended fact factor facts finally finish finished first fixed flow following follows found foundations fraction fractional from fujiwara function future generally generate generation gerhard getting give given guarantee gupta hans happens hardy have hiroshi ideas ieee implies impossible increasing inequalities inequality input instances integral into inverse irani jacobson ject jobs john kimbrel kirk know known knows kudva labetoulle large last lawler least lecture lemma lenstra leonardi less line literature littlewood lllk lower luca machines makespan manage management manish marchetti micro microarchitecture microprocessors minimization minimize minimizing model modeling more moreover motivates mudge must negligible news next nikhil note notes number objective obtain obtaining online only optimal optimization optimizes over page pages paral patchrawat peter plugging plus polya power poweraware prabhakar pradip precedence preemptive press problem problems proceedings progress proof pruhs pvsu ratio real reals records reduced references regrouping release researchers respect response result results rinnooy running runs same sandy scaling scandanavian scheduling schuster science section seeing selection shenker should show shown sigact simulate since sketch some spaccamela speed stacs stanley stee stefano strategy strictly subproblem such susanne symposium syposium takes tasks technical temperature term terms than that then theorem theory there these this thus time times together total tracy trevor under unfinished uniform unit university used uses using uthaisombut valued values victor volume weight weighted wellman were what when whenever where which will with within without woeginger work workshop would young your zyuban
http://doi.acm.org/10.1145/1283383.1283489	104	Finding a Heaviest Triangle is not Harder than Matrix Multiplication	about acknowledgments acyclic algorithm algorithms allpairs alon also ancestor ancestors annals annual another appear applications arbitrarily arises arithmetic asymptotically authors automata bits book boston bound bounds chosen circuit clique cliques coding cohn colloquium color comments common company complexity computation computer computing consequently constant contains coppersmith cormen could czumaj decomposition denotes detecting determining devoted difficult dilworth directed discussion edges edition every example existence exponent extension facts fast faster fastest final finding fixed focs foundations from generalize generally given graph graphs grateful greater grouptheoretic have hence hill huang icalp ieee improve improved include induced input international introduction isomorphic issue itai january journal july kleinberg kowaluk languages leiserson lingas lowest manuscript mathematics matrix maximum maximumweight mcgraw merging method minimum more multiplication multiplications natural note number numerical optimal ordered other paper papers partially particular pointing positive possible precision prior problem problems proceedings programming progression queries question randomized real rectangular referee references related remarks result results revisited rivest rodeh running runtime science section selected sets shown siam size small smallest solve some source special stein stoc stronger subgraph subgraphs substantially subsumes summary symbolic symposium szegedy table than that theorem theoretical theory therefore this time triangle umans unknown upper useful using values vassilevska vertex vertices weight weighted where whether williams winograd with yuster zwick
http://doi.acm.org/10.1145/1283383.1283462	77	Designing And Learning Optimal Finite Support Auctions	academic acknowledgments acmsiam adaptive aggarwal algorithm algorithms also amit anisov annual anonymous answer applicable approximating asokan assuming auction auctions author balcan based bayesian bergemann best bidders bidding blum bounds bulow case characterize cheng class classes clear clearly combinatorial comments commerce competitive computation computational computer conference considering containing counterspeculation cremer cryptography curve cussion demand dependencies design designing developed digital dimacs discrete discussions distributions dominant earlier econometrica economics economy electronic elkind enough existence expected extract extraction fiat finance financial finding finite foundation foundations framework full general generalization generalized goldberg goods hajiaghayi hand hardness hartline here hildrum hope however ieee incentivecompatible independent individually information interesting intuition investigating issues izmalkov ject joint journal karlin kleinberg knapsack knowing krishna kumar latter learning leighton like limit limited lipmaa lower machine mansour mathematics mclean mechanism might model more multi myerson naor near niemi note ongoing online open operations optimal oracle order other pages paper papers parkes paul pesendorfer pinkas political polynomial positive post postedprice precluded preserving press princeton privacy problem proceedings properties propose prove proved provide rational referees references regret research restricted result results revenue roberts ronen rudra saberi sahai scenario science sealed search secure sergei show siam simple since solution space special steiglitz strategy strong structures suggests sumner supply support surplus symposium techniques tenders thank that their theory thesis they this threshold time topic trust unit univers university useful valuations value version vickrey when whether while will with without work working workshop would wright yale yossef
http://doi.acm.org/10.1145/1283383.1283427	43	Aggregation of Partial Rankings, p-Ratings and Top-m Lists	acad acknowledgements adjacency agarwal aggregating aggregation ailon alantha algebraic algorithm algorithms alon american amit analyse annual application approach arnold arnon arrow artificial aslam association austin automate baltimore based basic berlin blaisdell borda cambridge charikar chien choice cisions classification closed cluster clustering collins comparing complexity computer computing condorcet conference conjectures consensus copp coppersmith correlation criteria cylindrical cynthia daedalus data database decomp diaconis diego dimensional disarray discrete discussions dissertation done dwork earman edward efficient elections elimination engineering enlightening ensembles ersmith essai evaluation fagin feedback fields filkov fitting fleischer focs footrule formal foundations fourteenth fullrankings fusion generalized gibb gionis gives good graham hands hierarchical high histoire hodge hong icde ictai ieee important improved inconsistent individual information integrating intel international jective john journal kemeny kendall klima know kong kumar kunal languages lections lecture ledge ligence like lists london mahdian management mannila manuscript mathematical mathematics mccallum measure medians methods metrics microarray mining models moire montague moses naor newman nice notes numb optimal ordering osition pages partial phylogeny plane pluralit pods predd press princeton principles probabilit proceedings proofs quantifier rand rank ranking rankings real recent references relating relations relationship rendues report reprinted resenhas result retrieval revisited royal royale rudra sacramento science sciences score scrutin search seffi series siam sigmod similarity sivakumar skiena snell social society soda somehow sons springer statistical steve stoc strehl symposium systems talwar technical tenth texas thank theory this ties tokyo tools tournaments tournamnets tree tsaparas university values verlag voix volume voting wakabayashi weighted well wide wiley wins with without world would york
http://doi.acm.org/10.1145/1283383.1283493	108	Combinatorial Algorithms for Web Search Engines - Three Success Stories	accurate algorithms american anatomy annual approximation authoritative berkhin brin broder building center charikar clustering clusters commerce complexity compression computing conference congress containment copy data databases davis detection development digital document documents duetting duplicate electronic engine environment estimation evaluation evolution fetterly file files finding fingerprinting from garcia glassman goemans harvard heintze henzinger hyperlinked hypertextual improved information international internet jacm jork kleinberg large latin libraries management manasse manber mathematics maximum mechanism mechanisms molina near nearreplicas notes osium page pagerank pages personalized polynomials practice problems proc programming rabin random references report research resemblance retrieval rounding satisfiability scalable scale scaling scam search semidefinite sequences shivakumar sigmod similar similarity sources survey symp syntactic system technical techniques technology theory university usenix using wide widom williamson winter workshop world zweig
http://doi.acm.org/10.1145/1283383.1283481	96	A Faster Cache-Oblivious Shortest-Path Algorithm for Undirected Graphs with Bounded Edge Lengths	acmsiam additions aggarwal algorithm algorithms annual applications architectures arge automata bender breadth brodal buffer cache cacheoblivious cacheobliviousness chiang chowdhury colloquium communications comparisons complexity computation computer computing connection data demaine dijkstra discrete distributed edge efficient european external externalmemory fagerb faster first floats foundations frigo funnel goodrich graph graphs grove heap hollandminkley ieee improved input integer integers international jampala january journal klein kumar languages lecture leiserson lengths limits linear mathematics mehlhorn memory meyer multi munagala munro note notes numerical oblivious octob ositive ounded output pages paral parallelism path paths pettie planar priority problems proceedings processing programming prokop queue ramachandran ranade rauch references related scandinavian schwab science sciences search separation septemb shortest siam single solving sorting source springer springerverlag sssp structures sublinear subramanian symposium system tamassia theory thorup time toma undirected using vengroff verlag vitter volume weights with workshop
http://doi.acm.org/10.1145/1283383.1283512	127	Harmonic algorithm for 3-Dimensional Strip Packing Problem	algorithm algorithmica algorithms analogous analysis appear approximation assoc asymptotic baker bansal based been berlin better bins bound bounds caprara cheng coffman combination combinatorial combinatorica combining comput computer computing concluding configuration constant correa cubes cutting designed dimensional dimensions discrete each efficient epsilon fernandez finally florida focs foundations from garey generalize guarantee harmonic harmony heuristic ieee improved inapproximability informatics jansen january johnson journal karmarkar karp kenyon latin lecture level line linear lower lueker mach math mathematics meir miami mila miyazawa moser multidimensional multiple natural near note notes oper operations optimal oriented orthogonal packing packings paper performance polynomial problem problems proceeding proceedings provides randomized recently references remarks research results rivest rotations rounding scheme schemes science seem siam similar simple since soda solis solution solved springer squares step stock strip sviridenko symposium takes tarjan techniques that theoretical theory this three time vega wakabayashi want while with within
http://doi.acm.org/10.1145/1283383.1283445	60	Ultra-succinct Representation of Ordered Trees	acmsiam algorithm algorithmica algorithms alphanumeric also ancestor applications aray arrays august balanced bender benoit beyond binary bounds cambridge chiang children chile cocoon coded codeword colton comb complex compressed compression computed computer computing concluding conference constant construction data definition degree demaine dept depth dfuds dictionaries done each economical efficient elias emis encoding entropy farach ferragina finding focs foundations fsttcs full functionalities functionality functions fundamental further geary given gnavarro graphs grossi gupta gusfield have having high higher html http icalp ieee improvements indexable indexes indexing inform information integers into isaac jacobson journal journals kinen kosara labeled lempel letters level lncs lothar luccio manzini march matches matching mccreight morrison multisets munro muthukrishnan natural navarro nearest node nodes number offs open operation opportunistic optimal order ordered orderly ordinal pages pagh paper parentheses partial patricia poon practical press problem proc proceedings processing proding proposed queries query rahman raman range reduce redundancy references remarks report representation representations representing retrieve right rote sadakane same science searchable semin sequences sets showed siam simple simplified size soda software space spanning squeezing srinivasa static storing string strings structure structures structuring succinct succinctness such suffix sums sung support systems tables technical technology text texts theoretical theory this time topology trade trans tree trees uchile univ universal university users venkatesh vitter which whose with wpapers
http://doi.acm.org/10.1145/1283383.1283479	94	Multiple Choice Tries and Distributed Hash Tables	aarhus abraham abstract acad academiae acta addison addressable adler advances adversarial algorithm algorithmica algorithms allocation allocations alphanumeric amsterdam anal analysis anced annals applications applied approach architectures area assigned assigning assumes asymmetric asymptotical average away awerbuch azar balakrishnan balance balanced balancing balof bartal bawa beach berlin binary bondy bounded brics broder building butterfly caap case castro characterization choice choie class coded coffman communications comptes computational computer computing concerning conclusion conservatively constant content continuous coop correspondence cuckoo czuma data deal define defined deheuvels department depth depths devroye digital dimension discrete distance distributed distributions division dyadic dynamic each edited emulation entropy erating erative ercub erds erin estimate etween extend extended external factor fields figure file fill finally five focs following foundations four fourth franchizannettacci francis fredkin from full functions further gebiete generic given gnier graph greedy growing growth hall halp handley harder hasard hash hashing have height hellerstein here heuristic holland however hungarica ieee implies indexing industrial inequalities information insertion internal international internet interp interval intervals ipdps iptps iris ithaca iting jacquet jczak journal kaashoek karger karlin karp knows knuth konheim lands large laws leaf leaves lecture left leftmost less level lime limiting load london looking lugosi malkhi management manku manner mass math mathematica mathematical mathematics maximum memory metho miami morris morrison multiple murty naor national network networks newman node nodes normally north note notes novak novel numb numo octob oint oints only osium over overlay oxes pagh paper parallel parallelism paris park paro part partition partitioning path patricia pavlov peer peerh peering philadelphia pittel podc points practical prefix preprint principles probabile probability problems proceedings process processes processing programming proof proposed prove providers pyke raghavan ramabhadran random randomized rata ratnasamy read reading references related relationships rendus renesse replacing representatives respect result results retrieve right rodler root royal ruhl runs scalable scenarios scheme science search searching segment sequences series shaded shenker shown siam sigcomm since size small society some sorting sosp spaa spacings springer standard statistical stemann stheorie stoc stochastic stoica storage string strings structure structures student subsets successful sums symp symphony systems szpankowski tables tail tarjan technical technologies tending than that then theorem theoretical theory this throughout thus tial together transactions tree trees trie tries unit university unknown upfal usenix using usits vazirani verlag version verwandte viceroy viewp wahrscheinlichkeit walfish well wesley when where while wide wieder will with within workshop world york zeitschrift
http://doi.acm.org/10.1145/1283383.1283486	101	Network Sketching or: "How Much Geometry Hides in Connectivity? ­ Part II"	aaron about algorithms algosensors allows andrew angle annual anxiao appear applications appropriate approximation average based become been before believe between beyond both bottom bound boundaries boundary bruck buschmann carlsson challenging chapman choice christian communication communications complexes computational computing conf conference connection connectivity constant controlled coordinate coordinates course coverage cycles december degree dell dense density detection determined deterministic diagram dial dialm dimensionality direction discrete discussion disk distortion distributed does effect eighteenth embedding embeddings erwig estimation euclidean exact explicitly explored extract extraction fabian fact fang fekete fifteenth figure fischer framework free funke general geographic geometric geometry ghrist gives glider global gpsr gradient graph graphics graphs greedy guibas gunnar hall hard have hides hold hole holes homology ieee ilan indistinguishable infocom information interesting international into jehoshua jiang john joseph josh journal june karp klein kuhn kung landmark landmarks langford large larger lead left like ller local localization location lower many martin methods metrics middle mitchell mobicom mobihoc mobile moscibroda much multidimensional neighborhood network networking networks newman nodes nonlinear pages papadimitriou paper papers part perimeter pfisterer planar point pomc poor positions preserving press problem problems proc proceedings proximity rabinovich ratnasamy recognition recover reduction references relations relative research results right rise robert robotics routing ruled satish scaling science second sensor september shenker show shown silva small smaller society soda solved space sparse stateless stefan still stoica symposium techniques tenenbaum that there this tight topological topology twenty ultimately underlying unfortunately unit used using varying very virtual volume voronoi wang wattenhofer while wireless with without witness workshop would york yuri zhang zollinger
http://doi.acm.org/10.1145/1283383.1283411	27	Minimizing Movement	about acmsiam additive advanced aerial alan alexander algorithm algorithmic algorithms also analysis andre andy annual another applications approximating approximation approximations architectures arkin ashish automata automation autonomous awakening bdhr behavioral bender bereg bernard best better between binhai boissonnat both bounds bredin broadcasting burdick california cambridge cannot capacity category cfkr champaign chandra changes charikar chekuri cheung china cimikowski circles circular claude client clients cohen collocated communicate compared computation computational computer computing conference connected connectivity consider constrained control corke daniela december demaine deploying deployment diego difficult directed discrete dispersing distance distributed doddi dominating dongdong douglas each edges editors either environments erik esther euclidean even every example existence experimental extended facility factor fault fekete fields figure fixed flying foundations fraigniaud framework francisco frank freeze from general generalizations geometry ghmm ghodsi given goel goldberg good gossiping graph graphs guaranteed guha hajiaghayi hall heuristics hong hongyan hrabar hsiang http hutchinson ieee illinois improved inapproximability include indmax induced information intelligent interesting international into introduces introduction jbqz jean jianbo jiang johanne john jonathan joseph journal khuller klein kong konig labeling labels lack latter lavalle lecture length letters line location lynne madhav mahdian marathe marcelo martin matchings maximum methods mexico michael might ming minghui mirrokni mirzaian mitchell mobihoc mobile model models mohammadtaghi more moret moses move movement moves multi multicasting multiplicative nearest nearly networking networks node notes notion obtained only open optimized orleans other pages parallel parker particular path pebbles permitted peterson philip pierre plane planning points port possible potential power practical prentice press problem problems proceedings processing property protocols prove puerto qian rapidly raspaud ratios ravi references reif remains repair results river robert robot robotics robots routed sabm saddle samir sandor saripalli scenario schneider schultz science sensor sergey server servers sets several shows siam simple simply singapore situation skutella social solution solved some specifically springer srinivas steiner still strijk sudipto sukhatme swarm swarms symposium systems sztainberg take target that theoretical theory they this through time tolerance total tracts transactions trees trivial tycho types uiuc under unit university unknown unmanned upper urbana using vallarta variation vehicle verlag version versions volume wake wang weighted west what when which with within wolff work workshop would zhongping
http://doi.acm.org/10.1145/1283383.1283471	86	Layered Multicast Scheduling for the L Ob jective	access adaptable adaptation adaptive aghvami aksoy algorithmica algorithms allocation altinel alves ammar anderson anily annual application applicationperceived applied approximation asymmetric audio automatic baby banerjee beaver bhatia bhattacharjee bidirectional biersack birk blueprint broadcast broadcasting bulk byers channel chen chou chrysanthis cluster codes communication communications computation computer computing conference congestion consistency content control convergence coop correcting cost costs crowcroft crupnicoff culler cumulative cycles cyclic data dbis declustering delivery design directional discrete disks disruptive dissemination distributed distribution donahoo driven duarte ecial engineering erasure eration erations erative eratore error evaluation evaluations fast feedback files fine floyd framework framing franklin friendly functions glass golden grained group hassin hierarchical hotnets hybrid ieee improving infocom information interest international internet into introducing ipdps isaac itai jacobson jersey journal jung kenyon khayat kivs knowledge kommareddy kronecker kulkarni large layer layered leases leduc legout level light like list luby lvmr maintenance mathematics mccanne mehrotra merging middleware minimizing mitzenmacher mohr morsillo multi multicast multidimensional multimedia multiple naor networking networks ninan nonnenmacher octob olicy optimal optimality osium over parallel patt paul performance periodic peterson polynomial preemption princeton problem proc proceedings protocol pruhs pujolle push ramamritham rate ratio receiver reconfigurable references reliable requests research retransmission rezende rizzo rosb roscoe rummler satellite scalable scale schabanel schedule scheduling scheme schemes schieb science sequences service sessions shamir shapiro shenoy shilo sigcomm sigmetrics sigmod silva sinha software source stacs stoc symp systems technology teletext terminals tewari theoretical theory time times toolkit topics transactions transfer transmission transp umts uniform upgrades user using vetterli vicisano video wang webdb weight what with within wong workshop young zdonik zegura zhang
http://doi.acm.org/10.1145/1283383.1283515	130	Quantum algorithm for a generalized hidden shift problem	abelian above acad academic acmsiam additive advances affine akademii algebraic algorithm algorithms alon american among annalen annual appear appears appendix applications applied apply arbitrary argument arxiv assume asymptotical available bacon basis because before berlin better body boneh borosh bound bounded bounds case ceedings chebyshev chicago childs chinese choices ciety ckmore claimed class classically close coefficients cohen combinatorica combining common complexity comptes computation computational computations computer computing consider constant convex copies coset course cryptanalysis crypto cryptology decrease defies dern detection deviating diagonal dihedral diophantine direct discrete distinct distinguishing distribution divisible divisor doklady each efficient encer english equation equations equivalently erations estimation ettinger example except extended fact factoring factorization factors find first fixed following follows formly foundations fourier friedl from functions gall gavinsky generality generalized give giving good graph grigni group groups grows hallgren hamiltonian handle hausladen have helstrom hence hidden holevo however hypothesis idea ieee indeed index inequality information instances integer integral international interscience into inui isomorphism isot ivanyos journal just kannan karp kholevo knowledge large last lattice least lemma lenstra limitations linear lipton logarithms loss lower magniez main mathematical mathematics mathematische matrix mean measurement measurements mechanical mentioned method might minkowski morphism must nauk near need neumark next noisy nonabelian noncommutative noting numb number numi observable obtained only operator optics optimal orbit osium over particular period periodic pointing poly polynomial polynomials positive power powers press pretty previously prime primeneniya primes probabilistic probability problem problems proceedings product programming proof prove provided proving putting quant quantph quantum random rational ready reducibility references regev remainder rendus representation research results rewrite ring russell same sampling santha schulman science sciences second selection semi semidirect shift shor show shows siam simply since slightly small solution solutions some space special springer sssr states statistics step strong stronger subexponential subgroup subgroups such sufficient sufficiently summations symmetric symp symposium teoriya term testing than that then theorem theoretical theory there therefore these they this tight time total translation treybig tteler typically unbounded unix unlikely upper urss used using value values variables variance vazirani verlag veroyatnoste version where while wiley with without wootters write york zprt
http://doi.acm.org/10.1145/1283383.1283519	134	Approximation Algorithms for Node-Weighted Buy-at-Bulk Network Design	access algorithm algorithmic algorithmica algorithms andrews appear applications approx approximability approximating approximation arbitrary awerbuch azar bartal best better bound bruce bulk capacitated charikar chekuri cheriyan chuzhoy combinatorial combinatorica company compared component components comput computation connected connectivity constant constrained continue cost costdistance david density design details deterministic directed distance dominating edge efficient element factor fakcharoenphol feige fleischer flow focs forest formal from further general generalized goemans graphs guha gupta hard hardness hochbaum ieee improved information installation integrality ipco iterative jain jcss jiaghayi johnson journal karagiozova khanna khuller klein kleinberg kortsarz kumar later least leighton light link linked lncs merge methods metric metrics meyerson minimum moss multicommodity munagala naor nearly network node nonuniform oblivious optimization optimum outage pages paper plotkin possible power preliminary probabilistic problem problems proc proof publishing rabani ravi recovery references rent roughgarden rounding routing salavatipour salman schieber schrijver separators sets shallow sharing shepherd siam simple simpler single sinha sink soda some spaces spans springer steiner stoc subramanian system talwar technique terminals there this tight tree trees uniform until vazirani version versions vertex weight weighted well will williamson zhang
http://doi.acm.org/10.1145/1283383.1283455	70	Whole Genome Duplications, Multi-Break Rearrangements, and Genome H alving Problem	abundance academy acknowledgements across alekseyev alenex algorithm algorithmic algorithms alphabets american analysis ancestors ancestral ancient annual aparicio application approach approximating approximation approximations architecture architectures ashbya asia assembly assignment attie bader bafna been belda bergeron berlin between bioessays bioinformatics biol biology birren block blocks boore bork bound bourque break breakpoint brenner brien bruijn bryant cabbage cambridge cerevisiae chang chen chia chicken christie christoffels chromosomal chromosomes circular classification colored comments comparative comput computational computer computing conference contiguous curado curr data dehal dekel deletions deyoung dias dietrich different discrete distance distances doubled doubling duplicated duplication during early earnest efficient elementary elias engineering escriva evidence evol evolution evolutionary experimental experiments extensive families faster find finite finned first fish fishes flato fortresses foundations fragment framework friedberg from fsgd fugu gene genes genome genomes genomic genomics glasgow gossypii graphs grateful guyot halve halving hannenhalli hartman have highly homologs human hurdles identify ieee implemented informatics information insertions insightful intel interchange interchanges international into inversion inverted jaillon jiang journal kaplan keller kellis labelling lander laudet lecture less lessons lineages linear lonardi mabrouk mammalian mammals manuscript many mapping maps marchand marron math maximizing meidanis meyer mixtacki models mohan molecular moret mouse moya multi multichromosomal multispecies murphy nadeau national nature nigroviridis notes novo ohlebusch ohno oliveira order orthologous orthology output over ozery pacific pages parity pattengale paturi peer peng pentium permutations pevzner phylogeny plos polynomial practice presentation press problem problems proc proceedings processing proof proteobacteria protokaryotype provides radcliffe random rates rearrangement rearrangements rechavi recomb reconstructing reconstruction references reginaldo remaining repeat research responsible retrieval reuse reveal reveals reversal reversals revisited rice robinson rounds saccharomyces sagot sankoff science sciences scott second segments sequences shamir sharan siam signed silva simpler singular software sorting south species specific spire springer standard steps stoye string study subquadratic sudborough swenson symposium synteny syst takes tang tannier tarjan teleost tesler tetraodon than then theorem theorems theoret theory thesis third this time tool transactions transforming translocation transposition transpositions transreversals true tsur turnip unique university unpublished using variable venkatesh verbin vertebrate very vibrio walter weighted well which while whole wilmer with without working workshop yacef yancopoulos yeast zdobnov zheng zhong
http://doi.acm.org/10.1145/1283383.1283474	89	Matrix Scaling by Network Flow	above accuracy achieve acknowledgements alenex alex alexander algebra algorithm algorithmics algorithms always analc analysis analytic appl applications apply approach approximate arbitrary arcs arge average bacharach bahman balancing balinski between biproportional bound cambridge case change column combinatorial combinatorica combinatorics common complexity comput compute computed contrast convergence convex cook course cubic cunningham data define demange depend deterministic difficult divisor dominating dorit doubly dynamic each easy edges editors engineering entry every exists experiments fakult feasible find flow flows follows found friedrich from furer gabrielle gaffke george giuseppe good graph greatest guarantee have helpful hochbaum however html http implement initial inputoutput integer integers integral italiano january kalantari karzanov khachiyan know largest lars leads leonid lest linear linial lower magdeburg march martin math mathematik matrices matrix maxi mccormick methods michel much nathan network nonlinear nonnegative norbert numbers optimization orleans other overhead pages particular pattern permanents pointing polynomial positive preprint preprints prespecified press previous problem problems proc programming proportional proportions pukelsheim pulleyblank putting quadratic quality rachev rate ratio rational real reals reduces references relationship remains remarks report representation richard robert rothblum rounding samorodnitsky scale scaling schneider schrijver scientist sections sedgewick seems sense separable setting shadows shows siam similar since sinkhorn sleator smal small solution solved solving some soules spaces starting statist stochastic strongly structure sufficient sums svetlozar syst systems taking tarjan technical teps term thank that their them then theorem there therefore these this thomas thus time tree trees trices unimodular universit university valued values vector vertices very where which wigderson wiley william with work workshop yields zero
http://doi.acm.org/10.1145/1283383.1283450	65	On the bandwidth conjecture for 3-colourable graphs	abbasi abstract acad acta aigner algorithmic algorithms almost alon amer amsterdam annual applications applio arbitrary aspects balatonfured bandbrea bandwidth berlin bipartite blow bounded brandt british budap bull cambridge cations celebration chromatic circuits cnrs colloq colloques comb combin combinatoires combinatorial combinatorica combinatorics complexity comput conf conjecture corradi critical csaba cycle cycles czechoslovak czygrinow degree dense dichten diestel dirac discrete duke eine eldridge embedding erds extremalaufgabe factors fiedler fischer florida graduate graph graphen graphentheoa graphes graphs hamiltonian holland house humb hungar impact independent informatik institut internationaux january jnal kierstead kleiner kleitman koml komlos kuhn large lecture lefmann lemma limit linear lobas london master matchings math mathematics mavron maximal maximum mcdonough meeting miami north note number oldt orie orsay osium osthus packings partitions paths paul perfect planar prague press probab probl problem proc proceedings proof publ quotas ramsey random recent references regular regularity rucinski section seventeenth seymour shokoufandeh siam simonovits smolenice soda some spanning springer square stone structure structures studia subgraphs summer symp szemer taraz texts their theorem theorems theory thesis third three tight tiling trah trees trends triangulations trotter univ universit unpublished verlag version wagner with yuster zhao
http://doi.acm.org/10.1145/1283383.1283397	13	Faster Dynamic Matchings and Vertex Connectivity	able ables about above acmsiam actual adjacency adjustment affects after akademieverlag algebraic algorithm algorithmfor algorithmic algorithms almost also always amnon analysis annual answer applications applied apply appropriately arithmetic assuming author bands because becker becomes been berlin better between biconnectivity bipartite bounds budach call called calls cannot capacity carried case cess change changes check cheriyan choose closure coefficients column combinatorica completeness complexity computation compute computer computing conference connected connectivity consider constant construct contains convex coppersmith corollary corresponding costs could data date david decomposition decremental defined degenhardt degree delete deletion deletions denote depending determinant determinants deterministic different digraph digraphs dimensional directed direction discrete disjoint division divisions doenhardt dominating dynamic dynamical each easy edge edges editor edmonds efficiency either element elements embeddings entries eppstein establish european evaluated evaluates event evolutionary example except exist exists expander exponent exponential exponentially fact fails failure faliure false fast faster field find finding finite flow flows focs following formula formulas formulated foundations fourth frands frandsen from fully fundamentals gabow galil general giuseppe give given graph graphs gudmund have hertel holm however idea identities ieee implies improve improvements include incremental indeed industrial information initialization insert insertion insertions intermixed international into inverse inversion italiano jacob ject jerg john joining joseph journal kaninke karp keber kristian kvertex laplacian laplacians latter lecture lemma length letters lichtenberg linial linked logarithmic lovasz lowing maintain maintaining maintains many matching matchings math mathematics matrices matrix maximum mehlhorn methods mikkel minimum model modified modulo moreover morrison most moving much mulmuley multiplication naher need network networks nevertheless nineteenth nissenzweig note notes number numberings obstacle obtain once only operation operations order original other others otherwise ourselves overcome page pages paper paths perfect perform peter philadelphia piotr poly polynomial polynomials possible predecessors press prime probabilistic probability problem problems procedure proceedings process processing progressions property proved queries query random rank reached realize realized recomputation rediscovered reduced references reif remains remove restrict result resulting results return returned returns reversed rohnert root rootk rubber same sankowski schwartz science separators sequence sets several sherman should shown siam similar single singular size skovb slightly small smaller society soda solved some spanning sparse sparsification speeding springer springerverlag square standard states static statist stoc structures subquadratic subset substitute success successors such suggested sung supports symbolic symposium technique terms test testing testroot tests than that then theorem theorems theoretical theory there third this thorup throughout thus time ting together transitive tree trees type types under undirected unfolded unique unit unsolved update updates used using value values vari variables vazirani vectors verification verify verlag vertex vertices volume want washington weight weighted wether when where whereas whether which whole wigderson will winograd winter with word works worst worstcase would zero zipp zippel
http://doi.acm.org/10.1145/1283383.1283506	121	Setting Lower Bounds on Truthfulness	aaai aaron ables abstract acknowledgements agent agents ahuva alem algorithmic algorithms allocating allocation allocations alternative amin amir amos andelman andrew anna annual approximate approximated approximately approximation approximations archer assigns auctions auletta azar bansal bartal based behavior berlin best beyond bezakova bidders bikhchandani both bound bounded bundling callaghan carmine carnegie cases chaitanya characterization characterizes chatterji choice chosen christodoulou christos cial clarke claus collel combinatorial communication comp compatible complement complexity computationally computations computer computing concerned constructions convex cost countersp course cramton currently dahav dani daniel david defined definition design deterministic discontent discrete discussed discussions distributed division dobzinski domain domains dominant dual duce each econometrica economic economics eculation efficient elchanan envy equilibrium erto etitive evangelos every exact exchanges exists expression fact factor fair fairness feigenbaum fiat finance focs formally foundations free from frugal frugality function functions game games generalization generalized giusepp goldb golovin gonen goods green groves guarantee hartline helpful holzman horowitz icalp ieee ilya implementation incentive incentives incurred incurs indivisible inter interested internet ivona jason jective joan journal karel karger karlin kemp kfir known koutsoupias kunal lavi least lecture lehmann lenstra liadan lindahl linear lipton location locations lower lowest lows machines marginal markakis maxi maxim maximal measure mechanism mechanisms mellon michael microeconomic minimal minimization minimize minimizes minimizing minimum mirrokni monderer monotonicity more moshe mossel motti multi multipart napproximation nearoptimal network nikhil nisan noam nonidentical notes notion number observation observe olicy optimal orne orting ound outputs overall oxford pages paolo papadimitriou paper parallel parameter path penna perfect persiano preliminary presented press prices pricing prisco private probabilistic problem proc proceedings processors programming public question rahul ramachandran randomized ratio recall references related relevant requirements restricted result revelation rica richard ronen routing rubinstein sahni saks sami santa satisfied schapira scheduling science scott sealed segal selfish setting settings shahar shenker shmoys shoham showing shows siam sigecom simple since single social soda solution sorani special springer stacs state steinb steinhaus stoc strategy strengthen study such suffices supp sviridenko swamy symposium talwar tami tamir tardos tark teams technical tenders tennenholtz thank that then theorem theory there these this thought toward towards truth truthful truthfully truthfulness tuple turns unified unit university unrelated utilitarian utility vahab valuations value varsha ventre verification version vickrey vidali viewed vijay vincenzo weak whether which while whinston with within working workload workshop yair yoav yossi
http://doi.acm.org/10.1145/1283383.1283521	136	A Polynomial-Time Approximation Scheme for Steiner Tree in Planar Graphs	acta algorithm algorithms annals annual application approximate approximating approximation arora baker banyans berman bern bienstock branch cases cess chapter chromatic clear complete computer computing concave concepts convexity cost create decomp discrete ecial edge editor erations erickson euclidean every exact fast faster finding flows focs forest geometric geometrical gives graph graphs grigni hicks increase informatica informs jacm japonicae journal karger klein kolotolu koster lengths linear lncs markowsky mathematica mathematics matsuyama meeting mehlhorn method minimum monma mono network networks number obstacles offspine olynomial operations optimization osition other pages planar plassmann polynomial polynomially problem problems property provan references repeating research satisfying scheme schemes science sendand series siam smith soda solution solvable spanner spanners spine split springer steiner stoc subset subtree summing symposium takahashi techniques that theoretic theory this time tree trees tutorials veinott verlag volume weighted widmayer with woloszyn wong
http://doi.acm.org/10.1145/1283383.1283396	12	Maximum matching in graphs with an excluded minor	academic acknowledgment addition adjacency akademieverlag algorithm algorithms alon also alternating amer american amsterdam analysis annalen annals appearing applications applied approach arbitrary arithmetic assign aths australian authors base berlin birkh bits blossoms blum bounded boyer canadian cardinality chiba circuits cnao coefficients color colored colors comb combin combinatorial combinatorica combinatorics complexity computation compute computed computer computing concluding conf conference conjecture considering coppersmith corollary correctness costs counting courbes crystal cuts cutting details determinant determinants determine determined difference different directed discrete discussions dissection dmtcs does duality during each ebenen edge edges edmonds efficient eigenschaft eine eleco electron electronic element elimination embedding entries enumerating enumeration euro european even every excluded exists extension factors fast faster finally find finding finite fixed flowers focs following follows free from fundamenta fundamentals gabow galluccio gauches gaussian general generalized genus george gilbert given graph graphs have hence high holland hopcroft huge hutchinson icalp idea information integer integers integrating jerrum join joins journal kasteleyn komplexe kuratowski lecture lemma linear lipton little llary loebl london main many matching matchings math mathematicae mathematical mathematics mathematik mathematische matrix maximum mccuaig melbourne mesh method micali minor minors mohar more mucha multiplication multiplied myrvold need nested nishizeki nonnegative nonplanar north note notes notice number numerical numerische obtained omit only operation orientations ozawa pages paper paths perfect permanent permanents pfaffian physics planar planarity plummer possibly precisely presented press probability probl problem problems proc progressions proof proving publishing puted rana random recall reed references regular related remarks replacing research result robertson robin root rose same sampling sankowski satisfying scaling science sciences second section separation separator series seymour show siam simplified since size skew society soda solved solving some springer square structures suppose surface surfaces symbolic system tarjan testing than thank that then theorem theoretical theory this thomas thomassen thus time topologie trees tronic uber univ used useful user using valiant variable variables vazirani vertex viii volume wagner where which wilson winograd with wood
http://doi.acm.org/10.1145/1283383.1283504	119	Games of fixed rank: A hierarchy of bimatrix games	aamas above agent agents aims algorithm algorithmic algorithms amer american amsterdam annals appear appl approximating approximation aumann autonomous barany based behavior between bimatrix bodies both bound bulow cell chen chersonissos class colloquium combinatorial combine commerce competition complexity comput computational compute computer computing conclusion conf conitzer convex cooperative coordination cornell current dantzig daskalakis decomposition deng dept deserve diego discrete econom economic electronic equilibria equilibrium existing exponentially extensions finding fixed flexible form found foundations from fruitful functions fundamental further future game games general generalizations generalizing generic geom goldberg grid hakodate handbook hart have hierarchy holland howson ieee indefinite indust industr inequality internet interpret introduced investigation isaacson ithaca japan kannan keiding kontogiannis kreta lacking large left lemke letters levin linear lipton logist loquium mangasarian many markakis matching math mathematics maximal mclennan mehta mentioned method methods millham model more moreover morgenstern most much multi nash nashsolvable naval neumann nonnegative normal north number numbers offer open optimization optimize over panagopoulou papadimitriou park person pittsburgh player playing points polynomial polytope presented press price princeton problems proc program programming provides quadratic quarterly question questions quint random randomized rank reducing references related remain report research results review rome roughgarden sampling samplingbased sandholm savani science seattle seems settling shubik simonovits simple smoothed some spirakis stengel steps strategies structure structures study subsets such suggest suitable symp sytems technical technique techniques that theory these think this time univ university uses using values vancouver various vavasis vempala vetta viewpoint volume walks where whether with work zero
http://doi.acm.org/10.1145/1283383.1283420	36	Efficient Aggregation Algorithms for Probabilistic Data	abiteboul above accommodating addison address aggregate aggregates aggregation algebra algebraic algorithm algorithms alice also although amihai amounts answers applications arbee arenas babcock babu based bases bell below bertossi binary binsof bits both bound bounds brevity brian bryan burdick calculating call cambridge case cavallo cedure chen cheng chiu chomicki coefficients combining communication company comparing completely complexity comput computation compute computebins computer computes computing conditions conference consider consistent constraints converge convergence count criterion current dalvi data database databases datar david debabrata define defined definition degree denote deshpande desired deterministic distinct dmitri does doug each efficient elements elke else emma empty endowment equal equals equation equations estimateaverage estimatemin estimating estimation evaluating evaluation even every exact exactly exist expression expressions extend extended extension factor faster find finding first flannery flexible follow following follows foundations frank from fuhr function garcia general generalized generating gets give given grahne grant guan guaranteed have havg having helper hence hhigh hilbert hlow hope http identical ieee implies imprecise imprecision inconsistency inconsistent increasing increment indicate inequalities inequality information initialize input inputs integral integration interesting international inverted issues items iterate jayram ject jeev jennifer jeremy john kalashnikov kanellakis know known kyoon laks lakshmanan language large lemma lemmas leone leopoldo linear lipson llrs logarithmic lower lowing lubomir maintain management manager marcelo mary matrix mayur mcclean memory message messages method models molina motro motwani multiple muthukrishnan needs negative newton next nicola nilesh norbert notice noting number numerical obtain olap only operations operators order over page pages paris part parts pass passes pdfs pittarelli player plus pods points polynomial pooling porter possibilistic possible potentially prabhakar prasad preliminary press probabilistic probabilities probability problem probview procedure proceedings produce promo proof protocol proves provide pseudo pseudocode psql ptvf publishing quadratically queries query querying raghavan raghu ramakrishnan randomized raphson read rearranging recal recall recipes reciprocal record recover references relational remaining repeat representation required resp results retrieval return reynold riemann robert roelleke root roots ross rundensteiner sally same sarkar satisfied satisfies saul scalar science scientific scotney search second send serge sets setup shang shapcott shivakumar shivnath shou show sigmod simple simulation since singular small smallest smoothed solutions solve some sort sources space special spinrad ssdm standard stanford stream streams subrahmanian substitute substituting such suciu suitable sumit summarize sunil support suppose syst system systems take technique teukolsky than that then theor theorem theoretical theory there therefore these this thomas through thus tkde tods trans trends triangle tseng uncertain uncertainty under union university until update used using vaithyanathan values variance very vetterling vijay vldb well wesley when where which while whose widom will william with within worlds would yield yields york
http://doi.acm.org/10.1145/1283383.1283516	131	The Quantum Schur and Clebsch-Gordan Transforms: I. Efficient Qudit Circuits	abelian accuracy achieve acknow adapted addison akad alexander algorithm algorithms along also ambainis amsterdam analogues annual appear applications applied applying approach appropriate approximate approximating approxrandom ashley asymptotic avoiding bacon barenco bartlett bases beals been bennett berkeley bernstein bertani between biedenharn bits brassard bullock calculus calfornia cambridge candidates capacity channel channels chap chapter chen choice chuang circuits classical cleve clifford codes coding coherence coherent coin commun communication companion component components compression compu computation computational computed computer computers computing concentrating concentration conclusion conference connections construction contracts control correction could counterparts cristopher cryptography daad daniel data dawson decoherence decomposing degrees density derandomizing devetak deviation dihedral dimension discrete discussed discussions distortion distribution divincenzo dokl drawn dual duality each eckart editors effect efficiency efficient either elementary elements encryption entanglement error estimating estimation existence experimental exploiting explore exponents families fault fifteenth finite fisher fixed focussed fourier frame free fresh from funded garbage gate gates gelfand general generally generic gentle given goodman graduate grant group groups harrow have hayashi hayden here hidden holevo hypothesis ieee industrial inform information institute international into invariants irreducible james jansen jersey jozsa kaye kempe kerber keyl khanna kitaev knill knowledge known kuperberg laflamme large lecture ledgments lemma length lett leung level lidar lloyd local logic london louck makes many markov mass math mathematics matrices matrix matsumoto measurements mechanics messiah montanaro moore moreover mosca nauk netherlands networks nielsen noise noiseless noisy nolan nonabelian northholland notes number october operational operations operator operators optimal other over pages pairs paper partial partially partitions pattern perform performance perhaps perspective philadelphia phys physicists ping poly polynomial popescu possibility precision preparation presnell press prior privacy problem proc proceedings processing produced products progress proof protocols provide pseudo public pure quant quantph quantum qubit qudits raises random rasetti reading realization recent reck reductive reference references relating remote represen representation representations reverse rockmore rolim rotation rudolph running russell schumacher schur science scientific sect sending sense sequence shannon shared shen shende shor siam signal similar simple small smith society soda solovaykitaev some source spectrum spekkens springer state states stein structure studies studying subexponential subgroup subroutine such symmetric symmetry symposium synthesis system systems tation techniques tensor testing thank that their theorem theory these thesis this thus time tolerant tomography tossing total toward trans transform transforms uncertain uncomputing under unitaries unitary universal university useful using variable versity viewpoint viola volume vyalyi wallach want werner wesley westmoreland whaley whose wigner will winter with without work world york zanardi zeilinger zetlin
http://doi.acm.org/10.1145/1283383.1283446	61	Tree Exploration with Logarithmic Memory	albers aleliunas algorithms alon annual applied aspects automata automaton awerbuch azar babi back based bender betke borodin bounded bounds bridgland buss case chains cliques cohen colloquium combinatorica communication complete complexity comput computation computational computer computing conf conference connectivity constrained constructible cycles deng digraphs diks directed discrete duncan eccc electronic environment environments expander exploration exploring fernandez finite five focs foundations fraigniaud generators graph graphs guided hard henzinger hoory http icalp ieee ilcinkas impagliazza information international istrail journal jsbaum kameda karchmer karloff karp kobourov korman koucky kranakis kumar label languages learn learning length letters linial lipton little lncs logspace lovasz lower machine mapping mathematics maze memory mobile multiparty network nisan nlog optimal panaite papadimitriou paths paturi pebble peer pelc peleg piecemeal polynomial power problems proc processing programming protocols pseudorandom pseudorandomness rackoff random ravid rectilinear reduced references reingold report rivest robot robots sahai science sequences siam simon singh sirocco slonim space stacs stoc structural symp symposium szegedy team theoretical theory tixeuil tompa tracking traver traversal traversing tree trier undirected universal unknown unlabeled vadhan walks werman widgerson with
http://doi.acm.org/10.1145/1283383.1283425	41	Scrambling Adversarial Errors Using Few Random Bits, Optimal Information Reconciliation, and Better Private Codes	about above achieve achieves achieving advances adversarial adversaries adversary after against algebraic algorithm algorithms allow allows almost along alphabets also always among amplification annual appeared appears applicable applications approach approaches approx archive asiacrypt assume asymmetric authentication available avbpa average aversarial balanced based basic because bennett best between binary biometric biometrics bits bound bounded bounds brassard buece cachin camenisch candidate capacity capacityachieving cascade case certain chances channel chennai chernoff choose choosing chosen close code codes codewords coding coefficients coins combinatorial combined commitment communication compared comparison completeness complexity complicated computational computationally computer computes computing concatenated conference consider consists constant construction constructions contains contexts control cormode corollary correct correcting correction corrects correlated corresponds could cover cryptographic cryptography cryptology data decodable decoder decoding definition degree derandomization derandomized derived described description descriptions detailed differences different dimension ding directly discrete discussion distance distinguish distributions document dodis does editor editors effectively efficient efficiently elements elias encode encoder english enhance enjalbert ensure ensuring eprint error errors essentially eurocrypt every exact exchange exist existence existential exists explicit explicitly extractors extreme fact fagin field fields files final find first fixed focs folklore forge forgery form forney foundations from full function functions fuzzy gabow gathered general generalized generate generator gets gilbert give given gopalan guaranteed guess guruswami hand handle harnik hash have here hoeffding http iacr ideas identify ieee independence independent india information initially integer integers interactive interests international intro introduces introduction invalid itself ject journal juels kaplan keys kilian known langberg large leaking least lecture lemma length lerton less limited line linear linnartz lint lipton list listdecodable literature long lower lying makes manuscript masks match math matter maurer mayr messag message messages micali minsky misuse model moment monticel more moreover most naor natural nearly noise noisy none notes oblivious observe only optimal order oregon original orlitsky ostrovsky other outputs over page pages pair paper parameters partial particular paterson peau peikert perfect permutation permutations permute phrased pinsker point polynomial portland positions preparation present presented prevent previous price privacy private probability problems proceedings proceeds progress promising proof properties protocol protocols pseudo pseudorandom public random randomness ranges rate receiver recent reconciliation reduces reducing references reingold renner report represent result resulting results reyzin robert rosen round rudra russian sahinalp salvail same scalable scheme schmidt science scrambling second secret section secure security seed seen send sends series sets several shaltiel shannon shared shielding short shortcomings siam side siegel simple since sixth sketch slightly small smith society soda somehow springer srinivasan stacs stad standard states stichtenoth stoc storage strong succeeds success succinct such sudan suggested symmetric symposium sync syndrome table tags take takes taking technical tehcnial telecommunications templates term that them then theory there thesis they think thirty this thomas throwing thus tight time times totally trachtenberg transactions transfer transmission tuyls unbounded unconditionally union uniquely using valid value variants various varshamov vault verlag version vishkin volume wagner washington wattenberg where which wiley will wilson wise with without wolf word work worst zippel zuckera zyablov
http://doi.acm.org/10.1145/1283383.1283514	129	Quantum Algorithms for Simon's Problem Over General Groups	abelian above action acts affine alagic alexander algorithm algorithms also alternate alternating amnon analogous andrew annual appearing associated back bacon base basis beth between case childs class classical combine composition comput computation computer computing concreteness consists coordinates coset course cristopher daniel david defies described description desired detailed determine difference dihedral dimensional direct discrete distinguish each efficient efficiently eqis examples explicit factorization fails familiar family final finally first follows form found foundations fourier fran friedl from fulton gall gebra generic given gorjan graduate graph greg group groups hallgren harmonic harris hence hidden identical ieee index instances into inui involution involved irreducible irreps isomorphism ivanyos jection journal just katalin kitaev kuperberg large lattice leaf leonard limitations linear logarithms magniez martin mathematics measurement measurements mika miklos missing mixed moore multiregister nontrivial normal note number occurring oded only operators optimal orbit original outside over pages particular peter polynomial polynomialtime power pranab preprint preserves previous prime probability problem problems proc process product provide quant quantph quantum random reconstruction references regev relabeling representation representations required rockmore rotations russell same sampling santha scalar schulman science sean section selected selection semi semidirect shen shor siam sign similarly simon simply since solution some space spaces springer state states step strikes strong studied studies subexponential subgroup subgroups subspaces symmetric symposium tashma texts that then theory there these this thomas thus time transforms translation treat trees tteler unaffected unchanged uniformly using value verlag vyalyi where which william with wreath yoshifumi
http://doi.acm.org/10.1145/1283383.1283453	68	Approximating the Spanning Star Forest Problem and Its Applications to Genomic Sequence Alignment	above acknowledgment adding additional admitting again agra akiyama algor algorithm algorithmic algorithms aligner aligning alignment alon also always among anchor anchors annual another aoki appear appeared appears applications approximate approximating approximation arboricity assoc assume assumption automobile baker base basepair basis belarus berman berry better between bipartite blanchette block blocks blockset both bridge called case cases check children choosing circles clearly cluster clusters cockayne collecting collection combinatorics common complete components comput computation compute computed computing concludes conclusions conditions conference connected connectedness connecting connon consider construct constructed contain contained containing contains control convenience corresponding corresponds count cover coverage covered cycle cycles decomposition define definition degree dekker deleting denote depth derived design directed discrete disjoint diversity divisible does dominating domination duplications during each easily easy ecco edge edgedisjoint edgeminimal edges egawa either empty endix equal eral erty estimate every evolutionary exactly example fact factors feige ferneyhough figure finally find finding finds follow following follows forest forests formed forms found from fukada full fundamentals further furthermore future generality genome genomic give given gives good goodman goodness grant graph graphs guillemot hakimi hand haray hard hardness have having haynes hedetniemi hence holds however icalp implies improve inapproximability incident indices induced induction industry information initiate input inter interesting internal into iteration iteratively joined joining journal kano karpinski keep larger leaf least leaves length lengths less letters linear ling lncs loss lowing lund machinery marcel mark math maybee mccuaig mention merging miller minimal minimality minimization minimum minsk mitchem model moreover most multipartite multiple must nagoya need neighbor neighbors neither nguyen nicolas node none note npthis number numbering obtain obtained obviously only open orthologous other otherwise output outputs pair pairwise paper particular path paths paul planar point points position problem problems proc process processing produced proof prop properties property prove question questions raises ramsey ratio readily recursive redundancy refer references regular removes removing reproduced research respect respectively result results roughly rows runique running satisfy satisfying schmeichel segment segments sequence sequences sets seven shared sheng shepherd show shows similar simple since size slater smaller some spanning springerverlag star starting step steps stoc study subgraph subgraphs such supported takes than that then theorem theory there thereby therefore these they this threaded threshold through tighter time times trast tree trees type union unique uniquely unweighted urabe used using verified vertex vertices wabi weighted were when where which while white whose wiley will with within without words xviii yannakakis york zhang
http://doi.acm.org/10.1145/1283383.1283437	53	Embedding Metrics into Ultrametrics and Graphs into Spanning Trees with Constant Average Distortion	abraham advances alamitos aleksandrs algorithmic algorithms alon annals annual anupam application applications applied approximating approximation arbitrary arxiv assaf athitsos august average bafna bang bartal beacons bioinformatics bollob bound bounds buhler burlington chan chao chuan cofe colton complex comput computational computer computing conservation constant construction contractive cost crovella daniel database david dawak decomposition detecting dhamdhere dimensional discrete distances distortion douglas eighth elkin embedding embeddings emek eran estimation euclidean european exploration extraction fakcharoenphol farach fast feature finite focs foundations fourteenth from gabriela game geometric geometry gesture giuseppe graph graphs guarantees gupta halperin hand hjaltason hristescu hubert ieee indexing industrial indyk into ismb issue ittai jects jeremy jittat journal karp kedar kleinberg krauthgamer kunal kunmao lancia landmark lemmas linial lipschitz liying lower manor manuscript mark martin math mathematics mendel method methods metric metrics michael minimum multi naor nathan neiman nets netw network ninth noga ofer online pages path peled peleg phenomena philadelphia polynomial pose press probabilistic problem problems proceedings protein rabinovich ramsey ravi references relaxed richard robert role routing samet sariel satish scalable scheme science sciences sclaroff searching selection sequence server sets seventh shang shavitt siam similarity simulation slivkins small society soda space spaces spanning special spielman stan stoc stretch supplement symposium system talwar tang tankel teng their theorems theoretic theory thirty thirtyfifth tight time tomer trans tree trees triangulation type ultrametrics using vassilis vineet west westover wexler with workshop yair york yuri yuval
http://doi.acm.org/10.1145/1283383.1283458	73	A Network Formation Game for Bipartite Exchange Economies	acknowledgements action advances again agents albers algorithm algorithms allocation also american amin analyzed annual anshelevich appear appendix application assume assumes attached aumann balanced bargaining because behavior better between bilateral bipartite bosch bottou bought buyer buyers buying buys cambridge cannot case christos clearing clubs coaliations coalitions coexist colt combining comments completes component components computer computing condition conference connected consecutive consider considerations consisting construction contain contractbased corbo cormen corominas correctness cost could creation dasgupta decrease degree demange design designated details devanur directed discussions distributed does dual each early earning econform economic economics economies edge edges editor editors efficiency eilts either embeddedness endogenous entirely equal equals equilibria equilibrium essential establishes even evenly every exchange exists exploitation extend extended eyal fabrikant facts fair finally first following form formation formed found foundations from full gale game games getting give good granovetter graph graphical graphs group have helpful here hill huanlei ideas ieee immediately implies importance imposed incentive incident increase increased increasing information introduction jackson johari journal kakade kearns kleinberg know kranton last lawrence learning leiserson lemma linear link lower luis luthra main maneva mannor mansour market matching mcgraw michael minehart mkearns model models moscibroda most myerson nash nature navigation near necessary neighbor neither network networks neural newtorks next nikhil nodes number observe occur offer offered omit only opportunities optimal original ortiz other outside over pages papadimitriou paper papers parkes part peers pemantle perfect players press price primal principles problem proc proceedings processing produced proof properties provide provides providing ratio rational ready reason references remains restrictions result review rivest robin roditty roger roof roth roughgarden saberi saul schmid science section selfish seller sellers sets sham shapley shenker show shown shows siddharth sill since size sketch small social sociology soda space split stability start stefan step strength structure subsets such sufficient suri survey switch symmetric symp symposium systems tardos technical than thanks that their them then theorem theory there therefore these this thomas those threshold thus ties topologies trade trading transformed transforms tsitsiklis type unconnected unequal upenn utility value variation vazirani version vijay warm wattenhofer weak wealth weiss wexler what when where which will with wooders world would yair yields
http://doi.acm.org/10.1145/1283383.1283476	91	Island Hopping and Path Colouring	above access achieve acknowledgments acyclic addison aggarwal agrawal algorithm algorithmica algorithms allow allowed allows already also always amer american analogue analysis andrews annals anshelevich applications applied approach approached appropriate approx approximating approximation arcs area areas argue arising assignment assume assuming assumptions author authors average bala bandwidth barnette basic baum bazgan beauquier becomes bell bellman bermond between bound bounded bounds bridge canadian capacitated capacity captures caragiannis carried chandra changing characterization cheapest chekuri chen circular claisse closure coloring colouring combinatorial communication completely comput computer configuration conjecture conjectured connected connectivity consider considering constant constrained conversaunbounded conversion converters coppersmith cost costs could counterexample criteria cubic cycle dark dealt decomposition decrease define degree demand demands department design desired details digraphs dimensioning directed directions discrete discussions disproved distance done driving during dwdm each edge edges efcapacity efficient electronic erations erlebach errorprobability especially essentially essex essiambre even example exist existing extremal false ferreira fiber fibers ficient final find finding first fixed flows focs forest fortune fractional francis from fsttcs full fundamental funded furer future gargano general generalized given gives goddyn goemans grants graph graphs grateful hall hamiltonian hassin have having hell hesse hoffman hold homeomorphism hopcroft hops huang hybrid icalp ideas improved incident induction inequalities infocom insist integer interesting interval island john journal jump kaklamanis kilper klasing klein kleinberg konemann kumar labs large layered leaves lengths letters lide lighting like line linear link lisa little location loptical lovely lowe luis mader many math mathematical mathematics matter maximum maxithan measure method methods middle mihail minimal minimiza minimization minimize minimum modiano more most multi multifiber multiple multiwavelength must necessary network networks nithi nother number numbers numerous obtain ocube omit optical optimal optimization orlin orthogonal osia other over pagourtzis pair pairs partly path paths pays perennes performance peter placement planar polyhedral polylogarithmic possible potika previous problem problems proceedings programming proof propose proved providence purchased raghavachari raghavan ramaswami rather ravi reading recent recently reconfigurable reduction references related replacing requiring research resource respectively results ring rings rivano roadm roadms rounda route routed routing rudra safra salman same saniee santha says schieber schrijver schwabe science section sections seek seen selected sense separately shepherd shortcuts shortcutting shortest siam similarities simple simplifying since single small smaller society soda solution some somewhat sons spanning split star static stefanakos steiner stern steve still stimulating stoc straightforward subgraph sudan sweldens symp system systems tech technical technique test than thank that their then theor theorem theory there thesis this thorup times tion tions tool tools total trans translation transparent transport tree trees trotter tunately turnpike turnpikes tutte tuza ular unbounded under undirected unfor unfortunately unimodalternatively university upfal upper usage used uses using utility vaccaro version vetta visiting volume walker warwick wavelength wavelengthrouting ways weaker wesley when which while white wiley wilfong williamson winkler winzer wish with within without wocs work works wyllie zane zhang
http://doi.acm.org/10.1145/1283383.1283467	82	Counting Colors in Boxes	adding algorithm algorithms applications arithmetic automata average aviv bentley berg berlin blue boca boissonnat bozanis case certain chan chapman chapter chew circular clarkson colored colors complexity comput computational computer connectivity convex copp counting data diagrams dimensional dimensions discrete distance dynamic dynamization ected edition editors efrat ersmith fast functions further generalized geom geometric geometry given gupta halfspace hall handbook heidelb higher http huang hulls improve inferior information interesting international intersection involving israel janardan jects journal kaplan kedem kitsios kreveld kung languages lecture letters loquium makris matching math mathematical matrix maxima mehta multiplication nonconstant notes numb olyhedral orting other ounds output overmars oxes pages pattern peled possible problems proc procesing programming progressions query random range raton rectangular references restriction restrictions results revisited rubin rubinnat sahni sampling schkolnick school schwarzkopf science searching sharir shor size smid solution some space sparse springer structures subgraph symb symp tagansky takes technical technique that theory this thompson trans tsakalidis under univ values vectors verbin verlag volume voronoi winograd with would yuster yvinec zwick
http://doi.acm.org/10.1145/1283383.1283491	106	A linear work, O(n1/6 ) time, parallel algorithm for solving planar Laplacians	achieving alain algebra algebraic algorithm algorithms america american analysis angeles annual appear application applications applied april association assume based belong between boman boundary bounds briggs bruce carnegie chung clustering collaborative column combinatorial commute comput computer computes computing conference connected constructed constructing contraction corr corresponds cvpr cycle daniel david decomposition demmel depends diagonal diagonally different dissection domain dominant doyle edges edition effective efficiency efficient electrical element eliminated elimination elkin elliptic embeddings emden emek endre equations erik fast finding finite form formally foundations fouss francesmary francois frederickson from gary gazit generalized good goodrich grady graph graphs greater greg gremban have hence hendrickson henson hillel hopcroft ieee image independent independently induced industrial inspecting intel intelligence international into invited james john jordan journal june kaufmann keith kiwi klein laurie leung ligence linear lipton list lower luby machine maggs manuscript marco marcos margaret math mathematical mathematics matrices matrix maverick maximal mccormick mellon michael miller modugno morgan multigrid near nearlylinear neighbors nested networks nodes novel numerical october ojas ones only other pages pair paral parallel parekh partitioning paths pattern peter philip pirotte pittsburgh planar planarity polygon positions preconditioners problem procedings proceedings procideengs publication ramachandran random ranking ravi recommendation references regional reid reif richter robert rose rounding saerens sampling science sciences second segmentation separated separator separators series sets shan shang shanghua shortest shown siam similarities simple small snell society solution solving spaa spanning sparse sparsification spectral spielman stephen steve stoc stretch such support symmetric symposium synthesis syst system systems talk tarjan tems teng testing that then theor theorem theory these thesis this through thus time tolliver trans tree trees triangular triangulation tutorial university vaidya vavasis vertex vertices victor vijaya walks weiss where which william with write yuval zeros
http://doi.acm.org/10.1145/1283383.1283426	42	Deterministic pivoting algorithms for constrained ranking and clustering problems	about aggregating aggregation ailon aimath april caccetta charikar chudnovsky clustering conjecture consensus coppersmith counted covering cycles daedalus data dense digraphs discrete dwork every filkov fitting fleischer focs follows ggkvist gives good hierarchical http ictai inconsistent information integrating kemeny krivelevich kumar mathematics methods metrics microarray naor newman next note number numbers once ordering packing pages phylogeny problems prove rank ranking references related results rudra seymour show sivakumar skiena soda stoc submitted sullivan summary that then tournaments tree triangles triplet tuza weighted will wins without
http://doi.acm.org/10.1145/1283383.1283419	35	The Communication and Streaming Complexity of Computing the Longest Common and Increasing Subsequences	acides actually adapt addison adversary after again agrees aldous algorithm algorithmica algorithms alice alignment allowing alon alphab also altschul amer amsterdam announces answer apostolico appear appearing application applications applied appropriate approximating arguments array assume assuming asymmetric baeza baik banerjee based basic before bespamyatnuikh between bioinformatics biology bits blanks blast block blocks both bound bounds bull cambridge canadian case center cfor challenging choose chooses clearly clickstream clustering cocoon codes combinatorial common communication communications compares comparison comparisons complexity compute computed computer computes computing conditions consider constant construction contain containing contains contiguous continues copies corp correct correcting corresponding create creates data decreasing defined definition deift deiftjohansson delcher details determine determined deterministic diaconis diagonal difference differences different digital direct disc discrete disjointness distinguish distribution distributional does duplicate each easily easy edition edits efficient either element encoding ending endix ends england enough entire entirely entries entry enumerating equipment error essentially estimating every exactly except exists extend extending extension fact fast fill final find finding finds first fleischmann focs following follows form fredman free frequency from full function gaps genomes ghosh gish give given gives goal gonnet gopalan greater guerra handbook hard have henzinger here high hirschberg hold holland hunt idea ignored iitk immediately improve increasing indeed index information input inputs instead integer integers integrable intermediate intersection interval intervals into invariant invocations jagopalon jayram jcss johansson journal just kalyanasundaram kasif keep known kordt krauthgamer kremer kruskal kumar kushilevitz large largest last leading learns least length less letters liben lipman lislength list local locally longest looking lower macromolecules macwilliams maintains math mathematics matias matrix maximum means merge miller miltersen mining minor model modification modified molecular moments more moreover most multi multilemma multiple must muthukrishnan myers next nisan noam north note notices nowell ntervals nucleic number numbers observe obtains occurs omit omitted oneround only open ordt other otherwise output outputs pace pairts part partitions pass passes patience permutations peterson plus point positions possible powerful practice prepended press previous probabilistic probability problem problems process processing proof protocol protocols prove questions raghavan random randomization randomized rank razborov recall record recording reduce reduction references related remaining repeat repeats replaces replacing report represent research resolving rest results retain revisited rough round rounds rule safra salzberg same sankoff satisfies save schensted schnitger sciences scoring search second section sections segal segment send sends sequence sequences sets setting show shown shows siam similar simply since size sloane small smallest soda some sorted sortedness sorting space split start state stated stoc store storing stream streaming streams strictly string structures subsequence subsequences subsequent such suppose system systems szegedy szymanski takes technical technique than that then theorem theory there therefore these they this thus tight time times together tool total track transmit transmits transmitting triangular trick union university until update upper used uses using usual value want warps weighted well were wesley when where which white whole whose wigderson will with without wokingham works workshop yates yields zhang
http://doi.acm.org/10.1145/1283383.1283472	87	Lower Bounds on Average-Case Delay for Video-on-Demand Broadcast Protocols 	above acmsiam aforementioned after algorithms already always another april area assumption audio average back bandwidth bandwidths both bounds broadcast broadcasted broadcasting buffer cannot carter case ccur change claim cols communications compared comprehensive computer conclude conference consider contradiction contradicts contradition contrary data david decreasing decreasingly delay demand differ different digital direction discrete dominate easier easy effect efficient elements endix engebretsen enough equal equivalent evans experience extended fact fast finite first following follows form future general generalize give given gives hand harmonic have here holds ieee imielinski include increase increasing increasingly infocom integer integral international january juhn july keeping kien kirkpatrick kurose ladner left lemma lighten long lower make matched media metrop ming minimize minimizing more most multimedia must naive need network networks nonnegative nossdav notation note number numbers octob olitan only operating optimal optimally opular other over pages paris part perform permutation permute place playback point present problem proc proceed proceedings proof proto protocol protocols prove pyramid real receive receiver receivers receiving references reorder research respectively restate result right roof same scheduling scheme schemes second segment selection selective sender sending septemb sequence sequences service shen sheu should show showing shown siam side sigcomm similar simon since skyscrap smaller some sort sorted sorting starting still straightforwardly strictly stronger study such sudan suffices support suppose swap swapping swaps symposium systems tami tamir techniques terms than that then there these this time times took towsley transactions tseng tune unchanged unit unpublished user using values video videos viswanathan when where which will william with words workshop worst would yielding
http://doi.acm.org/10.1145/1283383.1283442	57	Resilient Search Trees	acmsiam advanced affected algorithm algorithms along also anderson annual aslam attacks aumann auof automata average based bender binary bounded cambridge case charge charged claim cocoon combinatorial combinatorics computer computing conf coping cost costs cryptanalo cryptographic data detected dhagat discrete dundancy during embedded encryption engines error errors fault faults feige fifty finland finocchi focs follows foundations from future games generalizing geometric grandoni hall hardware have hence henzinger icalp ieee inconsison induction information invited italiano itself journal july kleitman known lang languages least leda lemma liars library linearly lncs logics loquium mccarty mehlhorn memory merge meyer might more musser must muthukrishnan neumann noisy once optical optimal organisms otherwise past path pelc peleg phase platform plauger ponents prentice presence present press princeton probabilistic probability proc procedures prog programming raghavan ravikumar reargument references reliable rivest round rounds science sciences search searching seifert shannon siam skorobogatov soda sorting spencer standard started stepanov stoc strategies structures studies such symp symposium synthesis system systems talk template tency than theoretical theory there therefore third this tolerant tomata total turku type univ university unreliable unsuccessful upfal used which winklmann with without workshop would years ysis
http://doi.acm.org/10.1145/1283383.1283447	62	Testing for a theta	algorithm algorithms appear balancedness berge bienstock chudnovsky combinatorica complexity conforti constricted contractile cornu corrigendum decomposition detecting discrete even extended free graph graphs hole holes induced jols kapadia kawarabayashi linear maffray manuscript math mathematical matrices members ordecomposition part paths perfection perfectly princeton prism problem programming publication recognis recognizing references senior seymour siam strip submitted testing theorem theory thesis theta three tion tree trotignon vukovi well
http://doi.acm.org/10.1145/1283383.1283433	49	The Random Graph Threshold for k -orientiability and a Fast Algorithm for Optimal Multiple-Choice Allocation	abstract access acknowledgments acmsiam actually algorithm algorithmica algorithms allo allocated allocation allocations almost also analysis annual application applications approximation architectures asymptotic august automata averages azar balanced balancing balls berenbrink between bins bollob broder bypass cain case cases cation chen choices christoph cking colorable combinatorial communication communications compared comparison complication comput compute computer computing concurrent constant construction core cores covered currently cycles czuma data database degrees dense dial dictionaries dietzfelbinger different differential dimacs directed discrete discussion disk disks distributed duplicate edge edges editors efficient egner emergence encer encores equation established experiments exploiting extended fast fault felix fernholz figure flexibilty forest franklin frieze from generalization germany giant give graph graphs greedy hakimi hamila handbook hard hash have heavily heide holland icalp implemented indistinguishable inst instances interest international jasekaran july jump june just karlin karonski karp keep kluwer korientability korst languages later lecture lectures level like lisbon lncs load loaded logical loquium luby machine makes marks martin matchings measurements melb memories memory method meyer mitzenmacher molloy near needed needs noninteger north notes obtain ological only onse optimal optimisation ordering orientability orientation oriented orleans osen ourne over ower packed pages pairs paral parallel parameters pardalos particular path performing pieces pittel portugal practice pram presentation presented press principles private probabilistic problem problems proceedings processes programming publication putze quality ramachandran random randomized randomly reconstruct redundancy references replace replicated resp results retrieval retrieve richa rolim rotem rucinski rutgers sanders scalable scale scheduling scheideler science seem selfless series servers several shared short shortest shriver sigact sigarch simple simulation simulations sitaraman size smaller soda sofsem solution space sparse springer steger stemann storage structures subgraphs submitted sudden suggests survey symp symposium systems tables techniques tested thank that them theoret theory thesis this threshold thresholds tightly time tolerance tonian track tradeoffs university upfal values variants velen version vertices visible vitter volume warsaw waste weidling where which with workshop wormald would
http://doi.acm.org/10.1145/1283383.1283428	44	Algorithms and Incentives for Robust Ranking	abbadi academic accept account actions adams adding adomavicius advertising affected afresh after against agrawal algebra algorithm algorithms alliances also amazon anupam anymore applications approach approx april arbitrage arbitrarily assignment assume authoritative available avoid avoiding ballot bankrupt bankruptcies bankruptcy barbasi based bases because behavior below bhattacharjee bianconi birkhoff bound boyd brin bringing cambridge canada cannot case ccurs certain challenges chapter cheap choice chosen citation claim click clicking clickthroughalg collusion combinatorial commerce communications competition computer conference constraint continuously contractual contributions convex correcting cost create cushion data databases decayed december deduction defined dellarocas design designing detection digital digitization disadvantage discriminatory discussion does doing down dumalge duplicate each ebay economics edition effects eigenvector either electronic eliciting endix engineering engines ensure ensures entities entity environment equivalent erties erty europhysics even eventually evolution evolving example exception exists expectations expected explicit extensions fact factor fail falls feasible feedback first fixing flow following follows fourth friedman frobeniusk from frontiers game games gaming garcia generation given goel gone google govindan graph greater guarantee gyongyi halperin handle hanson hardy have here heuristics hide hold however http hyper ieee imation immunizing impact implies inaccuracies inboxes incentive increase indefinitely industry inequalities inequality infinitum information informative interfere international interval inverted jeopardize jorized journal june just keep kleinberg know kuwabara large lead ledge leighton letters library like limiting lineal link linked littlewood loss made magazine majorization makes making malicious management marginally market marshall mason mayer mechanisms metho method metwally miller models molina money more motwani mouth multicommodity multiplicative multiply multiscaling negative networked networks neumann next nissin note null numb number obligations observaciones october olkin online only opportunities opportunity optimal optimization order other others outside page pagerank pages pair part participating peer person pinkas placed placing players popularity position positive possible post prediction press princeton principles problem proceeding proceedings profitable program project promise prop properties provides pseudonyms qualities quality quickly quite racing random ranking ranks rate ratings recent recommender references reiter removed repeat reporting reputation required resistance resistant resnick respectively return revenue rival robust said same schemes science search second security seek share shows shut sigmod since small sobre social some sources spam stanford started stateof steal stopped strategy streams structure stuffing such suggested suppose survey system systems technologies than that their them then theorem theorems theory there therefore these they third thirteenth this through thus time token tokens toward trans transactions tres tucum tutorial tuzhilin unbiased under understanding undoes unfair univ university used user users value vandenberghe various versa very vice vise vldb washington weeded when where which wide will winograd with word workshop world would yahoo york zeckhauser zero zhang
http://doi.acm.org/10.1145/1283383.1283507	122	An Efficient Cost-Sharing Mechanism for the Prize-Collecting Steiner Forest Problem	acmsiam aggregation algorithms allocations annual applications approach approximation automata back balance berlin budget charactere characterization choice coalition collecting comput computer computing conference connected cooperative cost costs croatian cross darko discrete dual econom editor efficiency facility focs forest forests foundations from games generalized group guido herv holland immorlica implementable incremental international ization jain jiaghayi jochen kamal kapov kathryn kent laffont languages lecture leonardi limitations location mahdian martin mechanism mechanisms methods mirrokni mohammad monotonic moulin msts nemann north notes offs oper operational pages population preferences press primal prize problem proceedings programming proofness relaxation research revelation roberts roughgarden rovinj rules schema schemes science scott seventeenth share shares sharing shenker siam sixteenth skorin social soda springer stefan stefano steiner stoc strategy strategyproof stronger submodular sundarara symposium taghi tardos theor theory trade tree vazirani versus vijay volume welfare zagreb zwam
http://doi.acm.org/10.1145/1283383.1283417	33	Estimating the Sortedness of a Data Stream	abuse accl additional ailon ajks ajtai aldous algorithm algorithms allow alphabet also american analysis andoni annual appear applications approach approxima approximate approximatelis approximating approximation arguments array assume automata auxiliary babcock babu baik batu biology bits bitwise bounds byjkk byjks call cambridge chakrabarti charge charged charikar chazelle checkers claim class clear column comandur combinatorial combinatorica common communication complexity computation computational computer computes computing conference conjecture consider consist constant contains contents cormode corresponding cost counting data databases datar decreasing definition deift desired deterministic deza diaconis discrete disjointness distance distortion domains edit editing efficient efficiently element elements elsevier embedding embeddings encode engineering ergun error essentially estimating every faster finding fischer followed following foundations fourier from full function general given gives giving goldreich goldwasser gupta gusfield hand hence however ieee imply implying improved increasing indices indyk information ings input inputs instance international into inversions issues jayram johansson journal kannan khot kilian korn krauthgamer kumar languages least lehman length lengths letin liben lists lnvz longer longest loquium lower magen masek matching mathematical matrix meaningful measuring memory mentioned metric might models molecular monotone monotonicity most motivate motivates motwani moves multiparty muthukrishnan namely naor natural naturally nearoptimal newman nonembeddability normed notation nowell number numbers obtained only optimization order ordering ostrovsky other over page pages paper part parts pass passes paterson patience permutation pevzner player poset press principles problem proceed proceedings programming proof protocol protwol prove publishers rabani random randomization raskhodnikova real references relative requires reservoir restricted rowwise rubinfeld runs sahinalp same sami samorodnitsky sampling science sciences sequence sequences setting show siam since single sivakumar sketch society software some sorting space spaces spot standard statistics storage store stores stream streaming streams string strings sublinear subsequences subset symbols symposium system systems taking terms testing that then theorem theorems theory this thus tion transactions trees ulam unit university used variables version viswanathan vitter wang weakly when which widom will with woodruff work workshop yossef zane zhang
http://doi.acm.org/10.1145/1283383.1283431	47	An Elementary Construction of Constant-Degree Expanders	absolute adding ajtai algorithms alon also amer annals annual appear appendix application applications apply appropriate assume between bilu bulletin cauchy cayley certain clearly close combinatorial combinatorica complement complexity computer concentrator conclude conference constant constantand construct construction constructions cycle define definition degree design difference differential discrepancy dodziuk duplicate each easy edge edges eigenvalue eigenvalues eigenvector entries entropy equations every expander expanders expansion explicit filling florida focs follows foundations fractional from gabber galil gaps generality geometry goal graph graphs gromov group guarantees half have hence hoory however ieee implies inequalities inequality informacii information island isoperimetric keeping laplace large larger largest last least length lifts linear linial loops loss lubotzky manifolds margulis math mathematics matrix milman most nearly nontrivial note optimal order otherwise peredacl phillips pinsker positive possible power problems problemy proc product prove raising ramanujan random recall recursive references regular regularity reingold replace replacement resulting riemannian right roichman roughly sarnak schemes schwartz science sciences second since singer single sized smaller smallest some spectral structures superconcentrators symp system take teletraffic than that their theorem theoretical theory there therefore these this times trans transience transmission twice using vadhan value vertices walks waves when where which wigderson with without
http://doi.acm.org/10.1145/1283383.1283520	135	Approximation algorithms for prize collecting forest problems with submodular penalty functions	acknowledgments algorithm algorithms applications approach approximating approximation author balas bgslw bienstock certain chaitanya clos collecting comb combinatorial combinatorica communication comput connectivity constrained cost daniel david define design discussions dual editor editors edmonds egon etyan factor first fleischer forest fujishige functions general generalized geoo given goemans gonzales hanani handbook hayrap hayrapetyan information iwata jack jain jiaghayi johnson kamal kortsarz levi like maria math matroids metaheuristics metric michel minimizing minimum minkoff network networks nheim note nutov olyhedra olynomial optimal optimization other pages personal phillips practice press primal prize problem problems programming references salesman sauer schema schrijver siam simchi soda solution springer steiner steven strongly structures submodular svitkina swamy tardos technique thank their theorem theory time traveling tree tschel useful verlag where williamson with would zoya
http://doi.acm.org/10.1145/1283383.1283511	126	Half integral packing, Erds-Pos´-Property and Graph Minors o a	adding addition additional additionally adhesion after again algorithm algorithmic algorithms also amer analogue apex appel appl applications apply approximation approximations argument arnborg aspects assoc assume attached baltimore berlin between bipartite blueberries bodlaender bottle bounded bounds called cambridge cannot case chains chartrand chromatic circuits closed color colorable coloring colourings combi combin combina combinatorica communication compared complete comput computing concluding congr conjecture connected connecting connectivity construction contained containing contains contemp continuing contractible contractions cornerstones critical crossed cuff cuffs curve cycle debrecen decision decomposition define defined definition degree delete denote details determined devos diestel dirac discharging discrete disjoint disk done down each ebenen edge edgedisjoint edges edition efficient eigenschaft eine either elementary embed embedded embedding embeddings empty endix endvertices erds erties ertson euler europ every excluded excluding exist exists face faces fachen family find finding fixed flow flows focs following follows forbidden forces formulation four free from full function gabow geller genus geometry give goes gorbunov graph graphen graphs grid grids hadwiger haken half halin happen hard have hedetniemi hegde hence henzinger here higher highly homomorphies hopcroft hopkins huge improper improved imrpovded infinity institution integer integral interscience intersects into irrelevant jective jensen johns jsut jung just kawarabayashi klassifikation klein kleinberg koch kolliopoulos komplexe korte ktrees kura large latter layout lecture lemma length less linear linearly linked linkless linois loading london longman mach made mader maharry mangoes math mathematics maximal maximum measure mech method middle minor minorcase minors mohar most much natorics naturforsch near nearly nelson nonempty norine note notes number numer obtained omit only oporowski order ordered ordering other otherwise outline over overview oxley packing pair pairs part partial path paths petersen pitman planar planarity planarly plane plied point polynomial positive precedes preprint presence press previous private problem problems proc procedure projective proof prop property proskurowski prove proved providence publ quickly reader recall reducibility reduction reductions reed refer references related remark remarked remarks replace representativity research respect rest restricted resulting rgensen ring robertson rooted routing sachs said same sanders schrijver seattle section seese separates separating separations sequence sets seymour shall shiloach should shrijver siam similar similarly simpler simplified since small society solution some space specified sphere springer srinviasan state stated stein still streckenkomplexe structure subgraph subgraphs submitted subset such supp suppose surface surfaces surrounding survey surveys symposium taken tangles targan techniques tending terms testing than that their them then theorem theory there these this thomas thomassen time toft torics torus towski tree trees treewidth triangle trivial type typical uber undirected univ university unspilittable unspittable unsplittable verallgemeinerung verlag version vertex vertices vierteljahrsschr vlsi vortex vortices wagner wall want wanted wessel when where which whose width wiley wilson winkler with without wollan woodall written xiii zurich zusammenhangs
http://doi.acm.org/10.1145/1283383.1283502	117	Complexity of Delaunay Triangulation for Points on Lower-dimensional Polyhedra.	achievable acknowledgments added addison algebraic algorithm algorithms almost also annu annual another applications attainable attali authors average avis ball bellairs boissonnat bound bounds bremner case chan chazal chazelle clarkson cohen comments compact complexity comput computational computer computing conjecture constructing convex cost could data definition delaunay densely diagram diagrams dimension dimensional dimensions directions discrete discussions distance dwyer easy edelsbrunner elements empty erickson euclidean everett expected extreme face faces february first fixed fruitfull function geom geometry gives goes golin good graphics greater guaranteeing have held herbert here higher highest however hull hulls improve improved infinity initiated inria institute interest kind knowledge lazard lieutier like linear logarithmic longer made manifold manifolds mathematika maximum mcgill mcmullen model more munkres nasty near nice noise noisy number observation only optimal organized output pages papers participants particular pdimensional point points polyhedral polyhedron polytope polytopes possible previous prior probabilistic problems proc programming question radius random reconstruction references related require research restrictive result results sample sampled sampling seidel sensitive sets setting several shor should similar size small smooth space sparse steiner still suggest surfaces symp sympos symposium than thank that theory this three time topology triangulation triangulations university useful using voronoi wesley when which whitesides with work workshop worst would
http://doi.acm.org/10.1145/1283383.1283436	52	On Testable Properties in Bounded Degree Graphs 	abello about abstract academic acyclicity alfonsin algorithm algorithmic algorithmica algorithms alon american annual applications applied august bender bipartiteness bogdanov borgs bound bounded bounds bulletin characterization chayes colloquium colorability combinatorial combinatorica complexity computational computer computing connectivity contemplations czumaj data decisions degree design diameter dimacs directed discrete eatcs eccc editors efficient electronic error every excluded expansion fischer focs foundations freeness general genus gilbert goldreich golumbic graph graphs handbook handobook hereditary homomorphisms hutchinson ieee journal june kaufman kluwer krivelevich kumar large limits lipton lovasz lower massive mathematical mathematics mathetaics methods microsoft minor monotone natural newman news obata october parameter pardalos parnas perfect planar press primer proceedings programs properties property providence publishers rajasekaran ramirez random randomization randomized reed references regularity reif report research resende rolim rubinfeld science separator series sets seymour shapira siam sided sigact society soda sohler sons stoc structures sublinear survey symposium szegedy tarjan technical testable tester testers testing theorem theoretical theory thomas tight time trevisan triangle uninformed vesztergombi volume wiley with workshop
http://doi.acm.org/10.1145/1283383.1283414	30	A 1.875­Approximation Algorithm for the Stable Marriage Problem	abraham acta admissions agrawal algorithm algorithmics algorithms allocation amer amin amsterdam analysis annals applications applied approach approximability approximating approximation bansal berman better bhushan bipartite boston bound canadian carms cechl challenging college combinatorial communication company complexity complicated computation computer consider construction cover currently degree dense dept design details disc discrete division eccc eckenmeyer edition efficient electronics elsevier endent engineering ergraphs erin erties etter even example exchange extension factor fails figure first fixed fleiner fujito fundamentals future gale galeshapley gmopt graph graphs gusfield halld halp hard have hill hospital hospitals house http ibaraki icalp improve improved improving incomplete increase indep indifference information instances institute investigate ipco irving isaac issue issues iwama japanese jrmp karakostas karpinski kavitha kavithar lists lncs local localsearch make malhotra manlove marriage marriages match matching matchings math mathematics maximal mcgraw means medical mehlhorn michail minimum miyazaki monien monthly more morita much multiple nagamochi nishida numb obtain oint okamoto operations optimal optimality optimization pairs paluch pareto partners planar polynomial popular possible press problem problems proc program prop prove publishing ramsey random randomized rank ratio references remarks research resident residents results revisited roommates rsson schemes science scott search second seems service sethuraman shapley single soda solution some somewhat sotomayor stability stable stacs strategic strong strongly structure students such swat technical techniques that theme theorem theoretical there thesis this ties time transactions university upper variants variation vertex volume wads warwick weighted whether which will with women work yamauchi yanagisawa yehuda zito
http://doi.acm.org/10.1145/1283383.1283483	98	Semi-oblivious Routing: Lower Bounds	acknowledgments acmsiam algorithm algorithmica algorithms among annual architectures arrays available balancing begin cambridge capacitated cardinality citeseer client communications computation computer computing congestion constructing contains course decomposition demand dimensional directed discrete discussions does edge engineering expected fact fall fewer flow follows foundations from general global graphs greater grids harald have helpful html ieee improved induced information institute least load magazine manuscript massachusetts matching matchings minimize minimizing mpls must neighbors networks node notes number oblivious online only optimal optimization parallel partition passes path paths polynomial polynomialtime practical press probability proceedings promlems racke recall references research routing satisfy schemes science server siam since society starting such symposium technology than thank that then theory there therefore thesis this through time topics traffic tree units unpublished using valued vertex vertices vlsi which wire with without
http://doi.acm.org/10.1145/1283383.1283440	55	Efficient Subspace Approximation Algorithms	adaptive agarwal algebraic algoa algorithm algorithms also analysis anchored anchoring angle annu appearing appendix applications applying approc appropriate approx approximate approximating approximation approximations argue arxiv assume assumed banez base based basic bdoiu because between brieden cambridge case chandrasekharan choice clarkson clearly close closest clustering column combinatorial combining complement complexity comput computational conclude condition conditions consider consisting constant construct constructed contained containment contains continuous convex convexity core coresets denote denotes descibe deshpande diaz different dimension dimensional dimensionality dimensions discrete distance distinct drineas each embedding enclosing error european existence exists extend extended facilities faigle fast feldman fermat fiat finding finite fitting flat flats focs follows found framework frieze from furnished geom geometric geometry global goodman gritzmann have here high hull hyperplane ieee implies improved induction inductively indyk inequality inner jection journal just kannan kern klee korneenko langford large last least lemma lies likely line linear linearity lines local location locational mahoney manuscript martini math mathematical matrices matrix median megiddo mesa methods minimizes minimum minsum montecarlo most muthukrishnan nearly nonlinear normed note obtain onto operations optimal optimization origin orthogonal otherwise outer over pach panigrahy peled point points polytope polytopes press priate problem problems proc proceedings program programming projections projective proof property prove proving rademacher radii random rank reduction references regression related relative requirement research rithms roweis sampling sarlos satisfies satisfy saul schobel science section segment sequence sets shape sharir silva since sine soda some spaces span spanned springer stand stands streng structures studies subgradient subspace subspaces such suppose supppose symb symp sympos take tamir tells tenenbaum that their then theorem theory there third this through throughout thus time topics translate translation trends trivial unbounded unit university using varadara vectors vempala venkatesh verlag volume wang weber weighted well welzl where whose york zhang
http://doi.acm.org/10.1145/1283383.1283407	23	Instability of FIFO in the Permanent Sessions Model at Arbitrarily Small Network Loads	acknowledgements adapted addition admis adversarial adversaries aggregate algorithm algorithms alto alvarez analysis andrews annals annual applications applied approach arbitrarily architecture architectures arrivals august author automatic awerbuch balter based believe bell bhattacharjee blesa boudec bounded bounds bramson buffer calculus case characterization charny cholvi clark classes come communications complexity computational computer computing conclusions conference contention control convergence cruz december decide decides delay density design determine deterministic diaz disciplines discussions distance duan dynamic each echague efficient electronic elwalid equilibria exact example fernandez ferrari fifo figure final finite first flow fluid foundations fundamental future gallager gamarnik general generalized georgiadis given goel greedy guaranteed guarantees harchol have heterogeneous http ieee implementation infocom information instability integrated interesting international internet january journal kleinberg know koukopoulos koupoulos labs leighton letters liebeherr like link load loads loquium lotker many march mechanism mitra model models most multiple multiplex multiplexing near network networking networks nikoletseas node nonstability november number october once open optimal oriented packet pages palo paper paral parekh part patt performance peris permanent polynomial probability problem proceedings processor protocol protocols provisioning quality queueing queues queuing quick range rate rates real references regarding remark requirements resolution results rosen routing scheduler schedulers scheduling science seidman september serna served server servers service services session sessions shamir shaping sharing shenker shown siam sigcomm similar single sion sivara small spirakis springer stability stable state statistically stiliadis supporting switched switching symposium systems thank that theorem theory there thesis thilikos thiran this time times tradeoffs traffic transactions ucsc under universal unstable uses visits whether which with workconserving workshop would wrege zhang
http://doi.acm.org/10.1145/1283383.1283460	75	Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing	agents aggarwal alem algorithm algorithmic algorithms allow allows alon also application approach approximability approximate approximately approximating approximation archer arora auctions ausiello balcan bartal become been berman besides best beyond bidders blum both bouhtou bounds briest budget budgets callaghan case characterization classes coloring combination combinatorial compatible competitive completeness complexity computation computational computer computers computing considered constant consumer cook coverage crescenzi cross cunningham demaine derandomization derandomized design digital dobzinski domatic duality each edges efficient either envy envyfree equilibria essentially exactly feder feige fiat focs follows free freeman from fudenberg gain gambosi game games garey general generalized glynn goldberg gonen goods graph greedy grigoriev guarantees guide guruswami hajiaghayi halldorsson hand hard hardness hartline have hoesel icalp immorlica improved incentive independent information instances interesting internet intractability item john johnson journal kann karlin kempe kenyon known koltun kortsarz koutsoupias kraaij krysta laboratory ladder lavi lehmann limited linear logarithmic lower lund marchetti maximizing mcsherry mechanism mechanisms mfcs minded motwani multi multiproduct near nearlinear network niques nisan nonparametric number obtain online open operations optimal optimization other packing papadimitriou paper parameter parametric polynomial possible presented press price pricing problem problems proc product products profit programming proof protasi ptas pulleyblank question randomized ratio references remains require research revelation river ronen routing rusmevichientong salavatipour scenario schapira schnitger schrijver science sciences settled shoham shown siam single soda solvable sons spaccamela sparse springer srinivasan stacs stoc strong submodular sudan supply swamy system szegedy talwar tardos tark tech that theory thesis this time tirole towards truth truthful turned uetz uniform unique unit unlimited unresolved utilitarian variation verification very vocking wads waoa well whether wigderson wiley with worst would wright yannakakis zuckerman
http://doi.acm.org/10.1145/1283383.1283409	25	Pull-Based Data Broadcast with Dependencies: Be Fair to Users, not to Items	according aggregate algorithm algorithmica algorithms alive allotted also analysis applied approximating approximation arbitrary arrives asymmetric average avoid bandwidth bansal based better bncod british broadcast broadcasting broadcasts cambridge challenging channel charikar chen clients comb competitive complexity comput computations computer computing concluding conf coppersmith correlation cost current currently customized dark data databases deadline decide deciding dependencies dependent depends design directions discrete distrib does each earliest edmonds engineering environment equiset erlebach european extend fairness files fine first flow focs fond gandhi generation given greedy hall hardness have huang idle ieee improved inapproximability including infocom informatic interesting ipco item items kalyanasundaram khanna khuller konw latin lead ledge lncs long longest maiden measure might minimizing mobile most motwani multicast multiple naor national networks newspaper note number once only optimal order outstanding over pages paral particular performances period policy possible precise preempts presence press probabilistic proc prog program proper providers pruhs published pull pushing queries question raghavan randomized ratio receive references remarks replication requested response schabanel schedule scheduling schieber science second servers sets several shilo should shows siam simply since single soda source speed stoc sviridenko symp systems that theor this thus time towards trans unified university unordered unsplittable velauthapillai volume wait waits weights when which wireless with within work
http://doi.acm.org/10.1145/1283383.1283416	32	Model-driven Optimization using Adaptive Probes	about above abstract acknowledgments acquisition across adapa adaptive adaptivity addition again akella algorithm algorithms allocating almost analysis analyze annual approximata approximate approximation approximations approxrandom artificial arya ashish asking assume available axis babcock babu balancing bandwidth based bases below benefit benefits best bizarro boosted both brian bursty case center centers certain changes charikar cheap collides combinatorial comput computer computing conf conference connections consider constant constructed control copies copy corresponding corresponds cost costs could current data database dean deshpande design dimensional discrete discussions distance distinct distribution distributions driven dual duke each easy edge else ensures every exercise expect expected expensive extended facility factor fagin fails feder first fisher fixed focs following foundations fractional from functions further garg gehrke goel goemans graphical gribble guarantees guestrin guha gummadi gupta halpern happens hellerstein helpful heuristics hong http icalp ieee immorlica implementation implies improved improving independent indyk information input intel internet intl intuitively jain jobs kamesh karger khandekar khanna khuller kleinberg kmedian knapsack krause lagrangian large larger least levy ligence load local location locations machines madden madhyastha maggs management mapped math maximizing measurement median medians metric meyerson minkoff mirrokni model models mohring most motwani mount multi multichannel multihoming multistage munagala must mutual narasimhan near needed nemhauser network networks nine node nodes nonadaptive nonmyopic note observed olston opening operating optimal optimization osdi other otherwise outliers over overall packing pages pair pairs pandit panigrahy parallel partial partialinfo particular paths peled performance place points policies polynomial polynomially possible power precedenceconstrained priced primal principles priority proactive probability probe probed probes probing problem problems proc proceedings processing procrastination programming proof query querying questions rabani raghavan ravi realized references related relaxation reliability removed reoptimization replication resolve restricted right root rounding routing sahai sampling sariel sarkar saswati saves scenarios scheduling schema scheme schulz science search sense sensor separated seshadri seshan setting shaikh shivnath shmoys show siam sigcomm sigmod since sinha sitaraman sixteenth skutella soda solution some source space srimetric stage stanford steiner stoc stochastic submodular swamy symp symposium system systems tardos than thank that then theorem theory there therefore these thesis thirty this through time times tivity trees trivial twelfth twenty uetz uncertainty university unless unprobed using utility utkarsh value values vastava vazirani very vondr wednesday well wetherall what when where which widom will wireless with without wolsey
http://doi.acm.org/10.1145/1283383.1283497	112	Restricted Strip Covering and the Sensor Cover Problem	above abrams accounts acknowledgements advances agarwal algorithm algorithms allocation also alternating although american anything appl applications applied applies apply approximating approximation argument assume automation aware bansal based battery becomes berg best better between bility both bound bounds buchsbaum cannot case chazelle chopra communications comp company compared completely completeness computational computers computing conditional conf consider constant constraints containing contains contribute contributes convenient coordinate could cover covered create cutting cuttings dasika date decreasing denote design desired details difference dimensional dimensions discard discrete discussions dmax dmin does domatic dotted duration dynamic each ease editors efficient either energy enough ensors entirely erickson error essentially europe every examine example exists expos fact factors feige fewer figure finally find first fixed flow following four framework freeman fruitful fully gaps garey general geom geometric geometry given gives goel going goodman group grouped grouping groups guide halldorsson hard hardness have heinzelman hence high higher horizontal however ideally ieee increase increasing indyk information inside instance integer interested interesting intersect intersected intersects into intractability introducing ipsn iterate johnson june karloff kenyon kortsarz larger largest last least lemma like line lines live load loads long lower management math maximum maxsx method minimum minp minsx monitoring moreover most narrow near networking networks nikhil note number obtain omit only open optimal optimization order organization other outside pages paper parameter partition partitioned perillo piotr plane plotkin point pointing points pollack poly polynomial positive possibility potkonjak power preemptive presentation probability problem problems proc procedure processing proof prove ptas randomized range ratio ratios rectangle rectangles reduces references reingold relationship relatives reliability remain remains remila repeatedly repeating replace replacing result resulting results ruled runs same schedule schedules schwarzkopf searching section sensor sensors sequence shaded show siam similarly simple since single situations size slijepcevic small smaller smallest snap solution some srinivasan stance starting steps stock storage strip strips stronger such sufficiently symmetric symp take techniques term terms test than thank that then theorem theory there therefore this thorup tight time total uncover under understanding understood unit until upper using valid value values variant versus vertical view viewed vrudhula wcnc well when where which wireless with within without would yields
http://doi.acm.org/10.1145/1283383.1283463	78	On Bregman Voronoi Diagrams	abstract additive algorithm algorithmic algorithms almost amari anisotropic application applications approach aurenhammer banerjee best boissonnat bounds bregman brown cambridge canadian centroidal chazelle clustering combinatorial common comp complexity comput computational computer computing concrete conference construction convex delaunay dhillon diagram diagrams dimension dimensional dimensions disc discrete divergence divergences eldar elsevier enclosing envelopes euclidean european faber faces farthest finding fitting fixed from further generation geom geometry ghosh give gunzburger half handbook herbster higher ieee ieice image imai inaba inform information inria isbn journal karavelas klein label lback learning least lecture leibler leibon lest letscher lett lindenbaum lloyd lower machine manifolds mathematical mathematics maximum mcmullen merugu mesh method methods nagaoka nielsen nock notes numbers onishi optimal optimality oxford parametric physics plane point polytope porat power press problems proc process processing programming progressive properties quality quantization references refinement regressor related relaxation report research results review revisited riemannian ruppert sack sadakane sampling science sets sharir shewchuk siam smal solution space spheres springer squares statistical strategy sympos symposium takayama takeuchi technical tesselations theory tight tracking trans transactions triangulation triangulations university upper urrutia ussr voronoi warmuth weights with wormser yvinec zeevi
http://doi.acm.org/10.1145/1283383.1283478	93	Noisy binary search and its applications	above again algorithm algorithms alon also answer aslam auctions because binary borgstrom bound bounded bounds coin combination combined comparisonbased computer computing consequently constant contradicts contrak coping cover curve define defined defining demand demonstrates depends dhagat diction discrete disjoint diverges elements enough erdos error errors established event events every exceeds fact factor find first fixed focs foundations from gacs game good halts have hence heorem here ieee implies information input instance interscience joel john journal kleinberg kleitman knowing known kosara large least left leighton less liar lies linearly lower mathematics measure method meyer most noga note number obtain once only optimal optimization other outcomes outputs pages paul pelc playing postedprice presence presented probabilistic probability proc procedures proceedings prove prsence questions recursion reference references regret rivest robert satisfying science sciences search searching series side soda sons spencer stipulated stoc subsets symposium system term than that then theorems theoretical theory third this thomas time tosses twenty ulam under using value very when which whose wiley winkler winklmann with york
http://doi.acm.org/10.1145/1283383.1283488	103	All-Pairs Bottleneck Paths in Vertex Weighted Graphs	acyclic addison akad algorithm algorithmica algorithms algowr alon also analysis ancestors apbp appear application applications arithmetic automata bender between boolean bottleneck bounded bridging canada capacity case chan closure colton common complexity components comput compute computed computer concatenation connected connection construction contains coppersmith correct czuma derandomization design determination directed dokl each east easy efficient equivalent fact farach fast faster fastest fibonacci finding fischer fredman from functions furman gabow galil generalizations graph graphs guaranteed harder hash have having heaps hence hopcroft huang icalp improved indeed interesting journal kowaluk lansing lecture lemma length lightest lingas lowest manuscript margalit matrices matrix maximum method meyer mich multiplication multiplications munro naor nauk network networks notes notice optimization other pairs path paths pemmasani perfect prim problem problems proc progressions proof queries reading real rectangular references related remains revisited rithm runs science seidel sets shortest shown skiena smallest soda some springer sssr stoc strongly subgraph sumazin suppose switching symbol symposium syst system tarjan technical that their then theorem theoretical theory there they thus time toronto transitive trees triangle ullman undirected univ unpublished unweighed unweighted uses using value vassilevska vertex vertices wads weight weighted weights wesley which will williams winograd with witnesses yuster zwick
http://doi.acm.org/10.1145/1283383.1283509	124	The Independent Even Factor Problem	acad acknowledgements adjacent algebraic algorithm algorithms applications applying arithmetic authors breach cardinality certain circuits combin combinatorial combinatorica comments common compo component comput connected connects coppersmith cover covered critical cunningham decomposition define denotes dicircuits dipaths discrete disjoint does edge edges edmonds equal even every exactly exists factor factorization find flowers focs following follows formula frank fujishige function functions gallai geelen generalization gordon graph graphs harvey have helpful holds ieee independence independent instance inter intersection ipco japan kazuo lawler linear linking lncs london manuscript matching matchings math matrix matroid matroids maximal maximum minimal minimizes minimizing multiplication murota nent note number obtain operations optimal partition partitions path pathmatching paths perfect polyhedra principal problem problems proc prog progressions recalling recent reduced references research resp review satisfies schrijver section society some spaces spille springer springerverlag statements struco structures submodular subset such symb symmetric syst systems szeg tersection thankful that their then theorem theory there these trees ture tutte type verlag vertex weakly weismantel where which winograd work york
http://doi.acm.org/10.1145/1283383.1283441	56	A Divide and Conquer Algorithm for d-Dimensional Arrangement	agarwal algorithm algorithms analog analysis annual applications apply approximating approximation arora arrangement balanced bandwidth blum case charikar clusters comput computer computing conquer consider contribute corollary cost decomposition definite deletion devanur differences directed discrete divideand dunagan easily ected edges embeddings equals euclidean even exactly except expander exponent feige finally find finds fine flows follows forward foundations from function generalizes geometric gives going graph guarantee hand hansen hardness hierarchical holds imes improved instead jiaghayi journal karloff khot konjevod level linear linearly makarychev manuscript metrics minimization minimum more most naor next number ompositi only optimal ordered ordering osium other paral part partition partitioning partitions plane polynomial previous problem problems proceedings proceeds processing proof pseudo randomization randomized ratio ravi recall references refinement relaxations respecting rest richa saket same schieb science section semi separator siam sketch solution some spreading symp techniques than that theor theorem theory there this time uncut undir undirected value vazirani vempala version vertex vishnoi volume where will with works workshop
http://doi.acm.org/10.1145/1283383.1283408	24	On the Separation and Equivalence of Paging Strategies	abraham according acknowledgements adequate adversarially adversary against albers alejandro alexander algorithm algorithmica algorithms allan alternative among amortized analysis anna annual another appears applied applying automata average baruch becchetti being believed best beyond biased bijective birs borodin bounding boyar caching cambridge candidate christos ciac claire combined communications comp comparison competitive complexity comput computability computation computer computing concave concepts conference daniel date david denning diffuse discrete discussions dorrigiv dual early efficiency ehaviour elias equivalent erformance eric erschatz etitive etitiveness european explains favrholdt fifo file gagne galvin gerg giel group have high influence input inputs interest irani italian joan john journal july june justifies karlin kenyon konstantinos koutsoupias larsen lazy lene line list locality lookahead loose luca markov measure measures medvedev model modeling models more most munro namely natural neal never news okahead oliver online open operating order ortiz other outperformed outperforms overcome packing pages paging panagiotou papadimitriou particular paul performance peter phillips prabhakar practical practice press probabilistic problem problems proceedings program proposed proved raghavan random ratio reference references reflect relative remains reservation restrict reza rules sandy scandinavian schieb sciences seat separate septemb sequences server shai shortcomings show showed siam sigact silb since sleator soda sole some sons souza special specifically steven stoc study survey susanne swat symposium system tarjan thank that then theoretical theoretically theory these they this thus torng unable under unified university when while wiley with working workshop worst yaniv young
http://doi.acm.org/10.1145/1283383.1283400	16	Equilibria in Online Games	aamas abstract adaptive adds akella algorithms also analysis ascending ashlagi auai auctions awerbuch azar barreno bartal behavior belong berman blum borodin bounds boutilier caching cambridge chaudhuri chun commun comp compatible competitive component components comput computation connected coulston curve data delays demand disc distributed dutta dynamic equilibria expiring extended fiat focs game games generalized given goel goods gradually hartline heidemann hyafil imase incentive includes internet into items jiaghayi karp kleinberg knowing kubiatowicz lavi leighton libman limited line long management math mechanisms merging minimizing monderer nash near networks nisan number oblivious online only optimal orda papadimitriou parkes path players podc posted press price problem problems rabani references regret request resource respectively round selection selfish seshan shenker siam sigcomm singletons sliding soda solution some stability steiner step stoc strategies strict supply systems tennenholtz that then theor theoretic tree trip type uncertainty univ unknown updates usable value vertices waxman window with xamines yaniv
http://doi.acm.org/10.1145/1283383.1283432	48	The k -orientability Thresholds for Gn,p 	access accesses algorithm algorithmica algorithms allocation allocations analysis asymptotic austin azar balanced bins bollob broder cain case chaining choice cloning cocoon comb combinatorial combinatorics comp comput computer computing connectivity constant coop core cores critical cuckoo czuma degree dept dictionaries dietzfelbinger differential directed distributed efficient egnes elled emergence encer equations ergraphs fast fernholz formula fotakis fredman giant given graph graphs hash hashing heide icalp janson jour journal karlin karp komlos korst linear literal lookups luby luczak machine malalla mcgill memory model molloy multiple numb oint oisson onent optimal orientability packed page pages pagh panigrahy pittel pram prob probabilistic probing problem problems proc proceedings processes proof pure ramachandran random randomized reed references regular rodler rule sanders school science separate sequence series siam simple simulations size soda solution space sparse spirakis stacs stemmann storing structures sudden systems szemeredi table tables technical texas theory thesis this threshold tightly time univ university upfal uppsala utcs walks weidling with wormald worst
http://doi.acm.org/10.1145/1283383.1283470	85	Path-Independent Load Balancing With Unreliable Machines	about actions adversary aggarwal albers algorithm algorithmica algorithms amortized analysis annals anomalies applications approximation assumptions balancing balls barcelona bins border boston bounds caesar certain choices communications comput computer computing concerns conference department determine deterministic discrete editor editors efficiency egress engineering fault finally gateway generous germany graham griffin handbook handley have icnp ieee independent interdomain interesting international into issue jasekaran jobs journal kalyanasundaram karlsruhe lawler lecture lenstra leung list load made magazine mathematics mitzenmacher model models more motwani multi nature network networking networks nextgeneration notes observe october online optimization over pages paging pardalos path paths performance philadelphia policies possible power powerful press problem proceedings processing protocol protocols pruhs raab random randomization randomized real rebalancing references reif rekhter report requirements respond results rexford richa rinnooy rolim route routing rules scheduling science second security selection sequencing shenker shepherd siam sibeyn sigcomm silberschatz simple sitaraman sleator sobrinho solve spain special springer stable steger stoica subramanian survey symposium systems tarjan technical techniques that theory tight time tolerant traffic transactions university update utrecht vary vector very volume wang weighted whether wilfong with workshop would yang
http://doi.acm.org/10.1145/1283383.1283410	26	Improved Bounds for the Online Steiner Tree Problem in Graphs of Bounded Edge-Asymmetry	acknowledgements agrawal alejandro algorithm algorithms alon analysis angelop annual appendix approximability approximation argument asymmetric asymmetry awerbuch azar backb bartal before berman bern borodin bounded braun cambridge cases characteristics charikar chekuri cheriton cheung claffy collide comb combining comments competitive comput computation computational computer computing consider consists constant constrained contributes contribution cost coulston david decomposition directed discrete discrte discussions dorrigiv dynamic each early easy edge edgeasymmetry edges effect eleventh euclidean example fall faloutsos figure follow follows forest form found from general generalized generation geometry given goel goemans graphs greedy guha helpful ieee imase improved incur incurred index infocom information instance internet jority journal klein last least lengths letters like line links lower majority mathematics michalis multicast naive netw networks node nsfnet number observation online onsisting optimal order ortiz otherwise oulos ounded ounds overall pages panka path plane plassmann polyzos press problem problems proceedings processing protocols ramanathan ravi references represent representative requested requests result reza robins roughly round rounds routing school science segev sevcik seventh show shown shows siam simplicity since steiner suppose symposium technical technique terminal terminals thank that their then theoretical theory there thesis thimm third this thus toronto total traffic trans translates tree trees twentyninth university vertex vertices waterloo waxman weighted well when where which will williamson with would yaniv zelikovsky
http://doi.acm.org/10.1145/1283383.1283413	29	Approximation Algorithms via Contraction Decomposition	according acknowledgments alamitos algorithm algorithmic algorithmica algorithms allocation allows almost along also amir andr andrzej annalen annual apex apices appear appendix application applications applied approximate approximation arbitrary areas arora artificial artur aspects association attaching august automata avrim back baker baltimore bcgz because been believe berger berlin biconnected bidimensional bijection bled blum bodlaender bogdan borradaile both boundary bounded bounds brenda bruce brunet cabello called cambridge canadian cannot carsten center cgsz characterizations christos chromatic circle circuits class classes clique closed coloring combinatorial combinatorica combinatorics combined complete computation computer computing conference conjecture connected connecting consider constant contracted contractible corollary corresponding crossing current cycle cycles czuma daniel david december decomp decomposition deep define defined deleting demaine denoted depend depending designing devos dfht diameter difficulties dimitrios ding dirk discovering discrete discussions disjoint disks dorn drawn each eben edge edgeconnected edges efficient eigenschaft eigenvalue eine electronic elias embeddable embedded embedding embeddings endpoints endre eppstein equivalence erik european every except excluded excluding exist existing exists expander exponential expressed eyal face faces families fast fedor feige finding finland fixedparameter flow flows fomin forbidden form foundations francisco frederic free from general generalize geneva genus geometric gilbert gives glencora goal goes good graph graphs grigni grohe guoli hairong hand hans have help helpful here high homotopic hopkins however hutchinson icalp ichi identifying ieee images important indices induced industrial information integer intel international january jiaghayi joan john johns join jonathan journal july karger kaufmann kawarabayashi kelner kernel kilian klein knowledge komplexe koutsoupias languages latvia lecture leighton less level ligence light linear lipton liptovsky local london loquium machinery made make mallorca many martin math mathematical mathematics mathematische matt michelangelo mikkel milwaukee minimum minor minorclosed minors mohammadtaghi mohar more morgan most multicommodity naomi necessary need neil nishimura nonetheless nonseparating note notes notion notions number obtain obtained october only open operations operator oporowski ordered ordering orderly osition packings pages pairwise palma papa papadimitriou parameterized parameters part partial particular partitioning path paths pathwidth paul philadelphia philip piece pieces pittsburgh planar planarity points polynomial possible possibly prabhakar practice precise precisely press problem problems proceedings programming programs progress ptas ptass publishers quotes ragde real realized reed references register result results revisited richard richter riga robert robertson robin roughly same sanders sanjeev satish says scandinavian scheme schemes science sciences separating separator september sergio series serves session sets seymour shortest siam simply single sissokho size slovakia slovenia small society soda solve solvene some spain spanner spanners spanning speaking spectral speed springer structure structured studies subexponential subgraph subgraphs submultigraph subset such suppose surface surfaces surmounted surveys symposium system tarjan terminology than thank that their theorem theorems theory there these they thilikos this thomas thomassen thorup time tool topologically toward transactions tree treewidth trends triangulation turku uber umesh uncertainty understanding union univ university unweighted uriel vazirani vertex vertices vertigan virtual volume vortices wagner weighted well where whereas which width with within woloszyn workshop would written zero zhao
http://doi.acm.org/10.1145/1283383.1283518	133	Counting good truth assignments of random k -SAT formulae	achlioptas algorithmic algorithms american analytic approximation assignment bandyopadhyay belief berkeley berlin case characteristic complexity computational computing correlation counting decay dept determining diluted endent entropy enumeration erature families fields francisco franz friedgut from gamarnik georgii gibbs graph graphical gruyter hard high indep inference intelligent ising jerrum jordan journal kaufmann kirkpatrick leone lett location longer loopy mathematical measure measures model models monasson montanari morgan naor nature networks onential optimization ounds parisi pearl peres phase phys physics plausible poissonian polynomial preparation probabilistic probability problem problems proceedings propagation proprties random reasoning references related replica report rigorous sampling satisfiability satisfying science selman sets shah sharp siam sinclair society soda solution spin stat statistical stoc systems talagrand tatikonda tech temp theory threshold thresholds time toninelli transitions tree troyansky university using variational version wainwright walter weitz without working zard zecchina
http://doi.acm.org/10.1145/1283383.1283448	63	Deterministic rendezvous, treasure hunts and strongly universal exploration sequences	acknowledgements activation aleliunas algorithmica alon always among anonymous arbitrary arguments backtracking believe between cannot close collisions complexity computer connectivity construction coppersmith cover define definition deserves dessmark deterministic dfkp difference discrete discussion exist existence explicit exploration focs fraigniaud further furthermore goldreich graph graphs however hunt improved independent isaac john journal june karp know koucky kowalski last length lipton logspace mathematics maze method natural network obtain obtained oded online pages paper pelc place polynomial probabilistic problem problems proc prove publication question rackoff raises random references reingold rendezvous robot robots sciences sequences show siam sirocco solution solutions spencer standard static stays stoc strong strongly study system technique tetali thank that there this time times traversal treasure undirected universal used utss variant very walks wether where whether which wiley winkler with
http://doi.acm.org/10.1145/1283383.1283402	18	Convergence to Approximate Nash Equilibria in Congestion Games	academy acknowledgements adaptive additional algorithm algorithms also anarchy applications approximate approximation artificial asymmetric atomic auctions automata awerbuch azar beckmann behavior blum bounding bounds carry case chen christodoulou christos cking class combinatorial commerce comp complexity computation computer computing concurrently conference congestion convera convergence daskalakis delay deng dependent discrete distributed dynamics each easy ecific economic economics efficient electronic epstein equilibria equilibrium erson etitive even exact example fabrikant facility factors fast ffer finite fischer fleischer flow foundations functions game games gence goemans goldb hard helpful ieee immorlica inefficiency influence input intel interesting international internet investigate issues johnson journal kearns kesselman koutsoupias kunal languages large ligence ligett linear lipton lisa loadbalancing local location mansour markakis mcguire mehta methods milchtaich minimizing mirrokni monderer move moves multiplayer nash national nicole nonatomic oints only optimization opulation orlin ossessing ounded over papadimitriou payoff player players playing polynomial potential press price principles problems proc programming punnen pure purestrategy randomized rate references regret rerouting rosenthal roughgarden routing sampling schulz science sciences search selfish settling shapley siam simple sink smoothed societies solve step strategies studies symposium system talwar tardos teng thank that theory time traffic transportation uncertainty university unsplittable using vetta wardrop which winsten with without workshop would yale yannakakis
http://doi.acm.org/10.1145/1283383.1283522	137	Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP	aarts about absolute aforementioned algorithm algorithms already analysis anneke another applied apply appropriate approximation arora barun been berthold between bound bounded case chandra changes christos combinatorial complete computer computing constant constitutes constructed contain corresponding craig daniel david deviation does easily eccc editors edwin englert enough euclidean even every exist expected experimental experimentally exponential exponentially factor failure finally from further gaussian geometric george gerhard given glin global graph graphs have heiko hence heuristic heuristics howard implies improving insertion instances interest interesting interval john johnson journal karloff kern larger leading leave leeuwen length lenstra less lewis library lies local long longest lueker lyle make manhattan manuscript mathematical matthias mcgeoch mentioned merely metric multiplying must narrow necessary nodes ntil number observe observed obtains olynomial only open optimization optimum orsa other outside papadimitriou particular path percentage perturbed philip plane points poly polynomial possess princeton probabilistic probability problem problems programming question random ratio redraw references reinelt remark results richard rosenkrantz ruucs salesman sanjeev schemes schoon science search sequences several shang show siam simplex sink small smoothed sons spielman standard state stearns steps studies study switching takes technical teng than that then theorems theoretical these they this time tour tovey traveling tsplib uesti uniform university unpublished untangling upper using usually utrecht value values variables variant vocking walter whether which whose wiley with within worst yields
http://doi.acm.org/10.1145/1283383.1283385	1	A PTAS for TSP with Neighborhoods Among Fat Regions in the Plane	abstracts acknowledgments algorithm algorithms amsterdam annu appear appl approximate approximating approximation arkin arora automata banyans berg boca brook chapman chapter cheong clustering collection combinatorial comments complete complexity comput computational computers corrections covering delineation design devoted discrete disjoint draft dror dumitrescu earlier edition editors elbassioni elsevier euclidean european explicit fast faster feremans fishkin freeman garey general generalized geographic geom geometric geometrical geometry goodman graphs grigoriev ground group gudmundsson guide guillotine hall handbook hard hardness hassin helpful holland internat intersecting intractability issue january johnson journal katz known lang lecture levcopoulos lines manuscript mata math mathematical mitchell mustafa neighborhoods network networks nordic north notes npcompleteness optimization orlin otfried other overlap overmars page pages pairwise papadimitriou paper part paths plane planes polygonal polynomial polynomialtime problem problems proc prog programming proofs ptas publishers raton references regions related rely report rourke sack safra said salesman scheme schemes schwartz science shortest siam simple sitters size smith space spanners special springer stappen stony straight subdivisions subsets survey sympos symposium technical thank that theoret theory there time tour traveling tspn university urrutia varying verlag volume washington what with workshop york
http://doi.acm.org/10.1145/1283383.1283495	110	Spectral Clustering with Limited Independence	achlioptas again alan algorithm algorithms alon along also amos analysis anirban anna annals annual applied arbitrary arise arora assuming assumption average away azar balanced been believe benny besides bhatia bisection boppana bordered bounds case certain characteristic christos clique clustering collaborative colorable coloring colt combinatorica competitive complexity computations computer computing concentration conclusion conference consider current customer dasgupta data degree dependence details dimensions dimitris directions discrete distribution distributions does doing drineas dyer easy edition eigenvalue eigenvalues endre entries eran essentially eugene expansion expected extend extended extending extra factors feige fiat filtering finding form foundations framework frank friedman frieze from full functional furedi further gaussian gaussians general generative gives golub grant graph graphs hadi hard have heavy here heuristics hidden higher hisao hopcroft hopkins however hypothesis ieee implies imply important independence indexing inequality infer infinite interesting involved iordanis isotropic issue janos jared jeff jendra joel john johns journal kahale kahn kannan karlin kerenidis kilian komlos krivelevich kucera large larger last latent learning learnt lemmas leonard letting limited loan logarithmic london mark martin mathematics matrices matrix mcsherry method michael mixture mixtures model models moment most motivation nabil natural noga norm number ofek omit open papadimitriou partitioning petros pods polynomial positions possibly prabhakar press probabilistic problem problems proceedings product properties property proved quadratic question questions raghavan random rank ravi recommendation reconstruction references regard regular related required results roots round rudelson saia salmasian sanjeev sanjoy santosh schulman science sciences second semantic semirandom september siam skewed solution some sparse special spectral springer stoc strengthened strong structures such sudakov symmetric symposium system systems szemeredi tackle tailed tamaki technique techniques that theorem theory these third this time type under university uriel using variant vectors vempala verlag very wang whether whole wigner will with work york yossi zoltan
http://doi.acm.org/10.1145/1283383.1283412	28	Optimization Problems in Multiple-Interval Graphs	academic acknowledgements agarwal algebraic algorithm algorithmic algorithms alignments allocation alon annals annual applications applied approach approximated approximating approximation aumann axis bafna berman birkhauser blin boston brandst chan clark classes clique colb coloring combinatorial combinatorica complement complete complexity computational compute computer computing constant corresponds cover covering crochemore cyclical dasgupta data define demands discrete discussions disk dotted efficient endent endpoints erlebach european even experimental extremal factor fertin figure fixed foreach fractional freund fruitful function gaur genotyping geometric geometry golumbic graph graphs griggs halld hard hassin hermelin high hitting hochbaum hunt ibaraki improved indep independent integral international intersection interval intervals jansen jects johnson journal kaiser karloff kohli kreveld krishnamurti landau lehel lems letters levin lewenstein like line linear lines local location marathe matching mathematics maximum mckee mcmorris megiddo melamud methods minimum mirchandani multi muthukrishnan naor narayanan ncapproximation nonoverlapping numb ological operations optimization ounds ourn packing pages pair papadimitriou parallel partitioning pattern perfect piercing pinter placement planar plied polynomial polynomialtime press primaldual probaa problem problems proceedings program programming pspace radhakrishnan ramaswami ratio ravi rawitz real recognizing rectangle rectangles rectilinear references relatives research resource result results return rosenkrantz rounding rsson ruven satisfiability schedule scheduling scheinerman schemes science sciences segev seidel sets shachnai shapira shieb shift shmoys siam soda spinrad split stabbing stable stearns straight subset suffice suri survey symposium systems tamir tardos thank then theorem theoretical theory three throughput tiling time tinterval topics transversals unified unit using values vertex vialette weight weighted west which with within workshop would yakhini yannakakis yehuda york
http://doi.acm.org/10.1145/1283383.1283451	66	Sandpile transience on the grid is polynomially bounded	abelian algebraic almost along ambient applied around aspects automaton babai been begin between biggs bjorner borgne bound boundary bounded cambridge case center centered centers central certain chip class comb combinatorics configurations conjecture constrained constructions continue contraction corresponding critical criticality departure depicts derived destination dhar diagonal diagonally diamond diamonds diffusions digraphs disc discrete does drsv endix equivalence europ expansion exponential exponentially extend family figure figures finally finite firing flood flooded flooding game games goldbug gorodezky graph graphs grid group grows have high holroyd html http hyperbolic identity image infinite intel jensen jour kleber laci large larger lecture left lett levine ligencer limit linked locally london long lovasz majumdar math median mixing model models monoid move notes once organized other parts path people phase phys physica physics plane polynomial polynomiality polynomially potts preparation progressively propp quasirandom random rank recurrence recurrent references right rossin rowlinson ruelle sampling sandpile sandpiles segment self sequence sequences shapiro shor shows siam similar sink smaller spaces square state stop structure surveys symmetry tang tardos that then theory tilings touched toumpakari toward towards transience uchicago until variations verma vertex walks were what whose wiesenfeld winkler with
http://doi.acm.org/10.1145/1283383.1283487	102	Line-of-Sight Networks 	acknowledgement acmsiam advice agoston algorithm algorithms alon also analysis applications approximation area asymptotic based best bettstetter bipartite birkhauser bollob boston bound broadnets cambridge capacity charge charged charging charter charters chrobak claw combinatorica communications computed computer computing conference connectivity control correction cost costs critical current data definition degree density design deuschel deviations diameters discrete distinct each ecial edge edges edition efficient efrat encer ercolation erties every expander fields finally fleming free frieze from galleries geoffrey geometric goel graph graphs grimmett guarantee guarding guards gupta hartenstein have high honor html http ieee ietf ifip improved incident information international israel issue journal june kalai klee klein krishnamachari kumar large leading lecture lemma locating location manet manetcharter march math mathematics matousek mauve mceneaney method minimum mitchell mixed mobihoc mobile molloy monotone multihop naor nearly network networking networks node notes novemb novick obtain oint optimal optimization optimum order osium oted ounded ower oxford pages peled penrose percolation personal pervasive philip pisztora polynomial position possible press probabilistic probability problems proc proceedings proof prop protocols random ravi references related relative review robins routing royer science second sees sensor sharp small spanning splitting springer steiner stochastic structures studies surface survey symp thank their theoretical theory this thresholds thus time together toward transactions tree trees university using valtr verlag version volume weight weighted weights where widmer wiley wireless with workshop zelikovsky zhang
http://doi.acm.org/10.1145/1283383.1283475	90	Single Source Multiroute Flows and Cuts on Uniform Capacity Networks	about acknowledgement aggarwal algorithm algorithmic algorithmica algorithms allgemeinen also analysis annual appear applications approach approximate approximating approximation approximations aumann author bagchi baier bandwidth baveja better between bound bounds broadcast canad capacities cases chakrabarti charles chaudhary chekuri cidon classical close combinatorial combinatorica commodity computer computes computing conclude connected connections consisting cost cuts dallas deleting described design designing dinitz disconnecting discrete discussions disjoint duality edge edgedisjoint edges erlebach flow flows ford foundations from fulkerson fundam garg general geometry goemans graph graphs guaranteed gupta guruswami hall hardness ieee ieice improved inapproximability instance instances instead international japanese jaraman journal khanna kishimoto kleinberg kodialam koehler kolliopoulos kolman kumar kurventheorie lakshman last leighton length line linial london lost lower martens math mathematical mathematics maximum menger method minimum modified more multicommodity multipath multiple multiroute neal near needed network networking networks note novel obtained obtaining only open operations optical optimal optimization orlin packing pages parallel paths prague problem problems procedure proceedings programming proof rabani rabinovich ratio references related relation reliable report research restorable results revisited route routing scheduling scheideler science sciences section sgall shavitt shepherd short siam similarly simple single sink size skutella slightly some source sources splittable srinivasan stein stimulating symposium system takeuchi technical texas thanks that their theorem theorems theoretical there these thesis think this through transactions uniform university unsplittable using vazirani vertices while will with workshop yannakakis yefim young
http://doi.acm.org/10.1145/1283383.1283466	81	On bounded leg shortest paths problems	acmsiam advances agarwal aggarwal algo algorithm algorithmic algorithms almost alon american amortized annu annual application applications approach approximate approximating arrangements arya automata baswana bentley berg berlin bernard beta binary body bose bottleneck bridging callahan chan chazelle cheaply closest compacting complete comput computational computer computing constructions consumption contemporary convex data david decomposable decomposition diagrams diameter dimensional dimensions discrete distance dynamic edition editors efficient efrat elkin eppstein epsilon erickson euclidean exact extrema fields fuel functions general geom geometric geometry germany good goodman graph graphs halfspace hansen hershberger hull hulls icalp ieee inform integer international jeff journal july kapoor knearest kosara kreveld languages lanky layers leighton levels linear logarithmic loquium marc mark mathematical mathematics matouek matrix meheswari micha michael mikkel minimum mount multidimensional multiplication narasimhan near nearest neighbor neighbors operations oracles otfried overmars pages pairs panka partition paths peleg pettie planar point points pollack positive potential preparata problem problems proc proceedings programming providence queries query randomized range real rectangular references relatives retrieval rithm salowe saxe schwarzkopf science search searching semidynamic sets shallow sharir short shortest siam simple single size small smid society solutions solving source spanner spanners spanning sparse springer static stoc structure suri sympos symposium techniques theoretical theory thin thorup time timothy trans transformations trees undirected using vaidya verlag vertical volume voronoi weighted weights with zwick
http://doi.acm.org/10.1145/1283383.1283421	37	An unbiased pointing operator for unlabeled structures, with applications to counting and sampling	academic acknow acyclic admissible after algebr algo algorithms alkanes along also amini analytic annals appl apply approximate arxiv assumption asymptotic available bell bergeron bias biological bodirsky boltzmann bolyai book books bounded burris cactus calculus cambridge cameron canad carbon case census chain class classes comb combinatorial combinatorics comimply complexity computation computer conf connected constructions correctness cost counting covers cutsem cycle decomposition definition degree digits discussions duchon each edinburgh efficiency efficient eled elle elled ensures ensuring enumeration enuof evaluate exact example examples exist exists expected finite fixed flajolet following form forthcoming fpsac free from fruitful functions fusy general generating generation give given gives grammar graph graphical graphs greatly group groups harary have hell hence high homomorphisms howell html http icalp inria instance integer involving isomorphic jerrum jolet kang ledgements lemma leroux lfcs lies like linear linearly liskovets lncs london louchard lowing maps markov math meration meth modulo molecules neetil negligible nijenhuis njas node nodes nonplane numb omid operations operator oracle osition other otter outerplanar oxford pages palmer particular permutation philippe pivoteau planar plane pointed pointing polya practice precision preparation preprocessing press principles prob proc proceedings proof proposition proved publications puting quadratic quartic random real recursive recursively references research rooted rules said sampled sampler samplers sampling schaeffer science secondary section sedgewick selection sequences siam simulation since size sloane small smith species specified structure structures submitted such sufficient symmetries technical techniques terminal thanked that then theorem theoretical there these this time trated tree treedecomp trees tutte unbiased under uniform uniformity uniformly univ universal university unlab unlabeled unrooted using values vector vigerske volume waterman which wilf with work yeats york zimmerman
http://doi.acm.org/10.1145/1283383.1283393	9	Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovasz extension and non-smooth convex optimization ´	academic acknowledgements algorithm algorithms allocation also amsterdam analysis anonymous applications approach approxie approximately approximation athena bachem base basic belgium belmont berlin bertsekas bienstock bonn bounded case catholique charikar chudak coincides combinatorial combinatorica common compact complete compute computing concerning consider constraints convex convexity core cost costs course cover covering cunningham define defined definition definitions describe design differentiable discrete discussion discussions dual dular each edition eigenvalue eleut elsevier endix erated etyan euclidean even excessive extrap facility fleischer flow flwp focs formulation fractional fujishige function functions geometric grateful groetschel have hayrap here hessian hierarchical hochbaum hong improved inequalities information initialization installation institute integer interior introductory ipco iteration iterations iwata iyengar journal khuller kluwer korte least lecture lectures levi lexicographically linear location louvain main massachusetts mathematical mathematics mation maxuq metho method methods minimization minimizing minimiztion minimzation minxq mixed more mount narasimhan nesterov network networks nonlinear nonsmo nonsmooth norm notes olation olymatroid olynomial operations optimal optimization ounded outliers over packing parallel parameter pointing potential practice press primal princeton problems programming proofs properties proposed publishers quadratic reader refered references referred related relaxations research resp respect reviewer rockafellar rooted satoru schemes schrijver scientific second sequential series service several shmoys show siam smallest smooth soda solved solving special springer state states stoc strongly subgradient subgradients submo submodular such svitkina swamy tardos technical technique text thank that their then theorem theory this time trees tschel twice university used useful using usual variation variational vector verlag vertex vygen weight when where which with young zuiki
http://doi.acm.org/10.1145/1283383.1283454	69	Fast Elimination of Redundant Linear Equations and Reconstruction of Recombination-Free Mendelian Inheritance on a Pedigree	adeyemo advances algebraic algorithm algorithms allegro altshuler analysis annual applications approach approximation arithmetic association available bafna baltimore based beckmann bioinformatics biol biology blocks blumenstiel cardon certifying chan chen cherny chin cofiguration combinatorial complexity comput computation computational computations computer computing conceptual conference configuration configurations connell consortium cookson coop copp cordero cryptology daly data deductive defelice dense descent determining devlin disequilibrium ecasis edigree edigrees edition edwards efficient elimination elkin emeky epidemiol erfect erin ersmith eskin euquations evolution exact faggart family fields finding fine finite flow framework frigge from fung gabriel gaussian gene genet genetic genome genotyp ghosh giesbrecht golub graphs gudb guided gusfield halld halp haplotyp haplotype haplotyping hapmap helmuth hered higgins high hopins http hudson human iccs ieee incomplete inconsistency inference integer international isaac istrail jartsson ject jiang john jonasson journal jumder karp kong kruglyak lamacchia lander lange large lecture linear linkage linked lipp lliu loan location lochner lowerstretch manuscript mapping maps marker markers maryland math matrix measured meets merlin method methods minimum missing molecular moore multip multiplication nature nguyen nonparametric notes numer odlyzko oint optimal over overview pages paper parametric pedigrees phylogeny press problem proc proceedings program programming qian rapid recomb recombinant recombination recombinations reconstruction reeve references research resolution rioux roeder rotimi rsson rule saunders scale schaffner science scores seltman sequencing sharing shen snps solution solutions solving spanning sparse speed spielman statistics stoc strassen structure suppl survey symb symbolic symposium systems tapadar teng test theory third tightly time trans transmission tree trees unified univeristy unpublished using wabi ward waterman weeks wiedemann wijsman winograd with without workshop xiao yooseph zero zhang zrhc
http://doi.acm.org/10.1145/1283383.1283490	105	Matrix-Vector Multiplication in Sub-Quadratic Time (Some Preprocessing Required)	adamedii addison adkf algebraic algorithm algorithms american analysis annual application applied arithmetic arlazarov atkinson automata automaton basch birkh boolean borodin boston bound cauchy certain chan closure comm comments complexity comput computation computational computations compute computed computer computing confluent construction context control coppersmith data department design diameter dinic directed discrete division doklady economical efficiently elimination elsevier evaluation extending faradzev fast fiduccia forms four fourier free functions gaussian general gohberg graph graphs helpful hopcroft ieee information interpolation investigation journal khanna kronrod languages letin letters like linear literature math mathematical matrices matrix modular moenck motwani motzkin multipication multiplication multiplications munro nauk nearly necessary number numer numerical olshevsky optimal pairs paths polynomial polynomials practical preprocessing present problems proc product progressions pure pushdown rational reading real recognition referees references report revisited russians rytter santoro savage science shokrollahi shortest siam society soda springer sssr stan stanford stoc strassen structured structures superfast switching symb symposium technical thanks theory this time transform transforms transitive ullman undirected unified university unweighted user vector verification wads weights wesley winograd with work workshop york
http://doi.acm.org/10.1145/1283383.1283403	19	Efficient Contention Resolution Protocols for Selfish Agents	above access agent agents algorithmic alice allen aloha also altman altruism altruistic always analysis anarchy another appendix approach argued argument ariel arises associated association assume assumes assumption avoid azouzi bandwidth barman base based beatcs because before behavior bound cambridge cannot case cast christos claim claims common competition computer congestion consider control cost course crete deadline deal dealing decision decreasing definition delay denotes derivative descendants design dhiman different direccapture direction directions directly disa discussion distributed dividing done doomed double duration dynamic each edge eitan either elias equation equilib equilibria equilibrium establish establishes establishing european even exactly exdeadlines expected extensions fact fails feigenbaum file find finite first flow focuses follow following follows form framework from function functions fundamental future gallons game general generalizing generally give goal grounds have hence holds home host hour hypothesis imagine implicitly implies important include including increasing induction inductive inequality infinite infocom information inner intriguing intuition investigate itself john justification koutsoupias labelled latency lead leaving lecture lemma length letin linear link lower lowest lutions mackenzie markov martin masdescribing massachusetts mechanism minimization minute monotonically moral more moshe movie mpeg much multicommidity multicommodity multipacket multiple namely networks next nonblocking none note notes number only osborne other otherwise outer packet papadimitriou parameter partial pending perfect performance play playing plays press previous previously price prior probabilities probability problems processes programming proof proposition protocol protocols prove provide puterman quiescent rachid range raphael rate rational recall recent references remaining remark removing required requires research respect results rium root roughgarden routing rubenstein rush sachusetts same sami scenarios science second section selfish sense sharing shenker show showing shows sidi similarly simply since single slots slotted some sons sotions special springer stability state steady stems step stephen still stochastic strategic strategy study substituting succeed success successful such symmetric tania tensions term than that then theorem theoretic theoretical theory there therefore thereof these this thus time traffic transmission transmit transmits understanding until used users utilities utility variant variety various verlag vertex waldrop where whether which wicker width wiley will with within work worstgeneral york
http://doi.acm.org/10.1145/1283383.1283398	14	Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems	algorithm algorithmica algorithms analysis annual appl applied approach approximate approximating arborescences bang barrier benczur beyond canada cole combinatorial comm components comput computing conclusions connected connectivity construct constructing cuts decomposition design diego discrete edge electron entire fast finding flow flows frank geometric goldb gomory graph graphs grotschel gusfield hariharan harold hiroshi ibaraki increasing indust inform inst jackson jacm jensen karger lineartime local math mathematics matroid methods minimum mixed montr most multi multigraph nagamochi network obtain open optimization osium packing pairs partial possibly presented preserving problem problems proc proving random rather references rizzi romeo sampling schrijver section siam simple sixth solve spanning sparse springerverlag stated steiner subgraph symp system terminal than theorem theory thus time toshihide toshimasa tree twenty used using very watanab which
http://doi.acm.org/10.1145/1283383.1283392	8	Improved bounds for the symmetric rendezvous value on the line	able academic acknowledgments adding address adopted advantage algebra alpern also analysis anderson applications applied arbitrary argonne argument aspect asymmetric asymmetry asymptotically attained based baston because beck becomes believe benson better bound bounded bounding bounds calculation calculations case cases challenging column communication computational computer computing concluding cones conjecture consider control correction current department desirable deterministic different distance distinguish distinguished division does double draft dsdp encouraging error essegaier expected extended extensive extremely fact feller finally find first following games global grateful have here however http idea increasing indistinguishable initial instead introduction just kluwer laboratory large last lengths letting limitation limitations line linear local logist lower main markovian math mathematics matheo matical matlab matrix maximizing mayer mcsp meeting memory method methods minimization mixed more moreover moving national naval need note numerical obtained offer only oper operations optim optimal optimization optimizer order original over paper parallel patterns personal perspective pittsburgh players pointing presented preserving press princeton private probability problem problems programming proof proving pseudostrategyn publishers pure quote random rather reasons referees references remarks rendezvous report requirement research resources result revised scheme science search sedumi semidefinite september serve shorter should siam softw software solve strategies strategy sturm suggesting support symmetric table technical techniques than thank that theorem theoretically theory this time toolbox university unix unknown upper using uthaisombut valid version volume while wiley will with work working
http://doi.acm.org/10.1145/1283383.1283503	118	On the number of tetrahedra with minimum, unit, and distinct volumes in three-space	agarwal algorithms amer angles apfelbaum applications area areas aronov arrangement arrangements beck between bound bounds burton chap chazelle circles clarkson comb combin combinatorial combinatorica combinatorics common complexity comput computational computing conf congressus congruent constructing contains contemp convex corrigendum counting croft crossing crossings curves degenerate determine determined dimensional dimensions dirac directions discrete distance distances distinct duality dumitrescu eastern edelsbrunner elekes elsevier entropy erdos extremal falconer feldman finding finite four geom geometric geometry graph graphs guibas handbook heidelberg hence higher hyperplane hyperplanes improved improving incidences inequality iosevich joints katz knauer koltun konyagin lattice least lecture lemma line lines london manuscript math mathematics monthly more moser motzkin noncollinear notes number numerantium pach perimeter pinchasi planar plane point points power press probab problem problems proc property providence purdy radoicic references related repeated research rote rourke rudnev sack seidel sequences sets shar sharir siam side simplices socg some south space sparse spheres springer straus swanepoel sweeping sympos syst szemeredi tardos tetrahedra their theorem theory three topologically toth towards triangle triangles trotter ungar unsolved urrutia verlag volumes welzl with york zone
http://doi.acm.org/10.1145/1283383.1283505	120	The Effectiveness of Stackelberg Strategies and Tolls for Network Congestion Games	achieving acknowledgment algorithms allowing also altruism anarchy appears arbitrary aspects assignment associated atomic august awerbuch azar beckman bounds caragiannis case change choosing christodoulou civil class cole collaboration collusion cominetti comments commodity communication competitive compute computer computing congestion consists correa cost dial discussions dodis drafts earlier economics edge edges effect efficient elias enforceable enforcing engineers epstein equality equilibria every extend fair fast feasible finite fleischer flow flows focs fractional function functions games general generalized hayrapetyan help hence heterogeneous huang icalp ieee improved include incurring independent institute internet ipco italy jain jective jhis journal june kaklamanis kanellopoulos kaporis karakostas kolliopoulos korilis koutsoupias kumar latency lazar linear lisa macmillan mahdian manuscript marathe mcguire mcmaster mixed model moses much multi multicommodity multicriteria multiuser must network networking networks nonatomic nonlinear note obtained only operations optima optimal optimized optimum orda pages papadimitriou paper parable part particular pigou players press price pricing problem proc references report research resources results road rome roughgarden routing satisfy scheduling schulz science sciences section selfish september setting several sharma shimkin siam single solution some source spaa spirakis splittable springer stackelberg stacs stier stimulating stoc strategies strategy studies such suffice system tardos taxes technical term thank that then theoretical there these this thresholds thus tolls topology traffic transactions transportation university unpublished unsplittable useful user users using value volume wardrop welfare were wexler where williamson winsten with worst yale yang
http://doi.acm.org/10.1145/1283383.1283405	21	Better Online Buffer Management	able above account achieve achieves acmsiam adding adversary after agreeable algorithm algorithmica algorithms along already always analysis andelman annual appears appendix argument arrivals assume assuming automata azar bansal bartal beats because becomes been before beginning best better between bits borodin both bound bounds buffer buffering calculation call called cambridge candidate cannot canonically case cases chin choice chosen chrobak ciss clearly colloquium come compare competitive competitiveness computation compute computer computing concept conference consider considering construct contains contrary contrast current dead deadline deadlines deciding decision defined delivers depend design deterministic difference diffserv discrete distributed does dropped drops dummy each earliest ease easy ects employs empty endix ends englert enough enumeration equivalently especially europ evaluating eventually example examples exhaustive existence explicitly expression field fifo finally find first fixed fleischer following follows found four fraction from full function fung further future gain gained general generality generated give greedy group grouping groups guarantees half hard have help here highest history however icalp idea identifying implies important improve improved improvement improvements improves include independently indexing information innovation instance instances instead instructive international into introduce involved itself jawor jobs journal kesselman kimbrel know languages large last later lavi least left length letting lines long loss lotker lower mahdian maintains makes making management manner mansour marked marks matched maximizing maximum memoryless might more most motivate multi must natural nearly networks newly note number obtained offline online only optimal order osium other ound ours overflow packet packets pages pair partial particular patt pattern pending performance perhaps play podc polices possible potential press principle principles problem proceedings programming propose provisional queue queuing randomization rank ratio references relation released releases rely remarks removed repeat reset rest results richter role routine said same schedule scheduling schieb schmidt science sciences second send sending sends sent sequence sethuraman sets sgall shamir show shows siam similarly simple simply since single size slotted small soda some sorted speculate stacs stage stages starts status stee stein step steps stoc substantially such superscript suppress suppressed sviridenko switches switching symp systems take terminology terms than that their then theoretical theory there these they this those throughput thus tichy time timesharing total twice unit university unlike upper used uses using value values various verify very volume weight weighted westermann what when where whether which while will with without work works worse yaniv zero
http://doi.acm.org/10.1145/1283383.1283492	107	Fast computation of power series solutions of systems of differential equations	able abrupt academic acta actes again algebra algebraic algebras algorithm algorithms also amer anal analysis analytic angew appl approximate arbitrary arithmetic august basis baur becomes behavior behaviour berechnung bernstein between bosma bostan both brent burgisser calculus cambridge canada cannon cantor carter certain clausen coefficients combinatorial comp compared comparison complexity composition comput computation computational compute computed computer computing conclusion conf confirms confluent congr constant continued convergence cost curve curves cutsem derivatives derive determining deterministic difference differential discr displays doubled dover dubious early efficient electron elementary entries equation equations established estimated eurosam evaluation exact experimental experimentally exponential exponentials fast fiduccia field figure finally finding finite first five focs form formal formula fractions frobenius from function functions gathen gebraic geddes generation gerhard gilbert give grown grund hanrot high highprecision hoeven homogeneous http hypergeometrics implementation implemented ince indicate inform international interpolation inversion issac iteration iterative january jolet journal jumps kaltofen kettenbruchentwicklungen knuth kung labelle labelled laforest language later lazy lehren lifting limitation linear loan loria luther magma mahmoud manipulating marked math maths maticiens matmul matrices matrix mech meth method methods modern moenck moler monthly most multiple multiplication multiplications multiplikation multivariate naive nearly newton nhage nice nineteen nonlinear note number numer onestep only operator order orders ordinary over pages paris partial pennell performance permutation pittel playoust point points polymatmul polynomial polynomials power powers precision prediction press primitive probable problem proc provide publications quadratic quadtrees rall random reasons recurrences redundancy references reflect relax removing respected respectively resultants results reversion revisited reziproken rost salvy same schnelle schost schulz science search second seconds series sets shape shapes shifts shokrollahi siam similar solution solutions solve solvediffhomsys sons space special springer storjohann strassen structure structures superior surfaces symbolic system systems taylor that theoret theoretical theory three time timings together tome trans traub tree twenty university used user uses using usyd vandermonde variable verlag very volume waterloo ways well werschulz wiley wiss with years york zahlen zero zimmerma zimmermann
http://doi.acm.org/10.1145/1283383.1283387	3	Squarepants in a Tree: Sum of Subtree Clustering and Hyperbolic Pants Decomposition	algorithm algorithmics algorithms already also alstrup aluru amenta application applications apply approximate approximating approximation approximations arxiv bern biology body borodin case cell center chemometrics chichester clarkson closest clustering clusterings clusters colin colt combinatorial completeness complexity compressed comput computational computer computers computing conclusion conf considered constant construct construction criteria crust curve curved curves cycles dasgupta data decomposition delaunay describes dimensional dimensions discrete done dynamic each efficient eppstein eppsteindynamic erickson essentially euclidean evolution experimental factor family fast feder finally find finding fixed focs form found foundations freeman functions garey generalized generation geometry goodrich graphical greene guarantees guide hard have hell hierarchical high holm http hyperbolic hyperoctrees ieee image improved inexplicit inform interest intractable intractibility jective johnson joining june kirkpatrick know krauthgamer large learning lecture lemma length lett machine maintaining many march matching median mesh method methods metric minimum models modified molecular much multidimensional nearest negatively neighbor neighbors noncrossing notes ones optimal optimizing ostrovsky other pairs pants parallel paths performance phylogenetic plane planes point poon press problem problems proc process processing produce proof provided psychometrika punctured quadtree quadtrees quality queries rabani ratio ratios reconstructing reconstruction reduce references refinement remains repository research resolve ruppert saitou same scand schemes science sets sevilgen siam simple sites skeleton skip soda softw some spaces springer steiner stoc structure structures studies subquadratic surfaces suspect swat symp tech teng than that them theorem theoret theory there these thite thorup tightening time total trees triangulation triangulations unchanged used verdi verlag wads weight whether with within work worksh would zupan
http://doi.acm.org/10.1145/1283383.1283444	59	Dynamic Weighted Ancestors	algorithmica algorithms alstrup amir ancestor ancestors appear beame bender berkman boas bound bounds case chen cole colton combinatorial compression comput computing conference construction data denoising design dietz diggavi discrete dusad dynamic efficient emde farach fich finding forest formalization fredman fusion hariharan hashing holm icalp implementation improved information international kaas kopelowitz landau less letters level lewenstein line linear logarithmic matching mathematical muthukrishnan offs optimal order patrascu pattern perfect possible predecessor preserving priority problem problems proc process processing queries queue range real references related retrieval search simplified soda sokol space spire static string strings structures suffix surpassing symposium syst systems text than theor theoretic theory theta thorup time towards trade tree trees ukkonen universal vishkin wads willard with workshop worst zijlstra
http://doi.acm.org/10.1145/1283383.1283485	100	Distributed Algorithms for Multicommodity Flow Problems via Approximate Steepest Descent Framework	adaptive algorithm algorithms allocation also another applications approximating approximation assignment awerbuch azar bartal better bound bounds byers cking commodiother comp computational computing congestion control convergence cost covering deadlock discrete distributed efficient endent equilibria etitive etitiveness even extending fast faster fischer fleischer flow flows found fractional garg global ieee indep information jectives journal lead line linear local luby mansour math mathematics methods mixed multicommodity naor nemann nissan numb open oper optimization ositive other overhead packing pages paper parallel plotkin problems proc programming provide question reducing references rerouting research resolution resource results sampling science selfish sequential shmoys should siam simpler solutions surely symp tardos that theory this ties tight time using value very wardrop with young
http://doi.acm.org/10.1145/1283383.1283434	50	On Extremal Subgraphs of Random Graphs	above abstract accad achieve advances akad algorithms almost alon applications arbitrary argue assume asymptotic atti babai balanced baln belong berlin bipartite books bounds budapest carefully change choose choosing chosen class combin combinatorica combinatorics combinatorie complete completed comput computational conclude conference construct contradiction convegni counted counting densities discrete dist dmtcs edges edition enumeration equal erds esrg ethz eurocomb european evolution extended extremal first following follows foundations free fulfilling fulfills gerke goes graph graphs have hence holds implies inequality interchange internazionale interscience janeiro janson john kleitman kohayakawa kutat large lemma lincei loquio luczak magyar mantel marciniszyn math mathematics method modifying most number observe opgaven optimization order osthus ouvrages over pages partition partitions parts paul possible precisely probab probabilistic probability problem proceedings proof properties propositions publications quasi random randomness recall recent references regularity rome rothschild rucinski satisfy second series simonovits sons sparse spencer springer steger subgraphs subset such sufficiently summation surely szemer taraz teorie that then theorem theory there they this times tomo triangle vertices volume want ways which wiley wiskundige with york
http://doi.acm.org/10.1145/1283383.1283477	92	Maximum Independent Sets in Graphs of Low Degree	alekseev algebraic algorithm algorithme algorithms appl applied ariyoshi arnborg asteroidal berlin bodlaender bound brandstadt broersma cardinalit chordal chordality classes claw clique cliques coloring combinatorial combinatorics complete comput computing covering dans decomposable decomposition discrete easy farber find finding fork free from garey gavril generating girth graph graphe graphs grotschel hereditary hertz hoang hujter independent intersci ipco japan johnson kalamazoo kloks kratsch lagergren large largest lncs lovasz lozin math mathematics maximal maximum methods milanic minimum minty muller murphy nakamura nearly networks nizhny novgorod number oper optimization perfect polynomial prisner problem problems proceedings publ recherche rectilinear references revision russian sans sbihi schrijver seese separators sets shirakawa siam small soda stability stable steiner symposium tamura tarjan theory thilikos toile tree treewidth triple tsukiyama tuza university upper vertices weight werra wiley with york
http://doi.acm.org/10.1145/1283383.1283430	46	An Algebraic Algorithm for Weighted Linear Matroid Intersection	above acknowledgements adding adjust affect aigner algebraic algorithm algorithms also although american analysis analyzed annals annual applications approach approximating approximation arbitrary architectures arcs argued arguments assignment assume augmentation augmenting automata auxiliary avoiding avoids bachem base bases basic becomes before begins belongs bipartite bold both breach brezovec brualdi call cannot capacitated case cases certain certification chalasani cheriyan claim collection combinatorial combinatorica combines common complement completion complicated computation computer computing consider constrained constructing continuing contradiction contribute contributing convenience conveniently conversely convex cook cornu corollary corresponding cunningham cycle cycles decreases deferred define defined definition definitions degree delete delivery desired deterministic difference ding directed direction directions directly discrete discussion disjoint distance distances does dowling each easy edges edition editors edmonds efficiency efficient element elements elimination elsevier emma endent ending ends establishing example examples except excluding exist existence exists extreme facts faster figure finding first focs following follows form formed forms foundations frank from fujishige full function functions furthermore gaussian geelen generality generously geometries given glover goemans gordon graph graphs greedy hammer hanani harvey hassin have having helping hence here high holds holland icalp ideas ieee illustrate implies implying important inbound incident indep independent inequality initial instigating institute integrality international intersection inversion itself japan ject johnson jols joseph journal july karger karp korte krogdahl languages last lawler lelism lemma lemmas length lengths levin lifting like linear loquium loss matching matchings mathematical mathematics matrices matrix matroid matroids maximum maximumweight member mentioned ming minimum modification mohit more most motwani mucha mulmuley multiplication murota must namely necessarily need negated negative neither network next nheim north notation note obtain olyhedra olynomial only operations optimal optimization optimum order other otherwise ounded outbound pages paper paral parallel path penultimate perfect physical plus polyhedra positive potential practical preceding precisely preliminaries preliminary primal problem problems proceedings processor programming programo proof proofs property proven pulleyblank quantity random rank reader references remove removing replace report representation research resulting results reversal reverse routing sankowski satisfying sauer scaling scheme schrijver schur science sciences second section several shortest shortestpath show shown shows siam simply since singh singular sixteenth slight society soda some spaa spanning splitting springer starting state steps storjohann structures submodular subsequent such suppose symbolic symmetric symposium system systems tarjan technical thank that their then theorem theoretic theory there therefore these this through thus time tomizawa transactions traverses tree trees troms tschel union unique uniqueness university upfal useful using vazirani vector verlag version vertex vertices volume weight weighted where which whose wigderson wiley will with without words work would written zero
http://doi.acm.org/10.1145/1283383.1283395	11	Obnoxious Centers in Graphs	above abstract achieve active actually adding additional adjacent affect after agency algorithm algorithmic algorithmica algorithmically algorithms allows along already also alsp alternative always amortized amounts analogous analysis analyze anew annual another apex appl applies apply applying approach approximate arbitrary arcs argument arises arising around asks assigned assigning associated assume assumed assuming attention augmented authors available aware away background bags balanced based basic because becomes been before beforehand beginning belong berlin best better between beyond bhattacharya binary bodlaender both bottom bottommost bound boundary bounded built burkard cabello cacti cactus calculated call called cancels capacity carried carry carrying case cational cedure center centers central changing chaudhuri child choice chosen cient classes classical clear close closest cole collection combinatorial comes common commonly community completely complexity complicated components comput computation compute computed computer computers computes computing concept concerning conclude confusion connected connection consider considered considering consisting consists constant construct constructed constructing contained containing contains context continuous contrast control corollary correctln correctness corresponds cost could cover coverage coverages covered covering covers criterion cross crossed crossing curie current curve cycle data deals decide decides decision decisions decisiontree decitheorem decomp decompose decomposition decompositions decreases define defined defining definition denote denotes department depend depends depth describe described description design details deterministic deterministically developed different difficulty dification digraphs dijkstra directed disc disconnects discrete discussed discussion disk disks distance distances dlaender does dollani dominating done down downward dual duced duction during dynamic each easy edge edges eedup eferences effifirst either elements embedded embedding emma emphasize employ empty enough enphol envelope environment equation equivalent equivalently european even every example exclude executed execution existing expected expense explained expressed extended exterior extractmin face facial facilities facility fact factor fakcharo fakcharoenphol faster fellowship figure final finally find finding findmin findp finds finishes first five fixed follow followed following follows form formal forms found fourth framework freie from fruitful function functions furthermore gave general generalize germany gets give given gives gorithm graph graphs growing guaranteed gunter hagerup half harm have height henceforth henzinger heorem here hierarchical holds hole holes however idea ideas identical identified imfm implicitily implicitly imply improve improved improvement improves inactive including increasing indeed indegree independent indicate indicates induction infinite informatik inherited initial initialized input instance instead institut integers interest interested interesting interior interval into intra intro intuitively invariant involving irrelevant isaac iterated iteration iterations ject jective jordan journal katz kedem keep keeps klein know known label labels larger later leads leaf least lection lecture left lemma lemmas length lengths less letters level levels like line linear lines lipton ljubljana locating location logarithmic long longest loop loops lower lowing lows made main maintain maintaining maintains make makes making many marie math mathematics matter maxaa maxee maxii maximin maximizes maximum mean measures median megiddo metric mfcs miller minimize minimum minvv models modification moreover moshe most move much multiple namely natural naturally near need needed negative neighbors network networks next node nodes nonnegative notations note notes number objective obnoxious observation obtain obtained often ombining once only oper operation operations opposed optima optimal optimization optimize optimum order oretum osing ositions oted other otherwise ounded ounds outdegree output over overhead pages pair pairs paper parallel parameter parameterize parametric parent part partial partially particular partition partitions parts pass passes passing path paths perclassically perform performed permitted piece pieces piecewise place placed placement placing planar plane plus point points portion positive possible precise precomputed predecessors preliminaries previous previously probdescribed problem problems proc proceedings processed program programme programming programs proof properties proposition provide pruning quickly radii radius random randomized range raph rational received recently recurrence recursive recursively reduced reduces reed references referred refers reflected regard related relation relax relaxation relaxations relaxed relevance relevant remaining removal remove replace represent requires research respect respectively result results return returns review right root rooted rote roughly round rounds running same satisfying science search searching section sections seem seen segal selected selecting selection separately separation separator separators sequence sequential sergio serial sets setting several shortest show showed shown siam side similar simple simpler simplicity since single sion site sites sixth size slovenia slovenian slower slowing small smaller soda solution solvable solve solved solves solving some sorting source sources space special speed spend splits springer stance standard start starting starts state statement steps stoc store storing structure structures study subgraph subpieces subquadratic subramanian subsequent subset subsets subtree successively successor successors such suitable summary supported supports sweep sympos symposium syst take takes taking takustra tamir tarjan technique techniques term terms test than that their them then theor theorem theoretical theory there therefore therein these they thick think this through thus time times together total towards transform traversal treat tree trees treewidth triangulation trying tsssp twenty under understo undesirable undirected union unique universit university unknown until update upper upward used useful uses using utilize value values variables verlag version vertex vertices view volume vwith wait waiting walk walks want weight weighted weights well were what when where whether which while whilelo whose width will with within without wmin works worst worstcase would zaroliagis zerovnik zmazek
http://doi.acm.org/10.1145/1283383.1283415	31	Improved Algorithms for Path, Matching, and Packing Problems	academy access algorithm algorithmica algorithms alignment almost alon annals annual appear bacteria biology bodlaender carter case chen classes coding color complexity computational computer computing conserved constructions depth derandomization design detecting deterministic dimension discrete divide downey efficient efficiently faster fellows find first fixed focs foundatins fredman friesen functions global goldreich greedy hardy hash hashing ideker ieee improved independent information interaction introduction iwpec journal kanj karp kelley knauer kneis komlos koutis lecture letters limited linear localization long matching mathematics minor monien naor national near network networks nilli nishimura nondeterminism notes numbers oblivious optimal oxford packing papadimitriou parameter parameterized paths pathways peralta perfect press probability probe problems proc proceedings processing protein ragde random references revealed richter root rosamond rossmanith schmidt schulman science sciences scott search sharan siam siegel signaling sima sittler sparse spatial splitters springer srinivasan stad stege stockwell storing structures symposium system szemeredi table tests theory thilikos time tractable universal university using variables wegman whitesides wise with within worst wright yannakakis yeast york yuster zhang zwick
http://doi.acm.org/10.1145/1283383.1283435	51	Online Vertex Colorings of Random Graphs Without Monochromatic Subgraphs	against akad algorithms annual approximating approximation armed assoc avoidance bandit berlin bollob books brooks calif cambridge chromatic clique coloring colouring combin combinatorial combinatorica completeness complexity comput computational computer computers conference deviations eleventh erds erties evolution feige foundations francisco freeman friedgut functions furer game games garey graphs grimmett guide hardness ieee improved intractability issue janson johnson kilian knowledge kohayakawa kozl kutato large lecture line luczak lund mach magyar marciniszyn math mathematical mcdiarmid minimization network nodes notes number online optimization pages philadelphia philos pittel poisson probab problems proc proceedings prop ramsey random randomization references results rucinski science sciences series small sparse special springer steger structures subgraphs submitted symposium system tetali theory thirtysixth threshold trees voigt volume weishaar yannakakis zero
http://doi.acm.org/10.1145/1283383.1283473	88	Maximum s­t­flow with k crossings in O(k 3n log n) time	ahuja algorithm algorithms american analysis andrew annual approach archivum automata borradaile bounded cheriyan class classes cliffs closed comput computer computers computing cybernetics december defines describe determining dimitrios directed discrete disjoint dorfman efficient endre engineering englewood example exponential fast fedor filotti finding flow flows fomin francisco freeman further garey gary genus glencora goldberg graph graphs gross hadlock hall icalp international intractability isomorphism jersey john johnson journal karsten kernel klein languages lecture lgorithms linear lipa looking loquium magnanti maheshwari mare martin mathematical mathematicum maximum miller minor moment network networks notes orlin orlova pages parameterized paths philip planar polynomial preflow prentice problem problems proceedings programming providence push references reif related ripphausen robert science sciences section seventeenth siam society soda solve sons specific speed steps stoc surfaces symposium system tarjan testing theory thilikos this time topological tucker twelfth useful volume wagner weihe wiley york
http://doi.acm.org/10.1145/1283383.1283384	0	Region-Fault Tolerant Geometric Spanners	above added advances algorithm algorithmic algorithmica algorithms allnearest almost amsterdam annual appear appl applications applied approximating approximation arbitrary aspect balanced between body bound callahan cambridge canadian cannot carried cccg cell chapman chew clarkson closest combining complete comput computational compute computer concept concluding conditions conference conquer construct constructing construction constructions cost czuma data decomposition define denote determine detour dilation dimensional dimensions discrete distance divide does duncan dynamic each easy edge edges editor editors elsevier enumerating eppstein euclidean everything exceed existence exists fast faster fault fields figure fischer focs following foundations fourth from full gebiete geodesic geometric geometry gerw gonzalez good goodrich graph graphs grid gudmundsson hall handbook have hence higher hten hulle improve improved industrial inside interdistances international intersect intersected intersection introduced journal keil knauer knearest kobourov konvexe kosara lecture length less levcopoulos line lines llig london lukovszki made mahing main matching mathematics metaheuristics minimum more moreover motion multidimensional narasimhan neighbors ners networks nlog note notes octrees open ordered pages pair paper path peled peleg perfect phase phases philadelphia planar plane planning plus point points potential press problem problems proc properties proportional proved publishers punkten putting quickly ratio references region relaxation remarks results running runs sack salowe same satisfies scandinavian schaffer science separated sets shortest show siam similar since size small smid society soda solve some space span spanner spanners spanning sparse springer sspd steiner structures sulanke symposium takes than that theorem theory there this through time together tolerant trees uber university urrutia used uses vaidya varadara variant verlag verw volume wads wahrsch weaker weight well where whether with workshop wspd york zhao
http://doi.acm.org/10.1145/1283383.1283459	74	Cheap Labor Can Be Expensive	above according agents algorithm algorithmic algorithms alternative anarchy anshelevich applications applied approach approximate approximates approximation approxthe archer arguments auction auctions australian based bases basis best better beyond bikhchandani both bound braess brualdi bulletin cacm capacitated case characterization cheap cheapest choice cking cknowledgements claim clarke colell combinatorial comments communication competitive complexity computer computing conference construct construction consumer consumergiven cornell correa corresponding cost costs counterspeculation course cramton creation czuma dasgupta decentralized defines delete deletion department dependence design designing desired devanur dietrich directed discrete disjoint dubey each easy ecommerce econometrica edge edges editors efficiently elkind eppstein equal equilibria even example expected exponential fabrikant facility fact factor facts fair farms fibonacci figure finance find finding firstprice flow floyd focs following follows from frugal frugality function game games garg generates generic given gives goods graph graphs greedyalg green groves half hand hard hardness have hayrapetyan icalp ieee igure imation immorlica inapproximability incentives independent inefficiency instance internet introduction journal karger karlin kempe khandekar kleinberg know koutsoupias krysta labor large learning least lemma lengths less levi linear locality location luthra maneva market markets mathematical mathematics matroid matter mavronicolas maximum mccormick measure mechanism mechanisms microeconomic ming minimizes minimizing minmax moses multipart murchland nash natural near network networks nikolova nisan note numbers objective obtain operations optimal original osborne other outline oxford oxley pandit papadimitriou paradox paradoxon path paths payment payments podc pointing polynomial press price pricing private problem problems programming proof provider public question rakesh ratio reduction references replace research respectively result resulting results ronen roughgarden routing rubinstein saberi sahai sami scheduling schulz schummer science sealed section selfish server service shenker shoham shortest showing shows siam simchi since societies society soda specified spirakis ssentially stability stackelberg stacs steiglitz steinberg stier stoc strategies structures subgraph submarket sufficiently suurballe tallisman talwar tamir tardos task teams technology tells tenders than thank that theorem theory there these thesis they this thus tight time together topology towards traffic transportation true truth truthful uber union university unless unternehmensforschung upper users utting value vazirani vector verkehrsplanung vertex vertices vetta vickrey vohra vries walkover weighted wexler where whether whinston whose wine winning with within worst yielding
http://doi.acm.org/10.1145/1283383.1283424	40	Probabilistic Analysis of Linear Programming Decoding	academic achieves agreement algorithm algorithms american analysis annual approaches approximately approximation april association barg based berkeley berlekamp bienstock binary bits boston bound bounded bounding bounds cambridge capacity certain check chung claimed code codes coding columbia combining communication complexity computer computing concentrated concrete conditioned conditions conf consequences constant constants contracting control corc correctable correcting corrects covers crit daniel daskalakis decays decemb decode decoding decreasing define defined definition degrees density department dimakis discrete done ensembles equation equivalent erations erforming error errors establish establishes estimates even event every exact example existence exists expander explore exponent exponential exponentially facets factor fails february feldman figure final finite flips focs following foundations fraction fractions frey full function further gallager gaussian generalized generally germany given good graph graphs guessing halabi have higher hoeffding ieee igure improved inequalities inequality info information inherent intermediate international intractability investigate irregular iterative jaakkola january journal july karger karp kluwer known koetter kschischang least lemma length lerton like linear linearprogramming loeliger lowcomplexity luby mackay malkin march matching math matrices maximization mceliece measure message methods michael mitzenmacher more moreover most munich negative note novemb number numerically octob olynomial onents other ounded ounds over pages pair paper parameters parity passing pieces polytop potential press previous previously probabilistic probability problems proc product programming proof provably provided random rate rates recall references regular related relation remains report requests research results richardson satisfied science scit scrit seattle section selections septemb servedio sets shokrollahi siam sipser size soda solving sparse specific specified spielman statement statistical statistics stein strictly structure such sums symp symposium technical technique term than that then theory there therefore this threshold tilb time times topics towards trans transactions trees turb turbo under uniform university upper urbanke using value variable variables verify version very vontob wainwright washington where which willsky with word workshop
http://doi.acm.org/10.1145/1283383.1283510	125	Fractional Packing in Ideal Clutters	academic acknowledgement advanced algorithm algorithms amsterdam annals anniversary anti applications applied applying arborescences arcs bachem barahona because berlin blocker blocking bonn bottleneck capacitated capacity cardinality case centroids clutter clutters combinatorial combinatorica comments compute conclusions conjecture connected connectivity consider cornu corollary cost counterexample covering covers denotes dicut dicuts digraph dijoin dijoins directed discrete discussions distinct edges edmonds engineering extrema faster find finding finds first flows fractional framework frank fulkerson function gabow geometric gerad giles graph graphs grateful hand harris have holland ideal industrial inequaity iwata joins jols journal kobayashi korte lehman length london lucchesi madison make manu mathematical mathematics mfmc minimal minimax minimizations minimum most multiplicities necessarily nonnegative north optimal optimality optimization orientations orlin other output packing paper pennsylvania performing philadelphia polyhedra polyhedral polynomial positive presented press proceedings programming property references remark removing reports representations research results runs satoru schrijver second seminar series sets shepherd siam society solutions some spaninng springer springerverlag state states strongly submodular such technical that theorem theory therefore this throughout time times tokyo trees tschel university useful uses valuable verlag vertex very vetta violating visualizing volumes where which width wisconsin with without yields york younger
http://doi.acm.org/10.1145/1283383.1283418	34	A Near-Optimal Algorithm for Computing the Entropy of a Stream	actually adversarial affected algorithm algorithms alon also anomalies anomaly appealing application applications approximately approximating approximation approximations arrives babcock backbone based basic because behavior bhattacharya bhuvanagiri bose bound bounded bounds chakrabarti collaborative combinatorica communication complexity computation computer conference copies cormode correct counter counting data datar detecting detection disjointness distances distinct each edge edges efficient element elements enabling enterprises entropy estimating estimation estimator estimators family fast feigenbaum finally finding fits focs followed follows frequency from function functions ganguly generators gives graph graphs gries guha hash hence ieee independent indyk information infrastructures international internet into jayram journal kannan kesh khot know kranakis kumar lall lemma length lower matias maximum mccallum mcgregor measurement mining misra model models moments morin motwani moving multi multigraph multiple muthukrishnan nearoptimal necessary network networks nisan norm note ogihara only optimal order ordered outset over packet paradigm party plattner pods probability problem problems proc profiling programming pseudorandom random reductions references repeated require required rescaling result returned saha same sampling science sciences sekar semi sigcomm sigmetrics simpler since sirocco sivakumar smal soda some space stacs stoc stream streaming streams sublinear suri system szegedy take tang technologies that theoretical there therefore this tight towsley traffic trevisan triangles using value venkatasubramanian wagner where window wise with woodruff workshops worm yossef zhang
http://doi.acm.org/10.1145/1283383.1283388	4	A Near Linear Time Constant Factor Approximation for Euclidean Bichromatic Matching (Cost)	acknowledgments agarwal algorithmic algorithms annual applications approximation arrangements author bartal bipartite cabello cambridge cgkr charikar chuzhoy color combination combinatorial comments computation computational computer computing constant costs could decomposition dimensional discrete distance earth earthmover efrat embeddings estimation euclidean european factor fast foundations from geometry giannopoulos guibas harpeled helpful helps holt iccv image individual indyk international journal julia kasturi klein knauer lawler levels like linear matching matroids metric metrics motwani mover naor near networks optimization other pages paper planar plane point press probabilistic problems proceedings raghavan randomized references respect retrieval rinehart rote rounding rubner sariel schechtman science sets shallow sharir siam sidiropoulos similarity spaces statistical symposium tasos techniques thank thaper theories theory this tomassi transformations under university useful vaidya varadara veltkamp vertical vision well winston with workshop would
http://doi.acm.org/10.1145/1283383.1283494	109	k-means++: The Advantages of Careful Seeding	abstract accrue achieve achieved achieves acknowledgements adam adnan agarwal algorithm algorithms allowed also amit analysis angela annual application applications applied approximate approximation arguments arthur asymptotic asymptotically bardia based been berkhin bernhard better bound bounds brien bull callaghan carry case cdna centers charikar chose christine claire cloud clustering code collard colt comments community comparable comput computational computer computing conference constant coresets cover currently darthur darwiche dasgupta data database databases dataset david decomposition decreased diagrams dimensions discrete drineas during each editors effectiveness engineering example experimental experiments extended facility fast fedkiw fernandez fifth finally fingerprinting focs foundations friedman frieze generally genome geom geometric geometry gibou graphs greedily greg guha have hawaii helpful here herwig hiroshi html http hybrid ieee imai inaba industrial information interesting international iteration jective jeev jose kannan kanungo karpinski katoh kaufmann kddcup kenyon kmeans kmeanspptest know kumar large learn learning least lecture ledge lehrach level liadan like likely linear lkopf lloyd local location mach machine mail manfred marek mary mathematics matousek mazumdar means measuring median method methods mettu meyerson mining mishra mlearn modified more morgan moses motwani mount much muller mustafa nabil naoki nathan netanyahu nina notes number once online only optimal ostrovsky other over page pages panigrahy panka particular pavel peled performance performed philadelphia philippe piatko plaxton pods possible poustka practice press principles problem problems proceedings proofs proven quantization rabani ramgopal randomization references report research result results rina ronald ruth sabharwal sadri sandeep sanjoy sariel scale scenario schemes schulman science search second segmentation selected sergei several show showed siam sigact sigart sigmod silverman similar simple singular sixteenth sixth slow smaller smoothed society soda software soham spam spambase springer squares standard stanford statistics stoc streaming streams stuart sudipto suggested survey swamy symposium systems tapas taylor technical techniques tenth test thank that then theory third thirty this thorough time times transactions trials twenty type undocumented unfortunately value variance variants vassilvitskii vega vempala vinay volume voronoi warmuth washington weighted whether with working worst would yogish york yuval
http://doi.acm.org/10.1145/1283383.1283443	58	Randomization Does Not Help Searching Predecessors	accept access ajtai algorithm alone also alstrup announced approximate arxiv asymmetric average beame bits boas bound bounds brodal brodnik carlsson case cell cells chakrabarti choice choices classification combinatorica communication complexity computations computer computing data degermark design desired efficient emde every fast feldmann fich find finding focs forwarding foundations fredman from further furthermore fusion higher icalp ieee implementation infocom information journal kaas least lemma letters logarithmic lookups lower machines mathematical measure miltersen model muthukrishnan near nearest neighbor neighbour nisan offs only optimal orthogonal over packet pages pink possible predecessor predecessors priority probabilistic probability probe probes problem problems proc processing ptra published queries queue random randomised range rauhe references regev related rich routing safra science sciences search searching sigcomm size small space split stoc strong structures subproblems surpassing symposium system systems tables theoretic theory this thorup time toward trade tradeoffs trees unified union venkatesh wigderson willard with worst zijlstra
http://doi.acm.org/10.1145/1283383.1283422	38	Approximating Entropy from Sublinear Samples	aare above account affairs after algebra algorithm algorithms allow alphab alphabet alphabets also always annual answer antos appearances apply appropriate appropriately approximating approximation assume assuming assumption assumptions asymptotic attained average based batu before bialek bias binomial bins block bound bounded brautbar briefly cambridge cardinality chapter chernoff choice choosing claim clearly combinatorics complementing complepr completes complexity computation computing condition conjecture consequence consider constant contribution convenient convergence convex convexity corresponding could countable counterpart counts couple cover covexity dasgupta decreasing definition degree derivative described desired deviating deviation deviations differences different differentiating direct direction discrete distance distribution distributions each easily easy eccc effective efron element elements empirical endix endpoints enough entropies entropy estimate estimated estimates estimating estimation estimator event events everywhere exact exists expec factor families fewer first fixed follows foster fraction free frequent from frop function functional further future give given gives glencoe good grassberger greater haixiao hand hard harder have heavy high hold holds however ieee immediate implicit imply individual inequalities inequality information instance insufficient interesting interscience interval introduce jackknife july koberle kontoyiannis kulkarni kumar large larger leads learn least lemma lemmas less like limits line logk look looking lower lowing made main make markov mass maximized mcdiarmid mean measure memoryless mentary method miller minimum modified moment most much mutual needed negligible nemenman neural next nonnegative notation note number obtain ommited option osition other ounds over pages pair paninski parameters part particular passing phys physics points possible precision press print probabilities probability problem proceedings progress proof prop properties proposition prove proved proving psychology purposes queries random rare reasonable recall references replacing report requires research restriction result return reversing right rubinfeld ruyter samorodnitsky sample samples sampling samplings second seen sets several should side since size small some sorting source spike stands start stat state statement statements states statistical stein steps steveninck stoc straight streamline strong stronger structures submitted subsets substituting success such sufficient sufficiently summing surveys symbol symbols symposium tation technical than that their then theorem theory there therefora therefore these third this thomas through thus topic trains transactions trivial turns umber uniform union universal university upper used uses using variable variance verdu very weaker what when where which wiley will with without wnight would wyner york
http://doi.acm.org/10.1145/1283383.1283517	132	Correlation decay and deterministic FPTAS for counting list-colorings of a graph	absence action again algorithm algorithms antiferromagnetic appear artificial bandyopadhyay belief bollobas bolyai bound bounds brightwell cayley chains coloring colorings colors colourings combinatorics combining completes complexity comput computer computing conclude constant contemporary correctness counting darwiche degree dfhv difficult dimacs discrete dobrushin dominic down dyer elect elekes enumeration estimating festschrift fewer follows foundations freeman frieze from furedy gamarnik generalizations geom geometric gibbs goldberg graph graphs hayes homomorphisms ieee improved independent inequality intelligence jerrum jonasson jordan journal jung kept koller last lattice lemma letters long loopy markov martin matching mathematical mathematics measures mitsubishi mixing models morphisms nesetril number obtain only part paterson phase phys physics potts preprint probability problems proceedings product proof propagation proposition random randomly range reason references regular salas sampling science series shah siam similarly simple society soda sokal spatial statist statistical statistics strong structures studies submitted survey symposium tatikonda terms theorem these this transition tree trees uncertainty understanding uniform uniqueness useful using very vigoda volume weight weiss weitz welsh where winkler with without yedidia
http://doi.acm.org/10.1145/1283383.1283523	138	Approximation Algorithms for Stochastic and Risk-Averse Optimization	aardal about adaptivity ahmed algorithm algorithmic algorithms almost among amsterdam analyzed annals annual appear appeared application applications applied approach approaches approx approximathe approximating approximation available average aversion back based beale behavior being benefit benefits boosted bounded bounds briefly calculations charikar chekuri chernoffhoeffding chudak clustering coloring column combinatorial combinatorica come complete complexity comput computational computer computing constraints controllable convex cordom cornell costs covering cswamy dantzig dean definition demand denominator dept design deterministic dhamdhere discrete discussion distributed dual dyer easy edge editors eindhoven empirical exstatistical extension facility factor file fitting focs foundations from full funci function given goemans good goyal greedy guarantees guha gupta handbooks have hedging holland hring http ieee immorlica improved inequalities integer ipco ists ithaca jacm jain ject journal karger khuller kleywegt knapsack lemma lets level linderoth linear location mahdian markakis math mathematics maximized method methods metric mgmt minimizing minkoff mirrokni multi multistage naor negative nemhauser network networks news next nine north operations optimal optimization packing pages pairs panconesi policies power preliminary present priority problem problems proc proceed procrastination programming programs proof proofs provably raghavan random randomized ranproof rational ravi recall references relation relaxation report research result revealing risk robust roth rounding routing royal ruszczynski saberi sample sampling saves scheduling scheme schulz science section series setting shapiro sharing shmoys shown siam sigact simplifies singh sinha society spor srinivasan stage start stochastic stougie strikes study such sviridenko swamy symposium tardos technical technique that theni theory there thesis this thompson time tion uetz uncapacitated uncertainty under university updated using uwaterloo variables vazirani version verweij volume vondrak wednesday what when will with work wright zhang
http://doi.acm.org/10.1145/1283383.1283452	67	Digraph Measures: Kelly Decompositions, Games, and Orderings	adler again against algebraic algorithmic algorithmica algorithms allow analysis annual another appear applications applied approach approximating approximation aspects automata baker bandwidth barat believe berwanger bodlaender both bounds branch clique coloring combinatorial combinatorics compare complete computer conjecture connectivity constant cops courcelle dagwidth dawar decomposition decompositions demaine dendris depth diestel digraph directed discrete does dorn edition editor editors efficient electronic elimination elsevier eppstein erich european exact examples exploiting factorization factors final first focs follow following fomin formal foundations frontsize fugitive game games generalization gilbert given giving gradel graph graphs hafsteinsson hajiaghayi handbook have heggernes however hunter ieee inert infinite international introducing invisible isomorphism johnson journal kawarabayashi kelly kirousis kloks koster kratsch kreutzer leeuwan lncs logic logics mathematical mathematics matrix measure mfcs minor minors models monotone monotonicity more natural necessarily notes obdrzalek observe olariu optimization pages parameters parity path pathwidth penninkx planar problems proceedings process proof rank reed references related relating result results rewriting robber robertson role rose safari science search searching sematics series seymour shortest showing siam soda sparse sphere springer stacs step strategies strategy strongly structures subgraph suffice symposium techniques telle that then theoretical theory thilikos this thomas towards translate tree trees treewidth triangulated twente unknown unsymmetric upper vertex visible volume width wilke winning within wolfgang workshop
http://doi.acm.org/10.1145/1283383.1283508	123	A lower bound for scheduling mechanisms	aaai abstract aggregation ahuva alem algorithm algorithmic algorithms amir annamaria annual applications approximation artificial aspects auctions bartal behavior berthold bidders boston briest characterization choice combinatorial commerce compatible complement computer computing conference convex design dobzinski domains dominant economic electronic ence erts european extended fast first focs foundations free games gonen hard hochbaum hongwei implementable incentive innovative intel itarian kevin know kovacs krysta lavi ledge lenstra ligence machines markets mathematical mechanism mechanisms michael monotone monotonicity muller multi multidimensional nisan noam pages parallel patrick piotr preferences problems proceedings programming publishing rakesh randomized rationality related revelation rica ronen rudolf rules saks schapira scheduling science seventeenth shahar shmoys stoc strategy suffices symposium tardos tark techniques theoretical theory thirty towards truthful truthfulness unit unrelated util vocking vohra weak with yair
http://doi.acm.org/10.1145/1283383.1283501	116	Delaunay Refinement for Piecewise Smooth Complexes	added algorithm algorithms also amenta angles annu appl application applications apply argue aspect ball balls based because bern between boissonnat boundaries boundary cannot case cheng chew closed cohen compact complex comput computer conclusions condition conforming consider construct contained contradict cornell curved cwcomplex delaunay dept dimension dimensional dimensions discr discrete discuss domains each easily edelsbrunner edge element elements enforce enforcing ensures entities entity establishes except explicitly extended extra eyond face features filtering following follows formed gable generation geom geometry good graded graphical graphics guaranteed handle have homeomorphism identified immediately implies incident input inputs interior internat intersect intersecting intersection intersects ithaca lack lipschitz manifold mesh meshes meshing modeling models mount murphy must near need nonsmo observe oint ological ology olyhedra ones other oudot oundary ounded partial placement polygonal poon presented preservation preserves proc proof properties property provably quality radius ramos ratio ratios reconstruction references refinement remeshing representation requicha respects restriction robust rossignac roundtable rupp sampling satisfied satisfying shah shewchuk siam since small smooth solid space spaces sphere states steiner steps strategy stratum structure such sugihara surface surfaces sympos take terminates tetrahedral tetrahedralization that their then theorem therefore these this three topology triangles triangular triangulating triangulations underlying union univ verdi voronoi walkington well when where which whose with words would york yvinec
http://doi.acm.org/10.1145/1283383.1283480	95	Making Deterministic Signatures Quickly	about absorb access acknowledgment additional algorithms andersson applications approach arge array author based beame begin behind bender between binary bits boas bottom brodal brodnik built cache case cell colton comments common comparison complexity composing comput computing conceptual concurrent constants construction cost data design details deterministic diaconis dictionaries dictionary dietz dietzfelbinger disarray division dominated during dynamic each eared earman edges efficient emde equal erfect evaluation external fagerb farach faster ferragina fich find first focs footrule fredman frigo from full function fusion graham grossi group groups hagerup hashing heide higher however icalp implementation improved included indexing inen information input integer into jumping kaas karlin keeping keys known komlos kuszmaul left leiserson length level like linear list logk logm longest lower made manuscript maps mathematical measure mehlhorn memory metho method miltersen minimum multiplication multiplications munro necessary needed neighborho neighborhoods nilsson oblivious offs optimal other ound ounds over pages pagh paper parallel partitioned phase piece pieces pods predecessor prefixes preliminary priority prob problem problems prokop proposition ptra query queue ramachandran raman rams rank rasmus reduction references related result results riis rohnert royal said saks sanders search searching second selecting siam simple simpler size small society soda some sorted sorting space sparse springer stacs static statistical stoc storing string strings structure structures sublogarithmic subset sufficient suffix suggestions suitable summarized surpassing syst systems szemer table tarjan task tasks thank that then theorem theoretic theory this thorup those time total trade transdichotomous tree trees trie uniform used useful values variable variation verlag version very viewed vitter wads which will willard with within without word work worst would writing zijlstra
http://doi.acm.org/10.1145/1283383.1283390	6	Linear Programming Relaxations of Maxcut	able actually adams after alekhnovich algorithm algorithms alon also alternate annihilate annual appears appendix applications applies applying approximation arbitrary arora august avner balas basis berlin binomial bollobas both bounds buresh ceria challenging chernoff chosen combinatorica comp comparison component components compute computer computing conclusion cones conjecture connected connection continuous convex cornuejols corresponding could course cover csps cutk cuts cutting deal defined delete deleted dense desired developed deza dimensional disc distributed donnell each eared ected eddability edge edges effding efficient elchanan endpoints enheim erations error etween even every exact expect explicit express extend fact feige fernandez focs forced foundations free frieze from full function galesi games gaps general generates generating geometry gideon gives goemans goemanswilliamson goldreich goldwasser good graph graphs hard have hierarchy hoory howard hull hypergraph iannis ieee implies improved inapproximability indeed independently inequality inspection instances integrality interesting into istinct ject josh joshua journal kannan karger karloff karpinski khot kindler knowing label labels lasserre laurent learning least lemma letters lift liftand likely linear lovasz lower magen math mathematical mathematics matrices maxcut maximum methods metrics michael michel might mixed monique more mossel most much naturally need negative nicola nisheeth nonapproximability nonlinear note olyhedral only open optim optimal optimization osium other pairs paper pitassi plane planes poljak polynomial polytope positive previous probability problems proc procedures proceedings process program programming programs proof property prove proving question quick random randomized rank ratio references regularity relative relaxation relaxations remaining remove representations research results ryan sampling sanjeev satisfiability schechtman scheme schemes schrijver science sciences seems semidefinite setfunctions sherali sheraliadams shlomo show shrijver siam similar simultaneously since springer starting stays stoc strong structures subhash successively symp system testing that them then theory therefore this thus time toniann tourlakis towards tree tuza uniformly unique unit uriel using value variable variants vector vectors vega verlag vertex vertices vishnoi weaker well will williamson with without would write zero
http://doi.acm.org/10.1145/1283383.1283429	45	Matroids, Secretary Problems, and Online Mechanisms	aaai able about above abraham accomplish achieve achieved achieves adaptive added additionally adversarial affirmative after afterward agent agents ahuva alem algh algorit algorithm algorithms allocating allocation alloction allow allowed along already also alternative alternatively among amos andrew anna announces announcing annual another ansversal answer answers anything appear appears appendix applications approximately approximation arbitrarily argmaxls arguments arrive arrived arrives artificial ascending aside assertion assign assigned assignment assume assumed assumption assumptions auction auctions avrim away axioms babaioff balcan balls based basis beats because becomes been before begin behaved being belong belongs bernoulli between binomial bins bipartite birthday blum both bound bounded calculation call callaghan called cambridge cannot cardinality case cases changing charged chernoff choice chooses choosing claim claims classical clearly close closer closes collection combinatorial combined combining comes coming commerce commit commitments common comparing competitive complex computer computes conclude concludes condition conditional conditioned conditioning condos conference consequence consequently consider consist consisting consists constant constantcompetitive constraint contain contained contains contribute copy correspond correspondence corresponding corresponds cost could counterexample counterexamples create creates creating criteria current cycle daniel david decides deciding declaration decreases deferred define defined definition definitions degree deletes deleting demand demonstrates denote denoted denotes department depend derive derived describe described design desired desires develop discrete discussion disjoint distinct distinction distributed distribution divided does dokl domain domains dynkin each earlier early easily easy economic edge edges eferences efficient either elan electronic element elements eliminating empty endpoints ensure ensures entire equal essential essentially estimate even event events every evidence exactly example examples exceeding exceeds exchange exclude exercise exist exists expectation expected expiring exposition extensions facing fact factor faculty fail failed fails fall family feige fewer fiat final finally find finish first flaxman floor florina focs focuses following follows form formal format found foundations fraction freeman from full function further future gammoid gammoids general generality generalization generalizations generalize generalized gets given gives goal going goldberg good goods gorithm gradually graph graphic graphical graphs greedy ground guaranteed hajiaghayi half hand happen happens hard hartline have having heavy hence here hereditary high higher highest hire hires hold holds however hypothesis iaai idea identical ieee illustrate implies imposing impossible improve improved improves incentive incident include incorporates incorporating increasing independent independently indicator indifferent induced infinity information initialize initially input inputs instance instant instead integer intelligence interest interesting internally internat intersect into introduced intuitively item items ithm jason journal karger karlin keeps kleinberg know knowledge known large largest later latter lavi learning least lected left lehmann lement less liadan light likely limit limited live logarithmically look losing loss lost lower lowest machine made make makes making mansour mapping maria markov match matched matching math mathematical matroid matroids maximal maximize maximizes maximizing maximum maximumweight mcgrew meaning means mechanism mechanisms members might minimal minimum mistake model modification modified modify mohammad monotone monotonicity more moreover moshe most motivating motwani multiple must namely national natural necessary need neighbor neighbors neither never next nisan noam node nodes none nonzero note number numerical observation observations observe observed observes observing obtained obtains occasionally occur occurs offline online only operation opportunity optimal optimization optimum optr order ordering orientation original other others otherwise outcome outcomes output over overcome pages pair paper paradox paragraph parameter parametrized parkes particular partition partitioned paths pavlov payments perfect pick picked picking piece pieces places portion positive possibility possible possibly potentially prabhakar preceding precisely preference preferences present presented presents preserves press preventing previous previously price prices prior private probabilities probability probabily problem problems proc procedure proceedings process profile programming proof properties property prove proved proven proves provides proving public publicly query question raghavan rajeev random randomized randomly rank ratio reached reaches real recall recalling receives reduced reducing reduction regardless remain remaining remains remark removing respect respectively restricted result results revealed revelation review right robert rooted routed routing rule safe same sample sampled samples sampling satifying satisfied satisfies satisfy satisfying sbmple science second secretary section sections select selected selecting selection selections selects self sell seller selling sequence series sets setting settle shall shoham short should show shown shuffling siam side similar similarly simple simply simplying simulation since single singletons sink size small social soda solicit solution some sort source sources south sparsification special specific specified specifying standard start stated states statist step still stoc stopping stronger structure subfield subject suboptimal subsequent subset subsets such suffices sufficiently supply supporting suppose swapping symposium system systems taghi tain taken takes tends than that their them then theorem there therefore these they third this those three threshold throughout throwing thus time times timing track tractable transformed translates transversal tree triangle trick trivial true truncated truncation truncations truth truthful twice types typically unchanged under underlying undirected unfortunately uniform uniformly uniformlydistributed unit unitdemand university unknown unless unlimited unmatched unobserved unsafe unsatisfied until uriel used uses using utility value valued values valuw variables various version vertex vertices very want wants weight weights welfare well wellbehaved were when whenever where whereas whether which whose will window wine winners winning wish with within without work would yishay yoav zero
http://doi.acm.org/10.1145/1283383.1283389	5	Compacting cuts: a new linear formulation for minimum cut	about above acknowledgments active actually adding additional after again alekhnovich algorithm algorithmic algorithms allows along already also alternate america amsterdam annual another anteed appendix appl applegate applies approximation argue argued argument arithmetic arora arrive arthanari assume assumption author authors avis barnhart based because becomes before berlin between bigger bixby bollob bonn both bother branch cannot capacitated carath carnegie carr case cases catholique cedure certificate choice ckheed claimed classes clearly closely collection column combination combinatorial combinatorica compact company complete completes complexity component comput computer computing conclude concluding conditions cone conference conforti conjecture connected connection connectivity consider consists constraint constraints continue contract contradiction contradicts convex cook core corporation cost cuts cycle dantzig decomp decomposability decomposition define defined defines definition definitions department derive derived determination determine deza dictate difficult directly discrete dividing documenta dominated done dual each eddability edge edgeconnectivity efficiency either element else elsevier embeddability embeddable endix ends energy enough ensures equa equal equality equals equation equivalence equivalent ergh erties every exactly examine example exercises exists expressing extended extra extract extracting facet fact factor false feasible final finally fine first flows follows forging form forms formulation formulations foundations four fractional frank from fulkerson further games gaps generalize generalized generate generation geometric geometry germany give given gives goemans gral grality graph graphs guar hand handbooks have held hence here hierarchy holds holland however huge hypothesis ibaraki implicit implies imply improved increase indeed indicates induced inductive inequalities inequality insertion insights instance inte intea integer integral integrality integralnsosution into issue jain johnson journal just karger khot know knowing laboratory lancia large latter laurent least left lemma lemmas length letters lifting like linear list little logic long louvain lovaszschrijver mader magnanti make manuscript martin math mathematica mathematical mathematics maximality maximum mber means meet mellon mentioning metarounding metric metrics might minimal minimality minimum mixed model models more most multicommodity multigraphs multiprogram multistage nagamochi namely near need negative nemhauser network networks next node nonapproximability none nonnegatib nonnegative nonnegativity north note numbers obtain obtaining odory oking olyhedron olynomial onentialsize only operated operations opposite optimal optimization order original osition osium other otherwise outlined over pages pairwise paragraph part performed please plug point polyhedra polynomial polytope pose positive possible present presented preserving previous price problem problems procedure procedures proceedings process program programming programs proof proofs prop properties proven provides proving quantity question questions random randomized rational recall reduced reduces refer references reformulations related relaxation relaxations remains remarks represent requirements requires requiring research resulting results rinaldi round salesman same sandia satisfiability satisfied satisfies satisfy savelsb scale schrijver science second section selecting semi semidefinite sense separating separation sets setting shores show shrink siam side sides sijdm similar simple simplified simply since skipping solu solution solutions solving some spanning splitting springer standard start statement states steiner still stoer strictly strong stronger struct structure subgraph substitute substituting subtraat subtract subtracting subtraction such suffices suppose suprational symmetric symmetry symp symposium syst take talking tamir technical tell tells teps term than thank that them then theorem theorems theory there therefore these thesis third this three thus time tion together total tourlakis towards traveling treat tree trees triangle triple true tschel turn turning twice under unique united universit university unpublished used useful usha using valid value values vance vanish variable variables vazirani vector vectors vempala verify verlag version viewed violating vishnoi volume wagner were west when where whether which while will williamson with without wolsey work worth would written xaka yannakakis
http://doi.acm.org/10.1145/1283383.1283399	15	Analytic Combinatorics-- A Calculus of Discrete Structures	academic access acknowledgement acta addison albert aldous alfredo algebra algorithm algorithmic algorithmica algorithms allen also ambiguity american amsterdam analco analysed analysis analytic annual anzahlbestimmungen applications applied approach approximate april army arthur arxiv asymptotic asymptotics atlanta automatic available average back based battista behavior bell bender bentley bergeron bernard binary birkh boltzmann book branching brigitte bruno burks calculus cambridge canadian cardinalities carine case castro central channels chapter chapters chemische chwa classes claude code combinatorial combinatorics communication company comparison comparisons complete complexity computation computational computer computing concrete conference connected considerations constants constructive context continued continuous control convergence convex corresponding counting cutsem daniel data david december decompose department derived describing design devroye digital dimensional directions discrete discussion domized donald doron doug drmota duch duchon durand dynamical dynamics edition editor editors edward effective efficiency eighth electronic electronically elsevier enumeration equations eric estevill euclidean european evolution exact examples exponential fact factorization fast february fields fill fine finite first formul frace free from functional functions fundamental fusy gaston gathen generating generatingfunctionology generation george georgia gerhard gessel gilles goldstine golin gonnet gordon gorithm gourdon graham graphen graphs gruppen hadamard handbook hashing height heights helmut hensley herbert herman hidden hill hoeven hofri holland holonomic home hosam hsien hwang ibarra identities ieee implies informatica information instability instrument interest intervals introduction introductory isaac issue jacquet james janson january jciech jeev jeffrey joachim john jolet joris journal jurgen kapur kirschenhofer knuth kombinatorische kuei labeled labelle labelled languages large largely lazy lecture leeuwen lempel leroux like limit linear logical loglog louchard mahmoud many maps marc march marianne mark mart mass math mathematica mathematical mathematics mathematika mcgraw mellin mergesort methods micha michael michel models modern mordecai motif motivated motwani multivariate neumann nevin newell nicholas nicod nijenhuis nonlinear north notes number odlyzko omer operators optimal ordnance oren orleans over oxford page pages panario paper parsing parts patashnik patricio paul pemantle performance perimental peter philippe pierre pivoteau planar poblete polyhedra polynomial prabhakar precisely prefixes preliminary preprint press probabilistic probability probing proc proceedings processes prodinger products programming progress properties protocol proves providence published publishing puech quadratic quadtrees quicksort rabin raghavan ramanujan random randomized rani rate rates reading readings recent recurrence recurrences recursiveness redundancy references relax report reprinted research results robert robin robson ronald salvy samplers sampling schaeffer scheme science scott search searching second sedgewick seminumerical sequences series siam singularity size society soda some sorting sources special species statistics steps stoc strings structure structures submitted svante symbolic symmetric symp symposium systems szpankowski tarjan that thee theorems theoretical theory third thirty this tions tools transactions transforms transmission traub tree trees tschel tuned turn twenty ultimate university unlabelled used user vall variations verbindungen viola vitter volume volumes well wesley wiley wilf wilson woods word wormald xavier york zeilberger zhicheng zimmerman zimmermann zwick
http://doi.acm.org/10.1145/1283383.1283513	128	Polynomial Approximation Schemes for Smoothed and Random Instances of Multidimensional Packing Problems	adversarially algorithm algorithms allows already always analysis annual anthe approach appropriate approximation arbitrarily arbitrary arguably asymptotic bansal better bins boston bound caprara carried check chekuri chernoff class coffman combinatorica computer computes computing conclusion considered constant constructed constructs convex correa criticisms dified dimension dimensional dimensions distribution dyer each easily easiness ected editor efficient erasing essentially even exact example exists expected explain exponent fails fernandez fixed focs following follows foundations frieze from future garey given greater hard harmony hidden hochbaum holds ieee immoreover important inapproximability incorporate inequality information inputs instances integer items johnson journal july kannan karmarkar karp kenyon khanna know large least length lenstra letters leveled linear luby lueker made marchetti mathematics minkowski model more moreover multidimensional multiple natural notation noted nual numb olynomial omega once operation operations optimum osing othed other over packing pages paper parameters perhaps perturbation perturbations polynomial positive practice preserve probabilistic probability probable problem problems proceedings processing programming proof proved ptas publishing random realistic references required research respectively resulting results returned returns running scheme schemes science seems several showing siam simplex since small smooth smoothed smoothing solution solved some spaccamela specifically spielman state still stoc structure such suggesting surely surpasses survey susceptible sviridenko symposium takes teng than that them then theorem theory there this time tiny treatment twodimensional uniform upper usually variables vector vega when where while wipes with within woeginger work
http://doi.acm.org/10.1145/1283383.1283438	54	Approximation Algorithms for Embedding General Metrics Into Trees	abfc about acknowledgments acmsiam agarwala agree ailon alexander algorithm algorithmic algorithms alon also analysis anastasios andrew anniversary annual apmetric applications applied apply approx approximability approximating approximation arrow assaf automata available average badoiu bafna bcis bdoiu best between biological boulos cambridge carolinae case charikar christos chuzhoy clustering colton combinatorics comment complexity computation computational computer computing congress convexity corneil dekm demaine derek dhamdhere dimacs dimensional directory discrete discussions distances distortion distributed durbin each eddy embedding embeddings emek eppstein euclidean ever evolutionary family farach faracha fckw fekete finding finite fitting foundations general geometric geometry given graphs group gupta hall handbook harb help hierarchical http hypercube ieee indyk information insightful institute international into issue jiaghayi julia kannan kearsley kenyon kremer krogh language leizhen lemma life line linial lipschitz london lowmany lows madanlal makowsky maps markov math mathematicians mathematics matouek mcgregor method metric metrics mihai minimum mitchison model moses most multidimensional naor narayanan newtons nodes norms novich numerical optimal ordinal page pages papadimitriou paterson peleg peres phylogeny piotr planar point press principles problem problems proc proceedings programming proof properties protocol proximating rabani rabia rabinovich raecke random rangan ravi really references relaxation report reshef restrictions robust rotics sack safra sampath scaling science sciencemag sciext sequence sets siam sidiropoulos since sinclair solution some spaces spanner spanners spanning spread sstress statistics steiner stress stretch symposium synchronizer systematists tapia taxonomy technical tendler thank that theorem theory there thorup tree trees trosset tutorial ullman ultrametrics under univ university unweighted urrutia using variant venkatesan warnow weizmann will with working
http://doi.acm.org/10.1145/1283383.1283461	76	Dynamic Pricing for Impatient Bidders	above acknowledgments acmsiam adaptive algorithm algorithms analog analysis anna appear approximability approximation argument arguments ascending auctions authors balcan behavior bids blum borodin cambridge child children chosen combination commerce competitive computation computer conference considering coverage decreasing demaine discrete discussed discussions distinct during each economic electronic envy every exceeds expiring feige finally free from further games goldberg goods gradually guruswami hard hartline helpful here hich however item items jiaghayi journal karlin kempe kenyon kimbrel kleinberg kumar lavi learning lemma level levels like limited line mahdian maximizing mcsherry mechanisms model near nisan node ones online optimal optimum order parent parkes press price pricing problem proceedings profit proof proves references repeating revenue root rudra saks salavatipour sciences show siam similar soda start staying strategy supply symposium thank that theh then theorem theoretical there time tracy truncated unique university usable used using value version visit where which with would wright xpected yaniv
http://doi.acm.org/10.1145/1283383.1283482	97	On the k -simple shortest paths problem in weighted directed graphs	aarni aingworth algorithm algorithms almost application approach approximate arcs avoiding best brander braz chan chekuri christofides cohen comp comparative computer computing cubic demetrescu deviation diameter directed discrete distance distances edge efficient elkin engineering eppstein ernesto esteves estimation failure fast finding focs found garida graphs gupta hadjiconstantinou halperin hershberger ibaraki icalp implementation improved indyk isaac journal katoh lawler lengths letters liam link loopless malik management mark maro marta martins matrix mikkel mine mittal most motwani multiplication network networks nicos operations optimization oracles pages pairs pascoal path paths performance perko pettie podc prices problem problems proc procedure queir ranking real references replacement research roditty santos science september shortest siam simple sinclair slightly small soda solutions stretch study suri systems telecommunications theoretical thorup time undirected unweighted vickrey vieira vital weighted what with without worksh worth zwick