Typical properties of winners and losers in discrete optimization
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Fighting against two adversaries: page migration in dynamic networks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
SIGACT news online algorithms column 8
ACM SIGACT News
Topology matters: smoothed competitiveness of metrical task systems
Theoretical Computer Science
Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
Mathematics of Operations Research
The diameter of randomly perturbed digraphs and some applications
Random Structures & Algorithms
Smoothed analysis of algorithms and heuristics
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
The smoothed analysis of algorithms
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
| Hi-index | 0.01 |
_cf_loadingtexthtml="";_cf_contextpath="";_cf_ajaxscriptsrc="/CFIDE/scripts/ajax";_cf_jsonprefix='//';_cf_clientid='DDF944B0AC4C78FF7F7E8B39D4A3FB12';Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm function settab() { var mytabs = ColdFusion.Layout.getTabLayout('citationdetails'); mytabs.on('tabchange', function(tabpanel,activetab) { document.cookie = 'picked=' + '946319' + ',' + activetab.id; }) }function letemknow(){ ColdFusion.Window.show('letemknow');}function testthis(){alert('test');}function loadalert(){ alert("I am in the load alert"); }function loadalert2(){ alert("I am in the load alert2"); } google.load('visualization', '1', {packages:['orgchart']}); google.setOnLoadCallback(drawChart); function drawChart() { var data = new google.visualization.DataTable(); data.addColumn('string', 'Name'); data.addColumn('string', 'Manager'); data.addColumn('string', 'ToolTip'); data.addRows([ [{v:'0', f:'CCS for this Article