(function(){var _jQuery=window.jQuery,_$=window.$;var jQuery=window.jQuery=window.$=function(selector,context){return new jQuery.fn.init(selector,context)};var quickExpr=/^[^<]*(<(.|\s)+>)[^>]*$|^#(\w+)$/,isSimple=/^.[^:#\[\.]*$/,undefined;jQuery.fn=jQuery.prototype={init:function(selector,context){selector=selector||document;if(selector.nodeType){this[0]=selector;this.length=1;return this}if(typeof selector=="string"){var match=quickExpr.exec(selector);if(match&&(match[1]||!context)){if(match[1]){selector=jQuery.clean([match[1]],context)}else{var elem=document.getElementById(match[3]);if(elem){if(elem.id!=match[3]){return jQuery().find(selector)}return jQuery(elem)}selector=[]}}else{return jQuery(context).find(selector)}}else{if(jQuery.isFunction(selector)){return jQuery(document)[jQuery.fn.ready?"ready":"load"](selector)}}return this.setArray(jQuery.makeArray(selector))},jquery:"1.2.6",size:function(){return this.length},length:0,get:function(num){return num==undefined?jQuery.makeArray(this):this[num]},pushStack:function(elems){var ret=jQuery(elems);ret.prevObject=this;return ret},setArray:function(elems){this.length=0;Array.prototype.push.apply(this,elems);return this},each:function(callback,args){return jQuery.each(this,callback,args)},index:function(elem){var ret=-1;return jQuery.inArray(elem&&elem.jquery?elem[0]:elem,this)},attr:function(name,value,type){var options=name;if(name.constructor==String){if(value===undefined){return this[0]&&jQuery[type||"attr"](this[0],name)}else{options={};options[name]=value}}return this.each(function(i){for(name in options){jQuery.attr(type?this.style:this,name,jQuery.prop(this,options[name],type,i,name))}})},css:function(key,value){if((key=="width"||key=="height")&&parseFloat(value)<0){value=undefined}return this.attr(key,value,"curCSS")},text:function(text){if(typeof text!="object"&&text!=null){return this.empty().append((this[0]&&this[0].ownerDocument||document).createTextNode(text))}var ret="";jQuery.each(text||this,function(){jQuery.each(this.childNodes,function(){if(this.nodeType!=8){ret+=this.nodeType!=1?this.nodeValue:jQuery.fn.text([this])}})});return ret},wrapAll:function(html){if(this[0]){jQuery(html,this[0].ownerDocument).clone().insertBefore(this[0]).map(function(){var elem=this;while(elem.firstChild){elem=elem.firstChild}return elem}).append(this)}return this},wrapInner:function(html){return this.each(function(){jQuery(this).contents().wrapAll(html)})},wrap:function(html){return this.each(function(){jQuery(this).wrapAll(html)})},append:function(){return this.domManip(arguments,true,false,function(elem){if(this.nodeType==1){this.appendChild(elem)}})},prepend:function(){return this.domManip(arguments,true,true,function(elem){if(this.nodeType==1){this.insertBefore(elem,this.firstChild)}})},before:function(){return this.domManip(arguments,false,false,function(elem){this.parentNode.insertBefore(elem,this)})},after:function(){return this.domManip(arguments,false,true,function(elem){this.parentNode.insertBefore(elem,this.nextSibling)})},end:function(){return this.prevObject||jQuery([])},find:function(selector){var elems=jQuery.map(this,function(elem){return jQuery.find(selector,elem)});return this.pushStack(/[^+>] [^+>]/.test(selector)||selector.indexOf("..")>-1?jQuery.unique(elems):elems)},clone:function(events){var ret=this.map(function(){if(jQuery.browser.msie&&!jQuery.isXMLDoc(this)){var clone=this.cloneNode(true),container=document.createElement("div");container.appendChild(clone);return jQuery.clean([container.innerHTML])[0]}else{return this.cloneNode(true)}});var clone=ret.find("*").andSelf().each(function(){if(this[expando]!=undefined){this[expando]=null}});if(events===true){this.find("*").andSelf().each(function(i){if(this.nodeType==3){return}var events=jQuery.data(this,"events");for(var type in events){for(var handler in events[type]){jQuery.event.add(clone[i],type,events[type][handler],events[type][handler].data)}}})}return ret},filter:function(selector){return this.pushStack(jQuery.isFunction(selector)&&jQuery.grep(this,function(elem,i){return selector.call(elem,i)})||jQuery.multiFilter(selector,this))},not:function(selector){if(selector.constructor==String){if(isSimple.test(selector)){return this.pushStack(jQuery.multiFilter(selector,this,true))}else{selector=jQuery.multiFilter(selector,this)}}var isArrayLike=selector.length&&selector[selector.length-1]!==undefined&&!selector.nodeType;return this.filter(function(){return isArrayLike?jQuery.inArray(this,selector)<0:this!=selector})},add:function(selector){return this.pushStack(jQuery.unique(jQuery.merge(this.get(),typeof selector=="string"?jQuery(selector):jQuery.makeArray(selector))))},is:function(selector){return !!selector&&jQuery.multiFilter(selector,this).length>0},hasClass:function(selector){return this.is("."+selector)},val:function(value){if(value==undefined){if(this.length){var elem=this[0];if(jQuery.nodeName(elem,"select")){var index=elem.selectedIndex,values=[],options=elem.options,one=elem.type=="select-one";if(index<0){return null}for(var i=one?index:0,max=one?index+1:options.length;i<max;i++){var option=options[i];if(option.selected){value=jQuery.browser.msie&&!option.attributes.value.specified?option.text:option.value;if(one){return value}values.push(value)}}return values}else{return(this[0].value||"").replace(/\r/g,"")}}return undefined}if(value.constructor==Number){value+=""}return this.each(function(){if(this.nodeType!=1){return}if(value.constructor==Array&&/radio|checkbox/.test(this.type)){this.checked=(jQuery.inArray(this.value,value)>=0||jQuery.inArray(this.name,value)>=0)}else{if(jQuery.nodeName(this,"select")){var values=jQuery.makeArray(value);jQuery("option",this).each(function(){this.selected=(jQuery.inArray(this.value,values)>=0||jQuery.inArray(this.text,values)>=0)});if(!values.length){this.selectedIndex=-1}}else{this.value=value}}})},html:function(value){return value==undefined?(this[0]?this[0].innerHTML:null):this.empty().append(value)},replaceWith:function(value){return this.after(value).remove()},eq:function(i){return this.slice(i,i+1)},slice:function(){return this.pushStack(Array.prototype.slice.apply(this,arguments))},map:function(callback){return this.pushStack(jQuery.map(this,function(elem,i){return callback.call(elem,i,elem)}))},andSelf:function(){return this.add(this.prevObject)},data:function(key,value){var parts=key.split(".");parts[1]=parts[1]?"."+parts[1]:"";if(value===undefined){var data=this.triggerHandler("getData"+parts[1]+"!",[parts[0]]);if(data===undefined&&this.length){data=jQuery.data(this[0],key)}return data===undefined&&parts[1]?this.data(parts[0]):data}else{return this.trigger("setData"+parts[1]+"!",[parts[0],value]).each(function(){jQuery.data(this,key,value)})}},removeData:function(key){return this.each(function(){jQuery.removeData(this,key)})},domManip:function(args,table,reverse,callback){var clone=this.length>1,elems;return this.each(function(){if(!elems){elems=jQuery.clean(args,this.ownerDocument);if(reverse){elems.reverse()}}var obj=this;if(table&&jQuery.nodeName(this,"table")&&jQuery.nodeName(elems[0],"tr")){obj=this.getElementsByTagName("tbody")[0]||this.appendChild(this.ownerDocument.createElement("tbody"))}var scripts=jQuery([]);jQuery.each(elems,function(){var elem=clone?jQuery(this).clone(true)[0]:this;if(jQuery.nodeName(elem,"script")){scripts=scripts.add(elem)}else{if(elem.nodeType==1){scripts=scripts.add(jQuery("script",elem).remove())}callback.call(obj,elem)}});scripts.each(evalScript)})}};jQuery.fn.init.prototype=jQuery.fn;function evalScript(i,elem){if(elem.src){jQuery.ajax({url:elem.src,async:false,dataType:"script"})}else{jQuery.globalEval(elem.text||elem.textContent||elem.innerHTML||"")}if(elem.parentNode){elem.parentNode.removeChild(elem)}}function now(){return +new Date}jQuery.extend=jQuery.fn.extend=function(){var target=arguments[0]||{},i=1,length=arguments.length,deep=false,options;if(target.constructor==Boolean){deep=target;target=arguments[1]||{};i=2}if(typeof target!="object"&&typeof target!="function"){target={}}if(length==i){target=this;--i}for(;i<length;i++){if((options=arguments[i])!=null){for(var name in options){var src=target[name],copy=options[name];if(target===copy){continue}if(deep&&copy&&typeof copy=="object"&&!copy.nodeType){target[name]=jQuery.extend(deep,src||(copy.length!=null?[]:{}),copy)}else{if(copy!==undefined){target[name]=copy}}}}}return target};var expando="jQuery"+now(),uuid=0,windowData={},exclude=/z-?index|font-?weight|opacity|zoom|line-?height/i,defaultView=document.defaultView||{};jQuery.extend({noConflict:function(deep){window.$=_$;if(deep){window.jQuery=_jQuery}return jQuery},isFunction:function(fn){return !!fn&&typeof fn!="string"&&!fn.nodeName&&fn.constructor!=Array&&/^[\s[]?function/.test(fn+"")},isXMLDoc:function(elem){return elem.documentElement&&!elem.body||elem.tagName&&elem.ownerDocument&&!elem.ownerDocument.body},globalEval:function(data){data=jQuery.trim(data);if(data){var head=document.getElementsByTagName("head")[0]||document.documentElement,script=document.createElement("script");script.type="text/javascript";if(jQuery.browser.msie){script.text=data}else{script.appendChild(document.createTextNode(data))}head.insertBefore(script,head.firstChild);head.removeChild(script)}},nodeName:function(elem,name){return elem.nodeName&&elem.nodeName.toUpperCase()==name.toUpperCase()},cache:{},data:function(elem,name,data){elem=elem==window?windowData:elem;var id=elem[expando];if(!id){id=elem[expando]=++uuid}if(name&&!jQuery.cache[id]){jQuery.cache[id]={}}if(data!==undefined){jQuery.cache[id][name]=data}return name?jQuery.cache[id][name]:id},removeData:function(elem,name){elem=elem==window?windowData:elem;var id=elem[expando];if(name){if(jQuery.cache[id]){delete jQuery.cache[id][name];name="";for(name in jQuery.cache[id]){break}if(!name){jQuery.removeData(elem)}}}else{try{delete elem[expando]}catch(e){if(elem.removeAttribute){elem.removeAttribute(expando)}}delete jQuery.cache[id]}},each:function(object,callback,args){var name,i=0,length=object.length;if(args){if(length==undefined){for(name in object){if(callback.apply(object[name],args)===false){break}}}else{for(;i<length;){if(callback.apply(object[i++],args)===false){break}}}}else{if(length==undefined){for(name in object){if(callback.call(object[name],name,object[name])===false){break}}}else{for(var value=object[0];i<length&&callback.call(value,i,value)!==false;value=object[++i]){}}}return object},prop:function(elem,value,type,i,name){if(jQuery.isFunction(value)){value=value.call(elem,i)}return value&&value.constructor==Number&&type=="curCSS"&&!exclude.test(name)?value+"px":value},className:{add:function(elem,classNames){jQuery.each((classNames||"").split(/\s+/),function(i,className){if(elem.nodeType==1&&!jQuery.className.has(elem.className,className)){elem.className+=(elem.className?" ":"")+className}})},remove:function(elem,classNames){if(elem.nodeType==1){elem.className=classNames!=undefined?jQuery.grep(elem.className.split(/\s+/),function(className){return !jQuery.className.has(classNames,className)}).join(" "):""}},has:function(elem,className){return jQuery.inArray(className,(elem.className||elem).toString().split(/\s+/))>-1}},swap:function(elem,options,callback){var old={};for(var name in options){old[name]=elem.style[name];elem.style[name]=options[name]}callback.call(elem);for(var name in options){elem.style[name]=old[name]}},css:function(elem,name,force){if(name=="width"||name=="height"){var val,props={position:"absolute",visibility:"hidden",display:"block"},which=name=="width"?["Left","Right"]:["Top","Bottom"];function getWH(){val=name=="width"?elem.offsetWidth:elem.offsetHeight;var padding=0,border=0;jQuery.each(which,function(){padding+=parseFloat(jQuery.curCSS(elem,"padding"+this,true))||0;border+=parseFloat(jQuery.curCSS(elem,"border"+this+"Width",true))||0});val-=Math.round(padding+border)}if(jQuery(elem).is(":visible")){getWH()}else{jQuery.swap(elem,props,getWH)}return Math.max(0,val)}return jQuery.curCSS(elem,name,force)},curCSS:function(elem,name,force){var ret,style=elem.style;function color(elem){if(!jQuery.browser.safari){return false}var ret=defaultView.getComputedStyle(elem,null);return !ret||ret.getPropertyValue("color")==""}if(name=="opacity"&&jQuery.browser.msie){ret=jQuery.attr(style,"opacity");return ret==""?"1":ret}if(jQuery.browser.opera&&name=="display"){var save=style.outline;style.outline="0 solid black";style.outline=save}if(name.match(/float/i)){name=styleFloat}if(!force&&style&&style[name]){ret=style[name]}else{if(defaultView.getComputedStyle){if(name.match(/float/i)){name="float"}name=name.replace(/([A-Z])/g,"-$1").toLowerCase();var computedStyle=defaultView.getComputedStyle(elem,null);if(computedStyle&&!color(elem)){ret=computedStyle.getPropertyValue(name)}else{var swap=[],stack=[],a=elem,i=0;for(;a&&color(a);a=a.parentNode){stack.unshift(a)}for(;i<stack.length;i++){if(color(stack[i])){swap[i]=stack[i].style.display;stack[i].style.display="block"}}ret=name=="display"&&swap[stack.length-1]!=null?"none":(computedStyle&&computedStyle.getPropertyValue(name))||"";for(i=0;i<swap.length;i++){if(swap[i]!=null){stack[i].style.display=swap[i]}}}if(name=="opacity"&&ret==""){ret="1"}}else{if(elem.currentStyle){var camelCase=name.replace(/\-(\w)/g,function(all,letter){return letter.toUpperCase()});ret=elem.currentStyle[name]||elem.currentStyle[camelCase];if(!/^\d+(px)?$/i.test(ret)&&/^\d/.test(ret)){var left=style.left,rsLeft=elem.runtimeStyle.left;elem.runtimeStyle.left=elem.currentStyle.left;style.left=ret||0;ret=style.pixelLeft+"px";style.left=left;elem.runtimeStyle.left=rsLeft}}}}return ret},clean:function(elems,context){var ret=[];context=context||document;if(typeof context.createElement=="undefined"){context=context.ownerDocument||context[0]&&context[0].ownerDocument||document}jQuery.each(elems,function(i,elem){if(!elem){return}if(elem.constructor==Number){elem+=""}if(typeof elem=="string"){elem=elem.replace(/(<(\w+)[^>]*?)\/>/g,function(all,front,tag){return tag.match(/^(abbr|br|col|img|input|link|meta|param|hr|area|embed)$/i)?all:front+"></"+tag+">"});var tags=jQuery.trim(elem).toLowerCase(),div=context.createElement("div");var wrap=!tags.indexOf("<opt")&&[1,"<select multiple='multiple'>","</select>"]||!tags.indexOf("<leg")&&[1,"<fieldset>","</fieldset>"]||tags.match(/^<(thead|tbody|tfoot|colg|cap)/)&&[1,"<table>","</table>"]||!tags.indexOf("<tr")&&[2,"<table><tbody>","</tbody></table>"]||(!tags.indexOf("<td")||!tags.indexOf("<th"))&&[3,"<table><tbody><tr>","</tr></tbody></table>"]||!tags.indexOf("<col")&&[2,"<table><tbody></tbody><colgroup>","</colgroup></table>"]||jQuery.browser.msie&&[1,"div<div>","</div>"]||[0,"",""];div.innerHTML=wrap[1]+elem+wrap[2];while(wrap[0]--){div=div.lastChild}if(jQuery.browser.msie){var tbody=!tags.indexOf("<table")&&tags.indexOf("<tbody")<0?div.firstChild&&div.firstChild.childNodes:wrap[1]=="<table>"&&tags.indexOf("<tbody")<0?div.childNodes:[];for(var j=tbody.length-1;j>=0;--j){if(jQuery.nodeName(tbody[j],"tbody")&&!tbody[j].childNodes.length){tbody[j].parentNode.removeChild(tbody[j])}}if(/^\s/.test(elem)){div.insertBefore(context.createTextNode(elem.match(/^\s*/)[0]),div.firstChild)}}elem=jQuery.makeArray(div.childNodes)}if(elem.length===0&&(!jQuery.nodeName(elem,"form")&&!jQuery.nodeName(elem,"select"))){return}if(elem[0]==undefined||jQuery.nodeName(elem,"form")||elem.options){ret.push(elem)}else{ret=jQuery.merge(ret,elem)}});return ret},attr:function(elem,name,value){if(!elem||elem.nodeType==3||elem.nodeType==8){return undefined}var notxml=!jQuery.isXMLDoc(elem),set=value!==undefined,msie=jQuery.browser.msie;name=notxml&&jQuery.props[name]||name;if(elem.tagName){var special=/href|src|style/.test(name);if(name=="selected"&&jQuery.browser.safari){elem.parentNode.selectedIndex}if(name in elem&&notxml&&!special){if(set){if(name=="type"&&jQuery.nodeName(elem,"input")&&elem.parentNode){throw"type property can't be changed"}elem[name]=value}if(jQuery.nodeName(elem,"form")&&elem.getAttributeNode(name)){return elem.getAttributeNode(name).nodeValue}return elem[name]}if(msie&&notxml&&name=="style"){return jQuery.attr(elem.style,"cssText",value)}if(set){elem.setAttribute(name,""+value)}var attr=msie&&notxml&&special?elem.getAttribute(name,2):elem.getAttribute(name);return attr===null?undefined:attr}if(msie&&name=="opacity"){if(set){elem.zoom=1;elem.filter=(elem.filter||"").replace(/alpha\([^)]*\)/,"")+(parseInt(value)+""=="NaN"?"":"alpha(opacity="+value*100+")")}return elem.filter&&elem.filter.indexOf("opacity=")>=0?(parseFloat(elem.filter.match(/opacity=([^)]*)/)[1])/100)+"":""}name=name.replace(/-([a-z])/ig,function(all,letter){return letter.toUpperCase()});if(set){elem[name]=value}return elem[name]},trim:function(text){return(text||"").replace(/^\s+|\s+$/g,"")},makeArray:function(array){var ret=[];if(array!=null){var i=array.length;if(i==null||array.split||array.setInterval||array.call){ret[0]=array}else{while(i){ret[--i]=array[i]}}}return ret},inArray:function(elem,array){for(var i=0,length=array.length;i<length;i++){if(array[i]===elem){return i}}return -1},merge:function(first,second){var i=0,elem,pos=first.length;if(jQuery.browser.msie){while(elem=second[i++]){if(elem.nodeType!=8){first[pos++]=elem}}}else{while(elem=second[i++]){first[pos++]=elem}}return first},unique:function(array){var ret=[],done={};try{for(var i=0,length=array.length;i<length;i++){var id=jQuery.data(array[i]);if(!done[id]){done[id]=true;ret.push(array[i])}}}catch(e){ret=array}return ret},grep:function(elems,callback,inv){var ret=[];for(var i=0,length=elems.length;i<length;i++){if(!inv!=!callback(elems[i],i)){ret.push(elems[i])}}return ret},map:function(elems,callback){var ret=[];for(var i=0,length=elems.length;i<length;i++){var value=callback(elems[i],i);if(value!=null){ret[ret.length]=value}}return ret.concat.apply([],ret)}});var userAgent=navigator.userAgent.toLowerCase();jQuery.browser={version:(userAgent.match(/.+(?:rv|it|ra|ie)[\/: ]([\d.]+)/)||[])[1],safari:/webkit/.test(userAgent),opera:/opera/.test(userAgent),msie:/msie/.test(userAgent)&&!/opera/.test(userAgent),mozilla:/mozilla/.test(userAgent)&&!/(compatible|webkit)/.test(userAgent)};var styleFloat=jQuery.browser.msie?"styleFloat":"cssFloat";jQuery.extend({boxModel:!jQuery.browser.msie||document.compatMode=="CSS1Compat",props:{"for":"htmlFor","class":"className","float":styleFloat,cssFloat:styleFloat,styleFloat:styleFloat,readonly:"readOnly",maxlength:"maxLength",cellspacing:"cellSpacing"}});jQuery.each({parent:function(elem){return elem.parentNode},parents:function(elem){return jQuery.dir(elem,"parentNode")},next:function(elem){return jQuery.nth(elem,2,"nextSibling")},prev:function(elem){return jQuery.nth(elem,2,"previousSibling")},nextAll:function(elem){return jQuery.dir(elem,"nextSibling")},prevAll:function(elem){return jQuery.dir(elem,"previousSibling")},siblings:function(elem){return jQuery.sibling(elem.parentNode.firstChild,elem)},children:function(elem){return jQuery.sibling(elem.firstChild)},contents:function(elem){return jQuery.nodeName(elem,"iframe")?elem.contentDocument||elem.contentWindow.document:jQuery.makeArray(elem.childNodes)}},function(name,fn){jQuery.fn[name]=function(selector){var ret=jQuery.map(this,fn);if(selector&&typeof selector=="string"){ret=jQuery.multiFilter(selector,ret)}return this.pushStack(jQuery.unique(ret))}});jQuery.each({appendTo:"append",prependTo:"prepend",insertBefore:"before",insertAfter:"after",replaceAll:"replaceWith"},function(name,original){jQuery.fn[name]=function(){var args=arguments;return this.each(function(){for(var i=0,length=args.length;i<length;i++){jQuery(args[i])[original](this)}})}});jQuery.each({removeAttr:function(name){jQuery.attr(this,name,"");if(this.nodeType==1){this.removeAttribute(name)}},addClass:function(classNames){jQuery.className.add(this,classNames)},removeClass:function(classNames){jQuery.className.remove(this,classNames)},toggleClass:function(classNames){jQuery.className[jQuery.className.has(this,classNames)?"remove":"add"](this,classNames)},remove:function(selector){if(!selector||jQuery.filter(selector,[this]).r.length){jQuery("*",this).add(this).each(function(){jQuery.event.remove(this);jQuery.removeData(this)});if(this.parentNode){this.parentNode.removeChild(this)}}},empty:function(){jQuery(">*",this).remove();while(this.firstChild){this.removeChild(this.firstChild)}}},function(name,fn){jQuery.fn[name]=function(){return this.each(fn,arguments)}});jQuery.each(["Height","Width"],function(i,name){var type=name.toLowerCase();jQuery.fn[type]=function(size){return this[0]==window?jQuery.browser.opera&&document.body["client"+name]||jQuery.browser.safari&&window["inner"+name]||document.compatMode=="CSS1Compat"&&document.documentElement["client"+name]||document.body["client"+name]:this[0]==document?Math.max(Math.max(document.body["scroll"+name],document.documentElement["scroll"+name]),Math.max(document.body["offset"+name],document.documentElement["offset"+name])):size==undefined?(this.length?jQuery.css(this[0],type):null):this.css(type,size.constructor==String?size:size+"px")}});function num(elem,prop){return elem[0]&&parseInt(jQuery.curCSS(elem[0],prop,true),10)||0}var chars=jQuery.browser.safari&&parseInt(jQuery.browser.version)<417?"(?:[\\w*_-]|\\\\.)":"(?:[\\w\u0128-\uFFFF*_-]|\\\\.)",quickChild=new RegExp("^>\\s*("+chars+"+)"),quickID=new RegExp("^("+chars+"+)(#)("+chars+"+)"),quickClass=new RegExp("^([#.]?)("+chars+"*)");jQuery.extend({expr:{"":function(a,i,m){return m[2]=="*"||jQuery.nodeName(a,m[2])},"#":function(a,i,m){return a.getAttribute("id")==m[2]},":":{lt:function(a,i,m){return i<m[3]-0},gt:function(a,i,m){return i>m[3]-0},nth:function(a,i,m){return m[3]-0==i},eq:function(a,i,m){return m[3]-0==i},first:function(a,i){return i==0},last:function(a,i,m,r){return i==r.length-1},even:function(a,i){return i%2==0},odd:function(a,i){return i%2},"first-child":function(a){return a.parentNode.getElementsByTagName("*")[0]==a},"last-child":function(a){return jQuery.nth(a.parentNode.lastChild,1,"previousSibling")==a},"only-child":function(a){return !jQuery.nth(a.parentNode.lastChild,2,"previousSibling")},parent:function(a){return a.firstChild},empty:function(a){return !a.firstChild},contains:function(a,i,m){return(a.textContent||a.innerText||jQuery(a).text()||"").indexOf(m[3])>=0},visible:function(a){return"hidden"!=a.type&&jQuery.css(a,"display")!="none"&&jQuery.css(a,"visibility")!="hidden"},hidden:function(a){return"hidden"==a.type||jQuery.css(a,"display")=="none"||jQuery.css(a,"visibility")=="hidden"},enabled:function(a){return !a.disabled},disabled:function(a){return a.disabled},checked:function(a){return a.checked},selected:function(a){return a.selected||jQuery.attr(a,"selected")},text:function(a){return"text"==a.type},radio:function(a){return"radio"==a.type},checkbox:function(a){return"checkbox"==a.type},file:function(a){return"file"==a.type},password:function(a){return"password"==a.type},submit:function(a){return"submit"==a.type},image:function(a){return"image"==a.type},reset:function(a){return"reset"==a.type},button:function(a){return"button"==a.type||jQuery.nodeName(a,"button")},input:function(a){return/input|select|textarea|button/i.test(a.nodeName)},has:function(a,i,m){return jQuery.find(m[3],a).length},header:function(a){return/h\d/i.test(a.nodeName)},animated:function(a){return jQuery.grep(jQuery.timers,function(fn){return a==fn.elem}).length}}},parse:[/^(\[) *@?([\w-]+) *([!*$^~=]*) *('?"?)(.*?)\4 *\]/,/^(:)([\w-]+)\("?'?(.*?(\(.*?\))?[^(]*?)"?'?\)/,new RegExp("^([:.#]*)("+chars+"+)")],multiFilter:function(expr,elems,not){var old,cur=[];while(expr&&expr!=old){old=expr;var f=jQuery.filter(expr,elems,not);expr=f.t.replace(/^\s*,\s*/,"");cur=not?elems=f.r:jQuery.merge(cur,f.r)}return cur},find:function(t,context){if(typeof t!="string"){return[t]}if(context&&context.nodeType!=1&&context.nodeType!=9){return[]}context=context||document;var ret=[context],done=[],last,nodeName;while(t&&last!=t){var r=[];last=t;t=jQuery.trim(t);var foundToken=false,re=quickChild,m=re.exec(t);if(m){nodeName=m[1].toUpperCase();for(var i=0;ret[i];i++){for(var c=ret[i].firstChild;c;c=c.nextSibling){if(c.nodeType==1&&(nodeName=="*"||c.nodeName.toUpperCase()==nodeName)){r.push(c)}}}ret=r;t=t.replace(re,"");if(t.indexOf(" ")==0){continue}foundToken=true}else{re=/^([>+~])\s*(\w*)/i;if((m=re.exec(t))!=null){r=[];var merge={};nodeName=m[2].toUpperCase();m=m[1];for(var j=0,rl=ret.length;j<rl;j++){var n=m=="~"||m=="+"?ret[j].nextSibling:ret[j].firstChild;for(;n;n=n.nextSibling){if(n.nodeType==1){var id=jQuery.data(n);if(m=="~"&&merge[id]){break}if(!nodeName||n.nodeName.toUpperCase()==nodeName){if(m=="~"){merge[id]=true}r.push(n)}if(m=="+"){break}}}}ret=r;t=jQuery.trim(t.replace(re,""));foundToken=true}}if(t&&!foundToken){if(!t.indexOf(",")){if(context==ret[0]){ret.shift()}done=jQuery.merge(done,ret);r=ret=[context];t=" "+t.substr(1,t.length)}else{var re2=quickID;var m=re2.exec(t);if(m){m=[0,m[2],m[3],m[1]]}else{re2=quickClass;m=re2.exec(t)}m[2]=m[2].replace(/\\/g,"");var elem=ret[ret.length-1];if(m[1]=="#"&&elem&&elem.getElementById&&!jQuery.isXMLDoc(elem)){var oid=elem.getElementById(m[2]);if((jQuery.browser.msie||jQuery.browser.opera)&&oid&&typeof oid.id=="string"&&oid.id!=m[2]){oid=jQuery('[@id="'+m[2]+'"]',elem)[0]}ret=r=oid&&(!m[3]||jQuery.nodeName(oid,m[3]))?[oid]:[]}else{for(var i=0;ret[i];i++){var tag=m[1]=="#"&&m[3]?m[3]:m[1]!=""||m[0]==""?"*":m[2];if(tag=="*"&&ret[i].nodeName.toLowerCase()=="object"){tag="param"}r=jQuery.merge(r,ret[i].getElementsByTagName(tag))}if(m[1]=="."){r=jQuery.classFilter(r,m[2])}if(m[1]=="#"){var tmp=[];for(var i=0;r[i];i++){if(r[i].getAttribute("id")==m[2]){tmp=[r[i]];break}}r=tmp}ret=r}t=t.replace(re2,"")}}if(t){var val=jQuery.filter(t,r);ret=r=val.r;t=jQuery.trim(val.t)}}if(t){ret=[]}if(ret&&context==ret[0]){ret.shift()}done=jQuery.merge(done,ret);return done},classFilter:function(r,m,not){m=" "+m+" ";var tmp=[];for(var i=0;r[i];i++){var pass=(" "+r[i].className+" ").indexOf(m)>=0;if(!not&&pass||not&&!pass){tmp.push(r[i])}}return tmp},filter:function(t,r,not){var last;while(t&&t!=last){last=t;var p=jQuery.parse,m;for(var i=0;p[i];i++){m=p[i].exec(t);if(m){t=t.substring(m[0].length);m[2]=m[2].replace(/\\/g,"");break}}if(!m){break}if(m[1]==":"&&m[2]=="not"){r=isSimple.test(m[3])?jQuery.filter(m[3],r,true).r:jQuery(r).not(m[3])}else{if(m[1]=="."){r=jQuery.classFilter(r,m[2],not)}else{if(m[1]=="["){var tmp=[],type=m[3];for(var i=0,rl=r.length;i<rl;i++){var a=r[i],z=a[jQuery.props[m[2]]||m[2]];if(z==null||/href|src|selected/.test(m[2])){z=jQuery.attr(a,m[2])||""}if((type==""&&!!z||type=="="&&z==m[5]||type=="!="&&z!=m[5]||type=="^="&&z&&!z.indexOf(m[5])||type=="$="&&z.substr(z.length-m[5].length)==m[5]||(type=="*="||type=="~=")&&z.indexOf(m[5])>=0)^not){tmp.push(a)}}r=tmp}else{if(m[1]==":"&&m[2]=="nth-child"){var merge={},tmp=[],test=/(-?)(\d*)n((?:\+|-)?\d*)/.exec(m[3]=="even"&&"2n"||m[3]=="odd"&&"2n+1"||!/\D/.test(m[3])&&"0n+"+m[3]||m[3]),first=(test[1]+(test[2]||1))-0,last=test[3]-0;for(var i=0,rl=r.length;i<rl;i++){var node=r[i],parentNode=node.parentNode,id=jQuery.data(parentNode);if(!merge[id]){var c=1;for(var n=parentNode.firstChild;n;n=n.nextSibling){if(n.nodeType==1){n.nodeIndex=c++}}merge[id]=true}var add=false;if(first==0){if(node.nodeIndex==last){add=true}}else{if((node.nodeIndex-last)%first==0&&(node.nodeIndex-last)/first>=0){add=true}}if(add^not){tmp.push(node)}}r=tmp}else{var fn=jQuery.expr[m[1]];if(typeof fn=="object"){fn=fn[m[2]]}if(typeof fn=="string"){fn=eval("false||function(a,i){return "+fn+";}")}r=jQuery.grep(r,function(elem,i){return fn(elem,i,m,r)},not)}}}}}return{r:r,t:t}},dir:function(elem,dir){var matched=[],cur=elem[dir];while(cur&&cur!=document){if(cur.nodeType==1){matched.push(cur)}cur=cur[dir]}return matched},nth:function(cur,result,dir,elem){result=result||1;var num=0;for(;cur;cur=cur[dir]){if(cur.nodeType==1&&++num==result){break}}return cur},sibling:function(n,elem){var r=[];for(;n;n=n.nextSibling){if(n.nodeType==1&&n!=elem){r.push(n)}}return r}});jQuery.event={add:function(elem,types,handler,data){if(elem.nodeType==3||elem.nodeType==8){return}if(jQuery.browser.msie&&elem.setInterval){elem=window}if(!handler.guid){handler.guid=this.guid++}if(data!=undefined){var fn=handler;handler=this.proxy(fn,function(){return fn.apply(this,arguments)});handler.data=data}var events=jQuery.data(elem,"events")||jQuery.data(elem,"events",{}),handle=jQuery.data(elem,"handle")||jQuery.data(elem,"handle",function(){if(typeof jQuery!="undefined"&&!jQuery.event.triggered){return jQuery.event.handle.apply(arguments.callee.elem,arguments)}});handle.elem=elem;jQuery.each(types.split(/\s+/),function(index,type){var parts=type.split(".");type=parts[0];handler.type=parts[1];var handlers=events[type];if(!handlers){handlers=events[type]={};if(!jQuery.event.special[type]||jQuery.event.special[type].setup.call(elem)===false){if(elem.addEventListener){elem.addEventListener(type,handle,false)}else{if(elem.attachEvent){elem.attachEvent("on"+type,handle)}}}}handlers[handler.guid]=handler;jQuery.event.global[type]=true});elem=null},guid:1,global:{},remove:function(elem,types,handler){if(elem.nodeType==3||elem.nodeType==8){return}var events=jQuery.data(elem,"events"),ret,index;if(events){if(types==undefined||(typeof types=="string"&&types.charAt(0)==".")){for(var type in events){this.remove(elem,type+(types||""))}}else{if(types.type){handler=types.handler;types=types.type}jQuery.each(types.split(/\s+/),function(index,type){var parts=type.split(".");type=parts[0];if(events[type]){if(handler){delete events[type][handler.guid]}else{for(handler in events[type]){if(!parts[1]||events[type][handler].type==parts[1]){delete events[type][handler]}}}for(ret in events[type]){break}if(!ret){if(!jQuery.event.special[type]||jQuery.event.special[type].teardown.call(elem)===false){if(elem.removeEventListener){elem.removeEventListener(type,jQuery.data(elem,"handle"),false)}else{if(elem.detachEvent){elem.detachEvent("on"+type,jQuery.data(elem,"handle"))}}}ret=null;delete events[type]}}})}for(ret in events){break}if(!ret){var handle=jQuery.data(elem,"handle");if(handle){handle.elem=null}jQuery.removeData(elem,"events");jQuery.removeData(elem,"handle")}}},trigger:function(type,data,elem,donative,extra){data=jQuery.makeArray(data);if(type.indexOf("!")>=0){type=type.slice(0,-1);var exclusive=true}if(!elem){if(this.global[type]){jQuery("*").add([window,document]).trigger(type,data)}}else{if(elem.nodeType==3||elem.nodeType==8){return undefined}var val,ret,fn=jQuery.isFunction(elem[type]||null),event=!data[0]||!data[0].preventDefault;if(event){data.unshift({type:type,target:elem,preventDefault:function(){},stopPropagation:function(){},timeStamp:now()});data[0][expando]=true}data[0].type=type;if(exclusive){data[0].exclusive=true}var handle=jQuery.data(elem,"handle");if(handle){val=handle.apply(elem,data)}if((!fn||(jQuery.nodeName(elem,"a")&&type=="click"))&&elem["on"+type]&&elem["on"+type].apply(elem,data)===false){val=false}if(event){data.shift()}if(extra&&jQuery.isFunction(extra)){ret=extra.apply(elem,val==null?data:data.concat(val));if(ret!==undefined){val=ret}}if(fn&&donative!==false&&val!==false&&!(jQuery.nodeName(elem,"a")&&type=="click")){this.triggered=true;try{elem[type]()}catch(e){}}this.triggered=false}return val},handle:function(event){var val,ret,namespace,all,handlers;event=arguments[0]=jQuery.event.fix(event||window.event);namespace=event.type.split(".");event.type=namespace[0];namespace=namespace[1];all=!namespace&&!event.exclusive;handlers=(jQuery.data(this,"events")||{})[event.type];for(var j in handlers){var handler=handlers[j];if(all||handler.type==namespace){event.handler=handler;event.data=handler.data;ret=handler.apply(this,arguments);if(val!==false){val=ret}if(ret===false){event.preventDefault();event.stopPropagation()}}}return val},fix:function(event){if(event[expando]==true){return event}var originalEvent=event;event={originalEvent:originalEvent};var props="altKey attrChange attrName bubbles button cancelable charCode clientX clientY ctrlKey currentTarget data detail eventPhase fromElement handler keyCode metaKey newValue originalTarget pageX pageY prevValue relatedNode relatedTarget screenX screenY shiftKey srcElement target timeStamp toElement type view wheelDelta which".split(" ");for(var i=props.length;i;i--){event[props[i]]=originalEvent[props[i]]}event[expando]=true;event.preventDefault=function(){if(originalEvent.preventDefault){originalEvent.preventDefault()}originalEvent.returnValue=false};event.stopPropagation=function(){if(originalEvent.stopPropagation){originalEvent.stopPropagation()}originalEvent.cancelBubble=true};event.timeStamp=event.timeStamp||now();if(!event.target){event.target=event.srcElement||document}if(event.target.nodeType==3){event.target=event.target.parentNode}if(!event.relatedTarget&&event.fromElement){event.relatedTarget=event.fromElement==event.target?event.toElement:event.fromElement}if(event.pageX==null&&event.clientX!=null){var doc=document.documentElement,body=document.body;event.pageX=event.clientX+(doc&&doc.scrollLeft||body&&body.scrollLeft||0)-(doc.clientLeft||0);event.pageY=event.clientY+(doc&&doc.scrollTop||body&&body.scrollTop||0)-(doc.clientTop||0)}if(!event.which&&((event.charCode||event.charCode===0)?event.charCode:event.keyCode)){event.which=event.charCode||event.keyCode}if(!event.metaKey&&event.ctrlKey){event.metaKey=event.ctrlKey}if(!event.which&&event.button){event.which=(event.button&1?1:(event.button&2?3:(event.button&4?2:0)))}return event},proxy:function(fn,proxy){proxy.guid=fn.guid=fn.guid||proxy.guid||this.guid++;return proxy},special:{ready:{setup:function(){bindReady();return},teardown:function(){return}},mouseenter:{setup:function(){if(jQuery.browser.msie){return false}jQuery(this).bind("mouseover",jQuery.event.special.mouseenter.handler);return true},teardown:function(){if(jQuery.browser.msie){return false}jQuery(this).unbind("mouseover",jQuery.event.special.mouseenter.handler);return true},handler:function(event){if(withinElement(event,this)){return true}event.type="mouseenter";return jQuery.event.handle.apply(this,arguments)}},mouseleave:{setup:function(){if(jQuery.browser.msie){return false}jQuery(this).bind("mouseout",jQuery.event.special.mouseleave.handler);return true},teardown:function(){if(jQuery.browser.msie){return false}jQuery(this).unbind("mouseout",jQuery.event.special.mouseleave.handler);return true},handler:function(event){if(withinElement(event,this)){return true}event.type="mouseleave";return jQuery.event.handle.apply(this,arguments)}}}};jQuery.fn.extend({bind:function(type,data,fn){return type=="unload"?this.one(type,data,fn):this.each(function(){jQuery.event.add(this,type,fn||data,fn&&data)})},one:function(type,data,fn){var one=jQuery.event.proxy(fn||data,function(event){jQuery(this).unbind(event,one);return(fn||data).apply(this,arguments)});return this.each(function(){jQuery.event.add(this,type,one,fn&&data)})},unbind:function(type,fn){return this.each(function(){jQuery.event.remove(this,type,fn)})},trigger:function(type,data,fn){return this.each(function(){jQuery.event.trigger(type,data,this,true,fn)})},triggerHandler:function(type,data,fn){return this[0]&&jQuery.event.trigger(type,data,this[0],false,fn)},toggle:function(fn){var args=arguments,i=1;while(i<args.length){jQuery.event.proxy(fn,args[i++])}return this.click(jQuery.event.proxy(fn,function(event){this.lastToggle=(this.lastToggle||0)%i;event.preventDefault();return args[this.lastToggle++].apply(this,arguments)||false}))},hover:function(fnOver,fnOut){return this.bind("mouseenter",fnOver).bind("mouseleave",fnOut)},ready:function(fn){bindReady();if(jQuery.isReady){fn.call(document,jQuery)}else{jQuery.readyList.push(function(){return fn.call(this,jQuery)})}return this}});jQuery.extend({isReady:false,readyList:[],ready:function(){if(!jQuery.isReady){jQuery.isReady=true;if(jQuery.readyList){jQuery.each(jQuery.readyList,function(){this.call(document)});jQuery.readyList=null}jQuery(document).triggerHandler("ready")}}});var readyBound=false;function bindReady(){if(readyBound){return}readyBound=true;if(document.addEventListener&&!jQuery.browser.opera){document.addEventListener("DOMContentLoaded",jQuery.ready,false)}if(jQuery.browser.msie&&window==top){(function(){if(jQuery.isReady){return}try{document.documentElement.doScroll("left")}catch(error){setTimeout(arguments.callee,0);return}jQuery.ready()})()}if(jQuery.browser.opera){document.addEventListener("DOMContentLoaded",function(){if(jQuery.isReady){return}for(var i=0;i<document.styleSheets.length;i++){if(document.styleSheets[i].disabled){setTimeout(arguments.callee,0);return}}jQuery.ready()},false)}if(jQuery.browser.safari){var numStyles;(function(){if(jQuery.isReady){return}if(document.readyState!="loaded"&&document.readyState!="complete"){setTimeout(arguments.callee,0);return}if(numStyles===undefined){numStyles=jQuery("style, link[rel=stylesheet]").length}if(document.styleSheets.length!=numStyles){setTimeout(arguments.callee,0);return}jQuery.ready()})()}jQuery.event.add(window,"load",jQuery.ready)}jQuery.each(("blur,focus,load,resize,scroll,unload,click,dblclick,mousedown,mouseup,mousemove,mouseover,mouseout,change,select,submit,keydown,keypress,keyup,error").split(","),function(i,name){jQuery.fn[name]=function(fn){return fn?this.bind(name,fn):this.trigger(name)}});var withinElement=function(event,elem){var parent=event.relatedTarget;while(parent&&parent!=elem){try{parent=parent.parentNode}catch(error){parent=elem}}return parent==elem};jQuery(window).bind("unload",function(){jQuery("*").add(document).unbind()});jQuery.fn.extend({_load:jQuery.fn.load,load:function(url,params,callback){if(typeof url!="string"){return this._load(url)}var off=url.indexOf(" ");if(off>=0){var selector=url.slice(off,url.length);url=url.slice(0,off)}callback=callback||function(){};var type="GET";if(params){if(jQuery.isFunction(params)){callback=params;params=null}else{params=jQuery.param(params);type="POST"}}var self=this;jQuery.ajax({url:url,type:type,dataType:"html",data:params,complete:function(res,status){if(status=="success"||status=="notmodified"){self.html(selector?jQuery("<div/>").append(res.responseText.replace(/<script(.|\s)*?\/script>/g,"")).find(selector):res.responseText)}self.each(callback,[res.responseText,status,res])}});return this},serialize:function(){return jQuery.param(this.serializeArray())},serializeArray:function(){return this.map(function(){return jQuery.nodeName(this,"form")?jQuery.makeArray(this.elements):this}).filter(function(){return this.name&&!this.disabled&&(this.checked||/select|textarea/i.test(this.nodeName)||/text|hidden|password/i.test(this.type))}).map(function(i,elem){var val=jQuery(this).val();return val==null?null:val.constructor==Array?jQuery.map(val,function(val,i){return{name:elem.name,value:val}}):{name:elem.name,value:val}}).get()}});jQuery.each("ajaxStart,ajaxStop,ajaxComplete,ajaxError,ajaxSuccess,ajaxSend".split(","),function(i,o){jQuery.fn[o]=function(f){return this.bind(o,f)}});var jsc=now();jQuery.extend({get:function(url,data,callback,type){if(jQuery.isFunction(data)){callback=data;data=null}return jQuery.ajax({type:"GET",url:url,data:data,success:callback,dataType:type})},getScript:function(url,callback){return jQuery.get(url,null,callback,"script")},getJSON:function(url,data,callback){return jQuery.get(url,data,callback,"json")},post:function(url,data,callback,type){if(jQuery.isFunction(data)){callback=data;data={}}return jQuery.ajax({type:"POST",url:url,data:data,success:callback,dataType:type})},ajaxSetup:function(settings){jQuery.extend(jQuery.ajaxSettings,settings)},ajaxSettings:{url:location.href,global:true,type:"GET",timeout:0,contentType:"application/x-www-form-urlencoded",processData:true,async:true,data:null,username:null,password:null,accepts:{xml:"application/xml, text/xml",html:"text/html",script:"text/javascript, application/javascript",json:"application/json, text/javascript",text:"text/plain",_default:"*/*"}},lastModified:{},ajax:function(s){s=jQuery.extend(true,s,jQuery.extend(true,{},jQuery.ajaxSettings,s));var jsonp,jsre=/=\?(&|$)/g,status,data,type=s.type.toUpperCase();if(s.data&&s.processData&&typeof s.data!="string"){s.data=jQuery.param(s.data)}if(s.dataType=="jsonp"){if(type=="GET"){if(!s.url.match(jsre)){s.url+=(s.url.match(/\?/)?"&":"?")+(s.jsonp||"callback")+"=?"}}else{if(!s.data||!s.data.match(jsre)){s.data=(s.data?s.data+"&":"")+(s.jsonp||"callback")+"=?"}}s.dataType="json"}if(s.dataType=="json"&&(s.data&&s.data.match(jsre)||s.url.match(jsre))){jsonp="jsonp"+jsc++;if(s.data){s.data=(s.data+"").replace(jsre,"="+jsonp+"$1")}s.url=s.url.replace(jsre,"="+jsonp+"$1");s.dataType="script";window[jsonp]=function(tmp){data=tmp;success();complete();window[jsonp]=undefined;try{delete window[jsonp]}catch(e){}if(head){head.removeChild(script)}}}if(s.dataType=="script"&&s.cache==null){s.cache=false}if(s.cache===false&&type=="GET"){var ts=now();var ret=s.url.replace(/(\?|&)_=.*?(&|$)/,"$1_="+ts+"$2");s.url=ret+((ret==s.url)?(s.url.match(/\?/)?"&":"?")+"_="+ts:"")}if(s.data&&type=="GET"){s.url+=(s.url.match(/\?/)?"&":"?")+s.data;s.data=null}if(s.global&&!jQuery.active++){jQuery.event.trigger("ajaxStart")}var remote=/^(?:\w+:)?\/\/([^\/?#]+)/;if(s.dataType=="script"&&type=="GET"&&remote.test(s.url)&&remote.exec(s.url)[1]!=location.host){var head=document.getElementsByTagName("head")[0];var script=document.createElement("script");script.src=s.url;if(s.scriptCharset){script.charset=s.scriptCharset}if(!jsonp){var done=false;script.onload=script.onreadystatechange=function(){if(!done&&(!this.readyState||this.readyState=="loaded"||this.readyState=="complete")){done=true;success();complete();head.removeChild(script)}}}head.appendChild(script);return undefined}var requestDone=false;var xhr=window.ActiveXObject?new ActiveXObject("Microsoft.XMLHTTP"):new XMLHttpRequest();if(s.username){xhr.open(type,s.url,s.async,s.username,s.password)}else{xhr.open(type,s.url,s.async)}try{if(s.data){xhr.setRequestHeader("Content-Type",s.contentType)}if(s.ifModified){xhr.setRequestHeader("If-Modified-Since",jQuery.lastModified[s.url]||"Thu, 01 Jan 1970 00:00:00 GMT")}xhr.setRequestHeader("X-Requested-With","XMLHttpRequest");xhr.setRequestHeader("Accept",s.dataType&&s.accepts[s.dataType]?s.accepts[s.dataType]+", */*":s.accepts._default)}catch(e){}if(s.beforeSend&&s.beforeSend(xhr,s)===false){s.global&&jQuery.active--;xhr.abort();return false}if(s.global){jQuery.event.trigger("ajaxSend",[xhr,s])}var onreadystatechange=function(isTimeout){if(!requestDone&&xhr&&(xhr.readyState==4||isTimeout=="timeout")){requestDone=true;if(ival){clearInterval(ival);ival=null}status=isTimeout=="timeout"&&"timeout"||!jQuery.httpSuccess(xhr)&&"error"||s.ifModified&&jQuery.httpNotModified(xhr,s.url)&&"notmodified"||"success";if(status=="success"){try{data=jQuery.httpData(xhr,s.dataType,s.dataFilter)}catch(e){status="parsererror"}}if(status=="success"){var modRes;try{modRes=xhr.getResponseHeader("Last-Modified")}catch(e){}if(s.ifModified&&modRes){jQuery.lastModified[s.url]=modRes}if(!jsonp){success()}}else{jQuery.handleError(s,xhr,status)}complete();if(s.async){xhr=null}}};if(s.async){var ival=setInterval(onreadystatechange,13);if(s.timeout>0){setTimeout(function(){if(xhr){xhr.abort();if(!requestDone){onreadystatechange("timeout")}}},s.timeout)}}try{xhr.send(s.data)}catch(e){jQuery.handleError(s,xhr,null,e)}if(!s.async){onreadystatechange()}function success(){if(s.success){s.success(data,status)}if(s.global){jQuery.event.trigger("ajaxSuccess",[xhr,s])}}function complete(){if(s.complete){s.complete(xhr,status)}if(s.global){jQuery.event.trigger("ajaxComplete",[xhr,s])}if(s.global&&!--jQuery.active){jQuery.event.trigger("ajaxStop")}}return xhr},handleError:function(s,xhr,status,e){if(s.error){s.error(xhr,status,e)}if(s.global){jQuery.event.trigger("ajaxError",[xhr,s,e])}},active:0,httpSuccess:function(xhr){try{return !xhr.status&&location.protocol=="file:"||(xhr.status>=200&&xhr.status<300)||xhr.status==304||xhr.status==1223||jQuery.browser.safari&&xhr.status==undefined}catch(e){}return false},httpNotModified:function(xhr,url){try{var xhrRes=xhr.getResponseHeader("Last-Modified");return xhr.status==304||xhrRes==jQuery.lastModified[url]||jQuery.browser.safari&&xhr.status==undefined}catch(e){}return false},httpData:function(xhr,type,filter){var ct=xhr.getResponseHeader("content-type"),xml=type=="xml"||!type&&ct&&ct.indexOf("xml")>=0,data=xml?xhr.responseXML:xhr.responseText;if(xml&&data.documentElement.tagName=="parsererror"){throw"parsererror"}if(filter){data=filter(data,type)}if(type=="script"){jQuery.globalEval(data)}if(type=="json"){data=eval("("+data+")")}return data},param:function(a){var s=[];if(a.constructor==Array||a.jquery){jQuery.each(a,function(){s.push(encodeURIComponent(this.name)+"="+encodeURIComponent(this.value))})}else{for(var j in a){if(a[j]&&a[j].constructor==Array){jQuery.each(a[j],function(){s.push(encodeURIComponent(j)+"="+encodeURIComponent(this))})}else{s.push(encodeURIComponent(j)+"="+encodeURIComponent(jQuery.isFunction(a[j])?a[j]():a[j]))}}}return s.join("&").replace(/%20/g,"+")}});jQuery.fn.extend({show:function(speed,callback){return speed?this.animate({height:"show",width:"show",opacity:"show"},speed,callback):this.filter(":hidden").each(function(){this.style.display=this.oldblock||"";if(jQuery.css(this,"display")=="none"){var elem=jQuery("<"+this.tagName+" />").appendTo("body");this.style.display=elem.css("display");if(this.style.display=="none"){this.style.display="block"}elem.remove()}}).end()},hide:function(speed,callback){return speed?this.animate({height:"hide",width:"hide",opacity:"hide"},speed,callback):this.filter(":visible").each(function(){this.oldblock=this.oldblock||jQuery.css(this,"display");this.style.display="none"}).end()},_toggle:jQuery.fn.toggle,toggle:function(fn,fn2){return jQuery.isFunction(fn)&&jQuery.isFunction(fn2)?this._toggle.apply(this,arguments):fn?this.animate({height:"toggle",width:"toggle",opacity:"toggle"},fn,fn2):this.each(function(){jQuery(this)[jQuery(this).is(":hidden")?"show":"hide"]()})},slideDown:function(speed,callback){return this.animate({height:"show"},speed,callback)},slideUp:function(speed,callback){return this.animate({height:"hide"},speed,callback)},slideToggle:function(speed,callback){return this.animate({height:"toggle"},speed,callback)},fadeIn:function(speed,callback){return this.animate({opacity:"show"},speed,callback)},fadeOut:function(speed,callback){return this.animate({opacity:"hide"},speed,callback)},fadeTo:function(speed,to,callback){return this.animate({opacity:to},speed,callback)},animate:function(prop,speed,easing,callback){var optall=jQuery.speed(speed,easing,callback);return this[optall.queue===false?"each":"queue"](function(){if(this.nodeType!=1){return false}var opt=jQuery.extend({},optall),p,hidden=jQuery(this).is(":hidden"),self=this;for(p in prop){if(prop[p]=="hide"&&hidden||prop[p]=="show"&&!hidden){return opt.complete.call(this)}if(p=="height"||p=="width"){opt.display=jQuery.css(this,"display");opt.overflow=this.style.overflow}}if(opt.overflow!=null){this.style.overflow="hidden"}opt.curAnim=jQuery.extend({},prop);jQuery.each(prop,function(name,val){var e=new jQuery.fx(self,opt,name);if(/toggle|show|hide/.test(val)){e[val=="toggle"?hidden?"show":"hide":val](prop)}else{var parts=val.toString().match(/^([+-]=)?([\d+-.]+)(.*)$/),start=e.cur(true)||0;if(parts){var end=parseFloat(parts[2]),unit=parts[3]||"px";if(unit!="px"){self.style[name]=(end||1)+unit;start=((end||1)/e.cur(true))*start;self.style[name]=start+unit}if(parts[1]){end=((parts[1]=="-="?-1:1)*end)+start}e.custom(start,end,unit)}else{e.custom(start,val,"")}}});return true})},queue:function(type,fn){if(jQuery.isFunction(type)||(type&&type.constructor==Array)){fn=type;type="fx"}if(!type||(typeof type=="string"&&!fn)){return queue(this[0],type)}return this.each(function(){if(fn.constructor==Array){queue(this,type,fn)}else{queue(this,type).push(fn);if(queue(this,type).length==1){fn.call(this)}}})},stop:function(clearQueue,gotoEnd){var timers=jQuery.timers;if(clearQueue){this.queue([])}this.each(function(){for(var i=timers.length-1;i>=0;i--){if(timers[i].elem==this){if(gotoEnd){timers[i](true)}timers.splice(i,1)}}});if(!gotoEnd){this.dequeue()}return this}});var queue=function(elem,type,array){if(elem){type=type||"fx";var q=jQuery.data(elem,type+"queue");if(!q||array){q=jQuery.data(elem,type+"queue",jQuery.makeArray(array))}}return q};jQuery.fn.dequeue=function(type){type=type||"fx";return this.each(function(){var q=queue(this,type);q.shift();if(q.length){q[0].call(this)}})};jQuery.extend({speed:function(speed,easing,fn){var opt=speed&&speed.constructor==Object?speed:{complete:fn||!fn&&easing||jQuery.isFunction(speed)&&speed,duration:speed,easing:fn&&easing||easing&&easing.constructor!=Function&&easing};opt.duration=(opt.duration&&opt.duration.constructor==Number?opt.duration:jQuery.fx.speeds[opt.duration])||jQuery.fx.speeds.def;opt.old=opt.complete;opt.complete=function(){if(opt.queue!==false){jQuery(this).dequeue()}if(jQuery.isFunction(opt.old)){opt.old.call(this)}};return opt},easing:{linear:function(p,n,firstNum,diff){return firstNum+diff*p},swing:function(p,n,firstNum,diff){return((-Math.cos(p*Math.PI)/2)+0.5)*diff+firstNum}},timers:[],timerId:null,fx:function(elem,options,prop){this.options=options;this.elem=elem;this.prop=prop;if(!options.orig){options.orig={}}}});jQuery.fx.prototype={update:function(){if(this.options.step){this.options.step.call(this.elem,this.now,this)}(jQuery.fx.step[this.prop]||jQuery.fx.step._default)(this);if(this.prop=="height"||this.prop=="width"){this.elem.style.display="block"}},cur:function(force){if(this.elem[this.prop]!=null&&this.elem.style[this.prop]==null){return this.elem[this.prop]}var r=parseFloat(jQuery.css(this.elem,this.prop,force));return r&&r>-10000?r:parseFloat(jQuery.curCSS(this.elem,this.prop))||0},custom:function(from,to,unit){this.startTime=now();this.start=from;this.end=to;this.unit=unit||this.unit||"px";this.now=this.start;this.pos=this.state=0;this.update();var self=this;function t(gotoEnd){return self.step(gotoEnd)}t.elem=this.elem;jQuery.timers.push(t);if(jQuery.timerId==null){jQuery.timerId=setInterval(function(){var timers=jQuery.timers;for(var i=0;i<timers.length;i++){if(!timers[i]()){timers.splice(i--,1)}}if(!timers.length){clearInterval(jQuery.timerId);jQuery.timerId=null}},13)}},show:function(){this.options.orig[this.prop]=jQuery.attr(this.elem.style,this.prop);this.options.show=true;this.custom(0,this.cur());if(this.prop=="width"||this.prop=="height"){this.elem.style[this.prop]="1px"}jQuery(this.elem).show()},hide:function(){this.options.orig[this.prop]=jQuery.attr(this.elem.style,this.prop);this.options.hide=true;this.custom(this.cur(),0)},step:function(gotoEnd){var t=now();if(gotoEnd||t>this.options.duration+this.startTime){this.now=this.end;this.pos=this.state=1;this.update();this.options.curAnim[this.prop]=true;var done=true;for(var i in this.options.curAnim){if(this.options.curAnim[i]!==true){done=false}}if(done){if(this.options.display!=null){this.elem.style.overflow=this.options.overflow;this.elem.style.display=this.options.display;if(jQuery.css(this.elem,"display")=="none"){this.elem.style.display="block"}}if(this.options.hide){this.elem.style.display="none"}if(this.options.hide||this.options.show){for(var p in this.options.curAnim){jQuery.attr(this.elem.style,p,this.options.orig[p])}}}if(done){this.options.complete.call(this.elem)}return false}else{var n=t-this.startTime;this.state=n/this.options.duration;this.pos=jQuery.easing[this.options.easing||(jQuery.easing.swing?"swing":"linear")](this.state,n,0,1,this.options.duration);this.now=this.start+((this.end-this.start)*this.pos);this.update()}return true}};jQuery.extend(jQuery.fx,{speeds:{slow:600,fast:200,def:400},step:{scrollLeft:function(fx){fx.elem.scrollLeft=fx.now},scrollTop:function(fx){fx.elem.scrollTop=fx.now},opacity:function(fx){jQuery.attr(fx.elem.style,"opacity",fx.now)},_default:function(fx){fx.elem.style[fx.prop]=fx.now+fx.unit}}});jQuery.fn.offset=function(){var left=0,top=0,elem=this[0],results;if(elem){with(jQuery.browser){var parent=elem.parentNode,offsetChild=elem,offsetParent=elem.offsetParent,doc=elem.ownerDocument,safari2=safari&&parseInt(version)<522&&!/adobeair/i.test(userAgent),css=jQuery.curCSS,fixed=css(elem,"position")=="fixed";if(elem.getBoundingClientRect){var box=elem.getBoundingClientRect();add(box.left+Math.max(doc.documentElement.scrollLeft,doc.body.scrollLeft),box.top+Math.max(doc.documentElement.scrollTop,doc.body.scrollTop));add(-doc.documentElement.clientLeft,-doc.documentElement.clientTop)}else{add(elem.offsetLeft,elem.offsetTop);while(offsetParent){add(offsetParent.offsetLeft,offsetParent.offsetTop);if(mozilla&&!/^t(able|d|h)$/i.test(offsetParent.tagName)||safari&&!safari2){border(offsetParent)}if(!fixed&&css(offsetParent,"position")=="fixed"){fixed=true}offsetChild=/^body$/i.test(offsetParent.tagName)?offsetChild:offsetParent;offsetParent=offsetParent.offsetParent}while(parent&&parent.tagName&&!/^body|html$/i.test(parent.tagName)){if(!/^inline|table.*$/i.test(css(parent,"display"))){add(-parent.scrollLeft,-parent.scrollTop)}if(mozilla&&css(parent,"overflow")!="visible"){border(parent)}parent=parent.parentNode}if((safari2&&(fixed||css(offsetChild,"position")=="absolute"))||(mozilla&&css(offsetChild,"position")!="absolute")){add(-doc.body.offsetLeft,-doc.body.offsetTop)}if(fixed){add(Math.max(doc.documentElement.scrollLeft,doc.body.scrollLeft),Math.max(doc.documentElement.scrollTop,doc.body.scrollTop))}}results={top:top,left:left}}}function border(elem){add(jQuery.curCSS(elem,"borderLeftWidth",true),jQuery.curCSS(elem,"borderTopWidth",true))}function add(l,t){left+=parseInt(l,10)||0;top+=parseInt(t,10)||0}return results};jQuery.fn.extend({position:function(){var left=0,top=0,results;if(this[0]){var offsetParent=this.offsetParent(),offset=this.offset(),parentOffset=/^body|html$/i.test(offsetParent[0].tagName)?{top:0,left:0}:offsetParent.offset();offset.top-=num(this,"marginTop");offset.left-=num(this,"marginLeft");parentOffset.top+=num(offsetParent,"borderTopWidth");parentOffset.left+=num(offsetParent,"borderLeftWidth");results={top:offset.top-parentOffset.top,left:offset.left-parentOffset.left}}return results},offsetParent:function(){var offsetParent=this[0].offsetParent;while(offsetParent&&(!/^body|html$/i.test(offsetParent.tagName)&&jQuery.css(offsetParent,"position")=="static")){offsetParent=offsetParent.offsetParent}return jQuery(offsetParent)}});jQuery.each(["Left","Top"],function(i,name){var method="scroll"+name;jQuery.fn[method]=function(val){if(!this[0]){return}return val!=undefined?this.each(function(){this==window||this==document?window.scrollTo(!i?val:jQuery(window).scrollLeft(),i?val:jQuery(window).scrollTop()):this[method]=val}):this[0]==window||this[0]==document?self[i?"pageYOffset":"pageXOffset"]||jQuery.boxModel&&document.documentElement[method]||document.body[method]:this[0][method]}});jQuery.each(["Height","Width"],function(i,name){var tl=i?"Left":"Top",br=i?"Right":"Bottom";jQuery.fn["inner"+name]=function(){return this[name.toLowerCase()]()+num(this,"padding"+tl)+num(this,"padding"+br)};jQuery.fn["outer"+name]=function(margin){return this["inner"+name]()+num(this,"border"+tl+"Width")+num(this,"border"+br+"Width")+(margin?num(this,"margin"+tl)+num(this,"margin"+br):0)}})})();function redirect(a){top.location.href=a;return false}function getElementsByClass(a){return jq("."+a).map(function(c,b){return b})}function toggle_head(a){items=getElementsByClass("head_"+a);for(i=0;i<items.length;i++){if(items[i].style.display!="none"){items[i].style.display="none"}else{items[i].style.display=""}}}function get_url_query_param(b){b=b.replace(/[\[]/,"\\[").replace(/[\]]/,"\\]");var a="[\\?&]"+b+"=([^&#]*)";var d=new RegExp(a);var c=d.exec(window.location.href);if(c==null){return""}else{return c[1]}}function ScrollToElement(a){jq.scrollTo(a,"fast",{offset:-200,axes:"x"})}function show_abstract(a){a.show("normal");var b=a.parent().find("img.toggle");if(b){b.attr("src","img/minustop.gif")}b=a.find(".pubimage");if(b&&b.attr("alt")){b.attr("src",b.attr("alt"))}return false}function hide_abstract(a){a.hide("normal");var b=a.parent().find("img.toggle");if(b){b.attr("src","img/plustop.gif")}if(b){b.attr("src","")}return false}function hide_all_abstracts(){jq(".abstract").each(function(b,a){hide_abstract(jq(a))})}function show_all_visible_abstracts(b){b=b||"#publication_list";var a=jq(b).find("li").not(".searchlight_hide_nomatch").find(".abstract");a.map(function(d,c){show_abstract(jq(c))})}(function(a){a.fn.extend({autocomplete:function(b,c){var d=typeof b=="string";c=a.extend({},a.Autocompleter.defaults,{url:d?b:null,data:d?null:b,delay:d?a.Autocompleter.defaults.delay:10,max:c&&!c.scroll?10:150},c);c.highlight=c.highlight||function(e){return e};c.formatMatch=c.formatMatch||c.formatItem;return this.each(function(){new a.Autocompleter(this,c)})},result:function(b){return this.bind("result",b)},search:function(b){return this.trigger("search",[b])},flushCache:function(){return this.trigger("flushCache")},setOptions:function(b){return this.trigger("setOptions",[b])},unautocomplete:function(){return this.trigger("unautocomplete")}});a.Autocompleter=function(m,g){var c={UP:38,DOWN:40,DEL:46,TAB:9,RETURN:13,ESC:27,COMMA:188,PAGEUP:33,PAGEDOWN:34,BACKSPACE:8};var b=a(m).attr("autocomplete","off").addClass(g.inputClass);var k;var q="";var n=a.Autocompleter.Cache(g);var e=0;var v;var y={mouseDownOnSelect:false};var s=a.Autocompleter.Select(g,m,d,y);var x;a.browser.opera&&a(m.form).bind("submit.autocomplete",function(){if(x){x=false;return false}});b.bind((a.browser.opera?"keypress":"keydown")+".autocomplete",function(z){v=z.keyCode;switch(z.keyCode){case c.UP:z.preventDefault();if(s.visible()){s.prev()}else{u(0,true)}break;case c.DOWN:z.preventDefault();if(s.visible()){s.next()}else{u(0,true)}break;case c.PAGEUP:z.preventDefault();if(s.visible()){s.pageUp()}else{u(0,true)}break;case c.PAGEDOWN:z.preventDefault();if(s.visible()){s.pageDown()}else{u(0,true)}break;case g.multiple&&a.trim(g.multipleSeparator)==","&&c.COMMA:case c.TAB:case c.RETURN:if(d()){z.preventDefault();x=true;return false}break;case c.ESC:s.hide();break;default:clearTimeout(k);k=setTimeout(u,g.delay);break}}).focus(function(){e++}).blur(function(){e=0;if(!y.mouseDownOnSelect){t()}}).click(function(){if(e++>1&&!s.visible()){u(0,true)}}).bind("search",function(){var z=(arguments.length>1)?arguments[1]:null;function A(E,D){var B;if(D&&D.length){for(var C=0;C<D.length;C++){if(D[C].result.toLowerCase()==E.toLowerCase()){B=D[C];break}}}if(typeof z=="function"){z(B)}else{b.trigger("result",B&&[B.data,B.value])}}a.each(h(b.val()),function(B,C){f(C,A,A)})}).bind("flushCache",function(){n.flush()}).bind("setOptions",function(){a.extend(g,arguments[1]);if("data" in arguments[1]){n.populate()}}).bind("unautocomplete",function(){s.unbind();b.unbind();a(m.form).unbind(".autocomplete")});function d(){var A=s.selected();if(!A){return false}var z=A.result;q=z;if(g.multiple){var B=h(b.val());if(B.length>1){z=B.slice(0,B.length-1).join(g.multipleSeparator)+g.multipleSeparator+z}z+=g.multipleSeparator}b.val(z);w();b.trigger("result",[A.data,A.value]);return true}function u(B,A){if(v==c.DEL){s.hide();return}var z=b.val();if(!A&&z==q){return}q=z;z=j(z);if(z.length>=g.minChars){b.addClass(g.loadingClass);if(!g.matchCase){z=z.toLowerCase()}f(z,l,w)}else{o();s.hide()}}function h(A){if(!A){return[""]}var B=A.split(g.multipleSeparator);var z=[];a.each(B,function(C,D){if(a.trim(D)){z[C]=a.trim(D)}});return z}function j(z){if(!g.multiple){return z}var A=h(z);return A[A.length-1]}function r(z,A){if(g.autoFill&&(j(b.val()).toLowerCase()==z.toLowerCase())&&v!=c.BACKSPACE){b.val(b.val()+A.substring(j(q).length));a.Autocompleter.Selection(m,q.length,q.length+A.length)}}function t(){clearTimeout(k);k=setTimeout(w,200)}function w(){var z=s.visible();s.hide();clearTimeout(k);o();if(g.mustMatch){b.search(function(A){if(!A){if(g.multiple){var B=h(b.val()).slice(0,-1);b.val(B.join(g.multipleSeparator)+(B.length?g.multipleSeparator:""))}else{b.val("")}}})}if(z){a.Autocompleter.Selection(m,m.value.length,m.value.length)}}function l(A,z){if(z&&z.length&&e){o();s.display(z,A);r(A,z[0].value);s.show()}else{w()}}function f(A,C,z){if(!g.matchCase){A=A.toLowerCase()}var B=n.load(A);if(B&&B.length){C(A,B)}else{if((typeof g.url=="string")&&(g.url.length>0)){var D={timestamp:+new Date()};a.each(g.extraParams,function(E,F){D[E]=typeof F=="function"?F():F});a.ajax({mode:"abort",port:"autocomplete"+m.name,dataType:g.dataType,url:g.url,data:a.extend({q:j(A),limit:g.max},D),success:function(F){var E=g.parse&&g.parse(F)||p(F);n.add(A,E);C(A,E)}})}else{s.emptyList();z(A)}}}function p(C){var z=[];var B=C.split("\n");for(var A=0;A<B.length;A++){var D=a.trim(B[A]);if(D){D=D.split("|");z[z.length]={data:D,value:D[0],result:g.formatResult&&g.formatResult(D,D[0])||D[0]}}}return z}function o(){b.removeClass(g.loadingClass)}};a.Autocompleter.defaults={inputClass:"ac_input",resultsClass:"ac_results",loadingClass:"ac_loading",minChars:1,delay:400,matchCase:false,matchSubset:true,matchContains:false,cacheLength:10,max:100,mustMatch:false,extraParams:{},selectFirst:true,formatItem:function(b){return b[0]},formatMatch:null,autoFill:false,width:0,multiple:false,multipleSeparator:", ",highlight:function(c,b){return c.replace(new RegExp("(?![^&;]+;)(?!<[^<>]*)("+b.replace(/([\^\$\(\)\[\]\{\}\*\.\+\?\|\\])/gi,"\\$1")+")(?![^<>]*>)(?![^&;]+;)","gi"),"<strong>$1</strong>")},scroll:true,scrollHeight:180};a.Autocompleter.Cache=function(c){var f={};var d=0;function h(l,k){if(!c.matchCase){l=l.toLowerCase()}var j=l.indexOf(k);if(j==-1){return false}return j==0||c.matchContains}function g(k,j){if(d>c.cacheLength){b()}if(!f[k]){d++}f[k]=j}function e(){if(!c.data){return false}var k={},j=0;if(!c.url){c.cacheLength=1}k[""]=[];for(var m=0,l=c.data.length;m<l;m++){var p=c.data[m];p=(typeof p=="string")?[p]:p;var o=c.formatMatch(p,m+1,c.data.length);if(o===false){continue}var n=o.charAt(0).toLowerCase();if(!k[n]){k[n]=[]}var q={value:o,data:p,result:c.formatResult&&c.formatResult(p)||o};k[n].push(q);if(j++<c.max){k[""].push(q)}}a.each(k,function(r,s){c.cacheLength++;g(r,s)})}setTimeout(e,25);function b(){f={};d=0}return{flush:b,add:g,populate:e,load:function(n){if(!c.cacheLength||!d){return null}if(!c.url&&c.matchContains){var m=[];for(var j in f){if(j.length>0){var o=f[j];a.each(o,function(p,k){if(h(k.value,n)){m.push(k)}})}}return m}else{if(f[n]){return f[n]}else{if(c.matchSubset){for(var l=n.length-1;l>=c.minChars;l--){var o=f[n.substr(0,l)];if(o){var m=[];a.each(o,function(p,k){if(h(k.value,n)){m[m.length]=k}});return m}}}}}return null}}};a.Autocompleter.Select=function(e,k,m,q){var j={ACTIVE:"ac_over"};var l,f=-1,s,n="",t=true,c,p;function o(){if(!t){return}c=a("<div/>").hide().addClass(e.resultsClass).css("position","absolute").insertAfter(k);p=a("<ul/>").appendTo(c).mouseover(function(u){if(r(u).nodeName&&r(u).nodeName.toUpperCase()=="LI"){f=a("li",p).removeClass(j.ACTIVE).index(r(u));a(r(u)).addClass(j.ACTIVE)}}).click(function(u){a(r(u)).addClass(j.ACTIVE);m();k.focus();return false}).mousedown(function(){q.mouseDownOnSelect=true}).mouseup(function(){q.mouseDownOnSelect=false});if(e.width>0){c.css("width",e.width)}t=false}function r(v){var u=v.target;while(u&&u.tagName!="LI"){u=u.parentNode}if(!u){return[]}return u}function h(u){l.slice(f,f+1).removeClass(j.ACTIVE);g(u);var w=l.slice(f,f+1).addClass(j.ACTIVE);if(e.scroll){var v=0;l.slice(0,f).each(function(){v+=this.offsetHeight});if((v+w[0].offsetHeight-p.scrollTop())>p[0].clientHeight){p.scrollTop(v+w[0].offsetHeight-p.innerHeight())}else{if(v<p.scrollTop()){p.scrollTop(v)}}}}function g(u){f+=u;if(f<0){f=l.size()-1}else{if(f>=l.size()){f=0}}}function b(u){return e.max&&e.max<u?e.max:u}function d(){p.empty();var v=b(s.length);for(var w=0;w<v;w++){if(!s[w]){continue}var x=e.formatItem(s[w].data,w+1,v,s[w].value,n);if(x===false){continue}var u=a("<li/>").html(e.highlight(x,n)).addClass(w%2==0?"ac_even":"ac_odd").appendTo(p)[0];a.data(u,"ac_data",s[w])}l=p.find("li");if(e.selectFirst){l.slice(0,1).addClass(j.ACTIVE);f=0}if(a.fn.bgiframe){p.bgiframe()}}return{display:function(v,u){o();s=v;n=u;d()},next:function(){h(1)},prev:function(){h(-1)},pageUp:function(){if(f!=0&&f-8<0){h(-f)}else{h(-8)}},pageDown:function(){if(f!=l.size()-1&&f+8>l.size()){h(l.size()-1-f)}else{h(8)}},hide:function(){c&&c.hide();l&&l.removeClass(j.ACTIVE);f=-1},visible:function(){return c&&c.is(":visible")},current:function(){return this.visible()&&(l.filter("."+j.ACTIVE)[0]||e.selectFirst&&l[0])},show:function(){var w=a(k).offset();c.css({width:a(k).outerWidth(),top:a(k).outerHeight()}).show();if(e.scroll){p.scrollTop(0);p.css({maxHeight:e.scrollHeight,overflow:"auto"});if(a.browser.msie&&typeof document.body.style.maxHeight==="undefined"){var u=0;l.each(function(){u+=this.offsetHeight});var v=u>e.scrollHeight;p.css("height",v?e.scrollHeight:u);if(!v){l.width(p.width()-parseInt(l.css("padding-left"))-parseInt(l.css("padding-right")))}}}},selected:function(){var u=l&&l.filter("."+j.ACTIVE).removeClass(j.ACTIVE);return u&&u.length&&a.data(u[0],"ac_data")},emptyList:function(){p&&p.empty()},unbind:function(){c&&c.remove()}}};a.Autocompleter.Selection=function(d,e,c){if(d.createTextRange){var b=d.createTextRange();b.collapse(true);b.moveStart("character",e);b.moveEnd("character",c);b.select()}else{if(d.setSelectionRange){d.setSelectionRange(e,c)}else{if(d.selectionStart){d.selectionStart=e;d.selectionEnd=c}}}d.focus()}})(jQuery);var undefined;var srch_hides;var srch_colors;var srch_message;var srch_input;var srch_container;var srch_has_focus;var srch_is_showing=false;srch_is_showing=true;var srch_matches=false;var srch_current_match_index=-1;var srch_enable_current_match=0;var calendar_url="http://neal1.cs.ucr.edu/cal/";var calendar_frame;var search_initialized=0;function search_onload(){var b=get_url_query_param("search");var d=get_url_query_param("paper");var c=get_url_query_param("p");if(!search_jumper){b=""}if(false){var a=init_google();if(a){b=a}}if(c){d=c}if(d){b="paper:"+d+"\\b"}srch_input=document.getElementById("SearchText");if((!b)&&srch_input.value){b=srch_input.value}srch_hides=getElementsByClass("search_hide");srch_colors=getElementsByClass("search_color");srch_container=document.getElementById("main_container");calendar_frame=document.getElementById("myframe");srch_has_focus=false;jq(".search_jumper").click(function(){search_jump(this);return false});index_onload();jq(srch_input).autocomplete(suggestions,{matchContains:true,max:100,minChars:3,scroll:false});jq(srch_input).result(update_search1);if(b&&b!=jq(srch_input).attr("placeholder")){search_init();search_show_search();b=unescape(unescape(b));srch_input.value=b;search()}else{srch_input.blur();if(srch_input.value==""){srch_input.value=jq(srch_input).attr("placeholder");srch_input.style.color="gray"}}}function search_init(){if(search_initialized){return}search_initialized=1;srch_message=document.getElementById("search_message");search_set_message("initializing search, please wait...");search_set_message("enter query")}function search_clear_displayed_matches(){jq(".search_color_nomatch").removeClass("search_color_nomatch");jq(".search_color_match").removeClass("search_color_match");jq(".search_hide_nomatch").removeClass("search_hide_nomatch");jq(".search_hide_match").removeClass("search_hide_match");jq(".search_current_match").removeClass("search_current_match");try{jq(".search_hide").show("slow",function(){this.style.display=""})}catch(a){}finally{}jq(srch_container).removeClass("dark_container")}function search_set_message(a){if(a){query=srch_input.value;if(query==jq(srch_input).attr("placeholder")){query=""}if(query){a=" > search for "+query+" > "+a}else{a=" > search > "+a}}srch_message.firstChild.nodeValue=a;window.status=a}function search_onfocus(){search_init();if(srch_input.value==jq(srch_input).attr("placeholder")){srch_input.value="";srch_input.style.color=""}srch_has_focus=true;return false}function search_onblur(){if(srch_input.value==""){srch_input.value=jq(srch_input).attr("placeholder");srch_input.style.color="gray"}srch_has_focus=false;return false}function search_show_search(){if(!srch_is_showing){srch_is_showing=true}if(!srch_has_focus){srch_input.focus()}return false}function search_show_and_search(){if(!srch_is_showing){search();srch_is_showing=true}if(!srch_has_focus){srch_input.focus()}return false}function search_hide_search(){search_reset_value();srch_input.blur();return false;if(srch_is_showing){search_clear_displayed_matches();srch_is_showing=false;last_search_str=-1;if(srch_matches&&srch_current_match_index>=0&&srch_current_match_index<srch_matches.length){ScrollToElement(srch_matches[srch_current_match_index])}}return false}var last_search_str=-1;function search_for(a){if(srch_input.value!=a){srch_input.value=a}search()}function search(){search_init();search_show_search();str=srch_input.value;if(last_search_str!=-1&&last_search_str==str){return}last_search_str=str;srch_current_match_index=-1;search_set_message("please wait...");var f;var l=str.split(" ");var b=new Array();srch_matches=new Array();for(f=0;f<l.length;++f){if(l[f]!=" "&&l[f]!=""){b[b.length]=new RegExp(l[f],"i")}}if(calendar_frame){if(b.length!=0){new_src=calendar_url+"search.php?query="+str}else{new_src=calendar_url}if(calendar_frame.src!=new_src){calendar_frame.src=new_src}}if(b.length==0){search_set_message("");search_clear_displayed_matches()}else{for(f=0;f<srch_colors.length;f++){var c=srch_colors[f];var g=c.innerHTML;var h=(b.length>0);for(var d=0;d<b.length;++d){if(!b[d].exec(g)){h=false;break}}if(h){srch_matches[srch_matches.length]=c;jq(c).addClass("search_color_match");jq(c).removeClass("search_color_nomatch")}else{jq(c).addClass("search_color_nomatch");jq(c).removeClass("search_color_match")}}for(f=0;f<srch_hides.length;f++){var c=srch_hides[f];var g=c.innerHTML;var h=(b.length>0);for(var d=0;d<b.length;++d){if(!b[d].exec(g)){h=false;break}}if(h){jq(c).addClass("search_hide_match");jq(c).removeClass("search_hide_nomatch")}else{jq(c).addClass("search_hide_nomatch");jq(c).removeClass("search_hide_match")}}if(srch_enable_current_match){search_move_current_match(0)}}try{jq(".search_hide_nomatch").hide("slow");jq(".search_hide_match").show("slow",function(){this.style.display=""})}catch(k){}finally{}search_announce_matches();try{var a=window.location.href.replace(/\?.*/,"");a=a.replace(/.*www.cs.ucr.edu/,"");pageTracker._trackPageview(a+"?search="+str)}catch(k){}finally{}}function search_announce_matches(){var a=0;if(srch_input.value.replace(/ /,"")==""){search_set_message("");jq(srch_container).removeClass("dark_container")}else{if(calendar_frame){search_set_message("calendar");jq(srch_container).removeClass("dark_container")}else{if(srch_matches){a=srch_matches.length}if(a==0){jq(srch_container).removeClass("dark_container");search_set_message("not found")}else{if(a==1){search_set_message("1 match")}else{if(a<100){search_set_message(a+" matches")}else{search_set_message("100+ matches")}}}jq(srch_container).addClass("dark_container")}}if(0<=srch_current_match_index&&srch_current_match_index<a){search_set_message(""+(srch_current_match_index+1)+" of "+a+" matches for "+srch_input.value);ScrollToElement(srch_matches[srch_current_match_index])}if(!srch_has_focus){srch_input.focus()}}function search_reset_value(){srch_input.value="";search();if(!srch_has_focus){srch_input.focus()}srch_current_match_index=-1;return false}function search_done_fn(){return search_hide_search()}function search_google_fn(){var a="http://www.google.com/search?cx=016552805717963713195:8g2_qyu-w7e&cof=FORID:0&q="+srch_input.value;redirect(a);return false}function search_google_scholar_fn(a){var b=srch_input.value;if(b==jq(srch_input).attr("placeholder")){b=""}if(b.indexOf(":")!=-1){b=""}var c="http://scholar.google.com/scholar?btnG=Search&as_subj=eng&num=100&hl=en&lr=&safe=off&q="+b+"+author%3An-young+"+a+"+&as_ylo=1989&as_sdt=2001";redirect(c);return false}function search_google_scholar_fn_old(b){var a=srch_input.value;if(a==jq(srch_input).attr("placeholder")){a=""}if(a.indexOf(":")!=-1){a=""}var c="http://scholar.google.com/scholar?btnG=Search&as_subj=eng&num=57&hl=en&lr=&safe=off&q="+a+"+author%3An-young+-intitle:hilbert+"+b+"+&as_ylo=1989";redirect(c);return false}function search_go_fn(){if(0<=srch_current_match_index&&srch_current_match_index<srch_matches.length){jq(srch_matches[srch_current_match_index]).find("a").click();return}if(!srch_has_focus){srch_input.focus()}if(!(srch_matches&&srch_matches.length>0)){if(srch_input.value==""){search_set_message("enter query!")}else{search_set_message("no matches!")}}else{if(srch_matches.length==1&&srch_current_match_index==-1){srch_current_match_index=0;return search_go_fn()}else{search_set_message("select match w/arrows!")}}}function search_move_current_match(a){if(!srch_matches||srch_matches.length==0){srch_current_match_index=-1;if(srch_input.value==""){search_set_message("enter query!")}else{search_set_message("no matches!")}return false}if(0<=srch_current_match_index&&srch_current_match_index<srch_matches.length){srch_current_match_index+=a;srch_current_match_index%=srch_matches.length;if(srch_current_match_index<0){srch_current_match_index+=srch_matches.length}}else{srch_current_match_index=0}jq(".search_current_match").removeClass("search_current_match");jq(srch_matches[srch_current_match_index]).addClass("search_current_match");search_announce_matches();return false}function search_forward_fn(){search_move_current_match(1);return false}function search_back_fn(){search_move_current_match(-1);return false}var maxpending=-1;var ret=13;var up_arrow=38;var down_arrow=40;function key_pressed(a){if(window.event){return a.keyCode}else{if(a.which){return a.which}}}function search_keypress(a){key=key_pressed(a);return true}function search_keyup(a){key=key_pressed(a);if(srch_enable_current_match){if(key==down_arrow){search_forward_fn();return false}if(key==up_arrow){search_back_fn();return false}}update_search1();return true}function update_search1(){maxpending+=1;setTimeout("update_search('"+maxpending+"')",250);return false}function update_search(a){if(a!=maxpending){return}search()}function search_jump(b){var c="";try{c=srch_input.value;if(c==jq(srch_input).attr("placeholder")){c=""}}catch(d){}finally{}if(c&&srch_is_showing&&c.indexOf(":")==-1){var a=b.href+"?search=";c=c.replace(/\\/g,"\\\\");c=c.replace(/&/g,"&");c=escape(c);redirect(a+c)}else{redirect(b.href)}return false}function init_google(){var c=/google\./i;if(c.exec(document.referrer)!=null){var e=document.referrer.split("?");if(e[1]){var d=e[1].split("&");for(var b=0;b<d.length;b++){var a=d[b].split("=");if(a[0]=="q"||a[0]=="p"){a[1]=a[1].replace(/neal/g," ");a[1]=a[1].replace(/young/g," ");a[1]=a[1].replace(/\+/g," ");a[1]=a[1].replace(/^\s+|\s+$/g,"");return a[1]}}}}return false}var index={};index.badge="background body untitled";index.bibtex="1991 1993 1994 1996 1998 1999 2005 2006 2007 2009 23rd 327 3887 5555 academic achieve acm adversarially adversary against agarwal algorithm algorithms american and antenna applications applied approaches approximate approximation april arbitrary array asia aslam astronomical author authors automata balaji balance barman bent biased bibtex bicriteria bioinformatics blanton books booktitle borneman bound bounded bounding bourns boustrophedon breadcrumbs cache caching cenk challenge change chapter chernoff chrobak claire cliff clones coauthors cocoon codebook coding collection college colloquium combinatorial combinatorics commodity communications competitiveness complexity compression computational computer computing conference congestion connected constrained constraints control cover covering crc current cycle daniel danskin dantzig data database deepak degree department diffuse digital digraphs dimacs dimitrios directional disc discovery discrete distances distributed divesh dna document dual eamonn editor effective efficient embedding encyclopedia end engineering equipped equiprobable equivalent evaluation existence explanation explanations expressive facility faculty fekete fiat fifth file finding flip flow for foundations fractional francis fully fun games garg gelal general generation gentian geometric glossary golin graphs greedy guided gunopulos hakimi handbook hard hierarchical hoc home huan hybridization icalp icde ieee image implementation informatics integer integrated international ipco iterations jakllari james jeff john journal karger karp kenyon keogh khuller klein klemmstein knowledge kolliopoulos korn koufogiannakis krishnamurthy languages large latin letter lin line linear lipton lncs location loose low luby lupton lyle main maley management matching matias maximum mcgeoch median medians mesh metric micheal mikkel millar miller minimum mining mixed mobile mueen multi multiobject multiway navigation neal near neighbor network networks new nicolas node noga note number oblivious online operation operations optimal optimization optimize org orie orlin other pacific packing page pages paging pairwise papers parallel parametric part path philip podc points poster press primal primitive principles priority proceedings processing program programming programs publications publisher raghavachari random rasala recursive research results reverse richard robert rounding sahinalp schabanel scheme schmeichel scholar school science search selecting sensor series server set shortest siam simplex simultaneously size sky sleator slides sloan sloane small society solving spanning spectrograph springer srikanth srivastava stein strategies strategy stretch strongly structures submodular sum survey symposium system systems tail talk targeting tarjan teaching technical technique the theorems theoretical theory thorup tight tiling time title topology transactions trees two ucr unequal university uzi venues version vertex via vishkin vitter volume wald weight weighted with without wolfe words workshop year young yousefi zero zhang";index.bleah="algorithms bourns breadcrumbs college computer contact current faculty fun home main navigation neal opportunities page photos puzzles research schedule science search teaching ucr undergrad vita young";index.chutes="1em 45deg 6em algorithms background border bourns breadcrumbs chutes collapse college computer div edge emptyedge faculty fill font fun home ledge main margin moz navigation neal noedge nopebble odd padding pebble research reset rotate science solid supportingedge supportingpebble table teaching text top translate ucr undo unsupportedledge violator webkit young";index.coauthors="abdullah academic agarwal algorithms amos april arman aslam balaji barman bent bibtex blanton borneman bourns breadcrumbs cenk christos chrobak claire cliff coauthors college computer current daniel danskin david deepak dhiman dimitrios divesh eamonn ece elizabeth faculty fekete fiat flip fun garg gelal gentian glossary golin gunopulos hakimi home huan jakllari james jay jeff jessica john karger karp keogh khuller klein klemmstein kolliopoulos korn koufogiannakis krishnamurthy laszlo lin lipton lovasz luby lupton lyle main maley marek mathieu matias mcgeoch michael mikkel millar miller mordecai mueen naveen navigation neal neil nicolas noga oblivious org orlin page philip publications qin raghavachari rasala research richard robert rounding sahinalp samir sandor schabanel schmeichel scholar science search sleator slides sloane srikanth srivastava stavros stein talk tarjan teaching thorup ucr uzi venues vishkin vitter yossi young yousefi zhang";index.contact="7146 827 92521 951 algorithms bourns breadcrumbs building california campus chung college computer contact current directions edu faculty first floorplan fun google hall home main map navigation neal page research riverside schedule science search teaching ucr university vita wch winston young";index.contact_info="7146 827 92521 951 algorithms bourns breadcrumbs building california campus college computer contact directions edu engineering faculty first fun google home main map navigation neal research riverside science search teaching ucr unit university vita young";index.course_evaluations="100 2004 2005 2006 2007 2008 4em 5em 5px about algorithms all and are better border bourns breadcrumbs changed col1 col2 college com comments computer concerned consider course courses cs141 cs145 cs215 cs260 current details did div effective enrollment evaluation evaluations experience faculty fall five for format forms full have here hide home instructor isn learned learning main margin material mean means median medians navigation neal now number organized overall page pagewrapper percentiles present prior problems proof puzzles ratemyprofessors rating ratings respect returned scale science search seven solid something spring student students summaries table taught teacher teaching term text than that the ucr understandable understanding was what wiki winter with you young your";index.courses="1996 1997 2004 2005 2006 2007 2008 advanced algorithms and approximation bourns breadcrumbs classes college combinatorial computation computer contact cs141 cs145 cs215 cs260 dartmouth data faculty fall footer frameworks fun graduate home intermediate main navigation neal novel optimization problems proof puzzles related research science search spring structures teaching theoretical theory ucr undergraduate vita wiki winter young";index.evaluations="100 2004 2005 2006 2007 2008 2009 2010 2011 5em 6em algorithms all are better border bourns breadcrumbs changed classes col1 college com computer course courses cs141 cs145 cs215 cs218 cs260 cs262 current details div effective engr101 enrollment evals evaluation evaluations experience faculty fall five for format forms full fun here hide home instructor isn learning main mean means median medians more navigation neal now number overall page pagewrapper percentiles prior puzzles ratemyprofessors rating ratings research respect respondents returned scale science search seven solid spring student summaries table taught teacher teaching term text than that the ucr was what wiki winter with young your";index.flashgallery="body click don download flash gallery have here installed like looks macromedia page player powered you";index.readme="10px 15px 30px 3px 40px 480 640 6px able absolute add addparam addvariable all allowfullscreen always and any anyway anywhere application arrows attribution auto background between body border bug but buttons can center change changing click code collapse color com comments commons compiled contact contains copy creative current customizable customize customizing default delay delete demo detects developed div don download embed embeds example except file filenames files flash flashgallery flickr folder following font for from fullscreen gallery getflashplayer have head height here hesitate high html icon images img included installation installed intact into javascript jpg keep license like link links load local location looks macromedia main margin means mouseover move need new next not off org our overall page paid paste path percents photos photostream php picture pixels place player please png powered previous project provided purchasing quality questions read reads reality relative released replace report running scans script scroll semi server set setid sets settings should show slides slideshow software solid somewhere start step style suggestions support swf swfobject table tabs text thanks that the then this thumbnails tips transparent true try under upload use username uses using var version view want way webpage webpages webserver what where which width with wmode work works write www xml you your";index.fun="10px 11px 1px 5px algorithms arial black bourns breadcrumbs college computer creek current digital faculty frisbee from fun helvetica home img labradors lime main navigation neal page photos pictures quotes research rgb sans science search serif sky sloan solid survey teaching the ucr ultimate young";index.glossary="10px academic algorithms and approximation bibtex bourns breadcrumbs coauthors college combinatorial computer cs260 current defn div faculty from fun glossary home iframe linear main margin navigation neal notes oblivious online org page pagewrapper paging publications research rounding scholar science search slides talk teaching ucr venues young";index.home="7146 827 92521 951 above algorithms analysis and approximation assoc bourns breadcrumbs bulletin california chung classes climate college combinatorial computer computing contact course current design directions edu efficient elsewhere engineering evals faculty find first footer for form frisbee fun hall here home information left links main more navigation neal oblivious openings opportunities optimization org page photos problems professor publications radio radiolab realclimate research riverside rounding schedule science search skip survey teach teaching the ucr ucues ultimate undergrad university use vita want what winston you young";index.home_test="all background clear float for home margin menu neal options text young";index.journals="23rd acm algorithmica algorithms american and applied approximation asia astronomical automata bibtex bioinformatics biology book bourns breadcrumbs challenge chapter chapters coauthors college colloquium combinatorial combinatorics communications compression computation computational computer computing conference crc current data database dblp department dimacs disc discovery discrete distributed encyclopedia engineering etc faculty fifth foundations fun glossary google handbook hoc home icde ieee implementation informatics information integer international journal journals knowledge languages latin letters main mathematics mesh metaheuristics mining mobile navigation neal networks operations optimization pacific page poster princeton principles proceedings processing programming publications report research scholar science sciences search sensor series siam slides society springer structures symposium system systems talk teaching technical the theoretical theory transactions ucr university workshop young";index.lagrangian_relaxation_links="101 111 1804596 1960 1961 1963 1971 1990 1991 1993 1994 1995 1996 1997 1998 1999 2000 2001 334 859 acm ahuja algorithm algorithms allocation amos and applications approach approximating approximation aspnes auction awerbuch azar balancing bartal baruch best boosting bourns breadcrumbs byers chapter circuits citeseer clifford collected college com combinatorial commodities competitive complexity computer computing concurrent condition conic context control covering cutting danny dantzig david deadlock decomposition determination distributed efficient elementary epelman erhan eva faculty fast faster fiat fillia fleischer flow for fractional freund fun game garg gilmore global gomory held home independent information james jochen john journal karp klein kuhn kutanoglu lagrangean lagrangian large leighton line linear links lisa load local machine magnanti main makedon mathematical matula maximum method minimum miscellaneous multicommodity naveen navigation neal nec nemann network neumann number numbers numerical operations optimization orli orlin other packing pages part pergamon person plotkin prediction press principle problem problems programming programs rakesh ravindra raz references related relaxation reliable research resolution resource review routing salesman schapire scheduling science search semidefinite serge shahroki shmoys simple simpler solution spanning spyros stein stock strategies sum survey sven system tardos teaching the theory thomas tom tragoudas traveling tucker two ucr using value very virtual vohra volume von vries waarts with wolfe works yair yossi young zero";index.major_diagrams="2007 2008 2010 algorithms all and any approximations are below bourns breadcrumbs but can college comment comments computer core courses credits dated dependencies diagram diagrams download electives email errors faculty for format fun further generally have here home information links main major more navigation neal not noted otherwise out page pdf please prerequisite prerequisites questions required requirements research science search see source sources teaching the them these this ucb ucd uci ucla ucr ucsb ucsd undergraduate unless various view with you young";index.bibtex="2005 322 327 achieve acm adversarially against agarwal algorithm algorithms american and appeared applications applied approaches approximate approximation april array asia aslam astronomical author authors balaji balance barman bent biased bibtex bicriteria bioinformatics blanton books booktitle borneman bounded bourns boustrophedon breadcrumbs caching cenk challenge change chapter chernoff chrobak claire cliff clones cocoon codebook coding collection college combinatorial combinatorics commodity communications competitiveness complexity compression computational computer computing conference congestion connected contact control cover covering crc cycle daniel danskin dantzig data degree department digital digraphs dimacs directional discovery discrete dna document dual editor effective efficient embedding encyclopedia end engineering equiprobable equivalent evaluation existence explanation facility faculty feedback fekete fiat fifth file finding flow focs footer for foundations fractional francis fully fun games garg gelal generation gentian geometric golin graphs greedy guided gunopulos hakimi handbook hard hierarchical hoc home huan hybridization icalp ieee image implementation informatics integer integrated international ipco iterations jakllari james jeff john journal karp kenyon khuller klein klemmstein knowledge kolliopoulos korn koufogiannakis krishnamurthy large latin letter lin line linear lipton lncs location loose low luby lupton lyle main maley management matias mcgeoch median medians mesh metric micheal millar miller minimum mining mixed mobile multi multiobject multiway navigation neal near neighbor network networks new nicolas node noga note number online operation operations optimal optimization optimize orlin pacific packing page pages paging parallel parametric part path photos press primal priority problems processing programming publisher puzzles raghavachari random rasala research reverse richard robert rounding sahinalp schabanel schedule scheme schmeichel school science search selecting sensor series server set shortest siam simplex simultaneously skip sky sleator sloan sloane small society soda solving spanning spectrograph springer srikanth srivastava stein stoc strategies strategy stretch strongly structures sum survey symposium system systems targeting tarjan teaching technique the theorems theoretical theory thorup tiling time title topology trees ucr unequal university uzi version vertex via vishkin vita vitter volume wads wald weight weighted with without wolfe words year young zero zhang";index.bleah="algorithms and bourns breadcrumbs college computer contact current engineering faculty feedback footer fun home main navigation neal opportunities page photos problems puzzles research schedule science search skip teaching ucr undergrad vita young";index.coauthors="agarwal algorithms amos and april aslam balaji barman bent blanton borneman bourns breadcrumbs cenk christos chrobak claire cliff coauthors college computer contact daniel danskin david deepak dhiman dimitrios divesh ece elizabeth engineering faculty feedback fekete fiat flip footer fun garg gelal gentian golin gunopulos hakimi home huan jakllari james jay jeff jessica john karger karp khuller klein klemmstein kolliopoulos korn koufogiannakis krishnamurthy laszlo lin lipton lovasz luby lupton lyle main maley marek mathieu matias mcgeoch michael mikkel millar miller mordecai naveen navigation neal neil nicolas noga orlin page phil photos problems puzzles qin raghavachari rasala research richard robert sahinalp samir sandor schabanel schedule schmeichel science search skip sleator sloane srikanth srivastava stavros stein tarjan teaching thorup ucr uzi vishkin vita vitter yossi young zhang";index.contact="423 7146 827 92521 951 algorithms and bourns breadcrumbs building california campus college computer contact current department directions edu engineeering engineering faculty feedback first footer fun google home main map navigation neal office page photos problems puzzles research riverside schedule science search skip teaching ucr unit university vita young";index.course_evaluations="100 2004 2005 2006 2007 2008 about algorithms all and are better bourns breadcrumbs changed college com comments computer concerned consider contact course courses cs141 cs145 cs215 cs260 details did effective engineering enrollment evaluation evaluations excellent experience faculty fall feedback five footer for format forms fun have here hide home instructor isn learned learning main material mean means median medians more navigation neal now number organized overall page percentiles photos present prior problems puzzles ratemyprofessors rating ratings research respect returned scale schedule science search seven skip something spring student students summaries taught teacher teaching term than that the ucr understandable understanding vita was what winter with you young your";index.fun="10px 11px 1px 5px algorithms and arial black bourns breadcrumbs college computer contact current digital engineering faculty feedback footer frisbee from fun helvetica hikes home img main mostly navigation neal near page photos pictures problems proof puzzles quotes research rgb riverside sans schedule science search serif skip sky sloan solid survey teaching the ucr ultimate vita young";index.glossary="algorithms and approximation bourns breadcrumbs college combinatorial computer contact cs260 defn engineering faculty feedback footer from fun glossary home linear main navigation neal notes online page paging photos problems puzzles research schedule science search skip teaching ucr vita young";index.home="141 1984 1991 1992 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 215 260 3438 achieve adversarially adversary advising against algorithm algorithmic algorithms allow also analysis and answer any applications applied approaches approximate approximately approximating approximation array assign associate association average balance beating because bernard best between biased bicriteria bidding blog bound bounded bourns boustrophedon breadcrumbs broadcast bulletin caching challenge change chazelle chernoff cip cliff climate clones codebook coding coe collection college combinatorial commodity comparison compendium competitive competitiveness comple completion complexity compression computation computational computations compute computer computing congestion connected constraints contact control cost costs course cover covering cra current cut cycle dantzig dasgupta data degree denotes design designing digital digraph digraphs dimensional directional discovery distance distributed distribution dna document dual each effective efficient embedding encyclopedia end engineering equiprobable equivalent essay etc evaluation evasiveness existence exists explanation facility faculty fall faster feedback file final finding first flow footer for formulated fortnow fractional frisbee from fully fun games general generalize generation geometric gets gives graph graphs greedy guarantee guided had hand hard has here heuri hierarchical hikes home huffman hybrid idiom image incremental infinite information input inputs instead integer integrated intermediate item items iterations itself jeff joel known lagrangian large latter lecture length letter lin line linear links local location loose low main makespan materials median medians methods metric minimum mixed model modern more most multi multiobject multiplicity multiway navigation neal near neighbor neither network new node non notes number off one online openings operation opportunities optimal optimization optimize org packing page paging papadimitriou paper parallel parametric part particularly path performance photos pictures polynomial possible prefix presenting previous previously primal priority probability problem problems professor program programs proof properties publications puzzles queues radio radiolab random randomized randomly reachability realclimate relaxation request research resources result results returns reverse root round rounding rows run schedule scheduling scheme science search second see selecting sequential server set severely shortest shows simple simplex simultaneously skip sky sloan small solution solved solving spannin spanning speci spectrograph spring standard stein strategies strategy strengthen strongly structures such sum summarie survey targeting tcp teach teaching technique term textbook than that the then theorems theory there these this time times topo topology total trade transform tree trees ucr ucues ultimate undergrad undergraduate unequal uses vazirani vertex via vita vitter wald was weight weighted wein when which winter with without wolfe words working yet young zero";index.journals="acm algorithmica algorithms american and applied approximation asia astronomical automata bioinformatics biology book bourns breadcrumbs challenge chapter chapters college colloquium combinatorial combinatorics communications compression computation computational computer computing conference contact crc data department dimacs discovery discrete edited encyclopedia engineering etc faculty feedback fifth footer foundations fun gonzales handbook hoc home ieee implementation informatics information integer international journal journals knowledge languages latin letters main mathematics mesh metaheuristics mining mobile navigation neal networks operations optimization pacific page photos princeton problems proceedings processing programming puzzles report research schedule science sciences search sensor series siam skip society springer structures symposium system systems teaching technical teo the theoretical theory ucr university vita workshop young";index.lagrangian_relaxation_links="101 111 1804596 1960 1961 1963 1971 1990 1991 1993 1994 1995 1996 1997 1998 1999 2000 2001 334 859 about acm ahuja algorithm algorithms allocation amos and applications approach approximating approximation aspnes auction awerbuch azar balancing bartal baruch best boosting bourns breadcrumbs byers chapter circuits citeseer clifford collected college com combinatorial commodities competitive complexity computer computing concurrent condition conic contact context control covering cutting danny dantzig david deadlock decomposition determination distributed efficient elementary engineering epelman erhan eva faculty fast faster feedback fiat fillia fleischer flow footer for fractional freund fun game garg gilmore global gomory held home independent information james jochen john journal karp klein kuhn kutanoglu lagrangean lagrangian large leighton line linear links lisa load local machine magnanti main makedon mathematical matula maximum method minimum miscellaneous multicommodity naveen navigation neal nec nemann network neumann number numbers numerical operations optimization orli orlin other packing page pages part pergamon person photos plotkin prediction press principle problem problems programming programs puzzles rakesh ravindra raz references related relaxation reliable research resolution resource review routing salesman schapire schedule scheduling science search semidefinite serge shahroki shmoys simple simpler skip solution spanning spyros stein stock strategies sum survey sven system tardos teaching the theory thomas tom tragoudas traveling tucker two ucr using value virtual vita vohra volume von vries waarts with wolfe works yair yossi young zero";index.major_diagrams="2007 2008 algorithms all and any approximations are below bourns breadcrumbs but can college comment comments computer contact core courses credits dependencies diagram diagrams download electives email engineering errors faculty feedback footer for format fun further generally have here home information links main major navigation neal not noted otherwise page pdf photos please prerequisite problems puzzles questions required requirements research schedule science search skip sources teaching the them this ucb ucd uci ucla ucr ucsb ucsd undergraduate unless various view vita with you young";index.photos="algorithms and animal antelope big bourns breadcrumbs canyon college computer contact creek cucamonga current diego eagle engineering faculty falls farm feedback footer forest fun gorgonio home idaho joshua kings lake lakes leland limecreek little lone main moccasin national navigation neal oregon page park photos pine problems puzzles research san schedule science search sequoia silver skip sur teaching trail tree tunnel ucr valley victor vids vita west yosemite young";index.photos_dynamic="0px algorithms and bourns breadcrumbs college computer contact current engineering faculty farm feedback footer fun home lake leland limecreek main navigation neal page photos problems puzzles research schedule science search skip teaching ucr vids vita west young";index.photos_h="0px algorithms and animal antelope big bourns breadcrumbs canyon college computer contact creek cucamonga current diego eagle engineering faculty falls farm feedback footer forest fun gorgonio home idaho joshua kings lake lakes leland limecreek little lone main moccasin national navigation neal oregon page park photos pine problems puzzles research san schedule science search sequoia silver skip sur teaching trail tree tunnel ucr valley victor vids vita west yosemite young";index.poster="0461 100 1304 1961 1971 1980 1982 1984 1985 1988 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 221 2286 235 289 317 322 324 327 3438 348 356 368 383 478 505 541 600 699 872 961 about above absolute access accomplished according account achieve acm actually additive adjusting adversarial adversarially adversary against agarwal algorithm algorithmic algorithmica algorithms all allow allows almost alphabet also always american among amortized amos analyses analysis analytic analyze analyzes analyzing and another answer answers any applicability application applications applied applies approach approaches approximate approximately approximates approximating approximation april arbitrary are area arises array asia asks aslam assign assignment associate assumes assuming astronomical asymmetric authored authors available average avoids balaji balance balanced balancing bandwidth barman based basic beating because been before behavior being below benders bent best better between biased bicriteria bid bidding bids bin bioinformatics biology bipartite blanton boas boolean borneman both bottleneck bound bounded bounding bounds bourns boustrophedon breadcrumbs bribery brief briefly brightnesses broadcast broadcasting broadcasts browsers but cable cache caching calinescu called can cannot cao capacities capacity capture captured carr case celestial cenk certain certifying challenge change changes channels chapter check chernoff chooses choosing christofides christos chrobak cip circle circuit circuits claire class classifies clients cliff clones clonetools close cmilp coauthored cocoon code codebook codeword coding coefficients coherent collection college columns combinatorial combinatorics commodities commodity common communication communications communities comparison competitive competitiveness completion complexity comprehensive compression computation computational computations compute computer computes computing concerns conference congestion conjecture connected connections consider considered considers constant constraint constraints contact contains continuous contracting contrast control convergence convex corollary correct corrected cost costs counterparts cover covering crc criteria cross crossing current currently customers cut cycle cycles daniel danskin dantzig data david decide deciding decomposition decrease deepak defining definition degree deletion demands denotes dense department dependence depends derive derived deriving describe described describes design designing desirable desired despite detail determine determining deterministic developed dhiman diffuse digital digraph digraphs dijkstra dilley dimacs dimensional dimitrios direct directed direction directional directly disc discovery discrete disproving disseminating distance distributed distribution divesh dna document documenting does domain dominates dominating dorit dual duality due dynamic each easy ece edge edges edited effective efficient eight either element elementary elements elias elizabeth ellipsoid embedding emde empirical empirically encode encoded encoding encyclopedia end engineering entire entries entropy environments equal equals equiprobable equivalent error etc euclidean eva evaluating evaluation evasiveness even every exact example examples except exchange existence exists expectation expected experimental experiments explain explained explanation explicit explores exploring exponential exponentially extend extension extensive faced facilities facility fact factor faculty fall fashion fast faster fastest fault faults favor faxing feasible features feedback fekete fiat fifo fifth file final find finding finds first fit fix fleischer flip flow flush focs focuses follow following follows footer for form formed formula formulae formulate formulated found foundations fractional free frequency from full fully fun function functions further galaxies game games gap garg gave gelal general generalization generalizations generalize generalized generalizes generalizing generally generates generating generation gentian geometric gets give given gives giving global goal goemans golin gonzales good graham graph graphs greedy grigoriadis gruia guarantee guarantees guided gunopulos had hakimi handbook handicapped hard hardness has have having held here heuristic heuristics hierarchical high hitting hoc hochbaum holding holds home how howard huan huffman hull hybridization icalp idea ideas ieee illustrated image implement implementation implementations implemented important improved improvement improves include includes including incorporated increase increases incremental indeed independently index individual inequality infinite informal informatics information ink input inputs insertion insight insignificant instance instead integer integrality integrated interest interested interesting international internet into introduced introduces introducing introduction ipco irani issues item items iterations its itself jakllari james jay jeff jessica jochen joel john journal karger karloff karp keep keys khachiyan khuller klein klemmstein knapsack knowledge known knows kolliopoulos konemann korn koufogiannakis koutsoupias krishnamurthy kurt label labels lagrangean lagrangian landlord language large larger last laszlo latin latter lead leads leaf least leaves lecture lectures left leighton length lengths less letter letters likely limits lin line linear links lipton lisa lloyd lncs local location log logarithm logarithmic logarithmically long lookahead loose lovasz low lower lru luby lupton lyle macroscopic made main mainly maintains makespan maley management many map marek marking markov match matches matching mathematics mathieu matias matrices matrix max maximally maximize maximizes maximum may mcgeoch mean means measurement measuring median medians medium meet meeting meg mehlhorn memory mesh message messages metaheuristics method methods metric mettu michael michel microbial mike mikkel millar miller million mimd min minimize minimizing minimum mining minor mixed mobile model models modification modified modifying monotone mordecai more morse most mst much multi multicommodity multiobject multiple multiplicative multiplicity multiway must naive naveen navigation neal near nearly necessary negative neighbor neil neither nested net network networks neumann new nicolas nisan noam node nodes noga non nor norms not note notes notion noy number numeric objective objectives objects observation observed obtain obtained off ofrg one online only open operation operations opponent optimal optimally optimization optimize optimum order ordered orient orienting original orlin other our out output over overall pacific package packets packing page pages paging pairs papadimitriou paper papers parallel parameter parametric parsimonius part particular particularly path paths pattern patterns pays pei per perform performance performed periodically phil phones photos placing plane plaxton play player plotkin plus points polylog polynomial posed positions positive possible post poster potential prabhakar practical practice predecessor prefix present presented presenting presents previous previously prim primal princeton principles priority probabilistic probabilistically probability problem problems procedure processing produce professor program programming programs proof proofs properties property proportional protocol protocols provably prove proved provide provided provides proxies proxy ptas public publications publicly published pure pushes puzzles qin quadratic quarter queries question queues rabani raghavachari raghavan random randomized randomly rao rasala rate rates ratio ratios reachability received recently reduce reduces related relations relaxation relaxations rely remain remaining removal removes rental report represent representing request require required requires research resorted respect response restriction result resulting results retrieve return returned returns revealed reverse rgreedy richard rnc robert role root rooted roughly round rounding rounds routed rows run running runs sahinalp salesman same samir sandor sandy sat satellites satisfy satisfying satish schabanel schedule schedules scheduling scheme schemes schmeichel science sciences search second see selecting semidefinite seminal sense sensor separates separator sequence sequences sequential serge series serve server set sets setting several severely shmoys short shortest should show showing shows siam significant similar similarity simple simpler simplex simultaneously since single size sizes sketch ski skip sky sleator slightly sloan sloane small snapshot snapshots society soda software solution solutions solvable solve solved solving some source space spanning special specific specified spectrograph speed springer sqrt squid srikanth srivastava stage standard start starts stavros stein step steps stoc stochastic stop stops strategies strategy strengthen strengthened stretch strictly strongly structure structures studied studies study sub subgraph subject submit submits submodular subset successfully successor such suggest suggesting sum summaries summary sums support surmount surprising survey symposium system systematic systems take taken takes taking tardos targeting tarjan taught tcp teaching technical technique techniques telescope tending tends teo term terminal terminals terms testing than that the their them then theorem theorems theoretical theoretically theory there therefore these thesis they thirds this thorup those three threshold through throughput tiling time times together tolerance tom too topic topology total trade traditional traffic transform traveling tree trees triangle triangulation trip trivial tsp tune twice two type typically ucr umesh underlies underlying understand understanding undirected unequal uniform uniformly unit university unknown unless unpublished until upper use used useful users uses using uzi value van variables variant variants varies vazirani vectors version vertex vertices very via vishkin vita vitter von wads wait wald was web weight weighted weights wein well were what when where whereas whether which while who whose will williamson with within without witnesses wolfe word words work worked working works worse worst would yet yields yossi you young yuval zero zeros zhang";index.proof_problems="0001 0101 100 101 102 5th absolute adds adjacent advance agree airline airlines algorithms alice all allowed always among and announces another any arbitrary are arithmetic around assigned audience average aweb baseball between bit blue bob both bound bourns boys breadcrumbs brother but can candy card cards carefully check chooses cities coins college color com common computer connected connects consecutive contact contained contains control converges cover current cycle cycles day deck decrease define density determine did differ different diffs directions discs distance distinct does each either elizabeth engineering equal every exactly example exceeding exclusion exist existence expressed faculty fatland feedback find finite first flight flights flip following footer for form four from fun function gave generate girls given gives graph hamming hanoi has her hides hiding him his home identity inclusion independently inequality infinite initial integer integers intersect into isn item items john kind label labelled labels later least length logic lower main manner matter maximum mean minimum move moves must navigation neal negative next non not number numbers object objects odd one ones operation operations order other out over own page pair pairs pairwise partioned partition passing peg perform person photos pieces place plane points positions positive possible presently prevent probability problems proof protocol prove provide put puzzle puzzles quickly random reach real reals rectangle rectangles red related replace replaces required research respectively resulting reveals round same satisfy say schedule science search secret sequence sequences series set several shape shared she shift shifting shocked show shows side signal sit sits skip some square standard start step steps strings stuck subset subsets such sum sums superkids suppose table takes taking teaching than that the them then there they things thinks third three through time times too tools towers traveling trick two ucr value values vary vertex vertices vita was way weights were what where which whose with won www you young younger";index.ps="0px algorithms and antelope big bourns breadcrumbs college computer contact creek cucamonga current eagle engineering faculty farm feedback footer fun home lake leland limecreek main navigation neal oregon page photos problems puzzles research schedule science search skip sur teaching trail ucr valley vids vita west young";index.puzzles="100 1x1 300 4x8 5th 8x8 able above accomplish according advance after agree agreed algorithms alice alive all allocation allowed along already also amount and annual answer answering answers anticipated any apply applying arbitrarily arbitrary are area arrange arranged asked asks assistant assume assuming assumption attend audience away back base basic because before being best bits black blue booty bottom bourns breadcrumbs but can cannot card cards carry case challenge championship chance checkerboard choose chooses chose circle claim closed cmu coins collection college color coloring colors come communicate computer consisting constraints consumes contact containers continuing cooperstock correct correctly could counting counts couples course cover criteria csu current cut deck denote department describe design determine determined diamonds did different dinner disc discover discrete discs discuss distinct divide dividing does doesn don done down drive dumb each easy either elsewhere end engineering equal etc eventually every everyone exactly example except executed executes executioner eyes face facing fact faculty feedback few fifth figure find fire fires firing first fit five flat flip flipping folded follow following follows footer for form forward from fun gallon gallons gas general get gets give given gives goal gold google got greater guess guessing guns half hand hands handshakes hanoi happening happens has hat hats have haven head hear hears hearts her here his home how ian identify induction inductive inductively information instruction instructor integers interview jeremy just kill killed known knows labeled large larger largest later learning least leave left less let like likewise limited line list lives load loot lose magician main many marble marbles market math mathematics matter max maximum mcgill memory might mile miles minimizes minus minute minutes mirrors more most mostly moves much must navigation neal necessarily necessary never new next nobody not now number numbers once one only open operation operations order ordered ordering orders other otherwise out outlined outside outwards over overlap own page paper paragraph parberry part particular partner party pass passed people person phase photos pick piece pieces pirate pirates place places please point positive possible power precisely previous priorities probability problem problems proceeds process promptly proof proposes protocol prove provided puzzle puzzles question questions quite raise raised random randomly reasons receive red regular related remaining remember repeated repeatedly repeats require required requires research rest reveals right room round said same save saved says schedule science search second see seen sees sell senior sequence set sets shake she shook should shoulder show shuffle simply simultaneously since single sit sits situation size skiena skip solder soldier soldiers some sort spare spares specifically specify square squares stack stacked stand start starting starts state stay step steps stop stranded strategy student students subject subset subsets such surprisingly take tap tapped taps teaching tell tells than that the their then there they thirty this those three thus time toad told top towers transport travels trick trivially truck true turn turning turns two ucr under university unsolved upon use using vita vote waits was way ways wearing wears week what when where whether while white who whom will win with wolfram work worse worst would write written wrong you young your";index.quotes="1571 1574 1627 1631 1640 1665 1686 1688 1713 1744 1755 1757 1768 1794 1795 1821 1822 1827 1843 1888 1889 1906 1911 1916 1932 44a 531 abolishing about above absolute absorbed absurd ace aces achieved across acting actual actually adaptation add adolescent advance adventure aerospace afraid after afterwards again aggressive aggressively ago agree agrees air alan alexander algorithms alien alienation all allow almost alone also always amber american americans amour anchor and andrew angels angry anonymous another anticipatory anu any anything apply apprehended aquiver arbitrator are arguing arnold around arrive art artificial asked asking asks aspects assets asshole assignment assimilates assumes asthma asthmatic atmosphere attack attempts attr avoid avoided awards away back balanced bar barnfield bartender bartholomew basic bath bay beam bear beautiful became because become becomes bedfellows been before began begetting beginning behind being bell best betjeman better bid bidding bids big bimbo bitch blackwood blake blasted blessed blow bluish body book bored borne boss both bourns breadcrumbs break bridge broth brutalizing bumped but buy call called came can candle cannot capability capable card cards carefree cargo carl carry carrying case casser catching caught cautious cautiously cavafy cease cell centered certain chagrin chamber chamomile changing chauvinistic cheapest cheaply choose chuang cities city claris class claude clawing clod closed clubs coast cockpit cognitive coherent coleridge college com combined come comes comments communicator complete computer computers conceived conclusion conference confessed confused congress connected consciousness constant constantine contact content continent continue continuity contract contrary control conventions conversation corals costs could couldn count course crashed creative creatures crook cry cue cyclopes darkness darwin dating day days dbl deadlock death decide defenseless defrauded delayed deny described destroy detach detect determination determined diabolical diamonds did didn died different dilemma dim diminishes direct directly disarmament disciples discours dissect distinct distinguishes distract distractions distribution dizzied does doing doit don donne door doors double doubles doubt doubts down dreaming dure each ear early earth easier ebony editor educational egyptian eight either else emotion empires employment emptying encouraging enemy engineering english enough enter entered entire equal equivalent essence essentially est established etc europe eval evaluating evaluation evaluations even evening evenings eventually ever every everything exactly except exception excited exist existence exists expecting experience experiences experiment explosion eye fact faculty falsehood far farmers faulty favorite fear feedback feelings felt few fewer fierce final finally find fine finest firepower first fist fit five fix fixed flashed floor florian flying following fools footer for forcing form format former forth fortune found four fous french fresh friend friends from full fun fusion future gained game gary gathering gave generally geostation get give given glad glass goal going gone good grand grave great greater ground grounded group grows guam guide had half hand hands happier harris has hast have hcp head headed headlines headquarters hear hearts heaven heavy hegel henry her here high higher him himself his history hit hold hole home honey hope hostile hostilities hosts hours how however htm huge human humor hurry hurts hypothesis idea identity ill immediate immediately immense impatiently important incapable incertainties inconceivably inconstancy index indicates inevitably ingle initiated innocence innocent innocently inquired inspirational instance interest into invite invites involved irritable island isle isolated isolation ithaka ithakas its itself iws james jean jesus job john jolt journey judas jump just justice kafka keats keep kind kinds kingdom kings knew know knowing knowledge largely last latter launched laurence laurie law lazy lead leader learn led left leg length less lesson lestrygonians let level library life like liked likewise limited line lip lippmann lisp literary literate literature lithium little live lives lofty long longer longest look loosen lose lot love low lower lunchtime machine main mainly major make makes man management mankind manor many marguerite markets massive match matthew maximum may mean meaning means meanwhile meditation meek meet meeting memory merchandise merciful might miles miller million mind minimum minor minsky minus miroir mirror miss missile missiles mit mix mobile mockery moment monde money mood more morning mornings mother mothership mountain mourn much must myself mysteries mystery name named nation natural nature navigation neal necessarily necessary necessity needs negation negative neither neuroses neurotic never new news newspaper newspapers nietzsche night nine non nook nor not nothing notrump nourishment now nowhere number numbers objectives ocean off offer office old once one only open opener opening opponent opponents orbit order ordinary original other otherwise our out over overcall overcalled overcalling overcalls own page pair pang paper paragraph parking part particle parties partner partners partnership pas pass passage passed passes path peaceful peaceniks pearl penalties penetralium perfumes perhaps permanently permission persecuted person peter petit pharisees philip phoenician photos piece pierre piling plain plaisir plan planet pleasurable pleasure plein point pointless points polar pondered poor pope porky ports poseidon position positive possessiveness poster pray preceding predicate preference preferred preoccupations present president probably problem problems process prof professor professors program progresses promise promises promontory proper proposition prove provided psychically pulverize purchase pushed puzzles question qui quotes race raise raises ran ranking reach reached reaches reaching read real reality really reason rebecca rebid rebidding rebids received reclaimed recognize recovering redouble references reformation refuse refusing regards regret rejoice related relax remain remained remaining remember reminded report reputation requests require requirement requires reread research resistance responder response responses return returning reward rich richard riches right road roared ruining rule sage said same sank satiriques say says schedule scholar science sea search seat seconds secret see seemed seen self semi send sense sensibility sent sergeant serious set settle seul seven several shall shalt share she sheet shepherd ship ships short should show shows side sign silent silken similar simon simple simplenet simultaneously since singleton sir sitting six skip skipped skylon slam slammed slash small smash snarled social some somehow someone something son soon soul space spades speak spent spider spirit spoils spoken squadron standard stared start started statement stayman stella stephen sterne still stomped stop stopped stopper stopping store story strange strength strong stronger student sublated submarine subsequent such suffer suffocating suggests suit suits summer support supported suppose supposed surely suspended sweaty swiftly switch syllogism table take taken takeout talking tandem target taught tea teaching teashop tedious television tend tenir tens termite test tex than that the thee their theirs them then there therefore these they thine thing things think thinker thinkers thinking third thirst this thoreau those though thought thoughts thousands threads three thro through thumping thy time times tissue today together toggling told tolls tomorrow tons too took top touches tout toute towards transgalactic travel treaty tricks triple troubled true trump truscott truth trying turn turned turning twice two tzu ucr udrian ultimate unbid uncertainties understand understanding understood unfeeling unhurriedly unilateral unimpeded unsuccessfully unsupported until use used useless usually valium vaporized varies verisimilitude very veto veut video vie violent visit vita void voir voyage vulnerability vulnerable walks walter want wanted war was washed wasn watch way weak weaker weakness web wednesday week weeks weigh well wept were weren what when where whether which whimpering who whom whose why wife will william wimpy wind window wirth wisdom wistfully with within without witted woman won wonder wooden words work working world worst would wright write writing written wrong xvii year years york you young your youth zarathustra zero";index.research="0461 0px 100 1304 1961 1971 1980 1982 1984 1985 1988 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 221 2286 235 289 317 322 324 327 3438 348 356 368 383 478 505 541 600 699 872 961 about above absolute academic access accomplished according account achieve acm actually additive adjusting adversarial adversarially adversary against agarwal algorithm algorithmic algorithmica algorithms all allow allows almost alphabet also always american among amortized amos analyses analysis analytic analyze analyzes analyzing and another answer answers any applicability application applications applied applies approach approaches approximate approximately approximates approximating approximation april arbitrary are area arises array asia asks aslam assign assignment assumes assuming astronomical asymmetric authored authors available average avoids balaji balance balanced balancing bandwidth barman based basic beating because been before behavior being below benders bent best better between biased bibtex bicriteria bid bidding bids bin bioinformatics biology bipartite blanton boas book boolean borneman both bottleneck bound bounded bounding bounds bourns boustrophedon breadcrumbs bribery brief briefly brightnesses broadcast broadcasting broadcasts browsers but cable cache caching calinescu called can cannot cao capacities capacity capture captured carr case celestial cenk certain certifying challenge change changes channels chapter chapters check chernoff chooses choosing christofides christos chrobak cip circle circuit circuits claire class classifies clients cliff clones clonetools close cmilp coauthored coauthors cocoon code codebook codeword coding coefficients coherent collection college columns combinatorial combinatorics commodities commodity common communication communications communities comparison competitive competitiveness completion complexity comprehensive compression computation computational computations compute computer computes computing concerns conference congestion conjecture connected connections consider considered considers constant constraint constraints contact contains continuous contracting contrast control convergence convex copies copyrights corollary correct corrected cost costs counterparts cover covering crc criteria cross crossing current currently customers cut cycle cycles daniel danskin dantzig data david decide deciding decomposition decrease deepak defining definition degree deletion demands denotes dense department dependence depends derive derived deriving describe described describes design designing desirable desired despite detail determine determining deterministic developed dhiman diffuse digital digraph digraphs dijkstra dilley dimacs dimensional dimitrios direct directed direction directional directly disc discovery discrete disproving disseminating distance distributed distribution divesh dna document documenting does domain dominates dominating dorit download dual duality due dynamic each easy ece edge edges edited effective efficient eight either element elementary elements elias elizabeth ellipsoid embedding emde empirical empirically encode encoded encoding encyclopedia end engineering entire entries entropy environments equal equals equiprobable equivalent error etc euclidean eva evaluating evaluation evasiveness even every exact example examples except exchange existence exists expectation expected experimental experiments explain explained explanation explanations explicit explores exploring exponential exponentially extend extension extensive faced facilities facility fact factor faculty fall fashion fast faster fastest fault faults favor favorites faxing feasible features feedback fekete fiat fifo fifth file final find finding finds first fit fix fleischer flip flow flush focs focuses follow following follows footer for form formed formula formulae formulate formulated found foundations fractional free frequency from full fully fun function functions further galaxies game games gap garg gave gelal general generalization generalizations generalize generalized generalizes generalizing generally generates generating generation gentian geometric gets give given gives giving global glossary goal goemans golin gonzales good google graham graph graphs greedy grigoriadis gruia guarantee guarantees guided gunopulos had hakimi handbook handicapped hard hardness has have having held here heuristic heuristics hierarchical high hitting hoc hochbaum holding holds home how howard huan huffman hull hybridization icalp idea ideas ieee illustrated image implement implementation implementations implemented important improved improvement improves include includes including incorporated increase increases incremental indeed independently index individual inequality infinite informal informatics information ink input inputs insertion insight insignificant instance instead integer integrality integrated interest interested interesting international internet into introduced introduces introducing introduction ipco irani issues item items iterations its itself jakllari james jay jeff jessica jochen joel john journal journals karger karloff karp keep keys khachiyan khuller klein klemmstein knapsack knowledge known knows kolliopoulos konemann korn koufogiannakis koutsoupias krishnamurthy kurt label labels lagrangean lagrangian landlord language large larger last laszlo latin latter lead leads leaf least leaves lecture lectures left leighton length lengths less letter letters likely limited limits lin line linear links lipton lisa lloyd lncs local location log logarithm logarithmic logarithmically long lookahead loose lovasz low lower lru luby lupton lyle macroscopic made main mainly maintains makespan maley management many map marek marking markov match matches matching mathematics mathieu matias matrices matrix max maximally maximize maximizes maximum may mcgeoch mean means measurement measuring median medians medium meet meeting meg mehlhorn memory mesh message messages metaheuristics method methods metric mettu michael michel microbial mike mikkel millar miller million mimd min minimize minimizing minimum mining minor miscellaneous mixed mobile model models modification modified modifying monotone mordecai more morse most mst much multi multicommodity multiobject multiple multiplicative multiplicity multiway must naive naveen navigation neal near nearly necessary negative neighbor neil neither nested net network networks neumann new nicolas nisan noam node nodes noga non nor norms not note notes notion noy number numeric objective objectives objects observation observed obtain obtained off ofrg one online only open operation operations opponent optimal optimally optimization optimize optimum order ordered orient orienting original orlin other our out output over overall pacific package packets packing page pages paging pairs papadimitriou paper papers parallel parameter parametric parsimonius part particular particularly path paths pattern patterns pays pei per perform performance performed periodically personal phil phones photos placing plane plaxton play player plotkin plus points polylog polynomial posed positions positive possible post potential prabhakar practical practice predecessor prefix present presented presenting presents previous previously prim primal princeton principles priority probabilistic probabilistically probability problem problems procedure processing produce program programming programs proof proofs properties property proportional protocol protocols provably prove proved provide provided provides proxies proxy ptas public publications publicly published publishers pubs pure pushes puzzles qin quadratic quarter queries question queues rabani raghavachari raghavan random randomized randomly rao rasala rate rates ratio ratios reachability received recently reduce reduces related relations relaxation relaxations rely remain remaining removal removes rental report represent representing request require required requires research reserved resorted respect response restriction result resulting results retrieve return returned returns revealed reverse rgreedy richard rnc robert role root rooted roughly round rounding rounds routed rows run running runs sahinalp salesman same samir sandor sandy sat satellites satisfy satisfying satish schabanel schedule schedules scheduling scheme schemes schmeichel scholar science sciences search second see selecting semidefinite seminal sense sensor separates separator sequence sequences sequential serge series serve server set sets setting several severely shmoys short shortest should show showing shows siam significant similar similarity simple simpler simplex simultaneously since single size sizes sketch ski skip sky sleator slides slightly sloan sloane small snapshot snapshots society soda software solution solutions solvable solve solved solving some source space spanning special specific specified spectrograph speed springer sqrt squid srikanth srivastava stage standard start starts stavros stein step steps stoc stochastic stop stops strategies strategy strengthen strengthened stretch strictly strongly structure structures studied studies study sub subgraph subject submit submits submodular subset successfully successor such suggest suggesting sum summaries summary sums support surmount surprising survey symposium system systematic systems take taken takes taking tardos targeting tarjan taught tcp teaching technical technique techniques telescope tending tends teo term terminal terminals terms testing text than that the their them then theorem theorems theoretical theoretically theory there therefore these thesis they thirds this thorup those three threshold through throughput tiling time times together tolerance tom too topic topics topology total trade traditional traffic transform traveling tree trees triangle triangulation trip trivial tsp tune twice two type typically ucr umesh underlies underlying understand understanding undirected unequal uniform uniformly unit university unknown unless unpublished until upper use used useful users uses using uzi value van variables variant variants varies vazirani vectors version vertex vertices very via vishkin vita vitter von wads wait wald was web weight weighted weights wein well were what when where whereas whether which while who whose will williamson with within without witnesses wolfe word words work worked working works worse worst would yet yields yossi you young yuval zero zeros zhang";index.schedule="afternoons algorithms and bourns breadcrumbs browser calender can college computer conflicting contact current does early email engineering events faculty feedback footer for fun here home iframes late main meeting mornings navigation neal not page password photos prefer problems puzzles research schedule science search see send show skip support teaching the this times ucr vita with you young your";index.slideshow="algorithms and animal antelope big bourns breadcrumbs browser can canyon college computer contact creek cucamonga diego does eagle engineering faculty falls farm feedback footer forest fun gorgonio home idaho iframes joshua kings lake lakes leland limecreek little lone main moccasin national navigation neal not oregon page park photos pine problems puzzles research san schedule science search see sequoia silver skip slideshow support sur teaching this trail tree tunnel ucr valley victor vids vita west yosemite you young your";index.ta="001 002 003 005 006 008 010 012 014 021 022 023 024 025 026 027 028 029 030 031 032 033 034 035 036 037 038 039 040 041 042 043 044 045 046 047 048 049 050 061 100 101 120b 141 150 152 153 160 161 161l 179g 179k 183 2008 algorithms also and apr assignment based bernstein bourns brady breadcrumbs browdus cancellation cetindil change chrobak ciardo class cole college comments commitments computer contact cortes czechowski diep email emailed engineering etc ezeobiejesi faculty feedback fernandez final fleisch footer fun gustafson hakkoymaz harris home hsieh huang huo jiang kasetty keogh khare kuang labs linard list lonjers main mecham medina miller molle mueen najjar navigation neal ning notes page payne pct peng photos please problems process przym pusukuri puzzles questions read research salloum santhanam schedule science search see sheng shi skip smith soriano spring tba teaching tentative the these this ucr updates vanda vieira vita wang wei who will woss young zhu";index.ta_explanation="005 006 008 010 012 120b 2nd about account admitted advisor after algorithms also and another appreciate are ask assigned assignment assignments avoid backgrounds before bourns breadcrumbs but can chair classes college coming committee computer conflict conflicts considerations constraints consultation contact converge counts course cs287 currently department determined does during each early easier engineering enrolled especially exceptions exchanging explanation faculty feedback first footer for from fun generally given goal good has have head home hours how ideally includes ing instructor instructors into job know lab labs large less let level levels main makes master match means meets month more multiple navigation neal necessary need notes now one order other otherwise out page particular patience per photos please possible practice problems process promised puzzles qualified reduced request requested requests requirement research rounds same schedule schedules science search second shouldn skip someone sometimes soon starts still student students subject such suggest support supported taing taken tas teaching term terri than that the their them these they this three time transition try two ucr undergraduate used useful usually vanda various vita wait waived want week welcomed what when which who whom with work working year yes you young your";index.tcp_ip_links="111 115 129 1350 140 156 16262 165 169035 1737214 17th 181366 1902794 1969 197931 1985 1988 1989 199010 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 218 226 235 252 259384 280819 28th 303 312 319471 31st 329 32nd 337047 34969 35th 371772 387 38th 398 39th 415830 458229 460684 4670 471986 490101 494567 496450 4966 598 598w02 71263 77736 800 818 832 91517 984895 99abstracts abhinav able about above access achieve achieved acm active activity adapted added addition additive adjustments admission advances afek afek96convergence agenda agent aggregate aimd algorithm algorithmic algorithms allocated allocation allow also amazon american amir ams analysis analytical analyzes anarchy and annual another appear appears applications applied apply approach approx approximated approximately approximation approximations arbitrarily arbitrary architectures are area argues arguments article aspects asymptotic athuraliya athuraliya99optimization att auctions august austin automatica available avoidance awerbuch awerbuch97converging background bad balakrishnan balancing bandwidth bansal bartal bartal97global based basic behavior being bell berkeley bhattacharyya bibliography bin bottleneck bourns breadcrumbs bredin brief broken brought buffy built byers cal caltech cam cambridge can capacities carlo carrying case center certain cgi challenging changing chaos charge charges charging chen china chiu choice choose christos chyouhwa citeseer claim clark class classes classic close collected collection collections college com combinatorial combining comm commun communication communications comp compatability compatibility compatible compensations competition competitive complex complexity computational computer computing concentrate concerns conditions conference congavoid congestion congress connections contact context control controls converge convergence converging convex cooperation cooperative cost counters course covering criterion critique crowcroft crowcroft98differentiated cs294 cse csm2001 cued current cyberdig dah dartmouth database dec december decrease deepak definition delay delays demonstrate department describe described design designed despite detail detection determines deterministic diego different differentiated dimensional disciplines discussed discusses discussing discussion distributed doc documents does domino doyle duality due dullerud dynamic dynamics each early ecn economic economics ecse edge edition eds edu eduardo eecs effects efficiency efficient elastic eliciting employ end end2end enforce engineering equilibirum equilibrium equlibrium estimation estrin european eva evol evolution exhibit existence existing experience explicit exponential extending external faculty fair fairly fairness fall fast faster fatourou fatourou00efficiency fcfs features feb feedback feigenbaum few fifth filtering finally finite first fixed flow floyd floyd92traffic floyd93random floyd99promoting focs follow footer for force formulation foundations fourth fractional fradkov framework frank friendliness friendly from ftp fun functions further game games garg garg97faster gateways general generalizes gibbens gibbens98resource global gmsjsac2 goel goel00combining golestani gorinsky gov gradient greed group groups hardcover hari have herzog heterogeneous heterogenous hipparch his home homepages hosts how htm html ibm icir icsi idea ieee ietf implement implementation important improved improving includes including increase independent industrial infeng inferior infocom infocom9 information instability interest interesting international internet interpret interpretation into introduce introduced introduction ipam iro isbn isdn issues jacobson jacobson88congestion jain jhmo jitendra johari jon journal june kahin kalyanaraman kamra karp karp00optimization katz keller kelly kelly97charging kelly99mathematical khurana kleinberg konemann kotz koustosoupias kunniyur kunniyur00endtoend lab laboratory labs lapsley large larry last laws lbl lcs lead library like limin limitations linear link links list lists literature lmassoul load local logarithmic lond look loss losses low luenberger mac mackie magazine maheswaran mailing main make making management manager mansour many march marios mark market markets marking marks mason massoulie massoulie00stability mathematical mathematics matrix maulloo mavronicolas max maximizing may means measurement mechanism mechanisms medium meeting meets mentioned methods metro meyerson michigan microsoft mihalis min ming minimization minimum miscellany mit mixed mmi mobicom mobile model modeling modelling models modest modified monte more multi multicast multicommodity multiple multiplicative national navigation neal nec necessary need net netlab network networking networks new news newton nice nicely nisan nisan99algorithmic nms non not notices notification nov november now nrg nsf number objectives oblivious october odlyzko odlyzko97modest oechslin oft one online only open oper optimality optimistic optimization optimized optimizing optimum order org oscillations ostfeld other our out over overall overcomes overview overviews packet packetswitched packing padhye paganini paganini01stability page pages panagiota papadamitriou papadimitriou paper papers parallel parcftp paris particular paul paxson pay pdf peering per performance personal perspective peterson phase phil photos picn play plotkin plus pmp10 podc pogromsky pointers poisson policy posts power predominant prepared present presentation press preventing price prices pricing principle priorities problem problems proc proceedings programming project projection projects promoting proof propagation proportional proportionally proposal proposed protocol protocols proves provides pub public publications pubs puzzles qos quality question rabani rahul ramesh random rate rates raz reading readings reasonably recent references related rep repeated report res research researchers reshaping resource responsive resreps results rev reviews rfc3168 richard risk roberts robust ronen roughgarden round route routers routing rpi rst rus sally san satellite satisfies scalable scale scaled schedule schedulers schemes sci science sciences scott scripts search second segue self selfish seminar september sequential servers service services seshan shadow share sharing shavitt shenker shenker94making shenker95pricing shivkuma shivkumar short shown siam sig sigcomm sigcomm01 signals similar similarity simple simpler simulation simulations single skip slowcc slowly smart soc some sontag soton sources sp2001 space specific spirakis springer srikant stability stable staff state stated statistical stats statslab steinberg step steven stoc strategies structure such sufficient summary sun survey switch switched symp symposium synchronization synchronous system systems taiwan tan tardos task tcp teaching tech technical techniques telecommunication telecommunications texas textbooks texts that the then theoretic theoretical theory these thesis this those tim time times tools topics towards tr2000 trading traffic trans transactions transmissions transport trip tsinghua twenty txt ucl ucla ucr umich under understanding unicast unintended unit university update usa use user users using utexas utility varian various varun vazirani vector vegas versions versus via view vin vinnicombe vita vol volume walrand wang was watson way web website weighted when where whether which why wiley willinger window wireless wischik with without work works workshop wustl www xerox yannakakis york young";index.teaching="1996 1997 2004 2005 2006 2007 2008 advanced algorithms and approximation bourns breadcrumbs classes college combinatorial computation computer contact course cs141 cs145 cs215 cs260 current dartmouth data engineering evaluations faculty fall feedback footer frameworks fun graduate home intermediate main materials navigation neal novel optimization page photos problems proof puzzles related research schedule science search skip spring structures student teaching theoretical theory ucr undergraduate vita wiki winter young";index.vita="0461 0626912 0729071 1304 1981 1982 1983 1984 1985 1986 1987 1988 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 221 2286 235 289 317 322 324 327 348 356 368 383 423 478 505 519 541 699 7146 827 840 872 92521 951 961 9720664 achieve acm advanced adversarially against agarwal akamai algorithm algorithmic algorithmica algorithmics algorithms alto american amos analysis and applications applied approaches approx approximate approximating approximation april architect architectures are array asia aslam assistant associate astronomical astrophysics automata available balaji balance balancing bandwidth barman based basic beating began bell bent beta biased bicriteria bidding bioinformatics biology blanton board borneman bound bounded bourns boustrophedon breadcrumbs broadcast building cache caching california cambridge career cenk center challenge change chapter chernoff chicago christos chrobak chronological circuit cise claire cliff clones coauthors cocoon codebook coded coding collection college colloq colloquium combinatorial combinatorics committees commodity communications competitive competitiveness complexity components compression computation computational computer computing conference congestion connected consultant contact content continued control cornell corporation cost costs course cover covering crc cum current cut cycle daniel danskin dantzig dartmouth data david dec deepak degree delhi delivery department dependent design designed designing dhiman digital digraph digraphs dimacs dimitrios directional discovered discovery discrete distinction distributed divesh dna document dual duality ece edited edu education effective efficient elizabeth embedding encyclopedia end engineering environment equiprobable equivalent eva evaluation evaluations evasiveness existence experience experimental experiments explanation facility faculty faster feedback fekete fellowship fermilabs few fiat fifth file finding first flip flow focs footer for foundation foundations fractional frameworks fsttcs fully fun games garg gelal generation gentian geometric golin gonzales graduate grant graph graphics graphs greedy guided gunopulos hakimi handbook hard hertz heuristic hierarchical hoc home hopkins hosted huan huffman hybridization icalp ieee image implementation implementing improved including incremental india indian indiana industrial informatics information informs inputs institute instructor integer integrated interests intern international internet invented ipco iterations jakllari james jay jeff jessica john johns johnson jorge journal journals kappa karger karp khuller klein klemmstein knowledge kolliopoulos korn koufogiannakis krishnamurthy laboratories labs lafayette lagrangian languages large largest laszlo latin laude layer layout lecture length letter letters lin line linear lipton lncs load location loose lovasz low luby lupton lyle machine main maley management marek marking maryland matching materials mathematica mathematical mathematics mathieu matias maximizes mcgeoch measurement median medians mesh metaheuristics method methods metric michael mikkel millar miller minimum mining mixed mobile mordecai multi multiobject multiway national naveen navigation neal near neighbor neil network networking networks new nicolas node noga notes novel now nsf number online operation operationalized operations optimal optimization optimize order orienting orlin pacific packing page paging palo parallel parametric part patent path performance phi phil photos physical policies policy polynomial postdoc practical prefix present press primal princeton printed priority probabilistic problem problems proceedings processing professor program programmer programming programs project properties proxy publications puzzles qin queues raghavachari random randomization randomized rasala reachability reduce refereeing relaxation replacement report research reverse richard riverside robert robotics rounding sahinalp samir sandor scandinavian schabanel schedule scheduling scheme schmeichel science sciences scientist search selecting senior sensor sequential series server set shortest siam simple simplex simultaneously skip sky sleator sloan sloane slovaca small smartwork society soda software solving spaa span spanning specializing spectrograph springer squid srikanth srivastava states stavros stein stoc stolfi strategies strategy stretch strongly structures student sum summaries summer summers survey swat symp symposium system systematic systems talented tardos targeting tarjan taught tcp teaching technical technique technologies technology teenagers teo that the theorems theoretical theory thesis thorup throughput tiling time topology transactions transform trees ucr umiacs unequal united univ university use using uzi variant vazirani vertex via vijay vishkin visitor vita vitter wads wald web weight weighted wide wintek with without wolfe words workshop www yossi young youth zero zhang";index["final"]="1097 125 134 1974 1979 1988 1990 1994 1995 1996 1999 278 279 287 31st 37th 3sat 5th 627 636 647 aastad ability about above absolute accept according accuracy achievable achieve achieved achieves achieving acm adaptation adapted add added addition additional additive additively address addressed addressing adjacent adversary affects after against aided albeit algorithm algorithms all allows almost along alphabetical also alter always among amount amounts ams analysis analyze analyzer and annual another answer anticipated any appearing application applications applied approach appropriate approximate approximately approximates approximation approximations arbitrary arc are area areas argue argument arising arora article assign assigned assignment assignments assigns assume assuming atlanta attention augmented augmenting available average bait balance balanced based basic basis because been before beginning belongs below best better between beyond bin bins biology bipartite bisector blocks blum book boolean both bound bounded bounding bounds brief briefly brown budget burlington but calculate calculated calculates call called cambridge can cannot canonical capable capacity cardinality case cases categories categorize categorized category ccs certain challenge chapter chapters charge charges cheapest chernoff choice choose choosing chosen circle cite claim class classic clause clauses clearly clique close closed closest cluster clusters coarsen coarsened coarsening code codeword collection collectively college color coloring colors combination combinatorial come commercial common commonly company compendium competent complete completeness complex complexity complicated component comprehensive comprising computation computational computationally compute computed computer computers computing conjunctive connect connected connecting connectivity conquer consequently consider considerable considered consisting consists constant constitutes constrained constraint constraints construct constructing constructs contain containing contains context continues continuous contrast convenience convert converting correct correcting correspondence corresponding corresponds cost costs could course cover covered covering covers crc crescenzi criteria critical crossing crossings current currently cut cuts cycles dartmouth david dean decades define defined defining definite definition definitive deg degree degrees deleted deleting demonstrate denote denotes department depend dependence depends describe described design designer designing desired detailed details determine determined determines determining develop developed development developments deviate diameter did difference different differs difficult dimensional direct directed discovered discrete discuss discussed discussion disjoint disks distance distinct distinctions distribution distributions diversity divide divided dlp dna does doing done dorit down dual duality due dynamic each easier easily easy edge edges edited editor efficiently either elegance element elements eliminated embed encodes endpoint endpoints enough entries entry equal equality equals equations equivalent error errors essentially estimates etc euclidean evaluated even ever every evidence exact exactly example examples exceeds excellent except executes exist existence exists exp expect expectation expected explained expressible expression extension fact factor factors facts fairly familiar family far faster feasible few fewer field figure figuring fill final find finding finds finite first fixed focus focuses focusing follow following follows for forest form forms formula formulate formulated formulates found foundations fraction fractional framework freeman frequently from fully function functions fundamental further furthermore garey gaussian general generality generalization generalize generalized generalizes generalizing generally genus geometric georgia get give given gives giving goal goemans good graph graphs greater greatest greatly greedy group groups growing guarantee guaranteed guarantees guide guidelines had hamiltonian hamming hand handbook handle hard hardness has have having heaviest hence here highest hochbaum hold holds hope how however html huge hybrid idea ideas ieee illustrate imagine implicitly imply important imposed improve improvement improvements incident includes including indeed independent indicated indicates induced induction inequalities inequality infinity information initializes inplans input inputs inserting instance instances integer integral integrality intent interested interesting interpreted into introduction intuitively involved involving issues item items iteration iterations itp its itself jiang jobs john johnson journal just kann key kind klein knapsack know known kth large larger largest latter lattice learning least leave lecture led left length less let light like likely limited limits line linear lines literature load log logarithmic logarithmically longest loop loosely loss louis lower machines made magnitude main make makes makespan making many match matches matching mathematics matrix matter max maximal maximization maximize maximizes maximizing maximum may meaning means measured measures meet meeting member mention mentioned met method methodological methods metric michael might mihail min minimization minimize minimizes minimizing minimum missouri mixed model models modification more most mostrel motwani much multi multiple multiplicative multiplying must nada naive namely natural naturally nature neal near nearest nearly necessarily need needed needs negated negative neighbors nemhauser network nevertheless new next nodes non none nonetheless normal not note notes notion novel number numbers objective observation observe observed obtain obtained obtaining obtains often omit once one only opt optimal optimality optimally optimization optimize optimum option order ordering organized organizing original other others otherwise our out output outputs over packing packings pages pair pairs pairwise parallel parameter particular partition passing path paths people per perform performance perhaps person philip planar plane play plus point points poly polylogarithmic polynomial polynomially poor positive possible possibly precise precisely precision preliminary presence presented preserves press presumed previous previously primal primarily principle principles probabilistic probability problem problemlist problems proc procedure procedures proceedings proceeds process produce product profit profits program programming programs progress promising proof properties propositional provable provably prove proved proven provide provided provides providing proving publishing purposes put pws quality quantifiably quickly raghavan random randomized randomly ranges rank rarely rather ratio ratios ravi reader real reason reasonably reasoning recall receive recent recipe reduce reduced references region regions relate related relative relatively relax relaxation relaxations relaxed relaxing rely remained remains remarkable remarkably removing repeat replacing represent representative representing required requirement requires rescalable research researchers resource respect respectively restrict restricted restricting restriction restricts result resulted resulting results return returned returns right role rough round rounded rounding ruled run running runs said salesman same sampling sat satisfiability satisfiable satisfies satisfying say scaled scaling scand schedule scheduling scheme schemes science sciences scientists searchable second section sections see seek seen segments select selected semi semidefinite sense separation separator separators sequencing series serve set sets settle seventh several shaded shall shallcross share shmoys short shortest should show shown shows siam significant similar similarly simple simplicity simplified simply simultaneously since single size sketch slight slightly slowly small smaller smallest snp solution solutions solve solved solves solving some something somewhat sons sophisticated source sources space spanning sparse speaking special specifically specified specifying spirit springer squares standard start state statement steiner step steps still storage story strictly string strings strongly structure studied subfamily subject submodular subsequent subsequently subset subtree subtrees such suffices sufficient sum summarize summary summing superstrings suppose survey survivable switch symposium system table take taken takes task tasks technically technique techniques term terminals terminates terminology terms text than that the them then theorem theory there therefore these they thing think third this though three through thus tight time times together too topics topology total towards transform translates traveling tree trees tremendous triangle tromp true truth tsp tuned turn twice two type typical typically uncovered under underlying understanding undirected uniform union universally universe university unknown unless unlikely unnecessary unrelated until unweighted upper use used useful usefulness uses using usual usually value values variable variables variant varied variety vector vectors verified verify verlag vermont version vertex vertices very via viewed vinn visits was way ways weaker weight weighted weights well were what whatever when where whether which while whole whose wide wiley will willing wise wish with within without witness witnesses wolsey work works worksh worst would writing written www yannakakis yet yields york young";index.final2="1979 and chapters completeness for garey johnson see the theory those unfamiliar with";index.final3="alternative analysis average case chapter see this worst";index.final4="actually analysis and any applied balanced captures choose commodities commodity congestion each edge essential example flow for given hard here integer matching maximum minimizing multicommodity network pair path polynomial problem problems randomized rounding set similar simple simplicity solvable spirit studied that the time typically use version vertices well whereas";index.final5="any events happens individual most probabilities probability several sum that the";index.final6="algorithm also alternative approximation authors but call confusingly finds frequently have literature most one refer some term terminology the this used what";index.final7="additional any are assuming constraints fact form incentive larger make may necessary negative non reader redundant such than the there vertex weights whether wonder would";index["crc-approx-algs"]="1097 125 134 1974 1979 1988 1990 1994 1995 1996 1999 278 279 287 31st 37th 3sat 5th 627 636 647 aastad ability about above absolute accept according accuracy achievable achieve achieved achieves achieving acm adaptation adapted add added addition additional additive additively address addressed addressing adjacent adversary affects after against aided albeit algorithm algorithms all allows almost along alphabetical also alter always among amount amounts ams analysis analyze analyzer and annual another answer anticipated any appearing application applications applied approach appropriate approximate approximately approximates approximation approximations arbitrary arc are area areas argue argument arising arora article assign assigned assignment assignments assigns assume assuming atlanta attention augmented augmenting available average bait balance balanced based basic basis because been before beginning belongs below best better between beyond bin bins biology bipartite bisector blocks blum book boolean both bound bounded bounding bounds brief briefly brown budget burlington but calculate calculated calculates call called cambridge can cannot canonical capable capacity cardinality case cases categories categorize categorized category ccs certain challenge chapter chapters charge charges cheapest chernoff choice choose choosing chosen circle cite claim class classic clause clauses clearly clique close closed closest cluster clusters coarsen coarsened coarsening code codeword collection collectively college color coloring colors combination combinatorial come commercial common commonly company compendium competent complete completeness complex complexity complicated component comprehensive comprising computation computational computationally compute computed computer computers computing conjunctive connect connected connecting connectivity conquer consequently consider considerable considered consisting consists constant constitutes constrained constraint constraints construct constructing constructs contain containing contains context continues continuous contrast convenience convert converting correct correcting correspondence corresponding corresponds cost costs could course cover covered covering covers crc crescenzi criteria critical crossing crossings current currently cut cuts cycles dartmouth david dean decades define defined defining definite definition definitive deg degree degrees deleted deleting demonstrate denote denotes department depend dependence depends describe described design designer designing desired detailed details determine determined determines determining develop developed development developments deviate diameter did difference different differs difficult dimensional direct directed discovered discrete discuss discussed discussion disjoint disks distance distinct distinctions distribution distributions diversity divide divided dlp dna does doing done dorit down dual duality due dynamic each easier easily easy edge edges edited editor efficiently either elegance element elements eliminated embed encodes endpoint endpoints enough entries entry equal equality equals equations equivalent error errors essentially estimates etc euclidean evaluated even ever every evidence exact exactly example examples exceeds excellent except executes exist existence exists exp expect expectation expected explained expressible expression extension fact factor factors facts fairly familiar family far faster feasible few fewer field figure figuring fill final find finding finds finite first fixed focus focuses focusing follow following follows for forest form forms formula formulate formulated formulates found foundations fraction fractional framework freeman frequently from fully function functions fundamental further furthermore garey gaussian general generality generalization generalize generalized generalizes generalizing generally genus geometric georgia get give given gives giving goal goemans good graph graphs greater greatest greatly greedy group groups growing guarantee guaranteed guarantees guide guidelines had hamiltonian hamming hand handbook handle hard hardness has have having heaviest hence here highest hochbaum hold holds hope how however html huge hybrid idea ideas ieee illustrate imagine implicitly imply important imposed improve improvement improvements incident includes including indeed independent indicated indicates induced induction inequalities inequality infinity information initializes inplans input inputs inserting instance instances integer integral integrality intent interested interesting interpreted into introduction intuitively involved involving issues item items iteration iterations itp its itself jiang jobs john johnson journal just kann key kind klein knapsack know known kth large larger largest latter lattice learning least leave lecture led left length less let light like likely limited limits line linear lines literature load log logarithmic logarithmically longest loop loosely loss louis lower machines made magnitude main make makes makespan making many match matches matching mathematics matrix matter max maximal maximization maximize maximizes maximizing maximum may meaning means measured measures meet meeting member mention mentioned met method methodological methods metric michael might mihail min minimization minimize minimizes minimizing minimum missouri mixed model models modification more most mostrel motwani much multi multiple multiplicative multiplying must nada naive namely natural naturally nature neal near nearest nearly necessarily need needed needs negated negative neighbors nemhauser network nevertheless new next nodes non none nonetheless normal not note notes notion novel number numbers objective observation observe observed obtain obtained obtaining obtains often omit once one only opt optimal optimality optimally optimization optimize optimum option order ordering organized organizing original other others otherwise our out output outputs over packing packings pages pair pairs pairwise parallel parameter particular partition passing path paths people per perform performance perhaps person philip planar plane play plus point points poly polylogarithmic polynomial polynomially poor positive possible possibly precise precisely precision preliminary presence presented preserves press presumed previous previously primal primarily principle principles probabilistic probability problem problemlist problems proc procedure procedures proceedings proceeds process produce product profit profits program programming programs progress promising proof properties propositional provable provably prove proved proven provide provided provides providing proving publishing purposes put pws quality quantifiably quickly raghavan random randomized randomly ranges rank rarely rather ratio ratios ravi reader real reason reasonably reasoning recall receive recent recipe reduce reduced references region regions relate related relative relatively relax relaxation relaxations relaxed relaxing rely remained remains remarkable remarkably removing repeat replacing represent representative representing required requirement requires rescalable research researchers resource respect respectively restrict restricted restricting restriction restricts result resulted resulting results return returned returns right role rough round rounded rounding ruled run running runs said salesman same sampling sat satisfiability satisfiable satisfies satisfying say scaled scaling scand schedule scheduling scheme schemes science sciences scientists searchable second section sections see seek seen segments select selected semi semidefinite sense separation separator separators sequencing series serve set sets settle seventh several shaded shall shallcross share shmoys short shortest should show shown shows siam significant similar similarly simple simplicity simplified simply simultaneously since single size sketch slight slightly slowly small smaller smallest snp solution solutions solve solved solves solving some something somewhat sons sophisticated source sources space spanning sparse speaking special specifically specified specifying spirit springer squares stad standard start state statement steiner step steps still storage story strictly string strings strongly structure studied subfamily subject submodular subsequent subsequently subset subtree subtrees such suffices sufficient sum summarize summary summing superstrings suppose survey survivable switch symposium system table take taken takes task tasks technically technique techniques term terminals terminates terminology terms text than that the them then theorem theory there therefore these they thing think third this though three through thus tight time times together too topics topology total towards transform translates traveling tree trees tremendous triangle tromp true truth tsp tuned turn twice two type typical typically uncovered under underlying understanding undirected uniform union universally universe university unknown unless unlikely unnecessary unrelated until unweighted upper use used useful usefulness uses using usual usually value values variable variables variant varied variety vector vectors verified verify verlag vermont version vertex vertices very via viewed vinn visits was way ways weaker weight weighted weights well were what whatever when where whether which while whole whose wide wiley will willing wise wish with within without witness witnesses wolsey work works worksh worst would writing written www yannakakis yet yields york young";index.papers="0461 0px 100 1304 1961 1971 1980 1982 1984 1985 1988 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 221 2286 235 289 317 322 324 327 3438 348 356 368 383 478 505 541 600 699 872 961 about above absolute academic access accomplished according account achieve acm actually additive adjusting adversarial adversarially adversary against agarwal algorithm algorithmic algorithmica algorithms all allow allows almost alphabet also always american among amortized amos analyses analysis analytic analyze analyzes analyzing and another answer answers any applicability application applications applied applies approach approaches approximate approximately approximates approximating approximation april arbitrary are area arises array asia asks aslam assign assignment assumes assuming astronomical asymmetric authored authors available average avoids balaji balance balanced balancing bandwidth barman based basic beating because been before behavior being below benders bent best better between biased bibtex bicriteria bid bidding bids bin bioinformatics biology bipartite blanton boas book boolean borneman both bottleneck bound bounded bounding bounds bourns boustrophedon bribery brief briefly brightnesses broadcast broadcasting broadcasts browsers but cable cache caching calinescu called can cannot cao capacities capacity capture captured carr case celestial cenk certain certifying challenge change changes channels chapter chapters check chernoff chooses choosing christofides christos chrobak cip circle circuit circuits citeseer claire class classes classifies clients cliff clones clonetools close cmilp coauthored coauthors cocoon code codebook codeword coding coefficients coherent collection college columns combinatorial combinatorics commodities commodity common communication communications communities comparison competitive competitiveness completion complexity comprehensive compression computation computational computations compute computer computes computing concerns conference congestion conjecture connected connections consider considered considers constant constraint constraints contact contains continuous contracting contrast control convergence convex copies copyrights corollary correct corrected cost costs counterparts cover covering crc criteria cross crossing current currently customers cut cycle cycles daniel danskin dantzig data david decide deciding decomposition decrease deepak defining definition degree deletion demands denotes dense department dependence depends derive derived deriving describe described describes design designing desirable desired despite detail determine determining deterministic developed dhiman diffuse digital digraph digraphs dijkstra dilley dimacs dimensional dimitrios direct directed direction directional directly disc discovery discrete disproving disseminating distance distributed distribution divesh dna document documenting does domain dominates dominating dorit download dual duality due dynamic each easy ece edge edges edited effective efficient eight either element elementary elements elias elizabeth ellipsoid embedding emde empirical empirically encode encoded encoding encyclopedia end entire entries entropy environments equal equals equiprobable equivalent error etc euclidean eva evaluating evaluation evasiveness even every exact example examples except exchange existence exists expectation expected experimental experiments explain explained explanation explanations explicit explores exploring exponential exponentially extend extension extensive faced facilities facility fact factor faculty fall fashion fast faster fastest fault faults favor favorites faxing feasible features fekete fiat fifo fifth file final find finding finds first fit fix fleischer flip flow flush focs focuses follow following follows for form formed formula formulae formulate formulated found foundations fractional free frequency from full fully fun function functions further galaxies game games gap garg gave gelal general generalization generalizations generalize generalized generalizes generalizing generally generates generating generation gentian geometric gets give given gives giving global glossary goal goemans golin gonzales good google graham graph graphs greedy grigoriadis gruia guarantee guarantees guided gunopulos had hakimi handbook handicapped hard hardness has have having held here heuristic heuristics hierarchical high hitting hoc hochbaum holding holds home how howard huan huffman hull hybridization icalp idea ideas ieee illustrated image implement implementation implementations implemented important improved improvement improves include includes including incorporated increase increases incremental indeed independently index individual inequality infinite informal informatics information ink input inputs insertion insight insignificant instance instead integer integrality integrated interest interested interesting international internet into introduced introduces introducing introduction ipco irani issues item items iterations its itself jakllari james jay jeff jessica jochen joel john journal journals karger karloff karp keep keys khachiyan khuller klein klemmstein knapsack knowledge known knows kolliopoulos konemann korn koufogiannakis koutsoupias krishnamurthy kurt label labels lagrangean lagrangian landlord language large larger last laszlo latin latter lead leads leaf least leaves lecture lectures left leighton length lengths less letter letters likely limited limits lin line linear links lipton lisa lloyd lncs local location log logarithm logarithmic logarithmically long lookahead loose lovasz low lower lru luby lupton lyle macroscopic made main mainly maintains makespan maley management many map marek marking markov match matches matching mathematics mathieu matias matrices matrix max maximally maximize maximizes maximum may mcgeoch mean means measurement measuring median medians medium meet meeting meg mehlhorn memory mesh message messages metaheuristics method methods metric mettu michael michel microbial mike mikkel millar miller million mimd min minimize minimizing minimum mining minor miscellaneous mixed mobile model models modification modified modifying monotone mordecai more morse most mst much multi multicommodity multiobject multiple multiplicative multiplicity multiway must naive naveen neal near nearly necessary negative neighbor neil neither nested net network networks neumann new nicolas nisan noam node nodes noga non nor norms not note notes notion noy number numeric objective objectives objects observation observed obtain obtained off ofrg one online only open operation operations opponent optimal optimally optimization optimize optimum order ordered orient orienting original orlin other our out output over overall pacific package packets packing page pages paging pairs papadimitriou paper papers parallel parameter parametric parsimonius part particular particularly path paths pattern patterns pays pei per perform performance performed periodically personal phil phones photos placing plane plaxton play player plotkin plus points polylog polynomial posed positions positive possible post potential prabhakar practical practice predecessor prefix present presented presenting presents previous previously prim primal princeton principles priority probabilistic probabilistically probability problem problems procedure processing produce program programming programs proof proofs properties property proportional protocol protocols provably prove proved provide provided provides proxies proxy ptas public publications publicly published publishers pubs pure pushes puzzles qin quadratic quarter queries question queues rabani raghavachari raghavan random randomized randomly rao rasala rate rates ratio ratios reachability received recently reduce reduces related relations relaxation relaxations rely remain remaining removal removes rental report represent representing request require required requires research reserved resorted respect response restriction result resulting results retrieve return returned returns revealed reverse rgreedy richard rnc robert role root rooted roughly round rounding rounds routed rows run running runs sahinalp salesman same samir sandor sandy sat satellites satisfy satisfying satish schabanel schedule schedules scheduling scheme schemes schmeichel scholar science sciences search second see selecting semidefinite seminal sense sensor separates separator sequence sequences sequential serge series serve server set sets setting several severely shmoys short shortest should show showing shows siam significant similar similarity simple simpler simplex simultaneously since single size sizes sketch ski sky sleator slides slightly sloan sloane small snapshot snapshots society soda software solution solutions solvable solve solved solving some source space spanning special specific specified spectrograph speed springer sqrt squid srikanth srivastava stage standard start starts stavros stein step steps stoc stochastic stop stops strategies strategy strengthen strengthened stretch strictly strongly structure structures studied studies study sub subgraph subject submit submits submodular subset successfully successor such suggest suggesting sum summaries summary sums support surmount surprising survey symposium system systematic systems take taken takes taking tardos targeting tarjan taught tcp technical technique techniques telescope tending tends teo term terminal terminals terms testing text than that the their them then theorem theorems theoretical theoretically theory there therefore these thesis they thirds this thorup those three threshold through throughput tiling time times together tolerance tom too topic topics topology total trade traditional traffic transform traveling tree trees triangle triangulation trip trivial tsp tune twice two type typically ucr umesh underlies underlying understand understanding undirected unequal uniform uniformly unit university unknown unless unpublished until upper use used useful users uses using uzi value van variables variant variants varies vazirani vectors version vertex vertices very via vishkin vita vitter von wads wait wald was web weight weighted weights wein well were what when where whereas whether which while who whose will williamson with within without witnesses wolfe word words work worked working works worse worst would yet yields yossi you young yuval zero zeros zhang";index.photos="10pt animal antelope arches background banff big bodie body border bryce canada canyon collapse creek cucamonga diego div eagle falls farm font forest gorgonio idaho india joshua kings lake lakes leland limecreek little lone margin meadows moccasin mono mountain national neal oregon pagewrapper park photos photosmenuitem pine san sequoia silver sur table trail tree tunnel tuolumne valley victor vids west white whitewater yosemite young zion";index.photos_dynamic="0px algorithms bourns breadcrumbs college computer current faculty farm frisbee fun home lake leland limecreek main navigation neal page photos quotes research science teaching ucr ultimate vids west young";index.photos_h="0px algorithms animal antelope big bourns breadcrumbs canyon college computer creek cucamonga current diego eagle faculty falls farm forest frisbee fun gorgonio home idaho joshua kings lake lakes leland limecreek little lone main moccasin national navigation neal oregon page park photos pine quotes research san science sequoia silver sur teaching trail tree tunnel ucr ultimate valley victor vids west yosemite young";index.poster="0461 100 1103 1304 1961 1971 1980 1982 1984 1985 1988 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2011 2012 221 2286 235 23rd 289 317 322 324 327 3438 348 356 368 383 478 505 541 600 605 699 872 961 abdullah about above absence absolute access accomplished according account achieve acm actually addition additive address adjusting admissible adoption adversarial adversarially adversary affinely aforementioned against agarwal algorithm algorithmic algorithmica algorithms all allow allows almost alphabet already also always american among amortized amos analog analyses analysis analytic analyze analyzes analyzing and another answer answers antenna any appears applicability application applications applied applies approach approaches approximate approximately approximates approximating approximation april arbitrary are area arises arman array arrayed asia asks aslam assign assignment assume assumes assuming astronomical asymmetric augmented authored authors available average avoids balaji balance balanced balancing ball balls bandwidth barman based basic beating because been before behavior being below benchmark benders bent berman best better between biased bicriteria bid bidding bids bin binary bioinformatics biology biometrics bipartite blanton boas boolean borneman both bottleneck bound bounded bounding bounds bourns boustrophedon breadcrumbs brief briefly brightnesses broadcast broadcasting broadcasts browsers building but cable cache caching calibrate calinescu call called can cannot cao capacities capacity capture captured care case cases causes celestial cenk centered centralized certain certifying challenge change changes channels chapter check chernoff chooses choosing christofides christos chrobak cip circle circuit circuits circular claire class classic classification classified classifiers classifies clients cliff clone clones clonetools close closed cmip coauthored cocoon code codebook codeword coding coefficients coherent collection college columns combinatorial commodities commodity common communicate communication communications communities community comparable comparison competitive competitiveness completion complexity comprehensive compression computation computational computations compute computed computer computes computing concerns conference configuration confirm congestion conjecture conjunctions connected connecting connection connections consider considered considers consists constant constrained constrains constraint constraints construct contains continuous contracting contrast control convergence converted convex cornell corollary correct corrected cost costs count counterparts cover covering crc created creates criteria cross crossing current currently customers cut cycle cycles daniel danskin dantzig data datasets david decide deciding decomposition decrease decreasing deepak defining definition degree deletion demands demonstrate denotes dense department dependence depends derive derived deriving describe described describes design designing desired despite detail determine determining deterministic developed dhiman diffuse digital digraph digraphs dijkstra dilley dimacs dimensional dimitrios direct directed direction directional directly disc discovered discovery discrete disjunctions disk disproving disseminating distance distances distinguishes distributed distribution diverse divesh dna document documenting does domain domains dominates dominating dorit dual duality duals due dynamic each eamonn easy ece edge edges effective efficiency efficient eight either element elementary elements elias elizabeth embedding emde empirical empirically encode encoded encoding encyclopedia end entire entries entropy environments equal equals equilibrium equipped equiprobable equivalent error etc euclidean eva evaluating evaluation evasiveness even events every exact exactly example examples except exchange existence exists expectation expected experiment experimental experiments explain explained explanation explicit explores exploring exponential exponentially expressed expressive expressiveness extend extension extensive faced facilities facility fact factor faculty fails fall fast faster fastest fault faults favor faxing feasible features fekete fiat fifo fifth file final find finding finds fingerprints first fit fix fleischer flip flow flush focs focuses follow following follows footprint for form formed formula formulae formulate formulated formulation found foundations fractional free frequency from full fully fun function functions fundamental further gained galaxies game games gap garg gave gelal gene general generalization generalizations generalize generalized generalizes generally generates generating generation gentian geometric gesture gets give given gives giving global goal goemans golin good graham graph graphs greedy grigoriadis gruia guarantee guarantees guided gunopulos had hakimi handbook handicapped hard hardness has have having held here heuristic heuristics hierarchical high highly hitting hoc hochbaum holding holds home hop hops how howard however huan huffman hull hybridization hybridizing hyperedges hypergraphs icalp idea ideas ieee illustrated image immense implement implementation implementations implemented important improved improvement improves include includes including incorporated increase increases incremental indeed independent independently index individual inequality infinite informal informatics information ink input inputs insertion insight insights insignificant instance instances instead integer integrality integrated integrates intelligent interest interested interesting international internet intersection into introduced introduces introducing introduction ipco irani issues item items iterations its itself jakllari james jay jeff jessica jochen joel john journal karger karloff karp keep keogh keys khachiyan khuller klein klemmstein knapsack knowledge known knows kolliopoulos konemann korn koufogiannakis koutsoupias krishnamurthy kurt label labels lagrangean lagrangian landlord language large larger last laszlo latin latter lead leads leaf least leaves lecture lectures left leighton length lengths less letter letters likely limitations limited limits lin line linear lipton lisa lloyd lncs local locally location log logarithmic logarithmically logical long lookahead loose lovasz low lower lps lru luby lupton lyle macroscopic made magnitude main mainly maintains maintenance makespan maley management many map marek marking markov match matches matching mathematics mathieu matias matrices matrix max maximally maximize maximizes maximum may mcgeoch mean means measurement measuring median medians medium meet meeting meg mehlhorn memory message messages metaheuristics method methods metric mettu michael michel microbial mike mikkel millar miller million mimd min minimization minimize minimizing minimum mining minor mixed mobile model modeled models modification modified modifying monotone mordecai more morse most move mst much mueen multi multicommodity multiobject multiple multiplicative multiplicity multiway must mwt naive nash naveen navigation neal near necessary need needed negative neighbor neighbors neil neither nested net network networks neumann new next nicolas nisan noam node nodes noga non nor norms not note notes notion novel noy number numeric objective objectives objects observation observed obtain obtained occurs off offline ofrg oligonucleotide one online only open operation operations opponent opportunity optimal optimally optimization optimize optimum order ordered orie orient orienting origin original orlin other our out outperform output over overall overhead pacific package packets packing page pages paging pair pairs pairwise papadimitriou paper papers parallel parameter parametric parsimonius part particular particularly path paths pattern patterns pays pei per perform performance performed performs periodically philip phones placing plane plaxton play player playing plotkin plus podc point points poly polylog polynomial posed positions positive possible post poster potential prabhakar practical practice predecessor predictive prefix presence present presented presenting presents previous previously prim primal primitive princeton principles priority probabilistic probabilistically probability probe problem problems procedure process processing produce produces professor program programming programs proof proofs properties property proportional propose protocol protocols provably prove proved provide provided provides proxies proxy pruning ptas public publications publicly published pure purposes pushes qin quadratic quality quarter queries question questions queues rabani raghavachari raghavan random randomized randomly range rao rasala rate rates ratio ratios reachability received recently recognition recursive rediscovered reduce reduced reduces region related relations relaxation relaxations rely remain remaining removal removes report represent representation representing request require required requires research resorted respect response restriction result resulting results retrieve return returned returns reuse reverse rgreedy richard rnc robert robotics role root rooted roughly round rounding rounds routed row rows rrna run running runs sahinalp salesman same samir sample sandor sandy sat satellites satisfy satisfying satish schabanel schedule schedules scheduling scheme schemes schmeichel school science sciences search secon second see seen selected selecting semidefinite seminal sense sensor separates separator sequence sequences sequential serge series serve server set sets setting several severely shapelet shapelets shmoys short shortest should show showing shows siam signals significant significantly similar similarity simple simpler simplex simulated simultaneously since single size sizes sketch sky sleator slightly sloan sloane small snapshot snapshots soda software solution solutions solvable solve solved solving some source space spanning sparse special specific specified spectrograph speed springer squid srikanth srivastava stage standard start starts stavros stein step steps stoc stop stops strategies strategy strengthen strengthened stretch strictly strong strongly structure structures studied studies study subgraph subject submit submits submodular subset successfully successor such suggest suggesting sum summaries summarization summary sums support surmount surprising survey symposium system systematic systems tail take taken takes taking tardos targeting tarjan tasks taught tcp teaching technical technique techniques telescope tending tends term terminal terminals terms than that the their them then theorem theorems theoretical theoretically theory there therefore these thesis they thirds this thorup those though three threshold through throughput thus tight tiling time times together tolerance tom too topic topology total track tracking trade tradeoff tradeoffs traditional traffic transactions transform transmissions traveling tree trees triangle triangulation trip trivial tsp tune twice two type typically ucr udg umesh underlies underlying understand understanding undirected unequal uniform uniformly unit university unknown unless unpublished until update upper upwards use used useful users uses using utility uzi value values van variable variables variant variants varies variety vazirani vector vectors version vertex vertices very via vishkin visualization vitter von wads wait wald was way web weight weighted weights wein well were what when where whereas whether which while who whose will williamson with within without witnesses wolfe word words work worked working works worse worst would yet yields yossi you young yousefi yuval zero zeros zhang";index.promotion="algorithm algorithms and approximation arbitrary beating bourns breadcrumbs coding college competitiveness computer constraints cost costs cover covering cut distributed dual embedding faculty for fractional geometric greedy home huffman letter linear loose main materials minimum multiway navigation neal other packing paging papers parallel problems program programs promotion randomized research rounding science search selected server seven simplex solving statement submodular the ucr unequal vertex vita weighted with without young";index.proof_problems="0001 0101 100 101 102 5th absolute adds adjacent advance agree airline airlines algorithms alice all allowed always among and announces another any apply arbitrary are arithmetic around assigned audience average aweb baseball between bit blue bob both bound bourns boys breadcrumbs brother but can candy cannot card cards carefully check chooses cities coins college color com common computer connected connects consecutive contained contains control converges could cover current cycle cycles day deck decrease define density determine did differ different diffs directions discs distance distinct distributive does each either elizabeth equal evaluations every exactly example exceeding exclusion exist existence expressed expression expressions faculty fatland find finite first flight flights flip following for form four from function gave generate girls given gives graph hamming hanoi has have her hides hiding him his home identity inclusion independently inequality infinite infinitely initial integer integers intersect into isn item items john kind label labelled labels later law least length lipton logic lower main manner many matter maximum mean minimum move moves multiplies must navigation neal negative next non not number numbers object objects odd one ones operation operations order other out over own page pair pairs pairwise partioned partition passing peg perform person pieces place plane points positions positive possible presently prevent probability problems proof protocol prove provide put puzzle puzzles quickly random reach real reals rectangle rectangles red repeatedly replace replaces reply required respectively resulting reveals round same satisfy say science search secret sequence sequences series set several shape shared she shift shifting shocked show shows side signal sit sits some square standard start step steps strings stuck sub subset subsets such sum sums superkids suppose table takes taking teaching than that the them then there they things thinks third this three through time times too tools towers traveling trick two ucr value values variables vary vertex vertices was way weights were what where which whose wiki with won www you young younger";index.ps="0px algorithms antelope big bourns breadcrumbs college computer creek cucamonga current eagle faculty farm frisbee fun home lake leland limecreek main navigation neal oregon page photos quotes research science sur teaching trail ucr ultimate valley vids west young";index.publications="0461 0px 100 1103 1304 1961 1971 1980 1982 1984 1985 1988 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2011 2012 221 2286 235 23rd 289 317 322 324 327 3438 348 356 368 383 3887 478 505 541 5555 5em 600 605 699 872 961 abdullah about above absence absolute academic access accomplished according account achieve acm actually addition additive address adjusting admissible adoption adversarial adversarially adversary affinely aforementioned against agarwal algorithm algorithmic algorithmica algorithms all allow allows almost alphabet already also always american among amortized amos analog analyses analysis analytic analyze analyzes analyzing and another answer answers antenna any appears applicability application applications applied applies approach approaches approximate approximately approximates approximating approximation april arbitrary are area arises arman array arrayed articles asia asks aslam assign assignment assume assumes assuming astronomical asymmetric augmented authors automata available average avoids balaji balance balanced balancing ball balls bandwidth barman based basic beating because been before behavior being benchmark benders bent berman best better between biased bibtex bicriteria bid bidding bids bin binary bioinformatics biology biometrics bipartite blanton boas book boolean borneman both bottleneck bound bounded bounding bounds bourns boustrophedon breadcrumbs brief briefly brightnesses broadcast broadcasting broadcasts browsers building but cable cache caching calibrate calinescu call called can cannot cao capacities capacity capture captured care case cases causes celestial cenk centered centralized certain certifying challenge change changes channels chapter chapters check chernoff chooses choosing christofides christos chrobak cip circle circuit circuits circular citation claire class classic classification classified classifiers classifies clients cliff clone clones clonetools close closed cmip cocoon code codebook codeword coding coefficients coherent collection college colloquium columns combinatorial combinatorics commodities commodity common communicate communication communications communities community comparable comparison competitive competitiveness completion complexity comprehensive compression computation computational computations compute computed computer computes computing concerns conference configuration confirm congestion conjecture conjunctions connected connecting connection connections consider considered considers consists constant constrained constrains constraint constraints construct contains continuous contracting contrast control convergence converted convex copyrights cornell corollary correct corrected cost costs count counterparts cover covering crc created creates criteria cross crossing current currently customers cut cycle cycles daniel danskin dantzig data database datasets david decide deciding decomposition decrease decreasing deepak defining definition degree deletion demands demonstrate denotes dense department dependence depends derive derived deriving describe described describes design designing desired despite detail determine determining deterministic developed dhiman diffuse digital digraph digraphs dijkstra dilley dimacs dimensional dimitrios direct directed direction directional directly disc discovered discovery discrete disjunctions disk disproving disseminating distance distances distinguishes distributed distribution div diverse divesh dna document documenting does domain domains dominates dominating dorit download dual duality duals due dynamic each eamonn easy ece edge edges effective efficiency efficient eight either element elementary elements elias elizabeth embedding emde empirical empirically encode encoded encoding encyclopedia end engineering entire entries entropy environments equal equals equilibrium equipped equiprobable equivalent error etc euclidean eva evaluating evaluation evasiveness even events every exact exactly example examples except exchange existence exists expectation expected experiment experimental experiments explain explained explanation explanations explicit explores exploring exponential exponentially expressed expressive expressiveness extend extension extensive faced facilities facility fact factor faculty fails fall fast faster fastest fault faults favor favorites faxing feasible features fekete fiat fifo fifth file final find finding finds fingerprints first fit fix fleischer flip flow flush focs focuses follow following follows font footprint for form formed formula formulae formulate formulated formulation found foundations fractional free frequency from full fully fun function functions fundamental further gained galaxies game games gap garg gave gelal gene general generalization generalizations generalize generalized generalizes generally generates generating generation gentian geometric gesture gets give given gives giving global goal goemans golin good google graham graph graphs greedy grigoriadis gruia guarantee guarantees guided gunopulos had hakimi handbook handicapped hard hardness has have having held here heuristic heuristics hierarchical high highly hitting hoc hochbaum holding holds home hop hops how howard however huan huffman hull hybridization hybridizing hyperedges hypergraphs icalp icde idea ideas ieee illustrated image immense implement implementation implementations implemented important improved improvement improves include includes including incorporated increase increases incremental indeed independent independently index individual inequality infinite informal informatics information ink input inputs insertion insight insights insignificant instance instances instead integer integrality integrated integrates intelligent interest interested interesting international internet intersection into introduced introduces introducing introduction ipco irani issues item items iterations its itself jakllari james jay jeff jessica jochen joel john journal karger karloff karp keep keogh keys khachiyan khuller klein klemmstein knapsack knowledge known knows kolliopoulos konemann korn koufogiannakis koutsoupias krishnamurthy kurt label labels lagrangean lagrangian landlord language languages large larger last laszlo latin latter lead leads leaf least leaves lecture lectures left leighton length lengths less letter letters likely limitations limited limits lin line linear lipton lisa lloyd lncs local locally location log logarithmic logarithmically logical long lookahead loose lovasz low lower lps lru luby lupton lyle macroscopic made magnitude main mainly maintains maintenance makespan maley management many map marek margin marking markov match matches matching mathematics mathieu matias matrices matrix max maximally maximize maximizes maximum may mcgeoch mean means measurement measuring median medians medium meet meeting meg mehlhorn memory mesh message messages metaheuristics method methods metric mettu michael michel microbial mike mikkel millar miller million mimd min minimization minimize minimizing minimum mining minor mixed mobile model modeled models modification modified modifying monotone mordecai more morse most move mst much mueen multi multicommodity multiobject multiple multiplicative multiplicity multiway must mwt naive nash nav naveen navigation neal near necessary need needed negative neighbor neighbors neil neither nested net network networks neumann new next nicolas nisan noam node nodes noga non nor norms not note notes notion novel noy number numeric objective objectives objects oblivious observation observed obtain obtained occurs off offline ofrg oligonucleotide one online only open operation operations opponent opportunity optimal optimally optimization optimize optimum order ordered orie orient orienting origin original orlin other our out outperform output over overall overhead pacific package packets packing padding page pages pagewrapper paging pair pairs pairwise papadimitriou paper papers parallel parameter parametric parsimonious parsimonius part particular particularly path paths pattern patterns pays pei per perform performance performed performs periodically personal philip phones placing plane plaxton play player playing plotkin plus podc point points poly polylog polynomial posed positions positive possible post poster potential prabhakar practical practice predecessor predictive prefix presence present presentation presented presenting presents previous previously prim primal primitive princeton principles priority probabilistic probabilistically probability probe problem problems procedure proceedings process processing produce produces program programming programs proof proofs properties property proportional propose protocol protocols provably prove proved provide provided provides proxies proxy pruning ptas pubimage public publications publicly published publishers pure purposes pushes qin quadratic quality quarter queries question questions queues rabani raghavachari raghavan random randomized randomly range rao rasala rate rates ratio ratios reachability received recently recognition recursive rediscovered reduce reduced reduces region related relations relaxation relaxations rely remain remaining removal removes report represent representation representing request require required requires research reserved resorted respect response restriction result resulting results retrieve return returned returns reuse reverse rgreedy richard rnc robert robotics role root rooted roughly round rounding rounds routed row rows rrna run running runs sahinalp salesman same samir sample sandor sandy sat satellites satisfy satisfying satish schabanel schedule schedules scheduling scheme schemes schmeichel scholar school science sciences search secon second see seen selected selecting semidefinite seminal sense sensor separates separator sequence sequences sequential serge series serve server set sets setting several severely shapelet shapelets shmoys short shortest should show showing shows siam signals significant significantly similar similarity simple simpler simplex simulated simultaneously since single size sizes sketch sky sleator slides slightly sloan sloane small snapshot snapshots society soda software solid solution solutions solvable solve solved solving some source space spanning sparse special specific specified spectrograph speed springer squid srikanth srivastava stage standard start starts stavros stein step steps stoc stop stops strategies strategy strengthen strengthened stretch strictly strong strongly structure structures studied studies study subgraph subject submit submits submodular subset successfully successor such suggest suggesting sum summaries summarization summary sums support surmount surprising survey symposium system systematic systems tail take taken takes taking tardos targeting tarjan tasks taught tcp technical technique techniques telescope tending tends term terminal terminals terms text than that the their them then theorem theorems theoretical theoretically theory there therefore these thesis they thirds this thorup those though three threshold through throughput thus tight tiling time times together tolerance tom too topic topics topology total track tracking trade tradeoff tradeoffs traditional traffic transactions transform transmissions traveling tree trees triangle triangulation trip trivial tsp tune twice two type typically ucr udg umesh underlies underlying understand understanding undirected unequal uniform uniformly unit university unknown unless unpublished until update upper upwards use used useful users uses using utility uzi value values van variable variables variant variants varies variety vazirani vector vectors version vertex vertices very via vishkin visualization vitter von wads wait wald was way web weight weighted weights wein well were what when where whereas whether which while who whose will williamson with within without witnesses wolfe word words work worked working works workshop worse worst would yet yields yossi you young yousefi yuval zero zeros zhang";index.puzzles="0001 0101 100 101 102 1x1 300 4x8 5th 8x8 able above absolute accomplish according adds adjacent advance after agree agreed airline airlines algorithms alice alive all allocation allowed along already also always among amount and announces annual another answer answering answers anticipated any apply applying arbitrarily arbitrary are area arithmetic around arrange arranged arrives asked asks assigned assistant assume assuming assumption attend audience average away aweb back base baseball basic because been before being best between bigger bit bits black blue bob booty both bottom bound bourns boys breadcrumbs brother building but can candy cannot card cards carefully carry case certainly challenge challenges championship chance check checkerboard choices choose chooses chose circle cities claim classes closed cmu code coins college color coloring colors com come common communicate community complete computer computing connected connects consecutive consisting constraints consumes contained containers contains continuing control converges cooperstock copied correct correctly corresponding could counting counts couples course cover criteria csu current cut cycle cycles day deck decrease define demand denote density describe design determine determined diamonds did differ different diffs dinner directions disc discover discrete discs discuss disk distance distinct distributive divide dividing does doesn don done down drill drilled drilling drive dumb each easy edu eecs either elizabeth elsewhere end ends equal etc evals eventually every everyone exactly example exceeding except exclusion executed executes executioner exist existence expressed expression expressions eyes face facing fact faculty families family fatland few fifth figure find finite fire fires firing first fit five flat flight flights flip flipping folded follow following follows footer for forever form fortunately forward four fourth from fun function gallon gallons gas gave general generate get gets girls give given gives goal gold google got graph greater growing guess guessing guns had half hamming hand hands handshakes hanoi happening happens harvard has hat hats have haven head hear hears hearts hence her here hides hiding him his home how however html ian ibm identify identity inclusion independently induction inductive inductively inequality infinite infinitely information initial initially instruction instructor insure integer integers intersect interval interview into isn item items ith jam john joins just kill killed kind known knows label labeled labelled labels large larger largest later law learning least leave left leino length less let like likewise limited line lipton live lives load locations logic long longest loot lose lower made magician main make manner many marble marbles market math matter max maximum may mcgill mean meet memory microsoft might mile miles mindcipher minimizes minimum minus minute minutes mirrors mit more most mostly move moves much multiplies must navigation neal necessarily necessary negative net never new next nick nobody non not now number numbers object objects odd olympiad once one ones only oops open operation operations order ordered ordering orders other otherwise out outlined outside outwards over overlap own page pair pairs pairwise paper paragraph parberry part particular partioned partition partner party pass passed passing peg people perform person phase pick piece pieces pirate pirates place placed places plane please point points ponder positions positive possible power precisely presently prevent previous priorities probability problem problems proceeds process projecteuler promptly proof proposes protocol prove provide provided put puzzle puzzles question questions quickly quite raise raised random randomly reach real reals reasons receive rectangle rectangles red regular remaining remember repeated repeatedly repeats replace replaces reply require required requires research residing respectively rest resulting reveals right room round said same satisfy save saved say says science search second secret see seen sees sell senior sequence sequences series set sets several shake shape shared she shift shifting shocked shook should shoulder show shows shuffle side signal simply simultaneously since single sit sits situation size skiena smaller solder soldier soldiers some sort source space spare spares specifically specify square squares stack stacked stage stand standard start starting starts state stay step steps stop stranded strategy strings stuck student students sub subintervals subject subset subsets such sum sums superkids suppose surprisingly table take takes taking tap tapped taps teaching tell tells than that the their them then there they things thinks third thirty this those three through thus time times toad told too tools top topcoder tournament towers training transport traveling travels trick trivially truck true trying turn turning turns two ucr umich under unfortunately unique unit unsolved upon usa use using value values variables vary vertex vertices vote waits was way ways wearing wears weights well wellprob wells were what when whenever where whether which while white who whom whose wiki will win with without wolfram won work worse worst would write written wrong www you young younger your";index.quotes="1571 1574 1627 1631 1640 1665 1686 1688 1713 1744 1755 1757 1768 1794 1795 1821 1822 1827 1843 1888 1889 1906 1911 1916 1932 44a 531 abolishing about above absolute absorbed absurd ace aces achieved across acting actually adaptation add adolescent advance adventure aerospace afraid after afterwards again aggressive aggressively ago agree agrees air alan alexander algorithms alien alienation all allow almost alone also always amber american americans amour anchor and andrew angels angry another anticipatory anu any anything apply apprehended arbitrator are arguing arnold around arrive art artificial asked asking asks aspects assets asshole assignment assimilates assumes asthma asthmatic atmosphere attack attempts attr awards away back balanced bar barnfield bartender bartholomew basic bath bay beam bear beautiful because become becomes bedfellows been before began begetting beginning behind being bell best betjeman better bid bidding bids bimbo bitch blackwood blake blasted blessed blow bluish body book bored borne both bourns breadcrumbs break bridge broth brutalizing bumped but buy call called came can candle cannot capability capable card cards carefree cargo carl carry carrying case casser catching caught cautious cautiously cavafy cease cell centered certain chagrin chamber chamomile changing chauvinistic cheapest cheaply choose chuang cities city claris class claude clod clubs coast cockpit cognitive coherent coleridge college combined come comments communicator complete computer computers conceived conclusion conference congress connected consciousness constant constantine content continent continue continuity contract contrary control conventions corals costs could couldn count course crashed creative creatures crook cue current cyclopes darkness darwin dating days dbl deadlock death decide defenseless defrauded delayed deny described destroy detach detect determination determined diabolical diamonds did didn died different dilemma dim diminishes direct directly disarmament disciples discours dissect distinct distinguishes distract distractions distribution does doing doit don donne double doubles doubt doubts down dreaming dure each ear earth ebony editor egyptian eight either else elsewhere emotion empires emptying encouraging enemy english enough enter entered entire equal equivalent essence essentially est established etc europe eval evaluating evaluation evaluations even evenings eventually ever every everything exactly except exception excited exist existence exists expecting experience experiment explosion fact faculty falsehood far farmers favorite fear feelings felt few fewer fierce final find fine finest firepower first fist fit five fix fixed flashed floor florian flying following fools footer for forcing form format former forth fortune found four fous french fresh friends frisbee from full fun fusion future gained game gary gathering generally geostation get give given glad goal going gone good grand grave great greater ground grounded group grows guam guide had half hand hands happier harris has hast have hcp head headed headlines headquarters hear hearts heaven hegel henry her here high higher him himself his history hit hold hole home hope hostile hostilities hosts hours however huge human hurry hypothesis idea identity ill immediate immediately immense important incapable incertainties inconceivably inconstancy indicates information ingle initiated innocence innocent inquired inspirational instance interest into invite invites involved irritable island isle isolated isolation ithaka ithakas its itself james jean jesus john jolt journey judas jump just justice keats keep kind kinds kingdom kings know knowing knowledge largely last latter launched laurence laurie law lazy lead leader learn left leg length less lesson lestrygonians let level life like liked likewise limited lippmann lisp literary literate literature lithium little live lives lofty long longer longest look lose love low lower machine main mainly major make makes man management mankind manor many marguerite markets massive match matthew maximum may mean meaning means meanwhile meditation meek meet memory merchandise merciful might miles miller million mind minimum minor minsky minus miroir mirror missile missiles mit mobile mockery moment monde more morning mornings mother mothership mountain mourn much must mysteries mystery name named nation natural nature navigation neal necessarily necessary necessity needs negation negative neither neuroses neurotic never new news newspaper newspapers night nine non nook nor not nothing notrump nourishment now nowhere number numbers objectives ocean off offer old once one only open opener opening opponent opponents orbit order ordinary original other otherwise our out over overcall overcalled overcalling overcalls own page pair pang paper paragraph part particle partner partners partnership pas pass passage passed passes path peaceful peaceniks pearl penalties penetralium perfumes perhaps permanently persecuted person peter petit pharisees philip phoenician photos piece pierre piling plain plaisir plan planet pleasurable pleasure plein point pointless points polar pondered poor pope ports poseidon position positive possessiveness pray preceding predicate preference preferred preoccupations present president process prof professor program progresses promise promises promontory proper proposition prove provided psychically pulverize purchase pushed question qui quotes race raise raises ranking reach reached reaches reaching read real reality really reason rebecca rebid rebidding rebids received reclaimed redouble references reformation refuse refusing regards regret rejoice remain remained remaining remember reminded report requests require requirement requires reread research resistance responder response responses return returning reward rich richard riches right road rule sage said same satiriques say says scholar science sea search seat seconds secret see seen self semi send sense sensibility sent sergeant set settle seul seven several shall shalt she sheet shepherd ship ships short should show shows side sign silent silken similar simon simple simultaneously singleton sir sitting six skipped skylon slam slammed slash small smash some someone something son soon soul source space spades speak spent spider spirit spoils spoken squadron stared start started statement stayman stella stephen sterne still stop stopped stopper stopping store story strange strength strong stronger student sublated submarine subsequent such suffer suffocating suggests suit suits summer support supported suppose supposed surely suspended sweaty swiftly switch table take taken takeout talking tandem target taught tea teaching teashop tedious television tend tenir tens termite test tex than that the thee their theirs them then there therefore these they thine thing things think third thirst this those thought thoughts thousands threads three thro through thumping thy time times tissue today together toggling tolls tomorrow tons too took top touches tout toute towards transgalactic travel treaty tricks triple troubled trump truscott truth trying turn turned turning twice two tzu ucr udrian ultimate unbid uncertainties understand understanding understood unhurriedly unilateral unimpeded unsuccessfully unsupported until use used useless usually valium vaporized varies verisimilitude very veto veut vie violent visit void voir voyage vulnerability vulnerable walks walter wanted war was washed way weak weaker weakness web wednesday week weeks weigh well wept were what when where whether which who whom whose why will william wimpy wind window wirth wisdom wistfully with within without witted woman wonder wooden words work working world worst would wright write writing written wrong xvii year years york you young your youth zero";index.research="2007 2009 2011 2012 academic algorithm algorithms analysis and applied approximation are area arman articles authored background bibtex blog book bourns breadcrumbs caching center chapters chazelle christos coauthored coauthors cole college colloquia combinatorial compendium competitive computer computing conference congestion control copies current design efficient elsewhere essay etc expected explanations faculty favorites footer for fortnow fun gasarch glossary graduate hard here home img including information journal khare koufogiannakis lagrangian line linear links lipton list main miscellaneous monik more nav navigation neal near oblivious online opportunities optimization optimum org other page paging papers phd png problems programming publications reading related relaxation repeat research results rounding scholar science search see slides solutions steve students talk teaching terms the these this topics ucr undergrad url venues white wordle work young yousefi";index.schedule="10px afternoons algorithms and bourns breadcrumbs browser can college computer conflicting contact current div does early email events faculty fun here home iframes late main margin meeting mornings navigation neal not page pagewrapper prefer research schedule science see send support teaching the this times ucr vita with you young your";index.slideshow="0pt 14em 95em 9em animal antelope arches background banff big black bodie body border bryce canada canyon collapse creek cucamonga diego div eagle falls farm font forest gorgonio idaho iframe india inherit joshua kings lake lakes leland limecreek line little lone margin meadows moccasin mono mountain national nav neal oregon padding pagewrapper park pine san sequoia silver slideshow sur table trail tree tunnel tuolumne valley victor vids west white whitewater yosemite young zion";index.slideshow2="0pt 14em 95em 9em animal antelope arches background big black body border bryce canyon collapse creek cucamonga diego div eagle falls farm font forest gorgonio idaho iframe inherit joshua kings lake lakes leland limecreek line little lone margin moccasin mountain national nav neal oregon padding pagewrapper park pine san sequoia silver slideshow sur table trail tree tunnel valley victor vids west white whitewater yosemite young zion";index.slideshow_bak="0pt 14em 95em 9em animal antelope arches background big black body border browser bryce can canyon collapse creek cucamonga diego div does eagle falls farm font forest gorgonio idaho iframe iframes inherit joshua kings lake lakes leland limecreek line little lone margin moccasin mountain national nav neal not oregon padding pagewrapper park pine san see sequoia silver slideshow support sur table this trail tree tunnel valley victor vids west white whitewater yosemite you young your zion";index.students="algorithms bourns breadcrumbs college computer contact faculty fun graduate home main navigation neal photos publications puzzles research schedule science search students teaching ucr vita young";index.ta="001 002 003 005 006 008 010 012 014 021 022 023 024 025 026 027 028 029 030 031 032 033 034 035 036 037 038 039 040 041 042 043 044 045 046 047 048 049 050 061 100 101 120b 141 150 152 153 160 161 161l 179g 179k 183 2008 algorithms also and apr assignment based bernstein bourns brady breadcrumbs browdus cancellation cetindil change chrobak ciardo class cole college comments commitments computer cortes czechowski diep email emailed etc ezeobiejesi faculty fernandez final fleisch fun gustafson hakkoymaz harris home hsieh huang huo jiang kasetty keogh khare kuang labs linard list lonjers main mecham medina miller molle mueen najjar navigation neal ning notes payne pct peng please process przym pusukuri questions read research salloum santhanam science search see sheng shi smith soriano spring tba teaching tentative the these this ucr updates vanda vieira wang wei who will woss young zhu";index.ta_explanation="005 006 008 010 012 120b 2nd about account admitted advisor after algorithms also and another appreciate are ask assigned assignment assignments avoid backgrounds before bourns breadcrumbs but can chair classes college coming committee computer conflict conflicts considerations constraints consultation converge counts course cs287 currently department determined does during each early easier enrolled especially exceptions exchanging explanation faculty feedback first for from fun generally given goal good has have head home hours how ideally includes ing instructor instructors into job know lab labs large less let level levels main makes master match means meets month more multiple navigation neal necessary need notes now one order other otherwise out particular patience per please possible practice process promised qualified reduced request requested requests requirement research rounds same schedules science search second shouldn someone sometimes soon starts still student students subject such suggest support supported taing taken tas teaching term terri than that the their them these they this three time transition try two ucr undergraduate used useful usually vanda various wait waived want week welcomed what when which who whom with work working year yes you young your";index.tcp_ip_links="111 115 129 1350 140 156 16262 165 169035 1737214 17th 181366 1902794 1969 197931 1985 1988 1989 199010 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 218 226 235 252 259384 280819 28th 303 312 319471 31st 329 32nd 337047 34969 35th 371772 387 38th 398 39th 415830 458229 460684 4670 471986 490101 494567 496450 4966 598 598w02 71263 77736 800 818 832 91517 984895 99abstracts abhinav able about above access achieve achieved acm active activity adapted added addition additive adjustments admission advances afek afek96convergence agenda agent aggregate aimd algorithm algorithmic algorithms allocated allocation allow also amazon american amir ams analysis analytical analyzes anarchy and annual another appear appears applications applied apply approach approx approximated approximately approximation approximations arbitrarily arbitrary architectures are area argues arguments article aspects asymptotic athuraliya athuraliya99optimization att auctions august austin automatica available avoidance awerbuch awerbuch97converging background bad balakrishnan balancing bandwidth bansal bartal bartal97global based basic behavior being bell berkeley bhattacharyya bibliography bin bottleneck bourns breadcrumbs bredin brief broken brought buffy built byers cal caltech cam cambridge can capacities carlo carrying case center certain cgi challenging changing chaos charge charges charging chen china chiu choice choose christos chyouhwa citeseer claim clark class classes classic close collected collection collections college com combinatorial combining comm commun communication communications comp compatability compatibility compatible compensations competition competitive complex complexity computational computer computing concentrate concerns conditions conference congavoid congestion congress connections context control controls converge convergence converging convex cooperation cooperative cost counters course covering criterion critique crowcroft crowcroft98differentiated cs294 cse csm2001 cued current cyberdig dah dartmouth database dec december decrease deepak definition delay delays demonstrate department describe described design designed despite detail detection determines deterministic diego different differentiated dimensional disciplines discussed discusses discussing discussion distributed doc documents does domino doyle duality due dullerud dynamic dynamics each early ecn economic economics ecse edge edition eds edu eduardo eecs effects efficiency efficient elastic eliciting employ end end2end enforce engineering equilibirum equilibrium equlibrium estimation estrin european eva evol evolution exhibit existence existing experience explicit exponential extending faculty fair fairly fairness fall fast faster fatourou fatourou00efficiency fcfs features feb feedback feigenbaum few fifth filtering finally finite first fixed flow floyd floyd92traffic floyd93random floyd99promoting focs follow for force formulation foundations fourth fractional fradkov framework frank friendliness friendly from ftp fun functions further game games garg garg97faster gateways general generalizes gibbens gibbens98resource global gmsjsac2 goel goel00combining golestani gorinsky gov gradient greed group groups hardcover hari have herzog heterogeneous heterogenous hipparch his home homepages hosts how htm html ibm icir icsi idea ieee ietf implement implementation important improved improving includes including increase independent industrial infeng inferior infocom infocom9 information instability interest interesting international internet interpret interpretation into introduce introduced introduction ipam iro isbn isdn issues jacobson jacobson88congestion jain jhmo jitendra johari jon journal june kahin kalyanaraman kamra karp karp00optimization katz keller kelly kelly97charging kelly99mathematical khurana kleinberg konemann kotz koustosoupias kunniyur kunniyur00endtoend lab laboratory labs lapsley large larry last laws lbl lcs lead library like limin limitations linear link links list lists literature lmassoul load local logarithmic lond look loss losses low luenberger mac mackie magazine maheswaran mailing main make making management manager mansour many march marios mark market markets marking marks mason massoulie massoulie00stability mathematical mathematics matrix maulloo mavronicolas max maximizing may means measurement mechanism mechanisms medium meeting meets mentioned methods metro meyerson michigan microsoft mihalis min ming minimization minimum miscellany mit mixed mmi mobicom mobile model modeling modelling models modest modified monte more multi multicast multicommodity multiple multiplicative national navigation neal nec necessary need net netlab network networking networks new news newton nice nicely nisan nisan99algorithmic nms non not notices notification nov november now nrg nsf number objectives oblivious october odlyzko odlyzko97modest oechslin oft one online only open oper optimality optimistic optimization optimized optimizing optimum order org oscillations ostfeld other our out over overall overcomes overview overviews packet packetswitched packing padhye paganini paganini01stability pages panagiota papadamitriou papadimitriou paper papers parallel parcftp paris particular paul paxson pay pdf peering per performance personal perspective peterson phase phil picn play plotkin plus pmp10 podc pogromsky pointers poisson policy posts power predominant prepared present presentation press preventing price prices pricing principle priorities problem problems proc proceedings programming project projection projects promoting proof propagation proportional proportionally proposal proposed protocol protocols proves provides pub public publications pubs qos quality question rabani rahul ramesh random rate rates raz reading readings reasonably recent references related rep repeated report res research researchers reshaping resource responsive resreps results rev reviews rfc3168 richard risk roberts robust ronen roughgarden round route routers routing rpi rst rus sally san satellite satisfies scalable scale scaled schedulers schemes sci science sciences scott scripts search second segue self selfish seminar september sequential servers service services seshan shadow share sharing shavitt shenker shenker94making shenker95pricing shivkuma shivkumar short shown siam sig sigcomm sigcomm01 signals similar similarity simple simpler simulation simulations single slowcc slowly smart soc some sontag soton sources sp2001 space specific spirakis springer srikant stability stable staff state stated statistical stats statslab steinberg step steven stoc strategies structure such sufficient summary sun survey switch switched symp symposium synchronization synchronous system systems taiwan tan tardos task tcp teaching tech technical techniques telecommunication telecommunications texas textbooks texts that the then theoretic theoretical theory these thesis this those tim time times tools topics towards tr2000 trading traffic trans transactions transmissions transport trip tsinghua twenty txt ucl ucla ucr umich under understanding unicast unintended unit university update usa use user users using utexas utility varian various varun vazirani vector vegas versions versus via view vin vinnicombe vol volume walrand wang was watson way web website weighted when where whether which why wiley willinger window wireless wischik with without work works workshop wustl www xerox yannakakis york young";index.teaching="1996 1997 2004 2005 2006 2007 2008 2009 2010 2011 advanced algorithm algorithms analysis and approximation border bourns breadcrumbs catalog chazelle classes college combinatorial compendium computation computer course courses cs141 cs145 cs215 cs218 cs260 cs262 cs270 current dartmouth dasgupta data design development elsewhere engr101 epsilon essay evals faculty fall footer frameworks fun grad graduate herbert home information intermediate list main mentoring more navigation neal novel online opportunities optimization padding page professional puzzles reading research results sandwiches schedule science search seminar spring structures table teaching textbook the theoretical theory ucr undergrad undergraduate wiki wilf winter young";index.tmp="1101 2242 231 749 951 contacts grandcentral greetings inbox log mobile notifications off out phones quickrule settings";index.UCB_CS_core="";index.UCB_electives="";index.UCD_CS_core="";index.UCD_electives="";index.UCI_CS_core="";index.UCI_CS_electives="";index.UCLA_CS_core="";index.UCLA_electives="";index.UCR_CS_core="";index.UCR_electives="";index.UCSB_CS_core="";index.UCSB_electives="";index.UCSD_CS_core="";index.UCSD_electives="";index.venues="23rd academic acm algorithmica algorithms american and applied approximation asia astronomical automata bibtex bioinformatics biology book bourns breadcrumbs challenge chapter chapters coauthors college colloquium combinatorial combinatorics communications compression computation computational computer computing conference cornell crc current data database department dimacs disc discovery discrete distributed encyclopedia engineering etc faculty fifth foundations fun glossary handbook hoc home icde ieee implementation informatics information integer international journal journals knowledge languages latin letters main mathematics mesh metaheuristics mining mobile navigation neal networks oblivious operations optimization org orie pacific page poster princeton principles proceedings processing programming publications report research rounding scholar school science sciences search secon sensor series siam slides society springer structures symposium system systems talk teaching technical the theoretical theory transactions ucr university venues workshop young";index.videos="0pt 14em 95em 9em animal antelope arches background banff big black bodie body border bryce canada canyon collapse creek cucamonga diego div eagle falls farm font forest gorgonio idaho iframe india inherit joshua kings lake lakes leland limecreek line little lone margin meadows moccasin mono mountain national nav neal oregon padding pagewrapper park pine san sequoia silver slideshow sur table trail tree tunnel tuolumne valley victor vids west white whitewater yosemite young zion";index.vita="0461 0626912 0729071 0em 1103 1117954 1304 1981 1982 1983 1984 1985 1986 1987 1988 1991 1992 1993 1994 1995 1996 1997 1998 1999 1em 1px 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 221 2286 235 23rd 25em 25in 289 2em 317 322 324 327 348 356 368 383 3887 423 478 505 519 541 5555 5em 5in 5pt 605 699 6em 7146 827 840 872 92521 951 961 9720664 abdullah achieve acm advanced adversarially adversary against agarwal akamai algorithm algorithmic algorithmica algorithmics algorithms alto american amos analysis and antenna applications applied approaches approx approximate approximating approximation april arbitrary architect architectures are arman array artificial asia aslam assistant associate astronomical astrophysics automata available balaji balance balancing balls bandwidth barman based basic beating began bell bent beta biased bicriteria bidding bioinformatics biology black blanton board border borneman bound bounded bounding bourns boustrophedon breadcrumbs broadcast building cache caching california cambridge career cenk center challenge change chapter chernoff chicago christos chrobak circuit cise claire classification cliff clones coauthors cocoon codebook coded coding cole collection college colloq colloquium combinatorial combinatorics committees commodity communications competitive competitiveness complexity components compression computation computational computer computing conference congestion connected constrained constraints consultant content continued control cornell corporation cost costs course cover covering crc cum cut cycle daniel danskin dantzig dartmouth data database david dec deepak degree delhi delivery department dependent design designed designing dhiman diffuse digital digraph digraphs dimacs dimitrios directional disc discovered discovery discrete distances distinction distributed divesh dna document dotted dual duality eamonn ece edu education effective efficient elizabeth embedding encyclopedia end engineering environment equipped equiprobable equivalent esa european eva evaluation evaluations evasiveness existence expected experience experimental experiments explanation explanations expressive facility faculty faster fekete fellowship fermilabs few fiat fifth file finding first flip flow focs font for foundation foundations fractional frameworks fsttcs fully games garg gelal general generation gentian geometric golin graduate grant grants graph graphics graphs greedy guided gunopulos hakimi handbook hard here hertz heuristic hierarchical hoc hopkins hosted huan huffman hybridization icalp icde ieee image implementation implementing improved including incremental india indian indiana industrial informatics information informs inherit inputs institute instructor integer integrated intelligence interests intern international internet invented ipco isaac iterations jakllari james jay jeff jessica john johns johnson jorge journal journals kappa karger karp keogh khare khuller klein klemmstein knowledge kolliopoulos korn koufogiannakis krishnamurthy laboratories labs lafayette lagrangian languages large largest laszlo latin laude layer layout lecture length letter letters lin line linear lipton lncs load location logical loose lovasz low lowercase luby lupton lyle machine maley management marek margin marking maryland matching materials mathematica mathematical mathematics mathieu matias maximizes maximum mcgeoch measurement median medians mesh metaheuristics method methods metric michael mikkel millar miller minimum mining mixed mobile monik mordecai mueen multi multiobject multiway national naveen neal near nearly neighbor neil network networking networks new nicolas node noga none normal notes novel now nsf number oblivious online operation operationalized operations optimal optimization optimize orie orienting orlin other pacific packing padding paging pairwise palo papers parallel parametric parsimonious part patent path pdading performance phd phi philip physical podc points policies policy polynomial postdoc poster practical prefix present presentation press primal primitive princeton principles printed priority probabilistic problem problems proceedings processing professor program programmer programming programs project properties proxy publications qin queues raghavachari random randomization randomized rasala reachability recursive reduce refereeing relaxation replacement report research results reverse richard riverside robert robotics roman rounding sahinalp samir sandor scandinavian schabanel scheduling scheme schmeichel school science sciences scientist search secon selecting senior sensor sequential series serif server set shortest siam simple simplex simultaneously size sky sleator sloan sloane slovaca small smartwork society soda software solving spaa span spanning specializing spectrograph springer squid srikanth srivastava states stavros stein steve stoc stolfi strategies strategy stretch strongly structures student students submodular sum summaries summer summers survey swat symp symposium system systematic systems table tail talented tardos targeting tarjan taught tcp teaching technical technique technologies technology teenagers text that the theorems theoretical theory thesis this thorup throughput tight tiling time times topic topology transactions transform trees triangulation two ucr umiacs unequal united univ university use using uzi variant varies vazirani version vertex via vijay vishkin visitor vita vitter wads wald waoa web weight weighted wide wintek with without wolfe words workshop workshops www yossi young yousefi youth zero zhang";index.all="";index.all+=" "+index.badge;index.all+=" "+index.bibtex;index.all+=" "+index.bleah;index.all+=" "+index.chutes;index.all+=" "+index.coauthors;index.all+=" "+index.contact;index.all+=" "+index.contact_info;index.all+=" "+index.course_evaluations;index.all+=" "+index.courses;index.all+=" "+index.evaluations;index.all+=" "+index.flashgallery;index.all+=" "+index.readme;index.all+=" "+index.fun;index.all+=" "+index.glossary;index.all+=" "+index.home;index.all+=" "+index.home_test;index.all+=" "+index.journals;index.all+=" "+index.lagrangian_relaxation_links;index.all+=" "+index.major_diagrams;index.all+=" "+index.bibtex;index.all+=" "+index.bleah;index.all+=" "+index.coauthors;index.all+=" "+index.contact;index.all+=" "+index.course_evaluations;index.all+=" "+index.fun;index.all+=" "+index.glossary;index.all+=" "+index.home;index.all+=" "+index.journals;index.all+=" "+index.lagrangian_relaxation_links;index.all+=" "+index.major_diagrams;index.all+=" "+index.photos;index.all+=" "+index.photos_dynamic;index.all+=" "+index.photos_h;index.all+=" "+index.poster;index.all+=" "+index.proof_problems;index.all+=" "+index.ps;index.all+=" "+index.puzzles;index.all+=" "+index.quotes;index.all+=" "+index.research;index.all+=" "+index.schedule;index.all+=" "+index.slideshow;index.all+=" "+index.ta;index.all+=" "+index.ta_explanation;index.all+=" "+index.tcp_ip_links;index.all+=" "+index.teaching;index.all+=" "+index.vita;index.all+=" "+index["final"];index.all+=" "+index.final2;index.all+=" "+index.final3;index.all+=" "+index.final4;index.all+=" "+index.final5;index.all+=" "+index.final6;index.all+=" "+index.final7;index.all+=" "+index["crc-approx-algs"];index.all+=" "+index.papers;index.all+=" "+index.photos;index.all+=" "+index.photos_dynamic;index.all+=" "+index.photos_h;index.all+=" "+index.poster;index.all+=" "+index.promotion;index.all+=" "+index.proof_problems;index.all+=" "+index.ps;index.all+=" "+index.publications;index.all+=" "+index.puzzles;index.all+=" "+index.quotes;index.all+=" "+index.research;index.all+=" "+index.schedule;index.all+=" "+index.slideshow;index.all+=" "+index.slideshow2;index.all+=" "+index.slideshow_bak;index.all+=" "+index.students;index.all+=" "+index.ta;index.all+=" "+index.ta_explanation;index.all+=" "+index.tcp_ip_links;index.all+=" "+index.teaching;index.all+=" "+index.tmp;index.all+=" "+index.UCB_CS_core;index.all+=" "+index.UCB_electives;index.all+=" "+index.UCD_CS_core;index.all+=" "+index.UCD_electives;index.all+=" "+index.UCI_CS_core;index.all+=" "+index.UCI_CS_electives;index.all+=" "+index.UCLA_CS_core;index.all+=" "+index.UCLA_electives;index.all+=" "+index.UCR_CS_core;index.all+=" "+index.UCR_electives;index.all+=" "+index.UCSB_CS_core;index.all+=" "+index.UCSB_electives;index.all+=" "+index.UCSD_CS_core;index.all+=" "+index.UCSD_electives;index.all+=" "+index.venues;index.all+=" "+index.videos;index.all+=" "+index.vita;index.research+=" "+index.publications;index.research+=" "+index.coauthors;index.research+=" "+index.journals;index.research+=" "+index.bibtex;index.research+=" "+index.tcp_ip_links;index.research+=" "+index.lagrangian_relaxation_links;index.research+=" "+index.glossary;index.teaching+=" "+index.evaluations;index.teaching+=" "+index.puzzles;index.teaching+=" "+index.proof_problems;index.fun+=" "+index.quotes;index.fun+=" "+index.photos;function index_onload(){jq(".index").each(function(e,c){c=jq(c);var d=c.attr("value");if(!d||typeof(d)=="undefined"){return}var b=index[d];if(!b||typeof(b)=="undefined"){return}c.replaceWith("<input type='hidden' value='"+b+"' style='display:none'/>")});var a=index.all.split(" ");a.sort();suggestions=[];for(i=0;i<a.length;++i){if(i==0||a[i]!=suggestions[suggestions.length-1]){suggestions[suggestions.length]=a[i]}}};