Sciweavers

43 search results - page 3 / 9
» tcs 2011
Sort
View
TCS
2011
14 years 4 months ago
P systems with minimal insertion and deletion
Artiom Alhazov, Alexander Krassovitskiy, Yurii Rog...
TCS
2011
14 years 4 months ago
Musings around the geometry of interaction, and coherence
We introduce the Danos-Régnier category
Jean Goubault-Larrecq
TCS
2011
14 years 4 months ago
Bitonic sorters of minimal depth
Building on previous works, this paper establishes that the minimal depth of a Bitonic sorter of n keys is 2 log(n) − log(n) .
Tamir Levi, Ami Litman
TCS
2011
14 years 4 months ago
Complexity of the traveling tournament problem
Abstract. We consider the complexity of the traveling tournament problem, which is a well-known benchmark problem in tournament timetabling. The problem was supposed to be computat...
Clemens Thielen, Stephan Westphal