http://www.informatik.uni-trier.de/~ley/db/conf/stoc/stoc2005.html
STOC 2005
http://doi.acm.org/10.1145/1060590.1060665	56	Lower-Stretch Spanning Trees	algorithm algorithmic algorithms alon application applications approach approximate approximating approximation arbitrary arxiv aumann automata available awerbuch azar bartal baruch boman bound bruce bulk circuits combinatorica communication compendium completeness complexity comput computers computing cornell covering crescenzi daniel david design designing deterministic directed distributed douglas element elliptic eran erik fakcharoenphol february finite flow focs fractionally game garey garg geometry graph graphs group guide hard hendrickson http ieee international intractability jittat johnson journal kann karp konjevod kunal languages leighton linear linial locality london manuscript metric metrices metrics minimum multicommodity nada nathan national near nearly network noga online optimum packing pages partitioning peleg personal philadelphia polylogarithmic preconditioners probabilistic problem problems proc proceedings programming rabani rabinovich ravi references reshef richard sandia satish sensitive server seymour shang siam soda solving some spaces spanning sparsification spielman steiner stephen stoc support synchronization systems talwar teng their theorem theorems theoretic theory tight time tree trees vavasis west with yair yonatan yuri yuval
http://doi.acm.org/10.1145/1060590.1060600	7	The Price of Anarchy of Finite Congestion Games	algorithms allocation anarchy annual anshelevich approximate architectures aspects atomic automata awerbuch azar balancing ball behavior bounding bounds case christodoulou cking class combinatorial communication complexity computational computer computing conference congestion convex correa correlated cost course czuma dasgupta design discrete ecific economic elias endent epstein equilibria fabrikant fair fairness farms fifteenth flow flows focs fotakis foundations functions fusion gairing game games http icalp ieee indep inefficiency information instances integer international internet ipco january journal june kleinb kontogiannis koutsoupias krysta languages latency lelism linear links load loquium lucking mathematical mavronicolas maximum mfcs milchtaich model monderer monien moses nash network nonatomic ology optimization orne ossessing pages papadimitriou paper paral parallel payoff player polynomial potential press price problem proceedings programming publications pure references restricted rode rosenthal roughgarden routing rubinstein scheduling schulz science sciences selfish septemb server shapley siam sirocco sixteenth social soda spirakis stability stacs stoc strategy structural submitted suri symposium system tardos theorem theoretical theory there tight traffic tulwar unsplittable vocking wexler which with worst zhou
http://doi.acm.org/10.1145/1060590.1060670	60	New and Improved Constructions of Non-Malleable Cryptographic Protocols	adaptive alternatives applications arguments assumptions barak barrier basic beyond black bounded cambridge canetti chosen ciphertext coin cols commitment commitments comp completeness complexity computation computing concurrent constant construction constructions crescenzo crypto cryptographic cryptography cryptology damg definitions dishonest dolev dwork efficient encryption eurocrypt existence extraction fail feige fischlin focs foundation from function functions game general generation generator goldreich goldwasser groth hash have hiding honest human impagliazzo indistinguishability interactive ishai jacm jcss jority jour katz kilian knowledge languages lapidot levin lindell lncs luby mackenzie malleability malleable mental micali multi multiple naor nguyen noninteractive note nothing numb only osable ostrovsky pages party pass passwords pedersen persiano pfitzmann play polynomial preliminary press probabilistic proof proofs proto protocols pseudorandom pseudorandomness rackoff random realizing references reiter reusable robust rosen round rounds sahai santis schemes secure security session setup shamir shared short siam signatures simpler simulation smith springer stad statistically stoc stop strict string systems that their theorem time tools tossing under universal universally university using vadhan validity version wigderson with without witness yang yield yung zero
http://doi.acm.org/10.1145/1060590.1060642	39	Hierarchies for Semantic Classes	advice algorithms allender almost amer annual argument automata balcazar barak beigel carlo circuit classes colorado complete complexity computation computational computer computing conference constructible cook denver derandomizing electronic enseignement everywhere existence fortnow foundations fourth from functions gabarro goldreich hartmanis hertrampf hierarchies hierarchy homer identity ieee impagliazzo inefficient information informatsii international journal july kabanets karp karpinski languages lecture levin lipton logarithmic loquium lower machine machines math matique means monte nondeterministic notes olynomial other ounds papadimitriou parity peredachi probabilistic problems problemy procedures proceedings programming proofs proving record references relativization results russian santhanam science sciences search separation sets single sipser slightly space springer stearns structural sudan symposium system take tests that theorem theorems theoretical theory time trans trevisan turing uniform universal verbeek verlag york
http://doi.acm.org/10.1145/1060590.1060632	31	Hardness of the Undirected Edge-Disjoint Paths Problem	above accept accepting accepts access additional after algorithm algorithmica algorithms alleged also alto always amortized analysis andrews annual answer answers appendix applications apply approximability approximate approximating approximation approximations arbitrarily argument assign assume atlanta aumann bandwidth baveja beach belongs between bigger bipartite bits bound bounded bounds bulk burlington cambridge case characterization chekuri choice choose cliques combinatorial commodity complete completeness complexity computation computer computing configuration configurations connected consider consists constant constraints constructed contains could creates dallas decide decides decision decomposition degree densely design diameter different dinitz discrete disjoint dual each easy edge either embedded endent equals equation erdos error every examining exist expander expression extension feige fglss fixed flow following forest form formula foundations from function garg gegebener generality given goemans goldwasser good graph graphen graphs greater greedy guruswami half hard hardness have high ieee important improved inapproximability inconsistent increasing indep independent index instance instances integer integral interactive into involves italy jaraman journal khanna kleinberg knotenzahl known kolliopoulos large latter leighton lemma less loss lovasz lowdegree lower lowing make makes matchings math mathematics maximum miami minimaler minimum minor moreover most multi multicommodity multicut near network networks node nodes note nothing november number obtain october only operations optical optimal optimization oracle original other packet packing pages palo parameters particular partition path paths planar poly polylogarithmic precisely primal probabilistic probability problem problems proceedings programming programs proof proofs properties property prove quantities queried queries query rabani random randomized read recall receiving reduced reduction references regular regulare related remove repetitions replace research result results revisited rome routing sachs safra same samorodnitsky satisfiable satisfied satisfying science sciences section series sets shepherd shows siam similar simple since single size small soundness source specification srinivasan states stein steiner string such sufficiently suppose symposium system szegedy taillenweite taking tardos than that them then theorem theory there therefore these thesis they third this time together toss tosses total trees trevisan uniform union unsplittable used uses using values varadara vazirani venkataraman verifier vertices wang well when where whereas whether which wiss with within without wittenburg yannakakis zero
http://doi.acm.org/10.1145/1060590.1060627	27	Balanced Boolean Functions that can be Evaluated so that Every Input Bit is Unlikely to be Read	abstract academic alexander algorithms alternatively although annual another answers applications applies architectures arrays assume assumed benjamini beyond boolean bound campanino carlo case chain circularly coin collective columbia combining comm complexity computation computer computing conference coupled critical cubic cucs daniel david decision dept deterministic directed discussed displayed does donnell drop editor electron evaluating even every exceptional extended factor first flipping formulae foundations from functions games generate generic give gives graph holds holographic hypercubes ieee implying inequalities inequality influence influences influential information introduction itai james jayram jeff journal kahn kalai kaufmann kumar last lattice learning leighton linial many markov mateo micali michael mike miklos monotone monte morgan nathan neal nearlylinear necessarily need noise obtained oded once pages paral percolation perfectly polishchuk preparation press probab probabilistic probability proceedings proof proofs propp quantitative questions quote radford random randomness ravi read references report revised rocco russo ryan saks sample sampling santha schramm science sensitivity servedio since sivakumar sixth size spanning spielman statistics steif step structure symposium takes taking technical that theorem theory there this thomson threedimensional times toronto tree trees twenty university upper valid values variable variables well wigderson wilson york
http://doi.acm.org/10.1145/1060590.1060697	80	An Optimal Multi-Writer Snapshot Algorithm 	access accesses account actions afek after agreement algorithm algorithms also analysis anderson annual appendix applications applied architecture architectures argue arrays aspnes asynchronous atomic attiya august basic because before bits blocking both canada case cases chandra choice comp complete completes complexity component computer computing concurrent condition conditions conference consensus constraints constructions containment correct correctly correctness data define defined definition definitions denotes department designed distributed does dolev dwork each ecause ectively effect efficient efficiently efore egins either elegant enable endix ensures eration erations erforms even except executed executes executing exists extremely figure first following follows free from further gafni guarantees haldar hand henceforth herlihy hold icdcs immediate immediately implement implementation implementations implemented implementing implements instructions international interval intervals into involves israel iteration jayanti ject jects john journal july june kinds kirousis known lapse large last late latest lattice lemma lemmas lies line linear linearizability linearization linearize linearized lines loop lowing machine manuscript many memorial memory merritt model moir more multi multiword natural need needs newfoundland next notation notice noticed numb oint oints older once onent only operation orts osite other overlaps packs pages paral particular petrovic phase plotkin point points practical pram precede precedes precise precisely primitives principles proceedings processes processids proof proofs prove proved rachman reading reads recent references refine registers requires resp return returns riany same scan science section septemb sequence shared shavit should similarly since single size sized sketch small snapshot snapshots solutions solve space spirakis starts state states stores structures sublinear such suggest supp symposium synchronization systems taken takes technical than that then theorem theoretical theory there therefore these this three thus time together toggle toplas total touitou towards tsigas university unpublished uses using value variable variables vidyasankar waarts wait when where which whose wing with within without word words workshop write writer
http://doi.acm.org/10.1145/1060590.1060614	17	Efficient Testing of Groups 	accepts actually again algebraic algorithms alon always amortized analysis appendix applications approximability approximate approximations aspects because behaving bellare biased binary blum boolean buhrman calls case characterisation characteristic checkable checkers chernoff cheung choice claim claims class classes clearly close combinatorial communication complexity computation computer computing conf constant convolutions copp correcting decomp define defined definition degree denote denoted derandomizing dimacs directions discrete distinct distributions does earlier ecause ecial edit efficient ehaving eigenvalue either ekert element elements elian encer endent epsilon equivalence ergun ersmith erty estimation evaluation event events every exact fact factorization failure finish finite first following follows form fortnow frequency from function functions general give gives goldreich goldwasser good graph greater group groups half halving hand handbook hidden hold holds homomorphism hrig identities ieee implies imply improved indep inequalities inequality information inside integer intersection invertibility jagopalan john jority kannan kiwi kluwer know known kumar least left less linearity lipton lncs logarithms luby lund magniez main markov mathematics method mosca motivates multiple must name nasa newman numb numerical oint optimal oracle osing other over overwhelming parameters pcps pigeonhole polynomial press prime principle probabilistic probabilistically probabilities probability problem problems proceedings proof proofs prop prove proving prud prxd prxs qcqc quantum query random randomized randomness references reflexivity relation requires restriction results rewriting rubinfeld russell same samorodnitsky santha sasson school schulman science sciences self series sets shor short show shpilka siam side similarly simple since size soda some sons stad standard start statement states stoc stronger structures subgroup such sudan summer supp survey symetric symmetric symmetrically system taken tester testing tests than that their then theorem theoretical theory there therefore this time tool total transactions transitivity trevisan trials trivial true tutorial twice udtwoe vadhan verification version viswanathan well wellb when where wigderson wiley will with
http://doi.acm.org/10.1145/1060590.1060592	0	Simulating Independence: New Constructions of Condensers, Ramsey Graphs, Dispersers, and Extractors	algorithm amplification appear appears applications applied approximating arxiv association assuming available banzhaf barak biased bits blum bourgain capalbo chain changing ches chor cohen coin collective combinatorica communicating communication complexity comput computer condensers condensing conductors connection consequences constant constructions correlated crypto cryptographic cryptography define degree deterministic developments digits dimension dispersers distribution distributions dodis elbaz embedded environment estimate estimates european every exist expanders explicit exposure extended extracting extraction extractors factors fields finite fixing flat flipping flips focs frankl friedman from functions gabizon gafa general generating generators geometric goldreich graphs hardware hastad have hoory http ieee impagliazzo impossibility improved independent intersection kamp katz keys least less letin linial lncs loss lossless manuscript markov math mcinnes minima more mossel neumann note number numbers obtaining oliveira optimal otherwise othesis over pages personal phenomenon pinkas preliminary prime private probabilistic problem proc proceedings product products pseudorandom publication pudl pudlak quasi ramsey random randomness reasoning recent references reingold repeated report resilient riemann robust ronens rosenman rudich same samplable santha sasson schemes science secure seed seeds semi sequences series sets shaltiel shma since slightly smolensky source sources spencer state stoc strong submitted subset such sums syst systems technical techniques that then theorems theoretical these three time trevisan tromer true umans unbalanced unbiased universality unpublished used using vadhan values variable variables various vazirani version voting weak weakly weizmann where wigderson wilson wisodm with workshop zuckerman
http://doi.acm.org/10.1145/1060590.1060696	79	From a Static Impossibility to an Adaptive Lower Bound: The Complexity of Early Deciding Set Agreement	adaptive afek agreement algorithm algorithms allow assure asynchronous asynchrony atomic attiya borowsky bost byzantine cedures cess charron chaudhuri choices column complexity computability computation computing consensus consistency cost dels detector distributed dolev early fault faults faulty fischer free gafni generalized harder herlihy immediate information interactive journal jsbaum july june kaufmann keidar knowledge letters lived long lower lynch memory merritt message more morgan news ological ology ossibility ossible ound ounds pages passing paterson preliminary press principles problems proceedings processing proving public references reischuk resilient result round saks schip shared shavit sigact simulation snapshot snapshots stopping strong structure stupp symposium synchronous synchrony systems technical than theorem theory there tight time tolerant totally touitou tutorial tuttle uniform unifying version wait when with zaharoglou
http://doi.acm.org/10.1145/1060590.1060678	66	Locally Decodable Codes with 2 Queries and Polynomial Identity Testing for Depth 3 Circuits	aamir able adam additions agrawal akademie akavia alexander algebraic algebras algorithm algorithms amir amit amos another applications approach approximate approximation aravind arbitrary argument arithmetic babai barrier baur beaver beimel believe benny berechnungskomplexitat berlin better between bilinear biswas bound bounded bounds breaking bshouty cambridge case categorial center characteristic chari checking chen chinese choffrut chor circuit circuits codes coding combinatorica come communication commutative complete complexity comptuation comput computation computational computations computer computing conclusions conference construction correcting correctors currently daniel decodable decoding depth derandomization derandomizing derivatives deshpande determinant determinants deterministic dima direct discrete donald easy edinburgh editors efficiency efficient element elementarsymmetrischen error even exact exponential eyal fast feigenbaum field fields find finding finite first focs formulae formulas fortnow found francois functions fundamentals funktionen gates gemmell general generators giving goldreich goldwasser grigoriev hardcore have heidelberg heights hiding highly howard however identities identity ieee impagliazzo improve information instances interesting international interpolation interpolationskoefizienten inversion iordanis irrational ishai isolation issac jacob jaikumar jain jean jerrum joan jonathan journal kabanets karloff karpinski katz kavitha kayal kenji kerenidis ketan klivans known kushilevitz lance larger laszlo ldcs learning lecture lengauer leonard leonid lett letters levin lewin line linear lipton list local locally lokam long look lovasz lower luca made madhu manindra marc marek mario mark martin matching matchings math mathematical mathematics matrix maybe means methods michael ming minimal models monotone muli mulmuley multi multilinear multioracle multiplication multiplications multivariate nader natural neera nisan nitin noam noisy notes number numbers numer obata oded oneway only open optimal over page pages panka parallel partial particular pavel perfect permanent peter polylogarithmic polynomial polynomials prasoon predicate predicates preliminary press previously primality primes private probabilistic problem problems procedures proceedings process processing product proved proving pseudorandom pudlak quantum quasipolynomial queries query question radhakrishnan rahul random randomization randomness rank raymond razborov recently reducibility reducing references related relation relations remaindering replace report research resilient restricted result results retrieval richard rings rohatgi ronald ronitt rubinfeld russell safra salil satyanarayana saxena schulman schwartz science seattle self semi serivatives sets shafi shamir should shpilka siam simple singer size snir society solvable some somenath sparse spielman springer srinivasan stacs standing step still stoc straight strassen sudan super suresh systems szegedy task technical techniques testing tests that theorem theoretic theoretical theory think thomas thus tight time tiwari tompa towards trevisan umesh unified unifying unique univ using vadhan valentine vazirani verification verlag version very view vijay volker volume walter washington watson were whether which wigderson with withapplications wolf workshop yang york yorktown yuval zero zhong zippel
http://doi.acm.org/10.1145/1060590.1060616	18	Approximation Algorithms for Network Design with Metric Costs	akad algorithm algorithmica algorithms amsterdam approx approximability approximate approximating approximation augmentation berlin bertsimas between biconnectivity boston budapest certain combinatorial combinatorica communication comp computing connected connectivity constrained constraints covers critical design designing discrete dual euclid exercises factor finding focs forest frederickson general generalized geometric goemans goldberg graphs guillotine hamming hard hardness highly hochbaum holland ieee improved jain journal june khuller kiad kortsarz krauthgamer lecture linear lncs mathematical mathematics meets methods miai mihail minimum mitchell monma munson network networks node north notes nutov operations optimization parsimonious plotkin polygonal polynomial preliminary primal problem problems proc programming property publishing pulleyblank raghavachari references related relationship relaxations research salesman scheme shallcross shmoys siam simple spanning springer steiner stoc stoer subdivisions subgraphs survivability survivable symposium tardos technique theor time traveling trevisan uniform vazirani verlag version vertex weight when williamson with
http://doi.acm.org/10.1145/1060590.1060629	29	Bounded-depth Circuits: Separating Wires from Gates	addition algebra almeida also always apparent applicable applying approximation associative automata barrington bilardi buhrman cambridge cannot chandra characterization circuits classifications combinatorica communication complete completely complexity compton computed computer computing concentrators concluding connectors constant currently dagstuhl decide depth develop difficulty dolev dwork each enger erations erconcentrators example fact finite following fortune from function functions gates generalized generalizers give gives information integer interesting intl journal know known kushilevitz language languages larger least lemma letters limited linear lipton loquium lower most much need nisan numb observation olylog only ordered ound ounded ounds pages partially personal pipp praha prefix preliminary preparata press problems proc proceedings processing produce programming proof prove proving pudl ragde reduces references regular related remarks result results rien schwentick sciences scientific seem semigroups sgall show showing shown shows siam single size stacs stoc straubing such switching system technique techniques tesson than that these this threshold thus universal university using version very vollmer well while wigderson wires with world would
http://doi.acm.org/10.1145/1060590.1060628	28	Lower Bounds for k-DNF Resolution on Random 3-CNFs	added alekhnovich algorithms allan also amer annual appear appearing appending appendix approximation assume atserias automated average avner backtracking beam because been before belong between beyond binomial bonet borodin boundary bounds buresh buss calculus case chain choose chvatal cleaning clearly closure complexity computation computational computer computing conference consider contra contradicts contrary davis definition denote diction dpll during dynamic each efficiency element elements erty esteban every examples expansion exponential feige first focs formulas foundations friedgut from fundamenta generators graph hand hard have here hirsch icalp ieee impagliazzo implied implies include index information issue itsykson joshua journal karp lemma lest lower made magen many math mathematicae matter michael model must narrow never note only oppenheim order other pages pigeonhole pitassi place polynomial principle problem proc procedure procedures proceedings programming proof proofs prop properties propositional proves pseudorandom putnam random razborov reasoning references relations remove resolution restrictions results rows running russell saks sasson satisfiable science segerlind sequence sharp short siam simple since size smal small some special step steps subsets such switching symposium szemer taken taking that then theory there therefore this those thresholds time toniann toward weak what which wigderson with
http://doi.acm.org/10.1145/1060590.1060613	16	Testing Monotone High-Dimensional Distributions	aldous algorithms annealing annual approximating batu cambridge chain circuits close codes combinatorial complexity computational computations computer computing conference constant correcting dasgupta degree depth distributions duct electronic endence engineering entropy error expansion fischer fortnow foundations fourier fourth functions fundamentals furst goldreich graphs huffman identity ieee improved indep information introduction jackson kearns kumar lance learnability learning linial loqium mansour markov measure metho monotone nisan ounded pages patrick pless press probabilistic probability proc proceedings random ravi references ronitt rubinfeld sanjoy science sciences servedio simulated simulation smith sublinear symposium testing that theory towards transform tugkan under unified uniform unimo university variables vazirani warren white workshop
http://doi.acm.org/10.1145/1060590.1060623	24	Low Distortion Embeddings for Edit Distance	akademii algorithm andoni appendix approximate approximating batu binary block broder capable clustering codes communication comparison complexity computer computes computing conditions conf consider constants cormode correcting curse database deletions deza dimensional dimensionality distance distnace document doklady eared edding edit efficient efficiently english erations ergun every exchange exist faster finds focs following function glassman gupta high indyk input insertions into jayram journal kilian krauthgamer kumar kushilevitz large lemma levenshtein lower magen manasse masek matching metrics motwani moves muthukrishnan nauk nearest negative neighb nomial normed oint olyn olynomial ostrovsky ounds pages paterson physics preliminary probabilistic probability problem proc processed processing product provided rabani raskhodnikova references removing reversals rubinfeld russian sahinalp sami satisfies satisfy sciences search sequence siam soda soviet spaces sssr stoc string sublinear such sufficiently syntactic systems that theorem there time towards translation under using version vishkin weakly wide with world yossef zweig
http://doi.acm.org/10.1145/1060590.1060621	22	Optimal Approximations of the Frequency Moments of Data Streams	abstract algorithm algorithms alon also annual appear appeared applications approach approximate approximately approximating approximation automata based bounds chakrabarti charikar chen colton combinations communication comp complexity comput computation computational computer computing conference coppersmith counting data difference discrete disjointness distance distinct distributions elements embeddings estimating estimation extended family farach feigenbaum finding focs foundations frequency frequent functions ganguly generators hash hashing hybrid icalp ieee improved independent indyk information international items jayram journal kannan khot kumar languages linear loquium lower luca manuscript massive matias model moment moments multiparty near optimal over pages preliminary proc proceedings programming pseudorandom random randomization references saks science second siam sivakumar small soda space stable statistics stoc strauss stream streams symposium symposum szegedy tabulation technique techniques theor theory thorup trevisan universal unpublished using version viswanathan wise with workshop yossef zhang
http://doi.acm.org/10.1145/1060590.1060676	65	Balanced Metric Labeling	algorithm algorithmic algorithms alon annual applications approximate approximating approximation arbitrary archer bartal bisection bound calinescu chekuri chuzhoy class classification computer computing conquer constant dependent designing deviations discrete divide earthmover even expander extension factor fakcharoenphol fast feige fields flow flows formulation foundations graph gupta hardness harrelson ieee improved janson journal karloff khanna kleinberg krauthgamer labeling large leighton linear markov method metric metrics minimum multicommodity naor pairwise partitioning partly polylogarithmic probabilistic problem problems proc programming rabani random references relationships rora schieber science siam spaces sparsest spencer spreading structures sums symposium talwar tardos their theorems theory tight tree variables vazirani wiley with york zosin
http://doi.acm.org/10.1145/1060590.1060701	83	Tensor Decomposition and Approximation Schemes for Constraint Satisfaction Problems	according advances algorithms alon already always applications approximation approximations arora arxiv assume attention below between bisection brief carlo case clustering combinatorica computer condition confine connection consisting contains contradiction converse core defined degree degrees dense density edges example fact fast fernandez final finding focs freeman frieze from functions general goldreich goldwasser graph graphs gromov groups hard have high homogenous hyperbolic ieee induced indyk instances into introduction itself kannan karger karpinski kenyon large learning lemma lipschitz london macias math mathematics matrices mcsherry median metric mettu monte most next notion number numerical online otherwise partition partitioning plaxton polynomial problem problems proc proof property prove quick rabani random randomized rank references regularity rest sampling scheme schemes sciences segovia semmes show siam similarly simple since sneath soda sokal some spaces spectral stoc structures subgraph subgraphs sublinear subraph subsets suppose system taxonomy testing that their theorem there this thus time total true type using vega vempala version vertices weighted will with
http://doi.acm.org/10.1145/1060590.1060631	30	Simple PCPs with Poly-log Rate and Query Complexity	abstract algebraic algorithms almost alon alto amortized annual applications approximating approximation arguments arithmetic arora babai barak barrier basic bellare biased bits black british california cambridge canada canetti characterization characterizations checkable checking chicago cliques codes coding colloquium columbia combinatorial combinatorics comp complexity computational computationally computations computing correcting dallas degree diego dinur discrete eccc ective edition efficient electronic epsilon error ersp extended eyond feige fields finite fischer focs fortnow foundations free friedl goldreich goldwasser guruswami halevi hardness harsha hatsagi holographic html http ieee inapproximability index interactive introduction journal july june karloff kilian kindler knowledge least length levin lewin lidl linear linnik locally louis louisiana lovasz lund methodology methods micali missouri montr more motwani nearly nevada niederreiter nisan nonapproximability nondeterministic note nullstellensatz olylogarithmic olynomials onential optimal oracle oregon orleans pages palo pcps polishchuk poly polynomially portland preliminary press prime probabilistic probabilistically probability problems proc proceedings program progression proof proofs protocols prover proximity query random randomness rate references reingold reports results revised revisited robust rubinfeld russell safra samorodnitsky sample samplers sampling sasson sbornik science sets shen short shorter siam simple simulation size small some sound spielman stad stoc sudan symp symposium systems szegedy tech testable testers testing tests texas their theorem theory thesis tight time towards trevisan trier university vadhan vancouver vegas verification version victoria wigderson with zero
http://doi.acm.org/10.1145/1060590.1060595	3	On Uniform Amplification of Hardness in NP	algorithms alternating amplification amplify applications average bogdanov boneh case chor circuits codes colloquium combinatorica complexity computational computer computing conference congress core correcting david decodable decoding derandomization distribution distributions donnell door electronic encodable error ersonal etter foundations functions generate generators goldreich hard hardness healy ieee impagliazzo information instances international journal learning lemma levin linear lipton list luby mathematicians monotone mossel nisan noise nondeterminism onential picking problems proceedings pseudorandom pseudorandomness random randomness reductions references science sciences sensitivity somewhat spielman structure structures sudan survey symposium system tech than theory time transactions trap trevisan under uniform uniformly universal unless using vadhan view viola ways weak wigderson within without wost
http://doi.acm.org/10.1145/1060590.1060609	13	Beyond NP: The Work and Legacy of Larry Stockmeyer	aaronson acceptance acknowledgments acta advances against ajtai alamitos algebraic algorithm algorithms allowed almost along also alternating alternation american among annals appear applied approach approaches approximate approximating approximation arora arthur asked automata away babai baker ballantine bellare between beyond bill billion bits bler blue board books boolean boppana borel boston bound bounded bounds britt brute bshouty captures chandra chapter characterization checkable checkers checking chervonenkis circuit circuits classes cleve cliques closed coin coins collapse collapses combinatorial come comments committee company compendium complementation complete completeness complexity complexityzoo computation computational computations compute computer computers computing conclusion conference connections consequences consider continue cook corrected cosmological counterpart counting cynthia december deciding decision depth deterministic developed difficult dimension discussed distribution does drafts dwork earlier editor editors elementary english entries entrusting enumeration eppstein equivalence equivalent essentially even event ever every exact exactly except exponential expressions exptime extend fact fagin february feige finite first force forced formulae formulas fortnow foundations fraenkel freeman from functions furst games garey gasarch gavald generalized generation generations giants gill giving goldreich goldwasser graph greenwich group grow guide guided half handbook hard hardness hartmanis have having hidden hierarchies hierarchy history hold holds holland horizon html http ieee immerman implicants important improved independent independently industrial informatica information informatsii instead institute interaction interactive intractability january jerrum johnson journal june just kadin kannan karloff karp klivans knowledge kozen language languages large larry last learning least lecture leeuwen legacy letters levels levin light like limitations lipton logic looking looks loquium lost lower lund machines march massachusetts mathematical mathematics matrix measured melkebeek merlin method methods meyer micali miller minimization minimum model models monadic moran more most motwani much must nanda nature negative news nisan nondeterministic nonisomorhism nonuniform north notes nothing november number october optimal oracle oracles order others pages papadimitriou papers parallelism parity pcps perebor perebornye peredachi perfect permanent person petrank player plenum pohl polynomial possibly power powerful press private probabilistic probabilistically probabilities probability problem problems problemy procedures proceedings processing program proof proofs properties protocol provably prove proven proving pseudorandomness pspace pspacecomplete public pure puzzles qbfs quantified queries question rackoff raghunathan rahul random randomized randomness recognizable recursive reducibility references regular relationship relativizations relativized reliability requires requiring research result retrospective robson russell russian ruzzo safra same sampling santhanam savitch saxe schaefer science sciences search second sends separating september sets shaltiel shamir short shortest show showed shows siam sigact since sinclair sipser size small society solovay some space specific spectra springer squaring stad started state stearns still stoc stockmeyer strictly string stronger structures subexponential successor sudan sufficient summer sundaram survey switching symmetric symposium system systems szegedy szelepcs tamon tape tarjan task technology than thank thanks that thatcher their theorem theoretic theoretical theorists theory thesis they this time toda tools trading trakhtenbrot transactions translation true turing umans under uniform universal universe university unless used using valiant validity vapnik vazirani verification verifier verifiers versus vigoda volume watanabe weak what when where which while wide wigderson will wins with witnesses word work would wrathall years yesha yield york zachos zadachi zero zppnp
http://doi.acm.org/10.1145/1060590.1060673	62	Euclidean distortion and the Sparsest Cut	achlioptas acta algorithm algorithmic algorithms almost amer anal analysis angew annual appear appendix application applications approximate approximating approximation approximations arbitrary arora asymptotic aumann average barbara bartal berlin between binary bodies bound bourgain brinkman calculation chains charikar chawla choosing chosen coins combin combinatorica comput computational computer computing conclude cone conference conn convex database decompositions definition descent diameter diamond dimension dimensional discrete distance distortion easy efficient electronic embeddability embedding embeddings enflo euclidean european every expander expansion extensions fakcharoenphol figiel finite first flow flows foundations friendly from funct geom geometric geometry graduate graph graphs gromov gupta have haven hazan heinonen hilbert homeomorphisms hyperbolic ieee implies implying impossibility improved inequality into israel issue ject jections johnson kale khot krauthgamer kumar lecture lectures lemma lindenstrauss linear linial lipschitz london lower manuscript mappings markov math mathematics matouek measured mendel method metric metrics milman misc modern naor negative nonexistence normed note notes observable pages partitionings peres pisier planar pods point preprint preserving probabilistic probability proceedings proof proofs properties prove providence quasisymmetric quotients rabani rabinovich racke random reduction references reine relaxations remarks returning saks same sampling santa scales schechtman schramm science sections sheffield siam sinclair sivakumar small smooth snowflakes society some space spaces sparsest special spherical springer structures subset subsets such suppose symposium syposium system talwar texts that then theorem theory tight time tree type uniform uniformly universitext upper vancouver vazirani verlag vishnoi volume which with yields york
http://doi.acm.org/10.1145/1060590.1060659	51	Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement	aaronson abstract academy aharonov alamitos algorithms also although alto ambainis american amount amplification amsterdam analysis anisotropic annual apart approximate approximation arbitrarily assisted association asymptotic available babai bacon bangalore bell bennett bernstein bipartite bits bohm brassard brendel buhrman california cambridge capacities capacity capture channel characterization characterize chau childs chuang circuit circuits classical cleve coin common communication comp complete completely complexity compub comput computation computer computers computing conference connection considered correlations cost criterion cross cryptography defant density description diamond diego discrete disjointness distances distribution distributive dual editor einstein elementary eleventh emerge english entanglement equality erator erators erop essence etter evolving extended fact factorization february fifth fingerprinting first floret focs formal foundations fourier fourth from function further furthermore gates general genesis gisin goemans graduate hall hamiltonian hamiltonians harrow haselgrove have heisenb hence holds holland http ideals ieee improve improved india individual inequalities inequality information inner interactions interactive interest international interpretation intuitive ising izvestiya jayram journal july june kerenidis kitaev klauck kremer kushilevitz land large last lecture lester lett letters leung logarithms long lower machinery makes many march math mathematical mathematics mayers measurement measures mechanical minimum mixed more most much nayak needed newman nielsen nisan nonlocality nontrivial norm norms north notes november numb octob onential open operator original orov other ounds over ower page pages palo papers paradox parallelization photons phys physics podolsky polynomial predicates prentice preprint preskill press prime private problem problems proceedings processing product proof providence public publishing quant quantum query questions random randomized razb reality references regions related remark replaced resp result results room rosen round rudolph russian salzman sampling schulman science sciences search second security seem senechal separability separation septemb seventh shen shma shor siam signal simon simple simulating simulation small smolin society some spatial states still stoc studies study substituting such symmetric symposium systems tapp tensor than that their them theory there they thirtieth thirty this tight time tittel toner tossing trace transformation translated translation twenty unconditional understanding unitary university useful using vazirani verstraete vidal violation volume vyalyi watrous werner what while wigderson williamson with wolf would york yossef zbinden
http://doi.acm.org/10.1145/1060590.1060657	50	Towards Asymptotic Optimality in Probabilistic Packet Marking	acad acknowledgments adapting adler advanced advances algebraic algorithm algorithms also amer american amherst anderson anonymous answering approach approximate assurance athens attack august authenticated author bandt burch case check cheswick claim close cmax coates combination combinatorial combinatorics communications complete comput computational computer computing concerning conf conference congestion congruent convex convexity corresp crystallographic danzer dean debrunner decoding dedicata demoding demonstrate denial depicted determinant determining deterministic difficult discrete discussions disp dispersed distributed doeppner done dong each eaking editors effectiveness efficiency efficient eginning eing eople ersed estimation euclidean exists fact fast faster figure finally first following follows formed fractal franklin from fruitful gelbrich geom geometry goodrich greece grunbaum have helly hence hesse hirata identify ieee inequality infocom information inproceedings instead integer interesting june karlin kindly klee klein koyfman lack large least legal lemma like linear linhares lisa lovasz marking massachusetts math mathematical matouek matrices matrix mention must need network ngai nonexistence norm november numb observed oint olynomial omitted onding optimization ossible other owers packet packets pages park part paths perrig plane practical price probabilistic problem proc procedure proceedings programming programs proof proofs protocol providence pure quantity queries received recent reed references related relatives report reptile reptiles required requires research router sales sample savage scale schemes second security self semidefinite service serving sets shapiro shields sigcomm similar simple simplexes simplices since sirvent snover societal society solution song source space springer stamping strictly string stubblefield submitted such sufficiently support symp symposium system technical thank that their then theorem theory there things third this thommes thus tiling tilings towsley traceback tracing tradeoffs triangles under university used usenix using vandermonde vectors veerman very volume waiveris wang well wetherall where while will william williams with workshop would york zwick
http://doi.acm.org/10.1145/1060590.1060603	9	On Lattices, Learning with Errors, Random Linear Codes, and Cryptography	academic accepted advanced advances aharonov ajtai alekhnovich algorithm algorithms almost annual applications approximation author available average barbara based berlin between bits blum boston braunschweig case codes complexity comput computational computer computing connection conp constructions course covering crypto cryptographic cryptology cryptosystem daniele discrete dwork ebeling eccctr edition electronic engineering equivalence factor feige focs foundations friedr from functions furst gaussian generating goldwasser hard hash hirzebruch http ieee improved instances international intersect journal kalai kearns kluwer kumar lattice lattices learning lecture lectures length lipton loquium massachusetts mathematics measures micciancio model more nerurkar noise notes page pages parity partially perfect perspective polynomial primitives problem problems proc public publication publishers query radius reductions references regev relations reports representing revised santa science series shortest siam sieve sivakumar sohn springer statistical stoc symp technical theory tolerant ucsd users vector vieweg volume wasserman with worst
http://doi.acm.org/10.1145/1060590.1060668	58	Covert Two-Party Computation	about above accommodated according active actual additive advances advantage advddh adversarial adversary advprf after against aggarwal algorithms alice allows also alternatively annual appear appendix applications applied applies applying approach assigns assume assumption attacks auctions backes based because bellare between bits black boldyreva books both bounds bout brickell cachin call calls candidate canetti cannot case channel chaum choice chooser chooses chose chosen circuit clearly coin collects columns combinatorial combine commerce commitment communicate completeness components computation compute computer computes computing conference consider construct construction correct corresponding covert covertly covertyao create crypto cryptographic cryptography cryptology damgard data decisional dedic define denote describe described description design developed diffie disclose discrete distinguish distinguisher distributed distribution divides does down drawing draws dwork each effect efficient either electronic element elements else enables encryption ensures ensuring eurocrypt even every exactly exception exchange exchanged execution exists expressed expressing fact fair families family fault fiat figure final finally finds first flip following follows formally fortieth foundations from function functionality functions galil game garbled garbles garbling gate gates generate generates generator given giving goldreich goldwasser graaf gradual greater group guarantee haber halevi hash hastad have hellman here hiding higher hopper html http hybrid identical identically identifier ieee impagliazzo implicitly implies imply independent indistinguishable information input inputs integer integers interactive international into invoked itkis journal kalai know known knows langford large last layer learn learning learns least leaving lemma length less levin likewise lman lower lowing luby magic make manuscript mapping masked mechanism mental mentioned message messages methodology micali mishra model modification modifications modulo most multi multiplications multiplicative must naor negligible nineteenth nothing notice oblivious observer obtain oracle order other otherwise output outputs over owner pages pair pairwise palacio paradigm parties party passed perform permutation philby picks pinkas play plays point polynomial power predict predicted predicting prediction present preserved preserving prfadvantage prime primes primitives privacy probabilistic probability problem proceedings produced program programs proof protocol protocols provably pseudorandom pseudorandomness public raising random randomized ranked realize realizes recovers references reignold rejected release relies repeatedly represented requires result resulting reveal revisited reyzin role round rounds running russell sampling scheme science secret secrets secure securely security send sender sending sends sent sequence sets setup shamir shorthand shown siam significant simple simulated simulator since single soda specified starting starts states steganography step stockmeyer straightforward string strings subgroup such sumner suppose symposium table tables taken takes taking tape term than that them then theorem theoretic theory there these they thirtieth this three thus time tolerant transfer transfers transformed trickling triple twoparty ucsd uniform uniformly uniformot uninstantiable unique unpublished until upper used uses using value values vcot verifiable view well when where which while whose wibi wigderson will wire wires with workshop would wout write yung
http://doi.acm.org/10.1145/1060590.1060622	23	Coresets in Dynamic Geometric Data Streams	adaptive algorithms alon american ancestors annual appear appendix applications approximating approximation asymmetric athos automata available bagchi base bell better bounds callaghan chan changes charikar chaudhary chekuri chen chernoff clearly clustering colloquium colton common communication complete complexity comput computation computational computer computing confined connection constructions continuous core coresets cormode count counting data database denote deterministic diameter dimacs dimensional dimensions discrete distance distinct distributions dynamic each elements embeddings eppstein expressions facility farach faster feder feigenbaum fernandez finding fixed flajolet focs following foundations frahling frequency frequent frequently from gabow garofalakis generalizations geometric geometry goldreich goldwasser goodrich guha gunguly hershberger high histograms hoeffding http icalp ieee improved incremental independence independent indyk informatics information international interval inverse invited isaac items jayram journal kannan kenyon kumar kushal languages latin learning limited linking location martin matching mathematics matias maximum mazumdar means median medians metric meyerson mining mishra models moments motwani moving multidimensional muthu muthukrishnan nearest networks online optimization over pages panigrahy peled personal pods point prim principles probabilistic problems proc proceedings processing programming proof property proximity radial random randomization randomized range rastogi references report retrieval rozenbaum rutgers sadjad sampling scheme schmidt science sciences shortest siam siegel sigmod since sivakumar sketch sliding smaller socg soda sohler some space spanning spatial srinivasan stanford stoc stream streaming streams structures summaries summarizing suri symposium syst system systems szegedy talk technical techniques testing their then theoretical theory thesis toth tree trevisan university update value variables variant vega weighted which window windows wise with workshop yale yaleu yossef zhang zhou
http://doi.acm.org/10.1145/1060590.1060686	71	The Complexity of Agreement	adopting agreement appropriate aumann complexity computer currently diffidence discussion ective else ersp framework from have here interesting intuitively know leads lower mathematical mathematically more nothing observation obvious once original osition ound problems prop protocols publish quantitative questions quite raised recall references results rich science shown since some studied that theorem theoretical this though tight trivial with
http://doi.acm.org/10.1145/1060590.1060641	38	The Round Complexity of Two-Party Random Selection	academic against alon applying arguments assumptions base based blum boppana both brics cachin challenge choices choosing claim claims coalitions coin collective cols compcom complete complexity computation computing conclude constant crep crypto cryptology damgard defining definition density design ding discrete does done efficient election elements endent equals erfect exchange exists fast fault feige fewer flipping focs full function functions games general generate goldreich goldwasser grow grows harnik harvard hashing have height help hierarchy holds honest ieee immune implies indep information interactive intuitively jagopalan katz keep knowledge languages lautemann leader lemma lindell linear linial lncs lower marcil math memory micali more must naor narayanan noncryptographic nothing numb oblivious olynomial only optimal ostrovsky ound ounded ounds parallel party perfect press proc proof proto protocols prove random randomness reason receiver references remains resilience robust root rosen round rounds russell sahai saks sanghvi secrets secure selection sets shaltiel siam simple simplify size sized sizes spring springer statistical stoc storage study subset such systems taking telephone than that their then theorem there these thesis this through thus together tolerant tossing tower transfer tree turn undergraduate university useful using vadhan validity vazirani venkatesan verifier when where wigderson with yield york yung zero zuckerman
http://doi.acm.org/10.1145/1060590.1060617	19	On Non-uniform Multicommodity Buy-at-Bulk Network Design	algorithm algorithms annual approximating approximation arbitrary architectures bartal bulk chekuri cheryian computer computing constant cost design designing deterministic discrete distance edge etter factor fakcharoenphol foundations guha gupta ieee incrementally installation integrality ipco khanna kumar lelism lncs metric metrics meyerson multicommodity munagala naor network networks online ound pages paral plotkin problem problems proceedings ravi references rent roughgarden salman science sharing siam simple simpler single sink subramanian symposium talwar theory tight tree
http://doi.acm.org/10.1145/1060590.1060601	8	Market Equilibrium via the Excess Demand Function	actually again aggregation alan alenex algorithm algorithms allen analysis applications applied approach approaches approx approximating approximation argument arrow article assumptions auction available ball barnett based basil blackwell block briefly cambridge case center certain chen circumscrib claimed class codenotti colell column comp complexity computation computed computing concave conclude conclusions constraint containing converging convex cornet correctness criteria current daspremont debreu decemb defining demand deng description devanur different distance does dual dynamic easily econometrica economic economical economics economies economy editor editors efficient eisenb ekonomika elements ellipsoid equilbrium equilibria equilibrium equipped erimental ernetica ernetika erplane etitive euclidean exchange existence extend fact finding fisher focs follows foundations from full functions gabszewicz garg general goods green gross hahn handb harvard holland homothetic hurwicz icalp initial input inscrib instead international intriligator jain journal kehoe kirman lead lemma lemmas leontief lies line linear mahdian main management market markets matekon matematicheskie mathematical mathematics mccune method methods metody microeconomic mitjuschin model models monotonicity negishi nenakov newman news normal normality north note ofdemand olynomial once optimum oracle ossible ound oxford papadimitriou parameter pemmara planning polterovich polynomial press price prices primak primal problem proc proceedings production program pure quasi raman references remarks result results returns review revisions running russian samuelson satisfies scale sciences section seller separable separating sequence sigact similar size sketched soda solution solutions solve solving some stability stoc study substitutability substitutes survey systems takes techniques that then theorem theory there this time under uniqueness university unwin using utilities utility varadara vazirani version very violated walras weak where which whinston with
http://doi.acm.org/10.1145/1060590.1060684	70	An O (log n log log n) Space Algorithm for Undirected st-Connectivity	aleliunas algorithm algorithms applications approximate architectures armoni awerbuch backtracking basic biconnectivity chandra chen chin chong cole colloquium communications comp complexities complexity computation computational computer computers computing conference connected connectivity crew depth deterministic discrete eccc efficient electronic erew erin etween exact fast finding first forest forests foundations gazit generators graph halp hirschb http ieee international johnson journal karger karp koucky lewis linear lipton list maze metaxas minimum nisan nondeterministic onents optimal other ounded pages papadimitriou paral parallel parnas pettie pram problems proceedings processing psuedorandom rackoff ramachandran random randomized references reingold relationships sarwate savage savitch scheduling science sciences search sequences shiloach shma siam some space spanning symmetric symposium system szemeredi tarjan technical theoretical theory these time traversal tree trees trier trifonov ultracomputer undirected universal vishkin walks wigderson with work zhou zwick
http://doi.acm.org/10.1145/1060590.1060606	11	On Dynamic Range Reporting in One Dimension	acknowledgement algorithms also alstrup applications arithmetic array aspects asymmetric authors automata beame bloom bloomier boas brodal case chazelle chernoff class classes communication complexity computer computing constant could counting data design dietzfelbinger dimension discrete discussions dynamic early efficient emde endence endent extended extremely fich filter focs fredman functions fusion gerth hagerup hash hashing heide hoeffding icalp implementation indep information integer international journal kaas kilian languages letters like limited logarithmic lookup loquium maintaining mathematical mathematics miltersen nisan optimal orting ossible ound ounds pages pagh partial particular predecessor primes priority problem problems proc processing programming queries queue random range rauhe real references related replacement results rubinfeld safra schmidt science sciences searching siam siegel soda sorting space srinivasan stacs stages static stoc structure structures sums supp surpassing symposium system systems tables thank theoretic theoretical theory this time trees universal variables wigderson willard wise with without word work worst would zijlstra
http://doi.acm.org/10.1145/1060590.1060637	35	Polynomial Time Algorithm for Computing the Top Betti Numbers of Semi-algebraic Sets Defined by Quadratic Inequalities	advanced agrachev akad algebra algebraic algorithm algorithms automata barvinok basic basu berlin betti bochnak bounding bounds bredon brique briques burgisser cambridge case characteristics classes closed collins combinatorial complexity computational computations compute computer computing conference consequence consists copies copy coste counting cucker cylindric decomposition defined denoting different differential discrete disjoint does each ectral edition elimination equations equator estimates euler every family feasibility fields first formal from general geometry grigor groups guide have hemispheres hessians homeomorphic homogenization homologie homology hypersurfaces inform input inst intersect isomorphic itogi jection languages lecture lower maps mathematics mccleary milnor moreover moscow nauchn nauk nauki notes numbers numeric observe olenik ology onto origin osition ounded output over part pasechnik petrovski pollack polynomial polynomials position preprint press princeton proc procedure proof prop proposition prove quadratic quantifier real references replace russian sampling science second semi sequences sets sheaf since smooth soviet sphere springer sssr step studies surfaces systems tekhn tekhniki testing that theory thom time topology translated trie unit university user using vari varieties verlag vsesoyuz where with
http://doi.acm.org/10.1145/1060590.1060666	57	Edge Partition of Planar Graphs into Two Outerplanar Graphs	alexandr alves amer analiz baton boca bruce brunet caterpillar chartrand chromatic chung class clique colb coloring combin combinatorial combinatorics computing conference congr connected daniel decomp ding discrete diskret douglas edges estimate every finite forbidden forests geller graph graphs gutin hamiltonicity hedetniemi induced international interscience interval into jensen john kedlaya kostochka london mallah math mathematics minors mutzel nash nineteenth numb numer ochem odenthal optimization oricities oricity orowski osition ourn outerplanar pages partial partitioning partitions pascal planar problems proceedings publication raton references richard richter rouge sanders scharbrodt selected series some sons southeastern subgraphs submitted surfaces survey theorem theory thickness thirtieth toft topics toroidal trans tree trees triangulations tutte union universal vertigan vizing volume warsaw west whitney width wiley williams with york
http://doi.acm.org/10.1145/1060590.1060599	6	The Price of Routing Unsplittable Flow	academic academy algorithms allocation anarchy annual architectures aspects atomic automata awerbuch azar balancing beckmann case christodoulou christos civil cking class cole commerce comp complexity computer computing conference congestion convex cost czuma designing discrete dodis economics ects edges edition electronic endent engineers equilibria equilibrium erson fabrikant farms finite flows focs fotakis found foundations functions gairing game games grove hard help heterogeneous icalp ieee indep inefficiency institute international internet journal kontogiannis koutsoupias krishnan krysta kunal languages latency lelism load loquium lucking mathematical mathematics mavronicolas mcguire mfcs model monien much nash national network networks norm oints ology olynomial operations ossesing ounds owen pages papadimitriou paral players press price pricing proc proceedings programming pure references research richter road rode rosenthal roughgarden routing science sciences selfish server siam social soda some spaa spirakis stacs strategy studies suri symp symposium talwar tardos taxes theoretical theory third tight toth tradeoffs traffic transportation tsur university unsplittable users vitter volume waoa wardrop winsten with worst yale zhou
http://doi.acm.org/10.1145/1060590.1060691	75	A New Strategy for Querying Priced Information	achieves affects algorithm algorithms analysis approximation books boolean both business callaghan canada candidates carmo case charikar cheap check comp comparison complexity computer computing conjunctive cost costs databases decision definition directed easy edge edges email ends etitive etitiveness etween evaluates evaluating exchanges executes fact fagin feder final find finding first focs follows forthcoming from functions game given guaranteed gupta guruswami hartline have hence hong ieee impact incurred inequality information instance internet jcss journal july kannan khanna kleinb kohayakawa kumar last lemma markets minimum mohr monotone most motwani namely next ontario optimal optimization order ordering orted othesis overall pages panigrahy parekh pods policy priced pricing probabilistic problems proc procedure processors proof public query querying quorum raghavan randomized ratio ravi references remaining research rocke runs sahai saks same sciences search second selection services siam soda some sorting stacs stahl strategies structured subcase submitted system tarsi that thomas thus toronto towards trees uncertainty where which whinston wigderson with yasuhara
http://doi.acm.org/10.1145/1060590.1060661	53	Polynomial Time Quantum Algorithm for the Computation of the Unit Group of a Number Field	abelian abstract advances alamitos alexei algebraic algebraischer algorithm algorithmic algorithms annalen annual artur banaszczyk based berechnung birkhauser bodo boneh bounds buchmann catherine christoph class colloquium complexity computation computational computer computing coppersmith cryptanalysis crypto cryptography cryptology darmstadt david determination discrete eccc editor eigenvalue einheiten ekert electrical electronic engineers equation estimation extended fachbereich factorization fields foundations fourier fourth functions generalization generalized geometry germany goldstein groups habilitationsschrift hallgren hidden http ideal informatik institute johannes journal jozsa juntgen kitaev klassenzahlen komplexitat lagrange large lecture length linear lipton logarithms lond markus math mathematics mathematische maurer measurements michael michele moller mosca nombres notes number numbers pages paris pell period peter pohst polynomial power practical press prime principal problem problems proc proceedings progress quantum references regulator regulators report richard saarbrucken saarlandes science sean seminaire shor siam simon society some springer stabilizer subexponential subgroup symposium technical technische theorems theorie theory thesis thiel thiry time transference transform units universitat veroeffentlichung version volume with zahlkorper
http://doi.acm.org/10.1145/1060590.1060618	20	Multicommodity Flow, Well-linked Terminals, and Routing Problems	advances agarwal algorithm algorithmic algorithmica algorithms alon amir among andrews applications approximate approximating approximation approximations arbitrary area arora aumann berlin bidimensionality bounds cambridge capacitated chekuri chuzhoy circuits combinatorial combinatorica complexity computations computer computing congestion connecticut constant cuts decomposition deletion demaine demand densely designing diameter directed discrete disjoint dual edge efficiency embedded embeddings equivalence even excluding expander factor february feige finding fixed flow flows focs frank gaps garg general geometric geometry good graph graphs greedy greenwich grids guruswami hardness harikar harrelson have hiedelberg high hildrum icalp improved integer integral integrality interconnection itai jacm jaraman jcss jiaghayi journal june karp khanna klein kleinberg kolliopoulos kolman korte kramer krauthgamer large layout layouts leeuwen leighton linial london lynch makarychev manuscript math miller minimize minimizing minimum minor multicommodity multicut mydlarz near network networks newsletter node nothing oblivious optimal optimization packing park partitionings path paths phillips planar plenum plotkin polyhedra polynomial preliminary preparata press primal problem problems proc programming programs proofs provably proving quickly quotient rabani rabinovich raghavan randomized reducibility references related research results revisited robertson rounding routing scheideler schrijver separators series seymour shamir shepherd siam sigda soda some spaa springer srinivasan stein stoc submitted survey tardos technique thatcher their theorem theorems theory thesis thomas thompson through time timetable tree trees treewidth uncut undirected unsplittable using vazirani verlag version vertex vlsi volume weight wire with yannakakis york zhang
http://doi.acm.org/10.1145/1060590.1060664	55	Quadratic Forms on Graphs	absolutely acad algorithms almost alon amsterdam analysis another applications approximate approximated approximating approximation asymptotic banach bansal barahona basel basic berlin bipartite birkh blum bonamie bordeaux bounded bounding cannot capacity cavity center challenge charikar chowla chromatic clique clustering coefficients coloring combinatorial combinatorica combinatorics common communication complement complexity computational concepts conjecture consequences considerably constant constante constructed convex correlation cover covering difference differs ding discrete distinct domination each easy eated edge efficiently ehaviour either electronic elings elled ellipsoid ellipsoids endently erator erators ergebnisse ergraph etude etween even example explicit extending factor family field find focs folge following fonctiones form fourier frieze from function functions general geometry given glass glasses gram graph graphs grenzgebiete grothendieck guruswami gutin handb hard holland homotopy ieee ihrer implying indep inequality infinity information inst institute integral interesting intersection investigation ising issue johnson journal juhasz kannan karger kashin kneser known kostochka krivelevich krivine large larger leads lies lindenstrauss logarithm logarithms lower matching math mathematical mathematicians mathematics mathematik matrices maximization maximizing mean megretski mention method models motwani nakprasit naor nemirovski norm north note numb observed obtained ologiques open optimal optimization orie orlitsky orthonormal ound over pair paolo parameter paris particular pelczy phys picking plane plummer probability problem problems proc proceedings produits programming programs quadratic qualitative quick ramsey random randomly ratio references related relaxation remain roos schrijver semidefinite sets several seymour shannon show showing singular spaces spin springer steklov stoc studia subgraphs sudan summing surely system systems szarek talagrand tends tensoriels terlaky terms that their theory there these theta this topics transactions trique true tschel uniformly user value verlag vertex vertices where which will winkler wirth with within
http://doi.acm.org/10.1145/1060590.1060698	81	Cooperative Asynchronous Update of Shared Memory	academic access adversary afek ajtai algorithm algorithms alon analysis anderson annals applications architectures aspnes asynchronous atomic attiya buss capalb case certified chlebus collective combinatorica combining comp complexity computation computer computing condensers conductors consensus constant construction creating data definite degree delays despite deterministic deterministically discrete distributed dobrev dolev dwork editor efficient eigenvalue encer endable enger entropy etitive european executions expanders explicit extractors failures fast fault fich focs foundations free functions gafni graph graphs herlihy hurwood ieee information instances journal kanellakis kaufmann kedem kluwer kowalski lelism less loss lossless lynch machine made making malewicz martel mateo mathematics memory merritt method model morgan near numb olylogarithmic optimal optimally otzky ound overhead palem paral parallel phillips pipp podc practical practice pram principles probabilistic problem proc processor processors product ragde raghunathan ramanujan random randomized randomness rapidly reading references reif reingold resilient robust rounds rumors saks santha sarnak science sciences selecting shared shavit shma shvartsman siam sipser snapshots soda sorting spaa space spirakis spreading stoc structures subramonian symposium synthesis system tentative that theory time tolerant towards trivial umans unbalanced using vadhan waarts wait waves wigderson wiley with woll work worst write writing york zuckerman
http://doi.acm.org/10.1145/1060590.1060636	34	Computing the First Betti Number and the Connected Components of Semi-algebraic Sets	akad algebra algebraic algorithms appl automata available basu berlin betti bettifew birkhauser bochnak book borel bounding bounds brique briques burgisser canny case characteristics classes closed collins combinatorial commun compact company complexity components comput computation computational computations computer computing conference connected construction coste counting cucker cylindric decomposition description different differential discrete elementary elimination estimates euler exponential eyssette fields first formal formulae free full gabrielov galligo gatech general geometry gournay grigor hardt heintz hill homologie homology hypersurfaces journal kozen languages lecture local mappings maps math mathematics mcgraw mich milnor moore multivariate nauk notes number numbers numeric olenik olic ology order pedersen petrovski pollack preparation preprint press princeton proc progress quantifier real reals references reif renegar risler road roadmaps russian saugata science sciences second semi semialgebraic sets single singly solerno spaces spanier springer sssr subexponential surfaces symb systems szpirglas theory thom time topology trie triviality university vari varieties variety verlag vorobjov zeroes
http://doi.acm.org/10.1145/1060590.1060674	63	Improved Approximation Algorithms for Minimum-Weight Vertex Separators	alamitos algorithm algorithmic algorithmica algorithms amer annual applications applied approximate approximating approximation approximations arboretum area artificial aspects author available average balanced between bidimensionality bipartite bisection bounded bounds call cambridge canada case circle classes clique cologne combinatorial combinatorica complete complexity comput computational computer computing cone conference connections conquer constant crossing cuts decomposition densest department descent designing directed discrete distance distortion divide edge efficient eigenvalue electronic element elimination embeddability embedding embeddings euclidean exchange excluded excluding expander factor feedback fifth fill finding finite fixed flow flows foundations fourth framework frontsize genus geometric geometry good graph graphs grids grouping hall hard hardness have hilbert holt homepage hyperplane ieee improved institute intelligence into introduction isoperimetric israel issues january journal kaufmann large layout layouts lett line lipschitz local manuscript math mathematics matroids measured meshes method metric metrics minimal minimum minor minors morgan multicommodity multicuts nearest negative neighbor network networks nonplanar notes numberings obstructions optimal optimality optimization other packings partial partitioning partitionings partitions pathwidth planar prentice preserving press problem problems proceedings process ptas ptass random ratcatcher references relations relaxations report rinehart river rounding routing ruling saddle scales science sciences separator separators series sets shortest shuffle siam single sixth small soda solving some space spaces sparsest spectral sphere spreading structures subgraph symposium system technical technique their theorem theorems theoret theory thirty thiry through titled tree treewidth triangulation twente type uncertainty upper vancouver vava version vertex vlsi volume weizmann width winston with workshop york
http://doi.acm.org/10.1145/1060590.1060700	82	Every 2-CSP Allows Nontrivial Approximation	acta algorithm algorithms alizadeh alto always amortized andersson annual applications approx approximate approximating approximation arora assignment beating blum characterization charikar chromatic clique colorable coloring combinatorial company complexity computating computer computers computing conference constraint cook cover creignou csps dichotomy discrete donnell easy editors engebretsen equation equations erin extending feige foundations freeman games garey generalized goemans graphs grothendieck guruswami halp hard hast ieee improved inapproximability inequality information interior intractability involving jansen johnson journal karger khanna khot kilian kindler knowledge letters lewin linear lncs lund manuscript mathematica maxclique maximizing maximum methods mossel most motwani numb oint optimal optimization other outward over ower pages palo pcps problems procedures proceedings processing programming programs proof prover proving quadratic query random randomization record references reichman relaxations results rolim rotations round rounding samorodnitsky satisfaction satisfiability schaefer science sciences semidefinite siam solutions some stad structures sudan symposium system systems szegedy tenth theorem theory three threshold tight tool trevisan unique using variable variables verification williamson wirth with within zero zwick
http://doi.acm.org/10.1145/1060590.1060594	2	Pseudorandom Generators for Low Degree Polynomials	acta actualites addison affine algebra algorithms almost alon andreev appear appendix applebaum application applications approximate arbitrary arithmetica arxiv assume basis bias biased binary bits book bound bounds briques cafure certain check circuit circuits clementi code codes column complexity computational computed computer computing conference congruences constant constructed constructions correcting counting courbes cryan cryptography definition degree depth derandomization derandomizing deterministic dimension dimensional distance done duisent each easy edition effective efficient element entry epsilon equations error estimates eurosam every example exhibit explicit fast field fields finite first following follows forms found foundations from full gate general generator generators given goldreich group hardness hastad holds holland huang identifying identities identity ieee impagliazzo improved independent industriel integers irreducibility ishai israeli jornal journal kabanets kaltofen kalyanaraman kernel klivans kushilevitz lang large least lemma linear lower luby macwilliams manuscript matera math matrices matrix means method methode mfcs miltersen minimal minimum modulo mossel most multiplication multiplicative naor need next nisan noether north note number obtained obtaining only over pages paper parametrization parity pcps peralta polynomial polynomials positive power prime primitive probabilistic probability proceedings proof proofs properties property proposition proving pseudorandom pseudorandomness random randomness rank recall references replacing represented representing respect rolim sasson satisfies schmidt schwartz science sciences scientifiques section sets short show shpilka simple since sloane small solutions solvability space spaces sparse specific spielman standard state stepanov subspace such sudan suppose symmetric symposium system systems technical testing tests that their then theory think third this through time transformation trevisan umans used useful vadhan vari variables vector velikovi verification verify version viola weil wesley which wigderson wise with wong zippel
http://doi.acm.org/10.1145/1060590.1060647	42	STOC 2005 Best Paper	abstract adsorbing advice affine ajtai aleliunas algebraic algorithm algorithms alon alvarez annals annual applications armoni asher babai backtracking better between bipartite biregular borodin bound bounded broder cayley chain chains chicago closed collapses combinatorial combinatorica combinatorics compendium complement complementation complete completeness complexities complexity comput computation computational computer computing concentrator concentrators conference connectivity constant construction constructions cook counting decomposition degree derandomization deterministic discrete dspace dymond eccc eigenvalue eigenvalues electronic entropy every existence expander expanders explicit exploration extended factoring focs foundations fourth friedman from gabber galil generalized generators goldreich gons good graph graphs greenlaw group hierarchy hoory ieee impagliazzo inductive inequalities informacii information informatsii isoperimetric jimbo journal june kahn karchmer karp klivans kolmogorov koml koucky lange lett lewis linear lipton logarithmic logspace loquium lubotzky madras margulis markov martin maruoka mathematical mathematics maze melkebeek method methods milman mixing model morgenstern multiparty network nineteenth nisan nondeterministic nonisomorphism obtained offs pages papadimitriou peredachi peredai phillips pinsker polynomial power prime probability problem problems problemy proc proceedings process product programs proofs protocols pseudorandom pseudorandomness rackoff ramanujan randall random randomization randomness rarely rates reconfiguring recycling references regular reif reingold relationship report roichman rutgers ruzzo saks sampling sarnak savitch schemes schuster science sciences second sequences series shamir shma short siam simulation size sized smallest space span staircase states stoc strings structure structures subexponential subgraphs sudakov superconcentrators symmetric symposium syst system szegedy szemer szemeredi tanner tape technical teletraffic that their theor theoretic theory thesis time tompa trade transformations traversal trevisan trifonov twenty typically under undirected universal university unless using vadhan walks waves wigderson with wrong zhou zuckerman
http://doi.acm.org/10.1145/1060590.1060644	40	Learning with Attribute Costs	above adaptive algorithms allocation angluin approximation april babu bellare chromatic circuits coloring combining comput consequence distributed elined endency event fast filters following greedy guarantees halld hamiltonian have immediate jcss kortsarz lemma matched matchings motwani munagala nishizawa obtain ordering ound phase probabilistic probability random references resource rsson same shachnai sigmod stream succeed sums tamir that then valiant variables where widom with
http://doi.acm.org/10.1145/1060590.1060654	47	Spectral Norm of Random Matrices	academic algorithms alon analysis annals applications approximating berlin boston campinas certain chromatic comb combinatorica comput concentration distribution edge edition eigenvalues expected functional furedi graph independence informatics israel koml krivelevich latin lecture math mathematics matrices mehta neighborhood notes number optim polynomial press random references refinement roots second semicircle sinai soshnikov spectral spectrum springer symmetric techniques theoretical time wigner
http://doi.acm.org/10.1145/1060590.1060679	67	Limits to List Decoding Reed-Solomon Codes	achievable achieve albeit algebraic also amnon amsterdam andrew annual appendix approximating arithmetic available based bchq begin below berlekamp berlin best beyond binomial both bound bounded bounds cannot cecm chaoping check cheng claim code codes codewords coding coefficients combinatorial completing complexity computer conclusions confront constant constructions correcting correction correspondence curves daniele daqing david decodability decodable decoding define defined definition degree demonstrates density distance done dumer edition efficiently element elements elsevier elwyn equals equation error every exactly except expander explicit exposes extensions extractor fact field focs follows foundations fourier from future geometric goal graduate granville guruswami hardness hastad have hill holdt holland html http identical ieee ilya implies improved improving including inclusion inclusions indeed indyk information input integer interesting introduction inverse january johan johnson journal justesen kind last lemma limitations lint list lists macwilliams madhu manuscript mathematics mcgraw mean micciancio might minimum most much multiplicative neil next nonlinear north note number october offs open organics other pages papers particular permutation piotr polynomial posk possible power pretty prime primes primitive proceed proceedings proof properties prove questions quite raises range rate recovered recovering reed references regard result science series sets several shma show showing shown sible similar since size sloane solomon solution some specifically springer step subcodes subfield sudan super suppose symposium systems takes texts that them then theory therefore they third this tight time together trade transactions transform tsfasman used using values venkatesan verlag vladut wanted well when whenever where while will with work xing zink zuckerman
http://doi.acm.org/10.1145/1060590.1060598	5	Computing Correlated Equilibria in Multi-Player Games	acknowledgments adaptive algorithm algorithms analog analysis annals appl approach arises artificial asked asking aumann available barreno based behavior behaviour bimatrix blackwell bounding bring brown caching calibrated certain chaudhuri christos chun class coherent colell combinatorial commerce complexity computable compute computed computing conference congestion constraints convex correlated correlation couple course daskalakis defined definition design destroys dick dimensional dimensions discovered distributed distribution does dokl doubly dover driven dual dynamic earlier early eaves ecially econometrica economic economics ectation effect efficiently electronic elementary ellipsoid employ endent equilibria equilibrium erative erkeley examples excellent existence exploiting explore fabrikant faster feedback finally finding focs foster fotakis game games generalizes geometric given good graph graphical graphs grateful great grid grotschel group hall hart have help highly however howson http icalp ijcai implicitly indep inefficiency input insight inspiring integer interesting international internet james jectivity joint journal kakade kamalika karp kearns khachiyan khandekar kinds known kontogiannis koutsoupias kubiatowicz kunal laci lagrange lagrangian langford later leading learning leyton linear linearity literature litovskii littman local management many martha matematicheskii math mathematical mathematics mavronicolas maximum mccardle mechanisms minimax models more multiplayer multiplier myerson nash needed negative network nonatomic noncoop note novel oints olymatrix olynomial olynomially onential onentially ones open operations optimization ortiz osed ossessing ossible over pacific papadimitriou paths payoffs played player players pocedure podc polymatrix prentice previous primal problem problems proceedings programming programs proof pure quest question questions random randomized rather recall reduction reductions references regular relaxation reminding representations research results reviewers reviews rohitk rosenthal roughgarden routing rule russian sampling satish savani sbornik scheme schemes schmeidler schrijver science seem selfish several shown siam sideri similarly simple singh soda spirakis springer standard steiglitz stengel steps stoc strategies strategy strategyproof structure structured succinct such suggestions symmetry systems talwar tardos technique techniques tennenholtz terms thanks that theorem theoretic theory there thesis third this umesh utility valued variables variant vazirani vector versions vohra well what which with work works would yanovskaya
http://doi.acm.org/10.1145/1060590.1060645	41	Learning Nonsingular Phylogenies and Hidden Markov Models	acids acyclic addario algorithms almost ambainis analysis ancestral annual appl applications approximating arxiv automata available beat berry bioinformatics biol biological biology biosciences bounds build cambridge cases cavender chang chor colourations combinatorics communications comparing compatibility complexity comput computational computations computer computing conference confidence consistency constructed cowell cryan dawid desper discrete distorted distributions donnell durbin durrett duxbury eddy efficient erdos evolution evolutionary evolve examples expert farach feldman felsenstein finite focs forests foulds from full general generates goldberg golub graham hallett hard hendy hidden hopkins horn http identifiability ieee inferring international inverting isaac johns johnson journal kannan kearns krogh lagergren lauritzen leaf learnability learnable learned learning lecture lett likelihood loan logs lyngs machine mansour markov math mathematical mathematics matrix maximum methods metrics minimal misleading mitchison mixtures model models mossel nearly networks noise nonsingular notes nucleic oxford panconesi parsimony pedersen phylogenetic phylogenetics phylogenies polynomial positively preprint press probabilistic probability proceedings product proteins queries rabiner random rates realistic reasonable recognition reconstructing reconstruction recovering references rice roch rubinfeld schapire science selected sellie semple sequence series servedio siam sinauer singer sites speech spiegelhalter springer state statistical steel stoc structures study suffice syst systematic systems szekely taxonomy that theoretical theory third tight time tishby todd tolerant tree trees tutorial under university unlikelihood usage valiant variable volume wareham warmuth warnow when which will with york zoology
http://doi.acm.org/10.1145/1060590.1060689	74	Key Agreement from Weak Bit Agreement	about acknowledgments adelman agreement ahlswede algebraic also annalen author available based between biham boolean boosting bounds cachin camenisch coding comm common comp complexity conditional consequences construct contents core cover crypto cryptography cryptosystem cryptosystems csisz decoding decryption diffie digital directions discussion discussions distributions dominic dwork eccc edition elements encryption endless errors essential eurocrypt extraction feigenbaum first focs foremost formation foundation from function functions generator gesellschaftsspiele goldreich goldwasser hard hellman helpful ieee immunizing impagliazzo information interaction intrinsic isbn jacm ject john jost jurg klivans krzysztof learnability learning lemma levin like limits list lncs luby machine mathematische maurer mceliece ments method micali naor nasa national neumann nisan obtaining pages part particular permutations pietrzak problems progress propulsion provable pseudorandom public rackoff random randomness references reingold renato renner report rivest rudich schapire schemes science secrecy secret section secure servedio sets shamir sharing siam signatures somewhat sons stad stoc strength stuttgart supported swiss teubner thank theorie theory thomas trans trevisan ueli unconditionally using volume weak wegener wigderson wiley wolf would wullschleger
http://doi.acm.org/10.1145/1060590.1060649	43	Universal Approximations for TSP, Steiner Tree, and Set Cover £	achievable adaptivity aggregation algorithmic algorithms alon amortized analysis annual applications approach approximating approximation approximations arbitrary assumes awerbuch azar bartal bartholdi believe benefit benefits bertsimas best between boosted borodin bound bounded bounds brebner building bulk cambridge carter case challenging classes classic cohen combinatorial communication communications competitive completeness complexity computation computational computer computers computing concave congestion conjecture constant costs cover currently curve curves dean directions discrete distortion distributed edge edges editors efficiency eighth embeddings emory estrin euclidean even every evidence extend facility factor fakcheroenphol fiat fifth filling finally first focs forming formulation forty foundations fourteenth fourth fractals framework francisco freeman functions further garey general geometries geometry given global goel goemans graph graphs grid grigni guide gupta hard hash have here heuristic hierarchical however html http ieee immediate immorlica important include incomplete independent induced interest interesting interests intractability introduced investigating jacm jcss johnson journal kaplan karger knapsack knowledge krauthgamer least letters line list locality location logarithmic lower mathcs median merit metric metrics mettu meyerson minimizing minkoff mirrokni natural networks nodes notion number oblivious october online only open operations optimal optimization other pages paging paper paradigm parallel partitioning partitions peleg philadelphia planar plane platzman plausible plaxton points polynomial posed preliminary presented press probabilistic problem problems proceedings procrastination provided racke ravi references regard required research resolve resolving rooted routing rules salesman sampling scheme schemes science sciences second sensitive seventh shown siam simultaneous single sinha sink sixth sleator soda solving source space spacefilling spaces sparse springer state steiner stoc stochastic stretch studied study symposium systems talwar tarjan terms that theory there thesis third thirteenth thirtieth thirty this three thus tight time tour traveling travelling tree trees uncertainty under underlying undirected universal universality university update upper valiant variant version very vondrak wegman weighted where with woeginger yaniv
http://doi.acm.org/10.1145/1060590.1060634	33	Towards Strong Nonapproximability Results in the Lovasz-Schrijver Hierarchy	according actually adams adding adjacent after against alamitos algorithm algorithms also annual appendix appropriate approximating approximation arguments arora assume assumed assumption based beach biased bipartite bollob buresh canada characterization check cholesky chosen claim clearly combination computer computing conclude condition cone cones consider consists constant constraint constraints construct contains continuous convenient convex corresp cover cutting decomp define degree denote derivation derivations derive derived deriving details diego different difficult dinur discrete does each earlier ecause eddings edge edges editor eighth eing element elements elong elongs elow endent endently enheim equal equals eredges ergraph ergraphs error erty etween every exactly existence exists expander expanders expansion expression extend fact fails famous feasible feature feige fifth finally finding florida flows focs following follows form forms foundations from functions galesi games gaps generalization generates generating geometric give given goemans good graph graphs greater guruswami hall hardness have help hence hierarchy high hole hoory hull hyperedges hypergraph ieee illustrate implied imply inapproximability included indep indicates induced inductive inequalities inequality integer integrality intended interesting interpreted into involves ject joined journal june just karloff khot knowing known krauthgamer last least lemma lemmas less lies lift lifting linear magen many mapping matching mathematics matrices maximum meaning means mentioned method methods metric metrics miami minimize minus montr more moreover most multilayered ninth note noted notoriously observed obtain obtains obviously oint ointed omitted once onds onential only open operations optimal optimization opular ordered ortance ortant oses osite osition ositive other ounded ounds over ower pages partitioning paso picture pigeon pitassi planes popular press princisle probability probable problem problematic problems procedure procedures proceedings process produces program programming proof prop prove proving pseudo quadratic question random randomly rank recursive recursively reductions references regard regev regular related relaxation relaxations removing representations required research restricted result results reviewers round rounds safra salient same satisfy schrijver science second seem seems semidefinite semidefiniteness sets sherali should show shown siam side sides similar similarly simplifying since sixth size sketch slightly smal solution solutions some space sparsest stad standard step steps stoc strong subset subsets such suggested supp symposium system test texas than that their then theorem theory there these they thirty this three threshold thus tight time triangle trivial true twenty unable uniform uniformly unit used using value variables variety vazirani vectors vertex vertices very view viewed well were when where whereby which whose will williamson with without words world york zero zwick
http://doi.acm.org/10.1145/1060590.1060692	76	Aggregating Inconsistent Information: Ranking and Clustering	abstract acad acyclic advances aggregating aggregation ailon algorithm algorithmica alon among analyse annual application applications approximating approximation approximations arora arrangement artificial assignment austin bang bansal bartholdi based biased blaisdell blum borda boston burlington cambridge charikar chawla choice circuits cisions classification cluster clustering combinatorial combinatorica communication complexity computations computer computing compututing concepts condorcet conference conjectures consensus constraints correlation daedalus data deng dense diaconis diego difficult digraphs dimensional dinur directed disarray discrete dissertation draft dwork eared earman eckenmeyer efficient eighth eing election encer engineering ensembles essai even extended fagin feedback fences filkov focs footrule foundations fractionally frieze futile gionis graham graph graphs guruswami high histoire hong icde ictai ieee inapproximability inconsistent information institute integer integrating intel international ipco issue jensen journal june kannan kaplan karp kemeny kong kumar learning lections lecture ligence linear machine management mannila manuscript massachusetts master mathematical mathematics matrices maximum measure medians method methods microarray minimum mining models moire multicuts naor newman notes numb olynomial optimal optimization ordering ortance packing pages path personal plenum pluralit potts precedence press princeton probabilistic probabilit problem problems procedure proceedings programming proofs qualitative quick rank ranking reducibility references relations relationship relaxations rendues reprinted resenhas results revisited rounding royal royale sacramento safra schemes schieb science sciences scrutin search semicomplete sequencing series sets seymour siam sigmod similarity single sivakumar skiena snell social society some special stad statistical stoc strehl subgraph sudan symposium technical technology tell tenth texas theoretic theoretical theory thesis thomassen tokyo tools tournaments tovey trick tsaparas university vempala vertex voix voting wakabayashi welfare which wide wiley wirth with without world york zang
http://doi.acm.org/10.1145/1060590.1060693	77	On the Bias of Traceroute Sampling	acad academic accuracy alfonsin algorithmic algorithms american amini applications association atlas attributes automata barford bestavros biases bollob bounded byers cambridge certain chang chapter chen chung clauset cloning combinatorics communication component computing concentration conf conference connectivity critical crovella cycle degree describing diameter disc discovery discrete editors erds euro evolution exploration exponential exponents fabrikant faloutsos fixed free friedman functions generatingfunctionology given govindan grad graph graphs habib hemisphere heuristically heuristics hoeffding hung hypergeometric inequalities inferring inst integral internet intl issues jagopalan jamin journal kleinberg koutsoupias kumar lakhina lamb languages largest latapy laws lecture leguay letters london mapping marginal matching math mathematics mcdiarmid measure measurement measurements methods mihail model models molloy moore motwani multicast network networks note offs oldham optimized origin pages pansiot papadimitriou paradigm petermann phenomena phys physical plus point poisson power preece preprint press probabilistic probability proc programming properties publ raghavan ramirez random randomized real reed references regular related relationships review revisited rios routers routes saberi salamatian sampling scale scaling schulzrinne seaborn sequence series shaikh shenker siam sigcomm simulating size spanier spie springer statistical structures sums symp tangmunarunkit their theory tomkins topological topologies topology trade trees university utility variables volume wilf willinger with workshop wormald
http://doi.acm.org/10.1145/1060590.1060675	64	 O( log n) Approximation Algorithms for Min UnCut, Min	algorithm algorithms amer among annual appendix applications approximability approximate approximation approximations arora around assume babai bollob case charikar chawla cheriyan chleb claim classes closest codes combinatorics complexity comput computational computer computing condition cone consider constraint contains contribution cover cuts deletion designing directed discrete distance distances distortion each eddings edge edges efficient either electronic equal equations ercub etter euclidean every expander expansion families feasible finds flow flows forbidden foundations frankl from games garg generalized geometric given graph greater gupta hardness hart haxell hence hypergraphs improved indeed international intersections into journal karakostas karloff khanna khot klein larman lattices least leighton lemma linear loquium lowing manuscript math mathematical mathematics mathematika minimum most multi multicommodity multicuts naor neighb note notice optima optimization ordering orhood other ound ower pages papadimitriou partitioning plotkin polynomial probabilistic problem problems proceedings proof prover ratio realization references relaxations replac report rogers round satisfaction scales science sciences sets siam similar since smaller soda solution space sparsest squaredradius steiner stern stoc such sudan summand sweedyk symposium syst system systems tance tardos task than that their then theorems theory there therefore these time trans trevisan unique vazirani vectors vertex vertices williamson with within yannakakis
http://doi.acm.org/10.1145/1060590.1060681	68	Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders	aaron agent alejandro alexander algorithm algorithmic algorithms allocation allocations amir among anna annual appendix applied approximate approximately approximating approximation aranyak archer artificial auction auctions available bartal based been behavior benny bertelsen bidder bidders bidding blumrosen bound bounds budgeted bundling calculated callaghan chapter christos comb combinatorial combinatrial commerce communication compatible complexity computational computationally computing concavity conclude conference consequences consists constant counted cover coverage covering cramton dahav daniel data decreasing define defined defines demand denote derandomization determination discrete dobzinski duplicates each econometrica economic edges editors efficient either electronic ellipsoid endre equilibrium evangelos every factor feasible feige finding follows forthcoming fourth from functions games given gonen goods graph groves half hard have holzman html http huji icalp identical iiasa ilya inapproximability incentive incentives indeed industrial intel iterative jacm joseph journal kfir khot khuller kunal languages least lehmann less lett liad liadan ligence lindahl lipton location lower marginal markakis martin mathematics maximized maximum mechanism mechanisms mehta method michael minimizing mkts monderer moshe moss multi naor network ninth nisan noam number observe once only optimal optimization packing pages papadimitriou paper papers parameter partition peter plus polynomial power press prices problem proceedings process proof prove queries recalling reducing references requirements results revelation rica richard robert ronen samir sandholm schapira schrijver seffi segal sept sets shahar shoham side single sivakumar social society soda some stad steinberg steinbergcombinatorial stoc strongly structures subhash submodular substitutes such supporting symposium szlo talwar tardos tarjan tark teams tennenholtz than that theorem theory these threshold time total truth truthful tschel tuomas twenty twice unit upper uriel using utilities utility valuation valuations value vertex vertices welfare which will winner with within working yair yoav
http://doi.acm.org/10.1145/1060590.1060660	52	Fast Quantum Algorithms for Computing the Unit Group and Class Group of a Number Field	acad academic adleman algebraic algorithm algorithmic algorithms american annual ants appear applications arakelov assumption atlanta banff basis belongs boston buchmann canada class cohen complexity comput computation computational computer computing course cryptographic discrete dordrecht editors engineering equation eurocal existence factorization field first fourier fourth from generalized generating georgia germany goldwasser graduate group groups hales hallgren huang hypothesis ideal international june kluwer lattice lecture lenstra liten lncs logarithms massachusetts mathematical mathematics micciancio montreal notes number pages pell perspective pohst polynomial power prime principal problem problems proceedings proof publ publishers quadratic quantum quebec real references regulator riemann saarbrucken saarlandes sampling schmidt schoof science series shor short siam simon simplified society some springer symposium system texts theory these thesis thiel thirty time under unit universit value vectors verifying verlag vollmer volume williams
http://doi.acm.org/10.1145/1060590.1060655	48	On Random +1 Matrices: Singularity and Determinant =	above achieve acta additive akad also amer appear approach arising arith arithmetic asserts assume assumption below better bound bounded bourgain cambridge certain combin combining communication completes complicated concentration concerning consider constant covariance details determinant determinants difference dimensional distribution eigenvalue entries error estimates extra extremal finite first fixed following follows fourth from function functions furthermore future gebiete going halasz have here however hungar hungarian ideas inequality instead kahn kolmogorov koml large least lemma lemmas limit littlewood macbeath math matrices matrix mean measure model moment more multiply naturwiss needs negligible notice odlyzko offord only over paper parallelepiped personal phil presented probab probability problems proc proof prove random references replacing result rogozin sample selections sets several singular singularity situations smallest spanned studia subspaces szemer term than that their theorem theory this torus turned ungar used using variables variance vectors verw volume wahrsch which will wiss with zero
http://doi.acm.org/10.1145/1060590.1060612	15	Testing versus Estimation of Graph Properties	advance against algorithmic algorithms alon appear appeared applications approximation aspects association available bermond blum boolean characterization cnrs colorability combinatorica communication complexity computational computer computing conference connection cornell correcting decisions diestel difficulty distance duke eccc edition efficient european every first fischer focs fortnow fournier given goldreich goldwasser graph graphs handbook ieee inter intolerant isomorphism jasekaran journal kluwer krivelevich large learning lefmann lemma letin loque luby monotone numerical pardalos parnas partitions polynomials preliminary press primer private problems proc proceedings program properties property random randomized references regarding regular regularity reif report robust rolim rubinfeld science sciences self shapira siam soda sotteau springer stoc structures sudan system szegedy szemer technical testable testing that theorems theoretical theory this three tolerant trevisan tutorial uninformed university vergnas version versus with yuster
http://doi.acm.org/10.1145/1060590.1060656	49	On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem	aardal academic algorithm algorithms analysis analyzed annual applied approximation barahona cbms charikar chudak classical combinatorial comparison complexity computation computer computing conference continuous coop cornu discrete dual efficient erimental euclidean european experimental facility factor fitting foundations frieze geometric graphs greedy guha heuristic hoefer ieee improved integer intl ipco jain jaraman jols journal kluwer korup krarup large lncs local location mahdian markakis mathematics median metric nemhauser numerical operational operations optimization oxford penrose plant plaxton press primal probabilistic probability problem problems proc programming pruzan publishers random references regional relaxation research revealing scale science search series shmoys siam simple solving springer steele survey sviridenko symposium synthesis tardos theory uncapacitated university using vazirani verlag volume with wolsey workshop yukich zhang
http://doi.acm.org/10.1145/1060590.1060638	36	On Algorithms for Discrete and Approximate Brouwer Fixed Points	abbildung abhand abstraits academic academy adjustment akad algorithm algorithmic algorithms altman anal annalen annarb appear application applications applied approx approximating approximation approximationen arch arrow avrachenkov banach bandwidth barakat berl bisection brouwer calculus case certain chaos chen class classes codenotti cole commerce comp complexity computation computational computer computes computing concave conference constraint constructive continuous contracting control convergent dans debreu deep delay deng devanur dimensional dimensionszahl discrete dodis dordrecht dual duality dynamical dynamics eaves econometrica economics economies economy ectral edges editors efficient electronic element ellipsoid ending ensembles envelop equations equilibria equilibrium erner erson etitive eweis existence extensions fast finding finite fisher fixed focs functions fundamenta funktionen games gebietes global grales graph graphs hamburg heterogeneous hirsch homothetic homotopies huang icalp identification ieee iimura inequalities infinity infocom intersection invarianz iterative jain journal kellogg khachiyan kluwer kronecker kuhn large lemmata leontief leur linear linearen lower lungen mahdian management mannigfaltigkeiten mapping mappings market math mathematicae mathematical mathematics mathematische mathematischen maximizing mech mehrerer mehta meinardus merrill meshes methods metr michigan milanese model montsh multicast murota nash national network networking neuer newton nonlinear norm numer oint oints olynomial onential ortega ounds pages papadimitriou partitioning planar plenum point points press price prices pricing primal problem proceedings process product production profit programming proof publishers quasi queue random rational rations reconsidered recursive references results rheinb robinson robustness roughgarden safra scale scarf science sciences selfish semi seminar several shellman shenker siam sikorski simplicial smale soda soft solution spielman stability stoc symbolic system systeme systems tamura teng that theorem theoretic thesis time trans transactions tsay uniqueness universitat university upper users utilities utility varadara variab variables vavasis vazirani vicino weakly wiss with works wozniakowski yang york yorke
http://doi.acm.org/10.1145/1060590.1060669	59	On Obfuscating Point Functions	algorithm applications asiacrypt barak basic bits blum cambridge canetti case circuits combinatorica committing comp complexity computing concurrent constant constructions core correcting crypto cryptographic cryptographically cryptography depth dology dwork efficiency encryption errors eurocrypt focs foundations fourier from function functions generate generic gennaro goldb goldreich graphs halevi hard hash hashing hide impagliazzo information journal knowledge krawczyk leaking learnability levin linial lower luby lynn mansour metho micali micciancio naor nielsen nissan obfuscating obfuscation oracle oracles osition otzky ounds partial password perfectly philips positive possibility prabhakaran predicates press princeton probabilistic proc proceedings programs pseudo pseudorandomness ramanujan random realizing references reingold results revisited rudich sahai sarnak security separating sequences siam smith stoc strong systems techniques that theoretic theory these tools towards transform trap trevisan university unix vadhan wagner without yang zero
http://doi.acm.org/10.1145/1060590.1060682	69	Derandomization of Auctions	agents algorithms american applications applied approximately april archer auctions available balance barbara behavior blum budget california callaghan color combinatorial commerce competitive competitiveness complexity computer computing concensus conf costs demand digital discrete earlier ebert economic economics editors efficiency efficient exploration feast feige fiat foundations games generalized goldberg goods guess hartline ieee income institute intertrust into karlin leave lehmann mathematics mechanism mechanisms mind mirrlees moulin near online operators optimal pages parameter people peters play press pricing proc publication puzzler randomness recursive references report revelation review rogers saks santa science segal sharing shenker shoham siam star strategyproof studies submitted submodular symp symposium tardos taxation technical theory thesis tribute truth truthful university unknown version weizmann winkler with wolfe wright york your
http://doi.acm.org/10.1145/1060590.1060619	21	Oblivious Routing in Directed Graphs with Random Demands	adaptivity algorithm algorithms alon annual applications approach approximating approximation architectures awerbuch azar balancing benefit bienkowski boucheron brebner buchbinder cambridge capacitated chekuri client cohen communication computer computing concentration congestion constructing control dean decomposition diagonal directed discrete distributed dominant fiat flow focs foundations general global goemans graphs hajiaghayi harrelson hildrum ieee inequality information kaplan khanna kleinberg knapsack korzeniowski leighton load lugosi maggs manuscript massart miller minimize minimizing motwani multicommodity naor network networks node nothing oblivious online optimal optimization packing paral parallel parekh polynomial practical preconditioning press problem problems proceedings racke rahgavan random randomized ravi references rosen routing schemes science server sharp shepherd siam society soda solving stochastic structures symmetric symposium systems theory time tree universal university valiant vondrak with without
http://doi.acm.org/10.1145/1060590.1060597	4	Approximation Techniques for Utilitarian Mechanism Design	aaai agents alem algorithmic algorithms allocation applications approx approximate approximately approximating approximation approximations archer aspects auctions awerbuch azar bartal bicriteria bidding bounding calinescu callaghan chakrabarti chekuri choice clarke combinatorial combinatorica commerce compatible competitive comput computing conf conference construction cooperative cost counterspeculation covering design deterministic disjoint dual econometrica efficient electronic equitable faster finance flow focs fractional frugality games garg gonen good goods graphs greedy groves guarantees gupta halldorsson hassin hunt ieee improved incentive incentives independent inhibition integer ipco isaac jain journal june khanna kleinberg knapsack knowledge kolliopoulos konemann kothari kumar lehmann lncs marathe math mechanism mechanisms meyerson multi multicommodity multidimensional multipart multiple network nisan online oper optimization other packing pages papadimitriou parameter parkes path paths payment phillips plotkin polynomial price pricing primal probabilistic problem problems proc programs proofs provably ptas public raghavan randomized rationality ravi reducing references regev restricted revelation robins ronen rosenkrantz rounding routing sahni scheduling schemes sealed shoham shortest siam simpler single soda springer srinivasan stacs stein steiner stoc strategyproof strongly sundaram suri survey syst talwar tardos tark tasks teams technique telling tenders theoretical thesis thompson throughput tractable tree truth truthful type unit unsplittable using vazirani vickrey with zelikovsky
http://doi.acm.org/10.1145/1060590.1060624	25	Low-distortion Embeddings of General Metrics Into the Line	additive agarwala algorithm algorithmic algorithms also annual appendix application applications approx approximability approximating approximation argmaxua argminua aspects assertion assume average bafna bandwidth bdoiu carolinae choice claim clearly colton combinatorics comment complexity computational computer computing conclusions congress consider constant contracting dcwvi demaine dhamdhere dimacs dimensional dimensionality discrete distance distances distortion does dunagan each ecting edding eddings emek endence etween euclidean evolutionary exist exists extra factor farach feige finding finite fitting follows foundations framework general geometric geometry glaring global graphs group gupta hastad have http ieee indyk information international into isomap ivansson jiaghai journal kannan kenyon lagergren langford leads lecture line linial lipschitz london mapping maps math mathematicians matouek maxuvi maxwx memo metric metrics minimization minimizing minimum minwx model most multidimensional narayanan naturally nonlinear note notes numerical obtain oint oints olynomial open optimal oulos page pages papadimitriou paterson peleg perhaps presented problem problems proceedings proof rabani rabinovich raecke random randomization ravi real reduction references resp results robust safra scaling science sciences sets several siam sidirop silva similarly since sinclair some space spaces spanning stacs stanford stretch such symposium system taxonomy technical tenenbaum that then theoretical theory there this thorup thus time tree trees tutorial unger univ unweighted vempala volume warnow with work working workshop
http://doi.acm.org/10.1145/1060590.1060662	54	Fast Quantum Byzantine Agreement	adam advantage agreement aharonov algorithm algorithms annual another application april aspnes asynchronous benny bound bracha brian byzantine canetti case channels choice chor claude close coan codes coin comp completely comput computation computer computing consensus constant correct cynthia daniel david degree details distributed dwork easily efficient environment erasures error errors extended extension failure fast fault faults feldman flipping flips forward foundations free fully gabriel garay generals gottesman handle ieee intriguing jacm joseph journal june kaufman lamp larry leaving long lower lynch manuscript meritt mexico micali michael model models morgan moses multi must nancy neglect note olynomial optimal ossible ounds party pavlov pease persuasively phaseflip podc polynomial preliminary presence principles probability proceedings protocol protocols puerto quantph quantum question qvss rabin randomized rate reaching realistic references resilience resilient rounds science secure setting seventeenth shmoys shostak siam simple since smith software stoc stockmeyer straight submitted symposium symposyum synchronous that theory third this tight time tolerant tolerating trans unpublished vallarta version well when whether will with work
http://doi.acm.org/10.1145/1060590.1060604	10	Representing Hard Lattices with O(n log n) Bits	advances ajtai algorithm algorithmic algorithms annalen annual ants approximation assumptions average banaszczyk based basis bounds buhler calc case chapter coefficients colloquium compact company complexity computational computer computing conference constructions cryptographic cryptography cryptology cryptosystem cryptosystems cyclic decryption diophantine dwork eccc editor efficient electronic eliminating equivalence errors factoring focs form foundations from functions generalized geometry goldreich goldwasser gruber halevi halmos hermite hierarchy hoffstein holland http ieee improving knapsacks kumar lattice lattices lecture lekkerkerker lenstra lovasz matematische math measure micciancio normal north nostrand notes ntru number numbers pages piper polynomial polynomials problem proc proceedings public rational reduction references regev ring schmidt schnorr science shortest sieve silverman sivakumar some springer stoc symposium theorems theoretical theory time transference trier using vector volume with wolfgang worst
http://doi.acm.org/10.1145/1060590.1060688	73	Correcting Errors Without Leaking Partial Information	achieves advances advantage adversaries adversary against agreement algorithms amit amplification amsterdam analysis applications apply april arbitrary assumption barak before below bennett between bias biased biometrics bits both bounded brassard cachin cally canetti ceedings cenk chauhan christian close codes collision combine combining commitment communication communications complexity comput computable computer computing conf construct constructing construction constructions contrary cormo correcting correction crhf crooked crypto cryptography cryptology cryptosystems cument data degree developments dijk ding directly discrete discussion distillation distribu distribution distributions does drawn eatcs ecom efficient encryption ensemble entropic entropically entropy epsilon equivalence error errors eteck eurocrypt exchange exist exists explicit exponential extractor extractors family final follow following follows foundations free from full function functions fuzzy generate generic gilles give given glob goldreich goldwasser graham halves hash henk here hide high holland ieee impagliazzo improved increasing independent independently indistinguishability indistinguishable info information initial input institute intermediate international intuition jcss juels keys leakage left lemma length letin light line linear linking lision look louis lynn macwilliams madhu maintaining mano marten massachusetts maurer messages micali micciancio mike naor need negligible nisan noise noisy north number obfuscating obfuscation obtain onetime oracles ordinary ossibility other ounded output over oxford pairwise partial paterson pcps perfectly permutations point positive powf prabhakaran practical previous privacy probabilistic probability proc programs proposition proto prove public publicly puzzles random randomized randomness realizing recent reconciliation recycle references regularity reingold removes requirement resilient resistant result results reyzin roughly rudich russell sahai sahinalp salil salvail same sasson scheme science secrecy secret section secure security sets shaltiel shengli short siam simpler sloane small smith soundness source space spaces specifically statement states stoc storage strong sudan suffices sufficient sufficiently suleyman suppose symp symposium techniques technology tests that then theorem theory there these thesis this tilb tions tolerant tolerates towards trachtenb trans ueli unavoidable uniform vadhan variant vault verifiable version vishkin wang wattenb when where which wigderson will with yang yields york zuckerman
http://doi.acm.org/10.1145/1060590.1060650	44	Saving an Epsilon: A 2-approximation for the k-MST Problem in Graphs	algorithm algorithms annual applied approximate approximation arora arya awerbuch azar bansal blum california chalasani chaudhuri chawla collecting computer computing constant deadline discounted discrete eleventh eppstein euclidean factor faster foundations garg geometric godfrey guarantees guillotine hochbaum ieee improved industrial information irvine jagopalan johnson journal karakostas karger lane latency letters logarithmic manuscript marathe mathematics meyerson minimum minkoff mitchell orienteering other pages paths phillips plane point polygonal polynomial practice prize problem problems proceedings processing ramesh ravi references related report reward rosenkrantz routing salesman salesmen scheme schemes science short siam simple small society spanning steiner subdivisions sundaram symposium talwar technical theory time tours traveling tree trees university unpublished vazirani vehicle vempala vertices weight windows with
http://doi.acm.org/10.1145/1060590.1060651	45	The Mixing Time of the Thorp Shuffle	addison american annals applications applied association availible bayer california communication computer computing diaconis dovetail duality evolving exchange exclusion faro fields fill form front game group hayward heat http institute journal kernel knuth lair lecture math mathematical mixing monograph morris networks nonrandom notes ounds peres personal probability programming rearrangeability references related representations searching series sets shuffle shuffling siam simple sorting stage stationary statistical statistics strong theory thorp time times tracing ucdavis volume wesley with
http://doi.acm.org/10.1145/1060590.1060671	61	Collusion-Free Protocols	abhi able about above active adaptive adaptively adleman after against allows also announced announces anyone appendix arbitrary attacks backes based being blum broadcast broadcasts cachin cambridge canetti channels chapter chaum chosen circuit coalitions coin coins cols commitment commitments compiled compiler completeness component components composable computation compute computed computer computes computing consists construct contents correctly create crypto cryptographic cryptography curious current cution damg decryption decrypts defining described deviate digital distributed dividing dodis each easily effects encrypted encryption encrypts evaluate even every execution fair fashion fault feige final first flipping focs follows foundations from function game general generator goldreich goldwasser hiding honest hopp information input inputs interactive into journal katzenbeisser knowledge knows lepinski lncs machine machines maintains malicious mapping matching mental message micali minimizes multi multimedia nicholas noar noninteractive note obtain oker once only operates output outputs pages paradigm parallel participants party peau perform persiano petitcolas play player players prescribed presence press previous private privately probabilistic proc proceeds produces proof properly proto protocol provably proven provide provides public random reaches receiving reconstruct reducibility refer references report rivest runs santis scheme science second secure security send sending sends shamir share shares sharing shelat siam signature simulate simulated since springer stage state statement steganographic steganography stoc string such system takes tape technical that then theorems theoretic theoretically these this throughout tial time tolerant transforms truth turing unconditionally universally university upon used uses verify volume wants watermarking which wigderson with zero zeroknowledge
http://doi.acm.org/10.1145/1060590.1060593	1	Extractors with Weak Random Seeds	acknowledgment addendum algebra algorithms almost alon amir amnon applications approx ariel barak beat benny bias bits boaz bound canad channel chapter chor colloquium combinatorica combinatorics communicating communication complexity comput computational condensers considerations constant construction constructions constructive conversations corollary david developments dispersers distributions dodis easy eatcs eccc eecs efficiency efficient eigenvalue elbaz electronic error expanders explicit exposition extracting extraction extractors factors focs form from gabizon generating given goldreich graham graphs grotschel guises handbook harvard hastad helpful higher http impagliazzo improved independence independent joel johan joseph kindler land lemmas letin like linear lovasz luca many math moni naor nisan noam noga north oblivious oded oliveira omer omitted optimal over paper peralta private probabilistic probability problem proceeding proof public quasirandom ramsey random randomness recent reduction references reingold rene roberto ronald ronen russell salil samplable sampling semi sequences shaltiel shma shpilka siam simple simulating small solution sources space spaces spencer stoc strong struct sudakov survey syst thank that their theorem this three tools tournament trevisan tutorial umesh unbiased using vadhan variables vazirani version very weak wigderson wise would yevgeniy zuckerman
http://doi.acm.org/10.1145/1060590.1060652	46	Approximately Counting Integral Flows and Cell-Bounded Contingency Tables	aldous algebraic algorithm algorithms annals annealing annual aoki application applications approximate approximately approximating approximation arrays arxiv available baldoni barvinok bases berlin carlo carnegie chain chains column combinatorial combinatorics complexity computer computing conditional constant contingency convex coste count counting cryan department diaconis dies dimension discrete discussion distribution distributions dular dyer dynamic efficiency efron encer endence entries ermanent exact fast fixed flows foundations frieze from gangolli generation genova geometric goldb greenhill harvard holmes http ieee improved indep inference integer integral interpretations jerrum jones journal kannan knapsack lattice loera margins markov martin math mathematics matrix mellon metho methods mildly mixing monte morris mount multidimensional negative networks numb number oints olynomial onential operations optimization ounds perkovic permanent polyhedra polynomial preprint probability problem proc programming random rapidly rapollo rectangular references research rowed rows saloff sampling schrijver science sciences silva simulated sinclair solutions springer square statistic statistics steele structural structures sturmfels sums symposium system table tables technical test testing theoretical theory thesis time tokyo tschel uniform unimo unimodular university valiant vazirani vempala vergne verlag vigoda volume volumes walk when with york zeros
http://doi.acm.org/10.1145/1060590.1060611	14	Every Monotone Graph Property is Testable	academic algorithm algorithmic algorithms alon also amer annual appear applications applied approximation aspects association asymptotic balogh bermond bollob bolyai branching budapest bulletin california characterization chromatic classical cliques cnrs colorability coloring colors column combin combinatorial combinatorica combinatorics complexity computational computer computing connection constant containing counting decisions design diego dimacs directed discrete duke edge edition editors efficient eichhorn eighty erds european every exponent extremal fischer fixed focs fournier frankl friedgut functions goldreich goldwasser gowers graham graph graphs handbook have having hypegraphs hypergraph hypergraphs ieee inter jacm jasekaran journal kalai kluwer koml krivelevich languages large learning lefmann lemma loque manuscript many math mathematics measures metho methods mikl monotone mubayi multidimensional nagle necessarily newman number pardalos partitions paul pittsburgh polynomials press primer probabilistic problem proc program programs properties property publishers queries ramsey random randomization randomized read recursive references regarding regular regularity reif rfas robust rolim rothschild rubinfeld satisfiability schacht science second separation sgall shapira sharp siam simonovits skokan small soda sotteau spencer stoc structures subcliques subgraph subgraphs sudan survey symp szegedy szemer testable testing that theorem theorems theoretical theory three threshold trevisan twice uniform uninformed variant vergnas weinreich width wiley with york yuster
http://doi.acm.org/10.1145/1060590.1060607	12	Worst-Case Update Times for Fully-Dynamic All-Pairs Shortest Paths	acta adding akademia algorithm algorithms allowing announced appl applications approach approximate avoiding balanced barrier bellman biconnectivity blum breaking brodal capability case cell closure comm complexity computer computing connectivity connexion cycles data date dating demetrescu deterministic digraphs dijkstra disjoint distances dokladi dynamic edge eeding efficiency eppstein eration failure faster finger flows floyd focs ford forests frederickson fredman fulkerson fully galil good graph graphs heaps henzinger holm improved informatica information inverse italiano king kostas lagogiannis landis levcop lichtenb line linear link logarithmic lson lueker machine maintaining makris math matrices matrix minimum nauk negative network networks nissenzweig note numer ointer olylogarithmic onacci oolean optimal optimization oracles organization oulos ounds overmars pages pairs path paths poly press princeton prob problem problems proc quart randomized range references restriction roditty routing saks sankowski sciences search shortest siam simpler single soda spanning sparsification sssr stoc structures swat system tarjan technique their theorem thorup through time transitive tree trees tsakalidis tsichlas undirected union university uses velski warshall willard williams with worst zwick
http://doi.acm.org/10.1145/1060590.1060702	84	On Strip Packing With Rotations	above acknowledgment additionally additive algorithm algorithmica algorithms allocate american another approximate approximation aptas asymptotic authors baker because below bins bound bounds brenda claire coffman coincide combinatorial combinatorica computing concave conclude conference constant constrained continue contradiction could cuts cutting david define defined denote dimensional dimensions does edge edward epstein eric eugene exist fast fernandez flavio follows from fully garey george given gives giving grigoriadis have height heights higher informatics input integer international intersect into ipco items jansen johnson jorge journal keidi kenyon khachiyan klaus knapsack latin lawler leah lenstra leonid less level linear lncs lorant lueker machines malleable mathematical mathematics method michael mike miyazawa most near next number online operations optimal optimization oriented orthogonal pack packed packing packings pages parallel performance plus polynomial porkolab preemptive presented problem problems procedure proceedings programming proof rameter references remila required research resource rivest robert ronald rotations rounding scheduling scheme schemes separate sharing shmoys siam side simplified solution solved some square starting stee stock strip structured substantially such suppose symposium take tardos tarjan tasks than thank that then theoretical there thereby these this thus time times trivially turned twodimensional unrelated until upper uses using vega villavicencio wakabayashi waoa wenceslas which wish with within workshop yoshiko
http://doi.acm.org/10.1145/1060590.1060687	72	Concurrent General Composition of Secure Protocols in the Timing Model	achieving agreement application applications archive assumptions barak basic black blum bounded bounds cambridge canetti chaum chor coin cols commitment commitments communication comp compcom completeness complexity computation computer computing concurrent conference constant constraints crep crypto cryptographic cryptography cryptology damgard disc dishonest distributed dolev dwork efficient endence eprint eurocrypt exchange fault feige fischlin flipping focs foundations full game general generate generators goldreich goldwasser hiding honest ieee indep indistinguishability integrity interactive jority journal kalai katz kilian knowledge kushilevitz limitations lindell lncs logarithmic lower malleable mental micali multi multiparty naor need notions numb osability osable osition ostrovsky pages paradigm parallel party pass pfitzmann phone plaintext play podc polynomial prabhakaran prabhakharan preservation press proof proofs proto protocols pseudorandom quasi rabin rackoff reactive reducing references revisited richardson rosen round rounds sahai secrets secure security self setup shamir siam simulation spring springer stoc systems their theorem theorems theory time timing tolerant tools tossing trusted unconditionally universal universally university using vadhan verlag version volume waidner wigderson with without witness zaps zero
http://doi.acm.org/10.1145/1060590.1060626	26	Tree-Walking Automata Do Not Recognize All Regular Languages	acta acyclic arto automata best bounded cannot colcombet computer context contributions control cybernetica determinized directed engelfriet forever foundations free grammar graphs honor hoogeboom information international janczyk jewels kamimura languages lncs loquium neven ordered parallel pebble power programming references salomaa schwentick science slutzki software springer technology theoretical translations tree trees trips ullman verlag walking
http://doi.acm.org/10.1145/1060590.1060633	32	Hardness of the Undirected Congestion Minimization Problem	algorithmic algorithms also always among andrews annual answer applying approximation arora bound bulk carried chicago choosing chuzhoy combinatorial combinatorica complexity computations computer computing conclude congestion constant construction correct cort design editors erdos example foundations fractional gegebener give gives good graph graphen halle hardness have instance integrality introduction italy journal karp knotenzahl large linear logarithmic lower lund machine math mentioned miller minimaler minimization motwani naor network npoly observe october pages parallel polynomial positive problem problems proceedings proof proofs provably quasi quasipolynomial raghavan randomized reducibility reduction references regulare relaxation repetition result results rome rounding running sachs scheduling science showing shown siam size solution standard states sudan symposium szegedy taillenweite technique that thatcher then theorem theory there thompson time undirected unless verification where wiss wittenburg yields
http://doi.acm.org/10.1145/1060590.1060639	37	Convex Programming for Scheduling Unrelated Parallel Machines	algorithm algorithms alon also annual applied approach approximate approximation assignment assoc association automata average awerbuch azar balancing chakrabarti chudak combinatorial combinatorica completion comput computer computing consequences constrained convex corrigendum criteria different discrete dual eeds ellipsoid epstein european exact focs foundations generalized geometric goemans grotschel grove hall hochbaum horowitz identical improved interior international january journal krishnan languages lenstra line load loquium lovasz mach machinery machines math mathematical mathematics maximum method minimize minsum nemirovskii nesterov norm oint olynomial operations optimization osium pages parallel phillips practical precedence problem problems proc proceeding processors prog programming quadratic references related relaxations research results richter sahni satisfiability scandinavian scheduling scheme schemes schrijver schulz science semidefinite sgall shmoys siam skutella springer stein studies swat symp symposium tardos that theoretical theory time tschel uniform uniformly unrelated using verlag vitter wein williamson woeginger workshop yadid