http://www.informatik.uni-trier.de/~ley/db/conf/stoc/stoc2001.html
STOC 2001
http://doi.acm.org/10.1145/380752.380857	68	A Sieve Algorithm for the Shortest Lattice Vector Problem	also ball balls bound centers completely contained distributed equality every hence here identically independence inequality inside intersect lattice lemma markov maximum mean most nonintersecting normal normally note number place points proof radius random references shown since such that then therefore third this upper using variable variables variance where which with
http://doi.acm.org/10.1145/380752.380810	30	Sampling Algorithms: Lower Bounds and Applications	american analysis annual approximating approximation association asymptotics basic bounded bounds communications complete complexity computation computational computations computer computing concepts crew data decision dence depth detection dimacs ding discrete distributions eccc embeddings estimation estimators focs foundations generators henzinger ieee indyk inequalities intervals introduction jagopalan john jorizing journal kearns learnable learning mathematics measure median modulation nayak nisan pages prams press probabilistic probability problems proceedings pseudorandom quantum query radhakrishnan raghavan random references related schulman science sequential series shma siam siegmund some sons springer stable statistical statistics stoc stream streams sums superconcentrators symposium tests theoretical theory tight toward trees valiant vapnik variables vazirani verlag volume wiley yang
http://doi.acm.org/10.1145/380752.380808	28	Learning Mixtures of Arbitrary Gaussians*	above according acta addtive algorithm algorithms alon also american anal analysis annals annual appear appendix applications approximately approximation around assoc association attempted berkeley between bodies boolean bounded bourgain brunn cambridge cant careful case cation center centered centers certain changes charikar cherno cient circuloid classi close coalesce combination combining communication computational computer concave concentration concentric concerns conclusions conference connection consequence consider consisting constant contemp converse convex corollary correct dasgupta data dempster denoted denoting densities density dimension ding directly distance distributed distribution distributions draw each eccentricity either ellipsoid ellipsoids ellipyi else erentiation errors essentially estimating every example exponential expression extending extensions fact factor facts familiar families feasible feature following follows foundations fraction freund from func function functions gaussia gaussian gaussians general generating geometric geometry goal guha hand have hence here hilbert hope however huber idea ieee incomplete inequalities inequality inst instead integer intercenter interscience into introducn involves isotropic jected jection jective johnson june kannan know known kopa laird lder lead learning learnt least leindler leindlerpr lemma like likelihood lindenstrauss lindsay lipshitz lipsoid lipsoids logarithmic logconcave lowing makes makov mansour mapping march mass masses math maximum mean measures median mention method minimize minimizing minkowski mixture mixtures models more most much multivariate next nite normal notable notation note noting observations obtained only open other overlap pair pairwise paper parameter personal picking points posisoids position positive practical presented press prob probabilistic probability problem problems proc proceedings product programming projected proof provide publ pursuit radii radius random ratio reals recall redner reduce references regarding region remain remark required respectively rest result results review royal rubin rudelson same sample samples sampling satis says schulman science second section seems sets several shel shmoys short shows siam signi similar simple simpli single size smith solid solution some space spencer sphere spheres spherical square squared start state statement statistical statistics still stoc stochastic stronger subspace such sumof sums symposium szeged tardos technical tends than that their them then theorem theorems theory there this thus tion titterington tive true under uniform unique univ used useful uses using value variable variables vector vectors version virginia vold volg vols walker well when where which whose wiley will with within witp
http://doi.acm.org/10.1145/380752.380854	37	Sharp Threshold and Scaling Window for the Integer Partitioning Problem	abuse acad addison akad alon amer analysis analytical appendix appl arti behavior berkeley birth bollob bollobas boolean borgs bounds bourgain budapest california chaimovich chayes cial combin combinatorial complex complexity component computational computer conference continuous costs critical dense derrida disordered division edited eecs energy equations erencing european even evolution exactly expected exponentially ferreira fontanari freiman friedgut function gent giant graph graphs http hungary implies indicator inst integers integral intel internat janson john karmarkar karp knuth kotecky kozl kutato lectures lett ligence linear luczak lueker magyar math mechanics mertens method mexico microsoft model more near nite number odlyzko once optimization optimum order over pages partition partitioning phase phys physica pittel point prob probabilistic problem problems proc proceedings process properties pubs rand random reading references report research rewritten rigorous santa scaling school science sharp size small smaller solvable solving sons statist statistical stein struc subset subsets summer sums systems technical that theory thresholds trans transition transitions university using wahlster walsh wesley where which wiley wilson window with york
http://doi.acm.org/10.1145/380752.380837	49	On the Integrality Ratio of Semidefinite Relaxations of MAX CUT	ables abnormally above absolute according achieves adapted added addition again almost already also always analyse analysis anyway apart appendix application applies apply applying arbitrarily arbitrary argue arguing argument arguments associated assume assuming assumption assumptions average ball based basic because becomes being belong belonging belongs below between bility bipartite both bound bounded bounds cannot cant cantly cardinality carefully case centered changes chebyschev choice choices choose choosing ciently claim claims classical clique closed closer color colored coloring colors compact compared complete completeness completes component computed conclude condition conditioned conditioning connected consecutive consider considering consistent consistently consists constant contained containing contains continue continuing continuous contradiction contribute contributes contributing contribution crossing cuts deal deals degree delay dene denote denotes dense density details determined development deviate deviates deviation deviations disjoint distance distinct does each easy ection ections edges empty enough ensure enter equal erence erent established every exactly example except expectation expected exponentially exposed extends fact factor finally follow following follows formally found four fraction from frovided generality generated gets given gives going good graph half hand handled happens hard hausdor have having helps hence here high higher highest highly hold holds however hyperplane hyperplanes idea identical identity ility implied implies imply implying important indeed independent independently independep induced induces inequality information intended intersection into intuitively involved isoperimetric jected jection jections joining jority kind known lace large larger largest last later least lebesgue lection left lemma length lengths like loss lost made main make many mapping mathematics maximal maximum meaning means measurable measure membership metric mgular midpoint might misplaced modi more moreover most mostly much namely near nearly necessarily need needs neglected neighborhhod neighborhood neighbors neither neutral never next nishes nite nition none notation note number observe obtained omitted oneto only open operations optd optimal opts order origin original other otherwise over overcome page pair pairs part participates particular partition partitioned partitioning parts perpendicular placed placing point points positive possibilities possibility possible precisely present preserves previously prior probab probability problem process projection proof proofs properties property proposition prove proved provided pushing radius random rather reach recall reduces references regular relative remaining remains repetitive replacing requirement respect respective respectively rest result reviewed right rigorous roles root roposition roughly same sample satis satisfying second segment select selected selection semi send sending sense sent separately sequence sequences sets shall show shown shows side sign signi similar similarly simple simpli simplify since size skecth sketch sketched small smaller some space sparse special sphere spheres square standard state statistically still stronger strongly subgraph subgraphs subsequences subset subsets subtleties such summarize surely symmetrization take taken technically tend tending tends term terminology terms than that their them then theorem there these they things third this those though three through thus time times together topology total totals trace tral transferred treat true turn twice typically unconsidered uncountable uniformly union unique unlikely until upper used using value varaibles variable variables variance varint vector vectors version vertex vertices very view waited want ways well were when whenever where whereas which while whose will with within without work works would wrong zero
http://doi.acm.org/10.1145/380752.380814	34	One Line and Ò Points	above advances algorithm algorithms also always amer annu applied assume assuming assumption being bjorner bokowski broder cambridge cannot case chazelle cliffs combinatorial combinatorica completely complexity comput computational computer conjecture consistent contemporary contradiction convex cubes directed discrete does dyer each eatcs edelsbrunner edge editors elementary empty englewood exponential figure folkman form frieze from gartner geometry germany given gives goodman graphs hall have heidelberg height hence henk hoke hold holt however implying index inform kalai kelly klee lawrence leads letters linear math mathematics matroids means methods mihalisin minty mock monographs monotone motwani must numberings onsidering operations optimization order orientations oriented pages papadimitriou perline pollack polytopal polytope prentice press proc programming programs proof raghavan random randomized rank references representation representative research results running science sequence sets show shown simple simplex since sink some springer steiglitz step streinu strict sturmfels subexponential subgraph sympos taking that theorem theoretical theory this time topological unimodal unique university upfal vergnas verlag volume west whenever which white will williamson with worst would york ziegler
http://doi.acm.org/10.1145/380752.380797	18	(1 +	addition additive algorithms almost applications approach approx approximating approximation aspects automata basic berlin boston bounded cardinality chandra chew client combinatorial company complete computat computational computer computing delaunay design designing diameter distance distributed dobkin dodis edge elkin extremal foundations france fraser friedman generating geneva geometry good graph graphs grid halperin hard hardness hochbaum hypercube ieee inapproximability institute journal july khanna kortsarz languages letters levi liestman lille lncs locality mccormick minimum narasimhan network networks operation optimal pages pairs pairwise paths peleg philadelphia planar problem problems proc programming publishing references report research results scha science sensitive series server shermer shortest siam simchi simon soares spanner spanners sparse sparseness springer strong supowit switzerland symp synchronizer tech technical theoretical theory there ullman university verlag weizmann wenger with york zwick
http://doi.acm.org/10.1145/380752.380846	58	The Price of Selfish Routing	academic access achieving alfonsin algorithmic algorithms allocation analysis annals annual applications applied approach approximability april architecting areas aspects asymptotic asynchronous atomic august automatic avoiding bandwidth basar based borodin braess cambridge capacity carrahan case cation cherno chistiakov ciency classics combinatorics communication communications competitive computation computational computer computers computing conference congestion control controllers convergence cooperative coordination cost course december decentralized deering designer discrete distributed douligeris draft dubey dynamic economics economides edition environment equilibria evaluation existence february feigenbaum finite flow foundations game games germany greedy grimmett habib handbook hinden hsiao hypothesis ieee ietf infocom integrated intelligent internet jective john johnson journal karp kitami kolchin korilis kotz koutsoupias kung lack lazar lecture libman locations magazine manuscript march markovian mathematical mathematics mavronicolas mcdiarmid mckelvey mclennan measure meinel methods models motwani mouskos multi multicast multiclass multiple multiuser nash network networking networks noncooperative notes observations october olsder online operations optima optimal optimization orda oregon osborne overview owen oxford papadimitriou paradox path pendarakis performance perspective philadelphia portland press probabilistic probability problems proceedings processes protocol publications queueing raghavan ramirez random randomized reed references research roughgarden routing rubinstein russo science second selected series services sevastianov sharing shenker shimkin siam silvester sons sources speci spirakis springer stackelberg statistics stirzaker strategies symposium synchronous tardos telecommunications tests their theoretical theory third tison trade transactions trier under university unpublished user using verlag version virtual wiley winston with worst yaniv yannakakis york zhang
http://doi.acm.org/10.1145/380752.380852	64	Black-Box Concurrent Zero-Knowledge Requires ~ (log n) Rounds	acknowledgements alon alternative archive auxiliary available bellare black book bounds brassard canetti chaum cient commitment complexity composition comput computationally computing concurrent constant constraints construct construction convincing crepeau crypto cryptography cryptology damgard disclosure does dwork eprint error eurocrypt existence feige focs foundations frag fragments from function generator goldreich goldwasser hada hastad have hiding html http iacr impagliazzo indistinguishability institute interactive internet jacm jcss jour kahan kilian knowledge krawczyk languages levin lncs logarithmic lower luby micali minimum model models naor need nitions note nothing oded oren ostrovsky pages parallel perfect petrank poly proof proofs properties protocols pseudorandom pseudorandomness racko reducing references repetition requires resettable richardson rosen round rounds sahai science shamir siam simulation sound springer stoc string systems tanaka techniques that their theoret theory thesis timing using validity weizmann wigderson witness yield yung zero
http://doi.acm.org/10.1145/380752.380786	13	Interaction in Quantum Communication and the Complexity of Set Disjointness	access aharonov algebra also ambainis annual applications april archive asymmetric automata bennett bernstein buhrman caltech cambridge center chasing chau circuit circuits classical cleve codes coin commitment communication complexity computation computational computer computing conference cover cryptographic data dimacs disjointness distinguishability duris earlier einsteinpodolsky elements entanglement entropy eople erators fidelity first foundations fourteenth fuchs function galil graaf http ideal ieee information inner interaction international ipping john journal jozsa kitaev klauck kushilevitz lanl lecture letters limited lower mathematical mayers measures mechanical miltersen mixed modern nayak nielsen nisan nondeterminism notes octob ointer olynomials onential optics optimal ossible ounds papadimitriou particle physica physical physics ponzio preprint preskill press probabilistic probability proceedings product protocol protocols quant quantum radhakrishnan random references reports review revisited rosen rounds rutgers safra sampling schnitger schulman science second secure separation series seventh shma siam sipser sons space springer state states structures symposium tapp technical telecomm theory these thirtieth thirty thomas tossing transactions transition twenty uhlmann unconditionally university vazirani vegas venkatesh verlag version wiesner wigderson wiley with wolf york zuckerman
http://doi.acm.org/10.1145/380752.380783	11	Stackelberg Scheduling Strategies	academic agents algorithmic algorithms also among analysis annual anupam appendix applied aspects assignment atkin available avoiding braess capture case comments communication comp computation computer computing consider cornell cost design disciplines discussions distributed draft earlier easy economy edition english entitled equally equilibria equilibrium erative etitive example formal foundations full functions game general gleichgewicht greed gupta hall hand having hebrew helpful http ieee including induces inducing infor jerusalem journal kleinb korlis koutsoupias latency lazar machine making market marktform mathematical mathematics maximum mechanism methods multi networking networks nisan noncoop nonlinear notions ointing optimal optimality optimization orda other owen oxford pages papadimitriou paradox peressini prentice press probability problem problems proceedings programming published references relevant relocation revelle ronen roughgarden routing science serra service several shenker shimkin solving springer stackelb strategy sullivan switch symposium tardos thank theoretic theoretical theory thesis third this three thus timr transactions translation transportation treatment university urban used useful user verlag version with work worst
http://doi.acm.org/10.1145/380752.380877	80	A Polynomial-Time Approximation Algorithm ∗ for the Permanent of a Matrix with Non-Negative Entries	achieved actual addison alex alexander algebraic algorithm algorithmica algorithms alistair alon andrei annual applications approach approximate approximating approximation arrangements barvinok broder cally cambridge canadian carlo case certain chain combinatorial combinatorica company complete complexity computer computing conceivably connected corresp counting degrees desired deterministic dimer dimers discriminants distribution dorit each ecial edge encer encyclopedia erfect ermanent ermanents erratum eulerian exactly factor fast following fpras from generation graph graphs hard hence henryk hochbaum however includes integration jeev jerrum joel john journal kasteleyn known lattice leslie likely linial manner mark markov marry matchings mathematics matrix method mihail mildly milena minc mixed monte more motwani nathan necessarily nite noga note numb olynomial onds onential orientations permanents peter physica polynomial prabhakar press probabilistic problems proceedings proof publishing quadratic raghavan random randomized references regular relationship samorodnitsky satisfy scaling science seems short siam simply sinclair solvable spanning statistics stoc strongly structures subgraph symposium that theorem theoretical theory this time tutte umesh uniform university valiant vazirani vertex vertices vijay wesley while wigderson wiley winkler with within
http://doi.acm.org/10.1145/380752.380803	22	Sparse Polynomial Approximation in Finite Fields	acad ajtai algebra algebraic algorithm algorithmic algorithms annalen annual appear appl applications approximate arora attacks bases basic basis berlin binary birkh bits bleichenbacher body boneh boston cambridge canetti cant carlo case chinese chosen cient cients clausen codes colloq commun comp compl complexity comput computation computational computing convex coorecting correcting correlation crete cryptographic cryptography cryptology curve dark data decoding degree designs digital discr distributions dordrecht dress ective elds electronic engin erroneous error exact factoring finite friedlander from function functions generalized generation generators geometric geometry goldreich gonz grabmeier graham greece grigoriev guruswami hardness hidden hierarchy highly howgrave ieee improved improvements independently inform insecurity integer interpolation israel july kannan karpinski keys kiwi kluwer known konyagin kumar lakshman larsen lattice lattices learning lect lenstra lidl lieman like liptic lipton list lman local magniez mahassni math mathematische melbourne message methods micali micciancio minkowski monte most multivariate nguyen niederreiter nite noisy nonces notes number numbers oper over partial passing perfect philadelphia polynomial polynomials preprint press problem proc programming properties publ public quasi queries random randomly randomness rational reconstructing reduction reed references related remaindering research review rounding rubinfeld sampled santha saunders scheme schemes schnorr secret security sequences shamir shokrollahi shortest shparlinski siam side sieve signature signi singapore singer sivakumar smart solomon some sparse springer standard statistical stern sudan survey symp system testing theor theorem theory thesis time trace trans transformations trier uniformly univ university update user vasco vector venkatesan verheul verlag wasserman weil werther with workshop york zero zippel
http://doi.acm.org/10.1145/380752.380782	10	Non-Clairvoyant Scheduling to Minimize the Average Flow L Time on Single and Parallel Machines	about achieves addison algorithm algorithms almost also amortized annual approximating assigning average awerbuch azar baker being between borodin bound brown case ciency claim clairvoyance clairvoyant communication communications competitive completes compute computer computing concurrent conference conjecture considering constraint convention david delicate discussions distribution distributions doeppner drawn dynamic efcient electrical electronic engineers equation exponential extensions fact flow focs foundations from function further good goodness grateful hall have help here holds however ieee immensely implementation indication input inserting institute integer introduction issue jective jobs kalyanasundaram karp kirk knowledge known lack leads leonardi library like line list logarithmic lower machine machines marchetti maxfy maximized mention metrics microsystems might migration minimization minimizing minimum modern motwani mueller muthukrishnan nally namely nonclairvoyant nonclairvoyantly nutt obtain obtained ofpther open operating optimal overhead pages paging paral parallel performances personal phase phillips point portable posix power powerful practice prentice probability problem problems proc proceedings processing programming projects proof pruhs randomization randomized references regev related release report result rewrite rmlf rules scheduling science second sequences sequencing services several since single sleator spaccamela speci special speed still stoc stretch such sunos support symposium system systems tanenbaum tardos tarjan technical thank that then theorem theoretical theory there therefore these this threads thus tight time times topics torng total under uniform university unix update usenix using validation value variables version very view violated wesley which widgerson wiley windows winter with without work worst would yielding
http://doi.acm.org/10.1145/380752.380838	50	Approximation Algorithms for Max-3-Cut and Other Problems ∗ via Complex Semidefinite Programming	ability about algebras algorithm algorithmica algorithms alizadeh already also although analysis andersson appear appendix applications applied approach approximate approximating approximation associative barrier barriers based because becomes begin being belgium below berlin between betweenness bisection block both capacity carefully case catholique change chebyshev chemical choice choices cholesky choose choosing chor claim class cleveland coloring colouring column columns combinatorial combinatorica commutative company complement completes complex computational computing cones consecutive consequences consider considered considers constitute constraint constraints construct construction contribution convex core corollary corresponding corresponds decomposed decomposition decompositions deduce denotes deriving dicut discrete distributed done dual each earlier easily edge edition editor ellipsoid engebretsen entries entry equal equations equivalence equivalent erent evaluate every exactly extension fact faybusovich feasible feige finally first focus following follows frieze from function functions furthermore general generate generated generating geometric give given goemans graph guarantee guler hand have here identical ieee imply impose improved increase independent independently indices industrial information inner inspired instances interior introduce israel jective jerrum jordan journal karger klerk know kronecker linear linmod louvain manuscript many mathematical mathematics matrix maximum maxj method methods monotone more motwani nemirovskii nesterov next nite nonconvex normally notice observe obtain ones only operations optimization optimum order other ours outward pages paper paragraph pasechnik performance philadelphia point polynomial polynomials positive precisely previous primal probability problem problems proceeding proceedings process product products program programming proof proper provided quadratic quality random randomized real references related relaxation relaxations replace report research result results rotations rounding rows rubber rutcor rutgers same satis scaled scheduling scheme schemes schmieta schrijver secondly section seen selby self semide setting several shannon show showing shown shows siam simulate since sketched skutella society solution solutions some springer stad standard start step studies such sudan symmetric symposium systems tables technical technique term that their then theory therefore these they third this those three through thus time todd tool transactions trefethen tschel twenty universite university used using value variable various vector vectors verlag version warners ways when where which will williamson with work worst zwick
http://doi.acm.org/10.1145/380752.380825	41	Applications of Approximation Algorithms to Cooperative Games	aciri acta agents aggregation algorithm algorithmic algorithms allocation annals appear approach approximation balance balanced berlin berman broader budget case characterization choice ciency coalition computation conference congestion contributions control core cores cost costs design distance distributed economics editor editors egalitarianism equilibirium equilibria fairness fast focs free game games green group holland http implementable incremental indian informatica information institute interfaces jain journal kapov karp kent kleinberg kohlberg koutsoupias kuhn kumar logistics markowsky measures mechanism megiddo minimum monotonic moulin mutuswami naval network networks nisan north notion operation operational optimization pages papadimitriou paper partial person population preferences preparation press princeton problem problems proceedings proofness public quarterly reearch research resource revealation rider roberts ronen roughgarden routing rules scheme sets shapley sharing shenker skorin social spanning springer stable stacs statistical steiner stoc strategy strategyproof submodular tardos technology theory tree trees tucker under university value vazirani verlag versus volume welfare working worst
http://doi.acm.org/10.1145/380752.380835	47	A Read-Once Branching Program Lower Bound of Ω(2n/4) for Integer Multiplication Using Universal Hashing	advances ajtai algorithm algorithms alon andreev application applications arguments arithmetic arithmetik babai based baskov bdds beame binary bollig boolean bound bounded bounds branching bryant cation cient circuit circuits clementi clique closest complexity computation computational computer computers computing data decision depth diagrams dietzfelbinger dimacs diploma discrete dortmund driven explicit exponential focs formal functions ganzzahliger gergov graph hagerup hard hash hashfunktionen hashing hierarchy hreshold icalp ieee implementations independent information input integer jainen jections jnal journal kata klassen koml kriegel lecture letters linear lower lynomial maass machines manipulation mathematics meanders mfcs miltersen multiplication nondeterministic notes obdd oblivious once only optimal optimally pages pair penttonen petrank ponzio primes problem proc processing programms programs pseudo pudl random randomized read real references reliable representations restricted rithmetic rolim saks savicky science sciences sequential series sets siam sieling simon size small space stacs stoc strongly structure super system szegedy szemer tardos teubner their theorem theoretical theory thesis threshold tight time trade tradeo trans trees turan types univ universal universel variables various veri vlsi volume waack wegener wiley wise with without woelfel yield
http://doi.acm.org/10.1145/380752.380777	8	Minimax parametric optimization problems and multi-dimensional parametric searching	abstract algebraic algorithm algorithms analysis appear applications applying aspect berkeley between bixby bound bounds bridge bridges chapter chazelle chong cient cohen cole combinatorial combinatorics communication comput computation computational computer computing conference conquer convex corresponding cunningham cuts cutting cycles design detecting deyer diameter dimension dimensions discrete divide down dynamic elsevier eppstein faster foundations gartner geometric geometry graphs hall handbook hkust hyperplanes ieee imai information introduction japan karger katoh letters linear lncs lower matousek matroid meggido megiddo memorandum minimax minimum mulmuley near network norton obtain optimal optimization otfried parallel parametric partition plotkin points polygons polymatroid polynomial preprint press princeton private problem problems proc processing programming proof queries randomized references regions related report research salowe schwarzkopf science search section sensitivity separation serial sharir shin siam slowing small sorting strongly subexponential sumino symposium tamaki tardos tcsc theoretical theory there through time tokuyama trees tting using welzl when
http://doi.acm.org/10.1145/380752.380802	21	Excellent nonlinear codes from modular curves	acad acknowledgments algebraic appl arithmetic artin asymptotic asymptotically attaining behaviour berlin better bound braunschweig brown careful codes composita curves decoding dipippo dokl dordrecht draft drinfeld earlier elds extensions fields finite foundation france function functions garcia geometric geometry gilbert good goppa gruyter guruswami harvard heights ieee ihara improved inform invent joel kluwer lectures list math modular mordel nachr nancial nite number over packard pages paris points rational reading reed references remarks rosenberg schanuel schreier serre shimura shokrollahi sohn solomon some soviet spaces stephen stichtenoth sudan support than thanks their theorem theory thesis thomas tokyo tower towers trans tsfasman varshamov vieweg vladut wasserman weil zeta zink
http://doi.acm.org/10.1145/380752.380792	16	Conditions on Input Vectors for Consensus Solvability in Asynchronous Distributed Systems	advanced advances advantage adversary afek agreement aguilera algorithm algorithms allow amara among analysis another appear approach approximate april aspnes asynchronous atomic attalah attiya aumann barbara based beach best bibli biran borowsky both bracha bratislava broadcast canada chandra characterization chaudhuri choice choices cient city combinatorial complete completely computation computer computing concepts concurrent condition conditions conference consensus correctness decidability deciding decision decisions dependable detection detectors deterministic disc distributed dolev dwork edmonton environment extended failure fast fault faults faulty february fischer formerly foundations france francisco free ftcs fundamentals gafni general glimmer graph greenwich hadzilacos handbook hard herlihy hierarchy hill html http hundred hybrid ieee impossibility information input international invited irisa january jayanti jects journal jsbaum june kaufmann koutsoupias lamport languages layered letters linearizability lncs loui lynch mathematical mcgraw memory merritt message mfcs minimal montreal moran more morgan moses mostefaoui mullender needed networks newport noisy object october operations oriented pages paral parliament part partial passing paterson perspectives pinter podc portland presence press previously principles problems proc process processes processing processor programming proofs protocols publi quorum rachman randomization raynal reaching real references related reliable rennes report requirements research results robust robustly santa scheduler science september shared sharing shavit siam simulation simulations slovakia snapshots society solvability solvable solve solving springer stark stoc stockmeyer structure symposium synchronism synchronization synchrony systems talk tasks theoretic theory three time timed tolerant topics totally toueg transactions tronel undecidable university unreliable using vectors verlag wait wdag weak weihl welch wing with wolfstahl words workshop worlds york zaks
http://doi.acm.org/10.1145/380752.380804	24	Fully-dynamic min-cut	algorithmica algorithms also alstrup ambivalent angluin applications approximate approximation april automata based biconnectivity cation center circuits classes coll comput computing connected connectivity covering cuts data decomposing decremental deterministic diameters dinitz discrete disjoint dynamic edge eppstein factors fast focs fractional frederickson fully galil graph graphs hamiltonian holm ibaraki incremental into invited italiano karger languages lichtenberg line linear lncs logarithmic london maintaining maintenance matchings math mathematics median minimizing minimum nagamochi nash nding near nissenzweig nite nossenson operations packing pages plotkin poly probabilistic problem problems proc program programming randomized references research rounding scandinavian separator shmoys siam sleator smallest soda solving spanning sparse sparsi speeding spencer stoc structure structures subgraph symp syst system talk tardos tarjan technique theory thorup time tree trees tutte updating using valiant vertex williams with without workshop young
http://doi.acm.org/10.1145/380752.380815	35	A Tight Bound for the Complexity of Voronoi Diagrams ∗ under Polyhedral Convex Distance Functions in 3D	abstract agarwal algorithmic algorithms almost amsterdam analyzing annu applications arrangements aspects aurenhammer aviv based bisectors boca boissonnat cambridge canad certain chapter chew clarkson complexity comput computational computer computing concepts concrete conf construction convex convolutions cori crum data davenport delaunay department dewdney diagrams dimensional dimensions discrete distance drysdale dunlaing edelsbrunner editor editors elsevier envelop erent fernuniversit fortune functions fundam general generalized geom geometric geometry goodman graph guibas hagen handbook herv higher holland icking inform internat ject kedem klein knuth lecture leeuwen leven linear lines lower math mehlhorn meiser metrics mitchell motion moving nickel nnimann north notes oints olyhedral other otics ounds pages partition piecewise plane planning press problem proc publishers purely random raton reciprocal references roos rourke sack sampling santos schinzel schwartz science search seidel sequences sharir shor space springer struct substructures surfaces sympos tagansky technical technique their theoret theoretical thesis tight translated translational triangulations under university urrutia using utilitas verlag volume voronoi vranch welzl wirsing with wood workshop york yvinec
http://doi.acm.org/10.1145/380752.380842	54	Optimal Static Range Reporting in One Dimension	access agarwal aggarwal ajtai algorithm algorithmica algorithms amir ancestors andersson annual applications approximate aragon arithmetic aspects asymmetric beame berlin boas brook case cell cient clarkson closest combinatorica common communication communications complexity computational computer computing data deterministic dichotomous dietzfelbinger discrete dynamic efrat emde endent fast faster fich floyd focs foundations fredman functions fusion geometry hagerup handbook harel hash hashing heapsort ieee indep indexed indyk information input integer jacobs journal komlos lecture letters linear lists location logarithmic lower matias mehlhorn miltersen minimum model multidimensional nding nearest nilsson nisan notes oblivious oint optimal ossible ound ounds output pages paths petersson predecessor predecessors preparata press primes priority prob problem problems proc processing proximity queries queues raman random randomized range references regular related results safra samet schmidt science sciences search searching seidel shamos shortest siam siegel soda sorting space spanning sparse spatial springer stoc stony storing structures surpassing symp symposium system szemer table tables tarjan theoretic theoretical theory thorup tight time trans trees treesort universal variables verlag vitter volume wigderson willard williams wise with without worst york young
http://doi.acm.org/10.1145/380752.380798	19	Approximate Distance Oracles	acad academic access acta aingworth algebraic algorithm algorithmic algorithmica algorithms almost alon althofer american among appear application applications applied approach approximate approximating arbitrary arikati awerbuch bartal based benson berger bollobas bondy boolean bound bounds bourgain brown bull bulletin canad canadian carter case center certains challenge characterization chaudhuri chekuri chen chew chiang cient classes closest cohen combinatorial combinatorica combinatorics comm communication compact components comput computational computer computing concentrators conference connexion constructing construction constructions contain cormen covers cowen cycles czechoslovak deduisent denison dense derandomization design diameter dictionary dietzfelbinger digraphs dijkstra dimacs directed discrete distance distances distributed djidjev dobkin dynamic edge eight elkin embedding erdos essential estimation euclidean european even exact examples expanders explicit extremal facility faculty fast fibonacci finding floats focs fredman functions gavoille general geometry girth graph graphs group groupes hagerup halperin hash hashing heaps heapsort hidden high hilbert hoory house hune hungar icalp implementaion implementation improved industrial indyk information institute integer integers introduction irregular israel joseph journal karger katajainen koller komlos kruskal labeling large lazebnik leiserson length libschitz linear linial locality location london lubotzky margulis math mathematical mathematics mathematik matrix mcgeoch median method metric metrices metrics minimal mitchell moore motwani multiplication naor near neighborhood network nite note numerische obstacles ohio optimization oracles pages pair pairs part path paths peleg penttonen perennes perfect philadelphia phillips planar plane point polynomial positive prague preserving press pretty probabilistic problem problems proc proceedings proximity publ publication publishing queries quick rabinovich ramanujan randomized reachability references regular rehovot reiman reliable renyi report result river rivest routing salesman sarnak schaffer schemes science sensitive sequential series shortest shoshan siam simonovits single size small smid smolenice soares society soda some source spaa space spaces spanner spanners spanning sparse spencer state stoc storing stretch strongly studia subgraph sublinear submitted subtree sympos syst szemeredi table tarjan technical that their theoretical theory thomsen thorup time tits trade transmission traveling tree treewidth trialite twelve uber undirected universal unpublished uses ustimenko vladimir wegman weighted weights weizmann wenger wiley williams with without witnesses woldar world worst zarankiewicz zaroliagis zwick
http://doi.acm.org/10.1145/380752.380830	44	Provisioning a Virtual Private Network: A Network Design Problem for Multicommodity Flow	aardal about abstract access adam albert alexander algorithm algorithms allocated allocation also amsterdam andrew andrews andy annals annual appendix applications approximate approximating approximation approximations area argument arkin assign assigned assume assumed asymt attention awerbuch azar bandwidth baruch been before behind berlin both bout break bruce building bulk calculation call called cannot case charikar charlie cheriyan chudak claim class clearly combination combinatorial common communication communications company comparing completeness completes completing component computer computers computing connected connecting consider constraint contained containing contains contradiction conversely convex coordinate core corollary cost counterparts covers created crocetti cult david davie decisive degree deleting demand denote describe design directed direction discrete disjoint distance dominated done dual each easy edge edges eight endpoints enough equal equivalent erwin esther every example exible expressed extended fabian facility fact factor fbibn fbin figure finally following follows form forms fotedar foundations four fractional francisco fratta freeman from further gabriel garey generalized geometric gerla gets give given global goemans goldberg goyal graph graphs greenberg grotschel guha guide halldorsson hassin have hence hierarchical holland however idea ieee immediately implies improved incomplete indecisive indeed indicates induced inequalities information installation instance instances into intractability jacobus jain jeffrey johnson joining joseph just kamal kamesh karen karger kaufmann know knowledge known kopt laszlo leaf lemma length lengths letters level lisa location look lovasz luigi magnus management maria mario martin matching matchings mathematics matthew median merwe metric meyerson michael michel mihail mike milena minimal minimizes minimizing minimum minkoff mishra model more morgan moses most mpls munagala must nding network networks nicholas node nodes nonnegative north note observations optimal optimality optimization oram otherwise packing pages pair paola part partho path paths paul pawan placement plotkin plummer points polytope previous primal private problem problems procedure proceedings processing proof prove proves publishers publishing quantities quantity ramakrishnan ravi record reduction refael references reilly rekhter replaced resource respect rest review robins sairam salman same schrijver science scott second september serge shaded shivi shmoys shortes show showing shows siam sibel sigcomm similar similarly since single sink smaller smallest solution solutions solving some special springer steiner step still strict structure subramanian subset subtree such sudipto symmetric symposium tardos technology terms than that them then theorem theory these thesis they thick thin this those three tour towards transforms tree trees turn uncapacitated undirected union unique useful usual vazirani vector verlag vertex vertices viewed vijay violation virtual vitter volume weight weighted well were where which will williamson with wolfe would yakov yossi zelikovsky zhang
http://doi.acm.org/10.1145/380752.380822	40	The Complexity of Analytic Tableaux	alasdair algorithms analysis analytic arti birkhauser cial clausal complexity computational computer conference cook daniel donald dover edition editor elimination erik european fabio family first formulae forthcoming greene henri igpl intel intractability journal kaufmann knuth letin ligence logic loveland massacci mathematics mechanical methods model morgan murray neil number order pages prade proofs propositional proving raymond reckhow references reprinted rosenthal science september smullyan springer subexponential symbolic tableau tableaux their theorem theoretical third urquhart verlag volume wrong york
http://doi.acm.org/10.1145/380752.380820	38	A Sharp Threshold in Proof Complexity	aaai ability about abstract academic achlioptas adding affect affects aguirre algorithms allows also always american analysis annual appealing appear appearances appears appendix argument arguments arti assume asymptotically atlanta automat available ball balls bdds beach beame before behavior below berlin biere bollobas boosting boston bound bounded bounding bounds british calculus capture case cast cation change chao characteristic checking choose choosing chtcherba chvatal cial cimatti claim clans clarke clause clauses coarfa collector coloring combinatorial combinatorics combining combinining communications complexity component components comput computation computational computer computing concentration condition conference connected consider considering constraint construct construction contains convergence correspond corresponds cost could couple coupling coupons crato critical cycle dallas davis demopoulos denote denotes dently department determining difference differences differential discrete distinct domain dominates dramatic dramatically each edges either elements encoding envelope equations equivalent establish estimate event every examples exhaust exists expectation exploit extended extensions fact facts family fewer fifteenth fifth finally first follow following follows form formed formula formulae formulas foundations franco friedgut frieze from function further general generalization generating germany gets goerdt gomes graph graphs gsat guarantee hard have having heavy hence here heuristics hold holds http idea ider ieee ignore ijcai impagliazzo implies ince indepen independent independently inequality information instance intelligence international introduce istrate janson journal karp kautz kirkpatrick kirousis knowledge known kranakis krizanc large last later lbsurvey least lemma levesque like linearity linearly literal literals logemann logic london loveland lower luckily machine made making manner many markov martingale mathematical mcallester mcdiarmid method mick microsoft miguel miracle mitchell model moment monasson moore more most must myopic narrow national nature need next nite nition notation note number observe observing occur october odds omit only optas optimal pages particular phase phenomena physics pick picked picking pitassi pittsburgh placement planning plans plot polynomial possibility possible practice press principles priori probabilistic probability problem problems procceedings procedure proceedings program programming proof proofs properties propositional prove proving pushing putnam quanti random randomization randomly rather ratio reason reasoning recall redondo reed references relation relet replace replacement replacing representation require required research resolution respectively rest result results rigorous rough saks sasson satis satisfaction satisfy scanning science sciences search seen selection selman september sequence setting sharp short show siam side simple simplify simultaneously since singapore single sketch society solving some somewhat sorkin springer stamatiou standard start statement step stochastic straightforward structured structures subcritical subgraph subramanian subset substituting such suen suffer survey surveys symbolic symposium system szemeredi tacas tail tailed taking tenth terms than that their then theorem theoret theory there thesis they thickens thirtieth thirty this threshold thresholds through thus toronto transition transitions tree troyansky typical undirected uniformly unit university unlikely unsatis until upper using value vamvakari vardi variable variables verlag vertex vertices washington weight weighted weights well were where which while wigderson will with without work workshop york zecchina
http://doi.acm.org/10.1145/380752.380796	17	Spatial Gossip and Resource Location Protocols	abbadi adaptive aggregation agrawal algorithms balakrishnan bimodal birman broadcasting budiu century cerdeira challenges communication computer computing conf connected coordination database databases demers dependable discrete dissemination distributed dust epidemic estrin fault foundations gobel gossip gossiping govindan graphs greene groups gupta hauser hayden hedetniemi heidemann heinzelman ieee information intl irish kahn karp katz kulik kumar label large larson liestman maintenance mathematics minsky mobile multicast networking networks next orestes ozkasap pister principles problem proc process protocols randomized references renesse replicated rumor scalable schindelhauer science sensor shenker smart spreading steinke stuygis survey swinehart symp systems terry tolerant transactions veldman vocking wireless xiao
http://doi.acm.org/10.1145/380752.380833	46	Lower Bounds for Matrix Product, in Bounded Depth ∗ Circuits with Arbitrary Gates	also another arbitrary bits boolean both cations changes circuit circuits claim depth each ecause element erent erties factor gates have hence input just lemma lower make matrices matrix minor modi note observe original ound ounds outputs over parameters product proof proofs prop prove proving rather reduction references represented same similar size some than that then theorem this values version viewed where with
http://doi.acm.org/10.1145/380752.380769	7	Quantum Mechanical Algorithms for the Nonabelian Hidden Subgroup Problem	advances advantage alexander alexei algorithm algorithms almost amer amnon annual applied apply beals beth birkh bler case cases cauchy challenging character checking cient class clausen comp complexity computation compute computer computers computing conjugacy conjugate convenient daniel diaconis discrete disjoint eccc elian emanuel ettinger even examples factorization fast finite fourier generalized graph group groups hallgren hidden involution isomorphism jacob jean johannes journal kaltofen kitaev knill known lanl linear logarithms mark markus martin math mathematics measurements michael most ning nite noncommutative normal observe orthogonal ositions over ower persi peter pierre polynomial preprint prime probabilistic problem problems proceedings product puschel quadratic quant quantum random reconstruction references representations rockmore russell schwartz sean serre shifted shma shor shows siam simon simple some springer stabilizer states strategy structural subgroup subgroups such symmetric symposium that theor theorem theory there this thomas though time transform transforms transp tteler user using verlag watt whether which with
http://doi.acm.org/10.1145/380752.380778	9	Algorithms for Minimizing Weighted Flow Time	according adapted afrati algorithm algorithms analysis annals annual appropriate approximability approximating approximation assign assigns augmentation average awerbuch azar bampis based becchetti bender best bound bounds brucker carried chakrabarti chekuri choices choose clairvoyance competitive completion complexity computer computing conclusions constant continuous critical culty dates described details discrete distribution each equivalent extended factor finally flow following foundations further gehrke group grouping hall however ieee improve improved interval into involved itself jaraman jobs kalyanasundaram karger kellerer kenyon khanna lemmas lenstra leonardi lowed machine machines manuscript math mathematics metrics migration milis minflog minimize minimizing more much muthukrishnan nonapproximability number obtain omit online operations optimal optimize other pages parallel parameterize perturbing phillips point preemptive probability problems proceedings procesing provn pruhs queyranne randomization ratio ratios real references regev release research resource result results rinnooy same scheduling schemes schulz science section shaheen shmoys show siam similar single skutella some speed srpt starting stein streams stretch sviridenko symposium tautenhahn technically that their theorem theory they this thus time times torng total using version very weighted wein which with within without woeginger