71 search results - page 10 / 15 » jcss 2006 |
JCSS
2010
13 years 8 months ago
2010
Nominal techniques were introduced to represent in a simple and natural way that involve binders. The syntax includes an abstraction operator and a primitive notion of name swappin...
JCSS
2006
13 years 9 months ago
2006
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
JCSS
2002
13 years 9 months ago
2002
The exact complexity of the weak pigeonhole principle is an old and fundamental problem in proof complexity. Using a diagonalization argument, Paris, Wilkieand Woods 16] showed ho...
JCSS
2002
13 years 9 months ago
2002
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...
JCSS
1998
13 years 9 months ago
1998
d Abstract) LYDIA E. KAVRAKI JEAN-CLAUDE LATOMBE RAJEEV MOTWANI ¡ PRABHAKAR RAGHAVAN ¢ The subject of this paper is the analysis of a randomized preprocessing scheme that ...