A Bibliography of Publications in Theoretical Computer Science

A Bibliography of Publications in Theoretical Computer

Science : 2005–2009

Nelson H. F. BeebeUniversity of Utah

Department of Mathematics, 110 LCB155 S 1400 E RM 233

Salt Lake City, UT 84112-0090USA

Tel: +1 801 581 5254FAX: +1 801 581 4148

E-mail: [email protected], [email protected],[email protected] (Internet)

WWW URL: http://www.math.utah.edu/~beebe/

01 March 2013Version 1.10

Title word cross-reference

#CSP [2265]. #P [1789].#P-completeness [1789].

(1 + 1) [1684]. (1, λ) [115]. (18/11)n [2214].(α, β) [2216]. (n, k) [2393, 1558]. (n, t) [1050].(p, k) [467]. (r, p) [2358]. $-calculus [1276].1 [220, 503].2 [1426, 2305, 1891, 2254, 2334, 1288, 1303].2 < α ≤ 7/3 [2164]. 3 [1629, 1772].3.4713 [2388]. 4 [2261]. 5 + ε [1969].5/2+ [90]. 5/4 [779]. [0, 1] [503]. ∗ [58]., [109]. ∞ [1544]. p [196]. A [1201].α [2164, 132]. b [1320]. β [1457]. c [469, 641].Cbω [2339]. C∞ [1503].d [1246, 913, 1691, 818, 105]. ∆ [439].

DblogmDc [648]. `1 [2297]. `∞ [2297, 1544].`p [783]. ε [1184, 729]. F0 [2006]. FS [1742].H [1824, 1586]. k [1117, 1806, 797, 804, 173,782, 1962, 1610, 776, 1990, 178, 1311, 630,1312, 952, 62, 1824, 1810, 2254, 2062, 2004,1625, 954, 1227, 1307, 1291, 2008].k > 2 [173]. Kmax,Kmin [541]. κ [1837].L(2, 1) [2244, 1636]. L(d, s) [440]. l∞ [962].λ [2282, 400, 1589, 562]. λµ [1160].logdN [547]. LU [1218].m [1761, 1325, 2259, 1746, 1227, 1307].µ [187, 400, 589, 359, 101].n [1910, 959, 2080, 1452]. Nd [1445].n ≥ 30 [2170]. 6= [790]. O(n1.75) [2244].Ø(n2polylogn) [1916]. O(nω) [1554].o(n logn) [1314].Ω [1373, 975, 1656, 663, 827]. ω(1) [1753].P [1528, 433]. φ [115].

1

2

π [35, 56, 1437, 143, 1441]. Πp2 [441].

Q [1035]. R [975, 417]. Rd [2063]. σ [1234].t [894]. T 2 [1321]. × [445]. U [1769].w × w [1503, 2339]. xk = zk1

1 zk22 · · · zknn [12].

Z [1860].

* [400]. *- [400].

-achievement [1882]. -antipodal [1050].-approximation [2388, 1969, 1288, 779].-ary [954]. -automata [827].-avoidable [1891]. -batch [1990].-bit [1314]. -calculi [101]. -calculus [35,2282, 187, 56, 589, 359, 143, 562, 1441, 1437].-categories [1373, 1035]. -center [776, 62].-centroid [2358]. -cliques [469].-collapsing [1452]. -coloring [467, 439].-complete [441].-connected [1312, 2254, 1227, 1307].-context-free [1625]. -contextual [894].-counter [220]. -cube [959].-dimensional [1753, 818, 105].-domains [1742]. -dominating [2254, 1307].-EA [1684]. -edge [1320].-estimation [2006]. -facility [1291].-flat [1761]. -free [433, 1824]. -game [1234].-iet [1629]. -in-a-row [1311].-induced [1824]. -integers [1457].-irreducible [115]. -labeling [2244, 1636].-labelings [440]. -language [663].-limited [2080]. -longest [1810].-maximum-sums [797]. -Median [782].-nearest-neighbor [2062].-panconnectivity [1325]. -path [630].-points [729]. -polygons [1769].-power-free [2164]. -reducibilities [1746].-regular [1246, 1625]. -SA-ES [115].-SAT [178]. -semirings [400].-spanner [173]. -spanners [2216].-splittable [952]. -star [1558, 2393].-Steiner [2008]. -strict [1201].-sub-recursive [417]. -subshifts [1445].-tape [1910]. -terms [975]. -theories [1589].-tonic [2004]. -transitions [1184].

-trees [1962]. -tuple [1227].-valued [913, 1691]. -varieties [641].-variety [1656]. -words [1503, 2339].

.NET [859].

1 [385].

2 [386]. 2-approximate [1916].2-approximation [1964].2-categories [102]. 2-coloring [2313].2-constraint [431]. 2-cyclic [2363, 1992].2-interval [1323, 1542, 2124].2-letter [1494]. 2-median [1980].2-radiian [1822]. 2-radius [1822].2005 [988, 1435]. 2006 [1514, 2303].2nd [1555]. 2nd-order [1555]. 2SAT [74].

3-COL [1717]. 3-coloring [1555].3-dimensional [1819]. 3-regular [1290].3-SAT [1026, 1811]. 3-tier [836].3-vertex-connectivity [1013]. 3D [689].3SAT [74].

4-coloring [1415]. 4-cycles [945].4-way [2041]. 400 [2399].

5 [899].

6-man [446]. 60th [2271, 1532, 2288].64-bit [503].

7/8 [2347]. 7/8-approximation [2347].

8-approximation [2347].

abelian [2261, 1185, 1891, 1912].absence [1140]. Absolute [1578, 317, 1297].absoluteness [1515]. absorption [372].Abstract [154, 2326, 672, 1686, 278, 356, 857,1070, 163, 1085, 1927, 186, 159, 1678, 1865].abstraction [593, 1730, 1785, 1437, 1696,1030]. abstractions [1699].Accelerating [2232, 2246].

3

acceptance [24, 72].Accepting [994, 1136, 2200, 1942, 1252].Access [1597, 1243, 1598, 1004, 159].accessible [1215]. achievable [2110].achievement [1882]. achieving [1017].achromatic [1975, 774]. acid [1933].Acknowledged [1104].acknowledgment [1984].acknowledgments [948]. across [1794].action [753, 59]. action-based [753, 59].Actions [641, 917]. actor [1864].Actors [1926]. Acyclic [2365, 1566, 1180,413, 1060, 2155, 972].ad [1666, 1664, 157, 1665, 1104].ad-hoc [1666, 1665]. Adams [2090].Adaptive [1368, 1664, 2213, 1953, 2021, 910,1099]. adaptiveness [107].Adding [164, 1039]. Addition [1128].Additive [381, 2332, 1324, 546].Additivity [1773]. address [2379].addressable [610]. addressing [1858, 67].AdHoc [2137]. adic [1194].Admissible [501, 374]. ADMs [457, 1302].advances [1683]. Adversarial [1961, 1232].adversaries [224, 227]. advice [1677, 2019].Affine [2056, 1390, 569, 1541]. affix [1411].after [1041]. again [1105]. against [574].agent [806].agents [288, 1462, 1306, 1927, 1488, 515].aggregate [982].aggregation [737, 310, 2023, 1876].AGh [922]. agnostic [1111].agreeable [1055]. Agreement [1301, 133,2021, 1955, 986, 1051]. agreements [473].al. [1910]. Alberto [1532, 363]. Alder [43].algebra [882, 141, 137, 140, 300, 883, 1470,1276, 1075, 509, 360, 210, 2054, 579, 1441].Algebraic [940, 238, 682, 1476, 2322, 338,958, 485, 1871, 1068, 579, 789, 497].algebraicity [2279]. algebraization [584].Algebras [1378, 514, 2367, 406, 2059, 1831,584, 1101]. Algol [1067, 1439].algorithm [2114, 812, 553, 1169, 1110, 1964,2377, 2163, 2388, 1701, 860, 640, 2296, 469,

128, 2309, 2363, 961, 711, 1144, 1427, 1664,1784, 1870, 1969, 779, 1552, 1952, 2001, 1183,1140, 329, 79, 1056, 1170, 1331, 1956, 1141,2357, 967, 387, 1322, 1648, 2148, 723, 816,1112, 1405, 2264, 910, 1722, 2022, 1268, 727,2231, 1429, 265, 468, 728, 1977, 1772, 1133,1452, 1992, 2294, 1455, 2139, 1288, 1504,2111, 431, 1689, 462, 627, 1291, 2008, 693].Algorithmic [1162, 1424, 1277, 720, 1170,2193, 950, 253, 408].Algorithms [1887, 1532, 1540, 1810, 1400,130, 1857, 1227, 1102, 1974, 1130, 1778, 938,386, 1149, 1907, 2314, 458, 2392, 433, 1684,2020, 86, 2053, 860, 3, 402, 1980, 2063, 268,1217, 2352, 797, 1649, 1802, 1607, 1180, 1608,1115, 2243, 2024, 1220, 421, 782, 549, 837,1310, 1610, 1854, 1174, 1677, 2310, 217, 834,1909, 1285, 269, 511, 1630, 1312, 624, 2050,774, 1500, 1026, 1983, 297, 2290, 1043, 1129,84, 1700, 1928, 539, 542, 1632, 1222, 1533, 530,1238, 1051, 694, 44, 2133, 2006, 1012, 2375,1307, 710, 2064, 1775, 1998, 2369, 1548, 2398].Aliased [1801]. Alice&Bob [900].alignment [927, 967]. all- [132].all-ones [1308]. all-optical [109].All-pairs [1916, 1554].all-shortest-path [1409]. all-to-all [109].allocation [951, 2101, 1181, 549, 1782, 1801].allowing [388]. almost [2367, 2026, 1111].almost-complete [2026]. alpha [1194].alpha-adic [1194].Alphabet [1314, 245, 2038, 2201, 1447].Alphabet-independent [1314].alphabet-size [2201].alphabets [262, 1494, 1315, 2169, 1910, 75].alternating [194, 251, 170, 567].Alternating-time [567].Alternative [890, 1729, 691].Amalgamating [1924].Amalgamation [51]. amazons [451].amb [35]. Ambainis [214].ambient [666, 884, 37, 1597, 667].ambient-like [666].ambients [1031, 97, 1598, 2017].

4

ambiguity [960, 352]. Ambiguous [101].amiable [1431]. among [2003, 1488].amplification [985, 2076].analog [1064, 996, 997]. analyser [274].analyses [858].Analysis [1653, 693, 447, 598, 1162, 1424,1694, 898, 2323, 2193, 591, 1469, 197, 154,899, 734, 268, 932, 2190, 2275, 595, 1374, 157,222, 192, 1559, 1556, 1170, 1072, 1151, 1363,1638, 723, 1535, 1405, 2254, 373, 1152, 568,449, 904, 1133, 540, 1678, 2334, 225, 1464, 906,1411, 332, 886, 462, 1812, 551, 1923, 2192].analytical [1761, 1324]. Analyzer [903].Analyzing [1073, 637, 1422, 1840].anarchy [935]. ancestor [1554].ancestors [1180]. AND/OR [1648].Angel [1402, 465]. animation [1739].Anisotropic [1851]. annealing [1331].annotated [1621]. anonymity [2272].anonymous [1815, 1612]. answer [1885].answering [1002, 149]. Ant [322].antichain [1148]. antimagic [1048].antimagicness [1966]. antipodal [1050].antiport [1022, 692]. Antonio [230].Any [284, 612, 2184]. Any-world [284].Apartness [1735]. Apostolico [1532].Application [735, 34, 805, 1422, 581, 689,1176, 1132]. Applications [2323, 1256, 871,1292, 602, 1585, 1469, 1198, 980, 365, 1062,1933, 1280, 1925, 2300, 251, 559, 1312, 2299,1722, 601, 1411, 1501]. Applied [271].approach [404, 975, 1851, 757, 920, 1627,737, 950, 968, 884, 2378, 1157, 58, 705, 295,328, 748, 1324, 60, 247, 2010, 1622, 2289, 152,2240, 466, 963, 842]. approaches [958, 1934].approaching [910]. appropriateness [480].Approximability [1320, 288, 952, 68, 267].approximants [358].Approximate [2379, 548, 1872, 1150, 1916,414, 2048, 311, 1453, 550, 1557].Approximately [1000, 2000].Approximating [1054, 1485, 2313, 1542,173, 1233, 1492, 1222, 2374, 819, 754, 2309,175, 1058, 1544, 1427, 597, 2050, 1996].

Approximation [2107, 1649, 732, 2001, 837,1310, 2310, 1990, 182, 624, 390, 1268, 1632,1249, 536, 2249, 2354, 216, 85, 1482, 1964,2102, 2388, 1988, 2309, 1217, 2352, 249, 1969,779, 2151, 1115, 730, 1549, 1183, 1647, 1473,2060, 943, 1299, 2347, 774, 1153, 1429, 1111,1288, 1307, 1291, 2008, 2110, 1051].approximations [1354, 618, 409].APX [134, 216, 730]. APX- [216].APX-hard [134]. Arbitrage [1794, 833].Arbitrary [1815, 262, 205, 1968, 1299, 2100,1757, 1432, 77]. arboricity [1225].architectural [141]. architecture [55].Area [1849, 2393]. Area-time [1849].areas [2005]. arising [532].Arithmetic [1128, 919, 502, 505, 506, 503,1454, 1404, 138, 679].arithmetical [1199, 207, 1908].Arity [1705]. arm [1123, 627].armed [2070]. arrangements [474].array [1411]. arrays [2387, 548, 1314, 1538].arrivals [2152]. Artemis [2106].artificial [686, 1683]. ary [954]. ASM [161].AsmL [303]. Aspects [64, 1241, 2272, 47,1236, 1517, 312, 791, 2007].assembling [1937].assembly [2040, 1128, 1523, 1525, 2035,1049, 1716, 721, 2031, 1524, 1941, 528].assertion [54, 1831]. assertion-based [54].assignment [288, 1169, 558, 1797, 1595, 438,1268, 1557, 2105, 1591]. assignments [1502].associated [1791, 1230, 768, 716, 1800].associativity [1640, 1208].assumption [227].assumptions [284, 1967].asymmetric [1960]. Asymmetry [776].Asymptotic [2093, 723, 1482, 1348].Asynchronous [2119, 628, 700, 1340, 2280,1262, 139, 787, 168, 1815, 1425, 1053, 1958,2334, 2131]. Atomic [2211]. atoms [1071].ATSP [979]. attack [1901].attacks [911, 906]. Attila [1760].attribute [1345, 752].attribute-efficiently [1345].

5

attribute-element [752].Attributed [1097]. auction [1141].auction-based [1141]. auctions [1481, 182].augmentation [734, 1649, 2081].authentication [226, 902, 10, 551].Author [40, 61, 91, 112, 125, 144, 162, 183,198, 221, 493, 759, 786].autocorrelation [2115].Automata [2156, 1329, 594, 2242, 975, 1351,830, 2074, 5, 1086, 713, 2302, 2194, 1215, 636,1728, 1814, 339, 1442, 244, 637, 456, 2058,483, 698, 2200, 1493, 71, 1490, 824, 1209,2169, 1910, 50, 2223, 1715, 695, 1179, 2203,264, 9, 1889, 2332, 2266, 892, 1182, 2224,2078, 788, 787, 56, 595, 1575, 2075, 194, 1795,2077, 648, 973, 2177, 2230, 24, 650, 2226,930, 826, 1211, 802, 114, 827, 1803, 1053,1092, 2221, 1438, 1230, 1903, 1685, 828, 100,328, 28, 30, 1359, 546, 1529, 894, 2229, 1344,2207, 1116, 1011, 2182, 1688, 1094, 2334].automata [1622, 323, 2397, 831, 538, 937, 72,1131, 2227, 1278, 2076, 124, 923, 659, 1697].automata-theoretic [975].Automated [1098, 727]. Automatic [1732,573, 566, 2161, 724, 1730, 949, 2233, 1044].automaticity [1163]. Automaton [2349,344, 1034, 2231, 1687, 266].automaton-based [1034].Automorphism [2091].Autonomous [2032, 1607, 2024, 1300, 1682].Autopoietic [1278]. auxiliary [826].availability [2146, 794, 2335, 2350].Average [1151, 932, 1263, 1357, 2002, 439].Averages [724]. avoid [941].avoidability [1991]. avoidable [1891].avoidance [202, 2180].Avoiding [203, 1912, 2387, 1547, 1454].aware [1031, 1370].Axiomatisations [619, 758].axiomatization [33, 1510, 187, 567].Axiomatizations [1033, 1006].axiomatized [745]. Axiomatizing [1007].axis [1768].

back [886]. back-and-forth [886].Backtracking [484]. backup [106].Backward [2230].Balanced [2151, 1181, 311, 929].balancing [783, 953, 2023]. ball [367].balls [1899, 1750]. balls-into-bins [1899].bandits [2070, 1576]. bandwidth [812, 709,1819, 1782, 1118, 835, 931].barrier [1332, 2396]. bars [1401].base [950, 2215]. based [54, 881, 1150, 1243,822, 34, 753, 1002, 912, 977, 1462, 128, 212,1148, 255, 1144, 47, 1598, 2326, 664, 343,903, 610, 720, 1374, 2325, 1926, 479, 1397,2179, 1731, 911, 1956, 2034, 1363, 1141, 2355,847, 995, 1034, 1696, 1267, 1005, 449, 312,1329, 411, 1733, 1455, 59, 1880, 1967, 780,2256, 123, 1812, 319, 921, 551, 1145].bases [1194, 1846, 1656].basic [883, 2136, 1170, 746].basis [586, 1880].batch [2152, 1059, 1990, 2154, 2000, 390,1055, 1568, 1976, 1046, 2111].batching [2238, 1226, 2362].Baumslag [220]. Bayes [1343].Bayesian [1836, 1283, 1756].be [483, 97, 612, 1085, 1687, 1309].behavior [2163, 456, 787, 1733].behavioral [822, 1528, 1673, 1156].behaviors [1033, 1099].Behavioural [301, 49, 754]. being [1081].Belnap [1387]. benefits [1252].Benenson [2397, 323]. Bernstein [1106].Besicovitch [2236]. best [1504, 2111].beta [1723, 2338, 2192].beta-binders [1723, 2192].beta-shifts [2338]. better [1549].between [278, 336, 1514, 1070, 2368, 1002,979, 1069, 1562, 382, 2215, 690, 2234, 1639,1977, 789, 231, 780, 563].Beyond [43, 730, 1364, 1440].Bezoutian [1106]. bi [399].bi-infinite [399]. Bias [453].bibliography [1621]. bicliques [172].biclusters [928]. biconnectivity [1557].

6

Bicriteria [1226]. bifinite [871].bijective [1179]. billiard [240, 1198].bimachines [1634]. bimatrix [1829, 2050].bimorphisms [2225].bin [2354, 1482, 795, 1900, 1432, 1501].Binary [2115, 2364, 978, 1368, 1886, 2164,1765, 1767, 1891, 1912, 749, 2175, 210, 392,25, 2232, 1771, 372, 983, 1500, 1152, 2004,203, 629, 627, 1775]. Bincoloring [1798].binders [2192, 1723]. binding [1850, 2195].binoid [1007]. binomial [540].bins [1899, 1181]. bio [1127, 2190].bio-operations [1127]. Bio-PEPA [2190].biological [1465, 2191, 1711, 2190, 1999,1842, 2298, 369, 1936, 1463, 2189].biology [1686].bipanconnectedness [1973].bipanconnectivity [1325].bipanpositionable [1973].bipartite [1228, 1229, 2089, 81, 2308, 1213].biprefix [2118]. biRFSA [652].Birthday [1532, 2271, 2288].bisecting [265].bisection [1246, 1247, 1122].bisimilar [1697]. Bisimilarity [881, 38].Bisimulation [1490, 281, 748, 661, 1341,187, 188, 2230, 1188, 1678, 1074].bit [2379, 544, 912, 1297, 503, 1314, 1186].bit-probe [1186]. Bitonal [1711].bits [2345]. biunitary [535].bivariate [375]. black [425, 1299].black-box [425]. BlenX [1842].blind [1889, 650, 802]. Block [1218, 1287,957, 781, 1964, 804, 290, 166, 906, 726].block-synchronized [166].blocks [1202, 974]. blockwise [1365].Board [270, 279, 298, 403, 443, 561, 575, 738,762, 770, 808, 848, 869, 887, 907, 914, 924,965, 987, 998, 1018, 1028, 1036, 1065, 1082,1095, 1125, 1137, 1166, 1191, 1235, 1326, 1349,1388, 1416, 1434, 1459, 1506, 1513, 1571, 1601,1637, 1661, 1833, 1867, 1920, 2159, 2185, 17,52, 92, 103, 126, 135, 153, 184, 199, 211, 228].Bodlaender [1405]. bond [833, 119].

bond-free [119]. boolean [1331, 471, 1130,2265, 1816, 1383, 1550, 1502, 406, 1562, 302,1285, 752, 1855, 277, 742, 68, 291].Boost [505]. bordered [236].Borel [2104, 492]. both [2348].bottom [389, 213, 2108].bottom-up [389, 213, 2108].bound [1243, 43, 792, 1272, 1295, 1544,2214, 1179, 1797, 87, 1908, 75, 954, 710, 428].boundaries [601].boundary [1407, 71, 321].bounded [327, 989, 434, 381, 1649, 597, 1231,1296, 9, 1264, 2381, 648, 719, 1403, 1731,1172, 1248, 348, 1120, 121, 814, 383, 498, 634].bounded-hop [1296]. Bounding [1521].Bounds [1246, 1443, 1561, 2020, 1988, 1123,2090, 1297, 715, 934, 1017, 421, 1372, 1190,706, 2178, 1821, 2130, 2254, 2231, 729, 1809,65, 1636, 1818, 780, 214]. box [425].boxed [1598]. boxes [685, 1172].Boyer [2302, 2232]. BPA [881].bracketing [747]. Brainstorming [1019].branches [1651]. Branching [661, 792,1164, 2280, 2315, 706, 1895, 285, 121].branching-time [1164, 285].brane [1715, 995, 1712]. break [1536].Breaking [1132, 694]. breakpoint [638].breakpoints [1535]. bridges [1712].brief [137]. broadcast [1262, 1605].Broadcasting [607, 558, 2217, 107, 2026,984, 1104]. broadcasts [1559, 1644].Brownian [1517, 1938]. Bruijn [610].brushes [1618]. Brzozowski [1631].Buchi [830, 194]. budget [1481].buffering [1603]. bundles [2312].Burrows [89, 1362, 1364, 1363, 1369, 2183,2294]. Busi [1931]. busing [65].butterfly [46]. BWT [1365].Byzantine [111].

C [502]. C# [156, 915, 306].cache [2144, 1679]. cache-friendly [2144].cache-oblivious [1679]. caches [47].cacti [630]. cactus [1149]. cage [2033].

7

calculations [1144].Calculi [1585, 1862, 662, 1070, 96, 1672, 664,995, 37, 1597, 1712, 101, 1385].calculus [57, 275, 850, 1631, 1592, 35, 1599,283, 2282, 1837, 187, 1593, 56, 666, 174, 884,589, 1437, 867, 1587, 586, 1588, 489, 1721,359, 568, 861, 143, 678, 305, 562, 1441, 1160,1003, 429, 751]. calibrated [840].calibration [839, 1348, 2064].call [733, 296]. call-by-name [296].camp [2215]. Can [989, 1085, 1652, 1687].Cancellation [1448]. candidate [2389].cannot [483, 97].Canonical [970, 1394, 639, 1148, 672].Cantelli [2104].capacitated [1320, 2388, 1429].capacities [1212]. capacity [166].capercaillie [2186]. cardiac [2194].cares [2292, 804]. carrier [1664].carrying [857]. Cartesian [1966].case [155, 777, 2163, 932, 1142, 1640, 1151,411, 1748, 813]. case-based [411].cases [134, 165]. CASL [579, 51].catalysts [23]. catalytic [1020, 825].categorial [1380, 1707].Categorical [850, 562, 488].categories [875, 573, 584, 1373, 742, 1744,102, 1035]. category [880, 1708].category-theoretic [880].caterpillar [2220]. caterpillars [835].Caucal [2399, 1623]. Causal [1749, 2277].Causality [1338, 1740]. Cavity [1850].Cayley [395]. CCP [39]. CCS [33].cell [2316, 1717, 1175]. cells [1721, 28].cellular [2242, 1465, 339, 456, 2332, 2266,787, 648, 114, 1053, 28, 546, 1529, 1116,1011, 2334, 1622, 538, 937, 1687, 1131].center [1149, 776, 62]. central [233].Centralized [1262, 1265]. centroid [2358].CERES [1694].certain [504, 2246, 1043, 231, 801].certification [586, 330]. certified [857, 499].chain [1229, 836, 2215, 2227].chains [115, 1949, 1471, 2031, 768].

Chaitin [1319]. challenges [1933].Chang [961]. Change [1471, 364].changeover [951]. Changing [2218].channel [11, 2105]. channels [1171].chaotic [456].Characteristic [2166, 2167, 169, 533].Characteristics [1944, 661].characterization [1198, 2343, 2298, 1447,399, 949, 1360, 557, 745].Characterizations [1016, 692, 1061, 644].Characterizing [702, 1593, 646, 2234, 261].Charts [2277]. chasing [1604].cheating [1854]. checkers [1021].checking [356, 2193, 753, 1164, 1239, 2286,1463, 1727, 1731, 572, 703, 2281, 1928, 1238,1733, 918, 333, 1003]. Chemical [1838].Chess [446]. Choffrut [656]. choice [143].Chomsky [583]. Choosing [504].chord [401, 457].chordal [1228, 1412, 2353, 437, 527, 1213].Chordless [524]. Chosen [911, 2355].chosen-ciphertext [2355].Christoffel [2252].chromatic [1799, 436, 82].chromosomal [1536]. Chudnovsky [553].Chvatal [2157]. Ciancaglini [1585].CiE [988, 1514]. ciliates [638].ciphertext [911, 2355]. circle [1552].Circuit [1271, 255, 1564, 84, 398].circuits [1849, 2132, 414, 718, 1855, 1908,913, 1691, 1404, 2269, 1733, 942, 1818].circulant [1802, 1428, 2085].Circular [2296, 90, 2343, 1639, 1451, 2082,82]. clarifications [401]. class [2292, 1390,753, 639, 196, 837, 1526, 1201, 2077, 532,559, 317, 1156, 1249, 477, 332, 1309, 1501].Classes [1108, 1407, 1257, 336, 216, 1255,2169, 1547, 730, 474, 971, 371, 1285, 692,1284, 2065, 1937, 1248, 475, 2003, 213, 374,1027, 542, 1579, 101, 937, 2395, 745, 545].classical [850, 2130, 2327, 325].Classification [1321, 1256, 438, 1578].Classifying [2100, 1057]. clause [2173].clauses [1641]. Claw [2375, 1555].

8

claw-free [1555]. Cleaning [1618].cleavage [1839]. clique [2092, 1054, 1412,980, 1217, 436, 719, 2385, 1322, 1569, 1120].clique-width [719, 1120].cliques [608, 469, 1826, 1333, 813].clock [328]. Clos [1015]. Close [427].closed [1255, 580, 2127].closest [2055, 1505].Closure [581, 1156, 538, 150, 580, 807].cluster [2392, 1965].clustering [775, 1788, 1956, 1811].clusters [2062]. CNF [393]. CNN [710].co [1839]. co-transcriptional [1839].coagnostic [473]. coalgebra [882, 756].Coalgebraic [56, 863, 1376, 884, 1440].coalgebras [2274, 739, 517, 756].coalgebras-A [756]. coarse [769].Cobham [2058, 1445]. cocomplete [1035].code [1418, 857]. codeletable [1771].Codes [243, 636, 233, 889, 2301, 2263, 1171,2118, 1050, 1127, 10, 1547, 234, 117, 1408,239, 1230, 1639, 654, 1451, 735, 736].Coding [957, 1244, 10, 2248].coefficients [1657, 375, 1877].coherent [2098]. coinductive [757, 305].coiteration [94]. COL [1717].Collage [242]. collapse [1317].collapses [340, 1866].Collapsing [2098, 2204, 1452].Collatz [1430, 1832]. Collatz-like [1430].collisions [2156]. colonies [1952].colony [322]. color [1063].colorability [45, 1643].Colored [1063, 1898, 1848]. Coloring [811,435, 2106, 812, 2313, 467, 1796, 2001, 1628,439, 2247, 441, 1415, 1555, 527, 1132, 2365].colorings [434, 2098, 945, 432, 2082, 1786].colors [176, 2247].colouring [1295, 2027, 1934, 631, 1396].colourings [2368, 1792, 442].colours [1792]. column [1367].columns [2101, 394]. combinations [2060].Combinatorial [458, 554, 1547, 1785, 2007,8, 388, 1183, 1364, 2378, 374, 780, 466].

Combinatorics [44, 1442, 2369, 1887, 720].combinatory [2283].combined [2205, 1273].Combining [155, 673, 1068, 590].comma [1639]. comma-free [1639].commands [357]. Commitment [1856].commitments [1062]. commodity [1968].common [669, 338, 1805, 1180, 1540, 2380,943, 2383, 1983, 966, 789, 2155, 2009, 1554,963]. Commons [287].communicating [1706, 695, 1355, 1027,1724]. Communication [1223, 781, 1783,822, 2137, 1340, 953, 1266, 1647, 2178, 1821,2130, 2023, 28].Communications [1298, 109].Commutation [239, 165].commutative [1631, 2012].commutativity [1640]. commuting [651].Compact [1034, 767, 1897, 2165, 1804].compactness [1735]. companion [1218].comparability [1560]. comparative [1597].comparator [2025]. compare [1927].Comparing [1684, 1184, 705].Comparison [2129, 1562, 1243, 1918, 1346,1331, 622, 161, 2385].comparison-based [1243].comparisons [919].compartments [2192, 2189].Compatibility [519]. Compatible [805].Competitive [1486, 600, 1559, 2238, 1481,1648, 1758]. competitiveness [258].competitivity [710].complementary [1943].Complementation [1245, 330, 1093].Complementing [30].Complete [567, 1373, 886, 2198, 1525, 836,1376, 438, 2089, 1511, 2112, 1831, 1611, 1808,441, 2026, 1801, 1360, 678, 814, 2395].completely [535]. Completeness [216, 730,1228, 2368, 174, 290, 1831, 1789].Completing [2301, 654, 1451, 736].completion [390, 2259, 1911, 267, 1943].Completions [8, 1909]. complex [608, 853,1463, 1628, 2371, 609, 611].

9

complex-value [853]. complexities [541].Complexity [1885, 1257, 1164, 597, 1647,1247, 2255, 1937, 952, 1153, 1334, 1136, 1643,810, 1879, 2092, 2114, 616, 1979, 1196, 1390,2389, 1666, 1650, 1561, 805, 1763, 1308, 1495,181, 2201, 418, 2265, 1816, 1277, 1272, 1199,20, 1658, 212, 521, 2305, 2087, 2143, 1433,179, 1853, 1998, 2203, 1297, 1356, 2121, 1829,1553, 2205, 1918, 1913, 438, 1142, 2209, 207,293, 1175, 2093, 1791, 2262, 1357, 1174, 2177,2136, 460, 192, 1655, 24, 1596, 2178, 1311,2339, 2130, 25, 1393, 707, 165, 1279, 1782,475, 1404, 1185, 107, 425, 1740, 2123, 1423,675, 1500, 1524, 1415, 2153, 828].complexity [2372, 151, 843, 1919, 1414,2233, 1286, 296, 2091, 349, 1186, 984, 2207,2126, 1723, 735, 1273, 121, 492, 1548, 1259,2338, 1275, 937, 813, 942, 1478, 1818, 31,1570, 398, 1996, 129, 1343, 1945, 1290, 552,565, 556, 842, 1213, 1510, 994, 1278].Component [822, 1384, 1237].component-oriented [1237].Components [517, 1762, 19, 660, 1355,1154, 60, 863]. composable [2009].composition [57, 2295, 822, 300, 725, 866,264, 301, 1890, 1808, 1387].Compositional [898, 1528, 591, 1098, 58,1042]. Compositionality [604].Compositions [893]. Compound [2088].Compressed [2162, 1989, 1370, 2381, 2300,548, 828, 1983, 1314]. Compressing [1367].compression [857, 1362, 75, 1363, 840, 767].Comput [1530, 2399, 402, 1691, 560, 1136,1708, 2397, 1124, 923].Computability [1596, 997, 256, 674, 1155,1514, 1462]. computable [417, 541, 841,1865, 708, 498, 497].Computation [833, 292, 1539, 404, 1292,327, 1128, 1330, 1280, 1998, 384, 290, 532,358, 1518, 1940, 1158, 1064, 449, 679, 1914,291, 1995, 122, 319, 614].Computational [872, 602, 1816, 1932, 1933,1716, 1936, 1740, 2391, 2091, 1435, 1290, 791,278, 2228, 1495, 179, 927, 681, 1276, 1718,

1511, 224, 1738, 2385, 885, 2153, 37, 855,1051, 2338, 1476, 323, 2397, 813].Computationally [23, 2198].Computations [1869, 500, 2297, 6, 2323,338, 660, 688, 1854, 1817, 1520, 321, 1881].compute [989, 2377, 1983].Computer [286, 1746].computers [1690, 1519]. Computing [988,133, 620, 178, 651, 1541, 1957, 1877, 2155,1505, 814, 77, 1718, 1140, 251, 1540, 1939,2148, 909, 177, 375, 1529, 1959, 2290, 1043,2091, 1857, 1712, 1417, 996, 430, 754, 1019].concatenation [958, 641, 350].concept [474, 475, 602].concepts [2385, 2239, 409, 496].conceptual [1064]. concerning [564, 1831].concise [909]. conclusive [2025].concordance [450].Concurrency [32, 1436, 704, 1673, 682,1338, 487, 700, 1078, 1923].Concurrent [662, 1381, 1339, 1732, 1841,1077, 108, 186, 864, 513, 861, 59].condensation [466]. condensing [1375].condition [372, 1622, 1309].Conditional [2142, 1807, 1555, 1286, 1387,1893, 1970].conditions [1732, 2098, 24, 492, 2360, 72, 31].conference [733]. confidence [839].Configuration [2278, 1153].configuring [510]. confinement [223].confirmation [1283]. conflict [405].conflict-free [405]. conflicts [1556].confluence [2283].congestion [2045, 2211, 2346].congruence [2223, 1723].congruences [142]. conjecture [2168, 1315,2170, 206, 209, 309, 442].Conjugacy [2118, 1207].Conjunction [1030].Conjunctive [1001, 413].connected [506, 2333, 1312, 1960, 2254,2398, 1227, 1307, 531, 1974, 2386].connection [1520, 1222].Connectionist [688, 991].

10

Connections [231, 1105, 445].connectives [36]. connectivity [1013, 1487,215, 1224, 312, 2140].connectivity-based [312].connectors [883]. coNP [345, 1317].coNP-hard [345]. conquer [532].consecutive [2083]. consensus [1534].consequence [2012].consequences [364, 817].Conservation [2242, 1487].considerations [1519]. considering [2141].Consistency [1756, 47, 2328].consistent [981, 419]. consolidation [1990].constant [1181, 1792, 1908, 1818].constant-depth [1818]. constants [116].constrained [1615, 634, 1323, 311, 1647,2262, 1389, 1981, 1810, 1977, 1501].constraint [2057, 419, 1840, 150, 290, 794,2258, 2054, 1696, 2350, 359, 431, 1045].constraints [1305, 2253, 243, 1765, 1767,1481, 1516, 1866, 50, 1444, 743, 1860, 148,1004, 1796, 1484, 2146, 752, 2267, 1464, 332,1820]. Constructibility [1515, 1519].Constructing [248, 1985, 1312, 727, 272,2104]. Construction [1960, 553, 824, 860,1376, 1507, 1306, 10, 873, 2059, 2062, 2231,1314, 2181, 1804, 817]. constructions [2074,1797, 2075, 117, 633, 1821].Constructive [954, 274, 2104, 1479].consumption [1953, 1252].contact [406, 427, 1858]. contain [1652].Containers [272]. containment [147, 148].contains [90, 1824]. content [681, 610].content-addressable [610].contention [108, 1953].Context [1092, 29, 385, 386, 583, 1905, 2199,1070, 1021, 1231, 643, 2361, 220, 692, 581,1919, 38, 166, 1394, 2080, 170, 1625, 2229,1539, 1380, 1707, 31, 1099].Context-dependent [1092].Context-free [29, 385, 386, 583, 1905, 2199,1231, 643, 2361, 220, 581, 38, 166, 170, 2229,1539, 1380, 1707].context-sensitive [1070, 692].

contextual [960, 894]. Continuant [2163].continuants [395]. continuations [1068].continued [1193, 1879, 1478, 2240].Continuity [256, 1219, 2285].continuous [327, 2287, 1719, 875, 1596,1170, 1667, 1748, 1035].continuous-time [327, 2287].continuum [1011]. contours [376].contract [898]. contract-signing [898].contraction [1187]. contracts [822].Control [1382, 701, 2389, 1673, 1598, 487,281, 1509, 2153, 1597, 2192].controllable [574]. controlled [2204].Convergence [115, 2031, 1638, 1133, 1552,841, 511, 910]. converse [1636].conversion [1455, 1880]. converting [393].Convex [1769, 1229, 397, 1766, 394, 640, 63,371, 376, 1401]. Conway [1904, 465].cooperating [19]. cooperative [701, 291].Coordinating [1119]. Coordination [2210,2049, 355, 1927, 2335, 60, 160, 2139].cop [1617]. cop-robber [1617].copies [511]. Copower [2011].Coppo [1585, 1593]. copulas [1144].copy [1481]. Coquand [1475]. Core [1075].corecursive [499]. cores [1802].corona [1663]. coroutines [489].correction [599, 2360].correctness [1922, 1335, 514, 291].Correlation [775, 1830, 1250].correspondence [278, 1070, 1853, 2176].corresponding [909].Corrigendum [1708, 1707]. corrupt [1345].Cost [961, 947, 380, 1646, 108, 1642, 785,1953, 1143, 837, 935, 1890, 1013, 2291, 1500,2141]. costs [2023, 1576]. Could [612].count [100]. countable [1507, 1576].counter [9, 220, 124].Counterexample [593].Counterexample-guided [593].counterexamples [1406, 2138].counters [27].Counting [74, 1147, 236, 1538, 2056, 860,643, 2361, 2255, 574, 1453, 1290].

11

cover [1178, 2102, 1229, 1605, 824, 979, 175,249, 423, 1917, 630, 1060, 2373, 1222, 2398,819, 1974, 2386, 85]. coverage [2396, 62].Covering [2387, 2089, 1545, 608, 836, 2351,66, 1115, 732, 217, 2260, 1632, 1012].CPO [1864]. cpos [875]. CPS [665, 99].Cramer [977]. Cramer-Damgard [977].crash [1958]. creation [1383, 992].Creol [864]. Crick [695, 2203].criteria [480]. Criterion [839, 1277, 1526].criterium [208].critical [1318, 368, 1090, 1221].Crochemore [2288]. crossed [1790].Crossing [964, 81]. crossover [912, 694].crowdedness [1620].Cryptographic [1508, 95, 50, 568].Cryptographically [1671].Cryptographically-masked [1671].cryptography [939, 1063, 251, 911].CSC [1384]. CSC-solving [1384].CSL [1238]. CSP [579]. CSP-CASL [579].CSPs [2328]. CTL [570, 646, 58, 359].CTL-like [646]. cube [959, 818].cubes [1807, 1985, 1790, 1654]. cubic [442].Cubical [873]. cubically [873].Curien [1593]. Curtis [1635, 2236].curve [1470, 1106].Curves [1477, 1150, 1219, 430]. cut [1103,2377, 2151, 1310, 555, 894, 565, 1122].cutsets [1828]. cycle [979, 381].Cycles [1027, 2359, 109, 1807, 945, 1476,2082, 1225, 1786]. Cyclic [2147, 2363, 1912,528, 966, 1992, 1820].

D [216, 1426, 259, 366, 2305, 1772, 2334, 1303].D. [553]. D0L [13]. D2B [610].Damgard [977]. Daniell [708].darkening [1063].Data [149, 2023, 1305, 1391, 1006, 446, 1805,274, 1806, 459, 1675, 1840, 1925, 311, 1175,276, 324, 1190, 1370, 1695, 1406, 1172, 1582,858, 1324, 1252, 993, 1580, 1579, 225, 161,1411, 476, 1644, 1367, 2, 1124, 2066].data-aware [1370]. data-flow [858].

data-independence [225].data-oriented [1925].databases [150, 853, 564, 285].datalog [1698]. dataspace [55].datatypes [94]. date [943].dates [390, 1055, 1489, 1568].Deadline [1896, 2107].deadline-TSP [2107]. deadlock [1060].deadlock-free [1060]. Deadlocks [877].debugging [586]. decay [2275].decentralized [427]. Decidability [2114,343, 1509, 746, 39, 661, 1515, 259, 747, 852,150, 567, 174, 1202, 525, 496, 1723, 1456].Decidable [147, 1029, 165, 1439, 895].decide [1020, 2077].decide-and-halt [2077]. Deciding [897,2280, 853, 2220, 1829, 1553, 1955].Decimations [2123]. Decision [1150, 1714,15, 327, 1443, 193, 590, 454, 1576, 1093].Decision-making [1150].declarative [2322]. declustering [715].decoders [1858]. Decoding [1171].Decomposition [138, 980, 1507, 1769, 913,1691, 1207, 1384]. decompositions [634,1089, 1619, 1700, 1877].dedicated [1442, 2303]. Dedication [1261].deductive [285]. Deeper [447].Default [854, 189]. Defect [1116].deficiency [1086, 1816].definability [1963, 294].defined [1641, 1127, 889, 359, 1187].definedness [1003]. Defining [2225].definite [766]. Definition [1507, 156, 691].definitions [164]. deflation [714].defying [1640]. Degree [634, 1168, 944,2309, 1396, 1871, 1962, 648, 1024, 1917, 2357,439, 2229, 778, 1907].Degree-constrained [634].Degrees [930, 1799, 81, 814].Dejean [1315, 2170]. Del [363].delay [1603, 1179, 1559, 2002, 2023].delays [1647, 648, 317, 1682].delegation [264, 1890]. deletable [1771].deleted [76]. deletion [1642, 64, 29, 2141].

12

deletions [1909].delivery [2335, 1489, 2139, 1046, 1504].Della [1585]. demand [1603, 1644, 1501].denotational [757].Dense [1813, 1988, 815, 2239].Density [1703]. dependence [1757].Dependences [392].dependencies [619, 853, 758, 564, 1014].dependency [585, 1367].dependent [1497, 1092].deployment [1668]. depth [602, 1353, 2199,1989, 1056, 1908, 2004, 351, 1818].depth-first [1056]. Derek [1491].derivated [232].derivation [1631, 2199, 354, 625, 391].derivations [2080]. Derivatives [69, 391].descendent [986].description [338, 157, 152].descriptional [2203, 24, 27, 1919, 31].descriptions [1286]. descriptive [878].design [2046, 154, 505, 222, 511, 1667, 1812].Designing [80, 2212, 83]. detect [1854].detecting [128]. Detection [1534, 1850,1825, 1535, 816, 1958, 1702, 225, 727].deteriorating [794, 2250, 1976].determinacy [543]. determinants [1876].Determination [2200, 63, 690].determined [535].Determining [1685, 2357, 1740].determinism [2273, 318, 107, 2220].Deterministic [1778, 2038, 799, 825, 2347,2108, 824, 628, 1608, 389, 802, 827, 2041,213, 1616, 2269, 1360, 1344, 1133, 1521, 124].determinization [830].determinized [483]. development [2015].Developments [1083, 1580].devices [933, 1837, 2032, 1145].deviousness [1845]. Dezani [1585, 1593].Dezani-Ciancaglini [1585].DFA [26, 2125]. DFAs [21]. DFCA [2125].diagonal [1010]. diagrams [1851, 213].diameter [1828, 1915]. dichotomy [435].dictionaries [1243, 1181, 1370].dictionary [246]. difference [1657].

differences [2003].different [1483, 986, 26, 1740].Differentiable [769]. Differential [851,216, 85, 1549, 1023, 1836, 1160].diffusion [1638, 1682]. Digest [459, 401].digit [251, 501, 1903].Digital [1113, 1747, 2240]. digits [76].Digraph [1619, 2389, 1824, 1823].digraphs [2359, 2082]. dihomotopy [877].Dilemma [1119].dimension [1577, 339, 461, 1471, 1216, 474,633, 1938, 475, 2100, 843, 517, 1624].dimensional [926, 245, 2228, 2038, 1753,1819, 242, 179, 2149, 320, 388, 964, 370, 2378,2226, 707, 818, 105, 1116, 1458, 377, 378,2007, 923, 659]. dimensionality [2053, 993].dimensions [718, 465].diophantine [559, 1058, 2364].Direct [2355, 2283]. directed [2359, 1566,1180, 555, 1373, 1567, 2155, 972, 2225, 2140].Directional [1622, 2332]. discipline [1590].Discontinuities [1581]. discounted [333].discounting [2224].discovery [1846, 2292, 847, 130].discrepancy [44].Discrete [1197, 1764, 1023, 885, 1189, 1761,1762, 1328, 1530, 365, 1450, 2305, 1768, 2097,396, 1719, 370, 1908, 1172, 1382, 572, 1941,1395, 1133, 1756, 391, 1967, 1944].discrete-event [1382]. discrete-time [572].discreteness [996]. Disjoint [2359, 1762,1108, 1649, 970, 959, 719, 1985, 1611, 1554].Disk [2027, 1605, 1295, 1969, 1122, 1307,531, 2386]. displacement [1793].displacements [2109].dissimilarities [1392]. Distance [2353,1610, 729, 2377, 171, 2120, 179, 269, 1546,2254, 177, 1977, 1344, 1830, 936, 556].Distance- [1610].distance-hereditary [269].distances [2297, 2368, 1123, 1785, 1539,2340, 754]. distillation [1250].distinct [1949, 1147].Distributed [1604, 2024, 19, 1673, 860, 866,

13

47, 1784, 1608, 1297, 1952, 1553, 292, 1925,384, 157, 55, 864, 1312, 1382, 1423, 373,1958, 1959, 1222, 1678, 1914, 321].Distribution [532, 471, 944, 1168, 961, 1962,623]. distributions [1762, 2063, 1172].Divergence [498, 1020]. diversity [2129].divide [532]. Divisibility [201, 800].division [2016, 981, 1717].divisions [248, 536]. DLS [731].DLS-trees [731]. DNA [22, 1718, 117, 2033,2034, 119, 689, 1943, 2032].DNA-based [2034]. DNAzymes [2032].DNF [393, 537]. do [1532, 111].Do-All [111]. documents [1368].does [1940]. Dolev [224, 227].Domain [1379, 98, 1515, 916, 1878, 878].domain-like [878].Domain-theoretical [1379].domains [871, 920, 179, 1596, 1157, 277,1742, 1189, 1035, 699]. dominance [2243].dominating [1320, 1308, 1988, 1969, 2357,1000, 1322, 1960, 2254, 2391, 1227, 1307, 531].domination [2353, 2352, 445, 1993, 726,545, 534]. domino [1787]. don’t [2292, 804].dot [351]. dot-depth [351].double [2377, 711, 787, 1214].double-loop [711]. double-quiescent [787].doubling [2007]. down [151]. Dpi [1039].Dr [2304]. Drawing [1848, 2005].driven [792, 582].Dual [1172, 1446, 1140, 350, 1557, 751].Dual-bounded [1172]. duality [1446].dualization [1248]. duals [530].due [943, 1212, 1055]. duplex [2033].duplication [944, 380, 1978].duplications [1313]. duration [174].Dutch [268]. Duval [206]. Dyck [1791].Dynamic [2046, 1900, 953, 2276, 1984, 2299,1243, 740, 2152, 1806, 1784, 1675, 1609, 915,1484, 276, 2300, 1186, 1035, 1074].dynamical [2242, 1328, 1530, 281, 1395, 313,2338]. dynamically [142]. Dynamics [1517,1197, 2332, 1562, 1596, 1027, 1622, 1682].

E-pattern [477]. e-services [264].EA [1684]. early [1955, 2362].early-deciding [1955]. EAs [768].Easiness [577]. economies [1853].EDAs [767]. Eddy [1526]. Edge [631, 1396,931, 1893, 1898, 2341, 709, 1320, 1988, 2313,543, 2027, 962, 1263, 2001, 959, 1909, 945,1985, 1248, 1611, 2247, 1428, 1557, 2365].Edge-bandwidth [931, 709].edge-biconnectivity [1557].edge-colored [1898]. edge-coloring [2247].Edge-colouring [631, 1396].edge-disjoint [1985, 1611].Edge-fault-tolerant [1893].edge-intersections [1248].edge-labeled [543].edge-modification [2341].edge-pancyclicity [1428].edges [2387, 773, 1632]. edit [171, 1977].editing [1352, 2392, 1965]. edition [1076].Editor [1947, 136, 1342].Editorial [230, 17, 52, 92, 103, 126, 135, 153,184, 199, 211, 228, 270, 279, 298, 403, 443,587, 561, 575, 738, 762, 770, 808, 848, 869,887, 907, 914, 924, 965, 987, 998, 1018, 1028,1036, 1065, 1082, 1095, 1125, 1137, 1166, 1191,1235, 1326, 1349, 1388, 1416, 1480, 1434, 1459,1506, 1513, 1571, 1601, 1637, 1661, 1833, 1867,1920, 2159, 2185, 1467, 518, 821, 697, 576].EF [702]. Effective [1938, 1965, 875, 500].effects [278, 673, 885, 1068, 855].efficiency [1954, 1279, 2066].Efficient [2222, 2297, 327, 1149, 1663, 2102,1980, 932, 1220, 549, 384, 1825, 1731, 774,572, 374, 1176, 1983, 2181, 2281, 1667, 580,1995, 2076, 2137, 711, 558, 737, 204, 1265,329, 967, 816, 1700, 982, 391, 2006, 1145,977, 1174, 1172].Efficiently [608, 430, 1345, 2239, 972].Ehrenfeucht [294]. eigenvalues [909].Eigenvariables [747]. eigenvectors [909].Eilenberg [1910]. Einstein [1514].Election [1606, 961, 723, 667, 1385].elections [2389, 460].

14

electromagnetic [1775].element [752, 2291, 1313].element-cost [2291]. Elementarily [417].Elementary [2003, 787].elements [1157, 2109, 1114, 2127].eligibility [2267]. eliminating [1702].Elimination [704, 36, 969, 1703, 905, 252,1881, 565, 1907].embedded [1713, 665, 1939, 472].Embedding [1728, 180, 1654, 1790].emergence [611]. emerging [129].Empire [1952]. empirical [1144, 1279].EMSO [698]. encapsulation [2355, 1100].encoded [1368, 1541, 2299, 2264].encoding [665, 366, 1211, 143].encryption [911, 227]. endgame [447].endgames [446]. Energy [2137, 1487, 989,558, 311, 1818, 1605].energy-constrained [311]. enforces [95].Enforcing [1640]. enhanced [234, 321].enquiries [1580].Enriched [1744, 1380, 1707].ensuring [1649]. entanglement [1391].entrant [1630].Entropy [461, 490, 1017, 2381, 423, 1537].entropy-bounded [2381].enumerability [340]. enumerating [2239].Enumeration [1351, 1215, 394, 371, 946,2222, 522, 2385]. environment [911, 1073].environments [1738, 1576, 1757].epichristoffel [2252]. epistemic [569].episturmian [1483, 2166, 1201, 1906, 261].eponymous [1957]. equal [2169, 1645].equal-processing-time [1645].equality [1032, 152].equation [342, 788, 302, 12, 77, 1838].Equational [1699, 897, 33, 2016, 1032, 2059].equations [2056, 2171, 343, 1023, 2175,1836, 1203, 559, 1657, 349, 454, 1093, 1058].equidistribution [2248]. equilibria [2045,777, 1650, 865, 2047, 1853, 2048, 1484, 1142,2209, 293, 1883, 2346, 2262, 2050, 1139].equilibrium [1140, 360, 182, 1141].Equitable [434, 1786, 439].

Equivalence [1087, 1029, 823, 13, 746, 690,1685, 349, 2182, 2240]. equivalences [1528].equivalent [337, 698, 858].erasing [1090, 410, 845]. Errata [1530].Erratum [2399, 402, 758, 1691, 560, 1136,2397, 1124, 923]. erroneous [459].error [84, 2064]. error-free [84].errors [2379, 814, 88]. Essays [1585].essence [303]. establishment [1949].estimates [2070].Estimation [2205, 1928, 2006]. EU [1417].EU-FET [1417]. Euclidean [1296, 2007].Euler [1693]. Eulerian [1875].evaluating [1648].evaluation [1001, 250, 452, 150, 450, 451].evaluators [278].event [1926, 1382, 699, 1820, 2278].event-based [1926]. Events [1084].Every [1221, 90]. everywhere [1111].evolution [1536, 765, 1714, 1842].evolutionary [2198, 1684, 20, 731, 1170,1331, 1129, 2133, 1689, 693].Evolving [1842, 1744, 1278]. EX [702].Exact [311, 131, 502, 499, 1322, 1158, 626, 86].examples [1253, 412, 1346, 2138, 1739, 845,626]. exception [537].Exchange [1139, 149, 1145, 1422].Excluded [479]. exclusion [2260, 877].exclusivity [291]. Executability [2014].execution [354]. execution-time [354].exercise [863]. exercises [1080].existence [2095, 1328, 1530, 2257, 1354,1089, 2034, 817, 873].Existential [2268, 589]. Expander [2373].Expanders [1895].expansion [939, 1704, 251, 2229].expansions [1194, 251, 76].expected [468, 314].Experiments [827, 2385, 1051, 813].Explicit [16, 1418, 96, 670].exploitation [2070].Exploration [2070, 344, 600, 1659, 160, 1911].explorer [2215]. Exploring [606].explosion [328]. exponent [2364, 87, 1221].

15

Exponential [2146, 1818, 792, 2143, 2275,317, 1317, 1343]. exponents [1090].EXPRESS [32]. expression [1897].expressions [245, 1728, 1631, 2206, 973, 69,2220].expressive [1866, 664, 663, 1512, 491, 454].expressively [698].Expressiveness [32, 1932, 923, 659, 1700].Expressivity [1440]. EXPTIME [1808, 38].EXPTIME-complete [1808].EXPTIME-hard [38].extended [663, 206, 1512, 2328, 1371].Extending [1910, 1600, 516, 1583, 1593].extensible [128].Extension [1631, 1202, 902, 1369].extensions [971]. external [1190, 1056].external-memory [1056].Extracting [1323, 274]. extraction [847].extractions [1414]. extremal [1118].extreme [293, 2346].

face [2005]. facility [837, 1291, 782].Factor [1196, 2158, 1390, 1263].factorial [2175]. factoring [1523, 977].factorisation [1863].factorization [1318, 368, 1967].factorizations [649]. factorizing [234].Factors [169, 1218, 240, 1198, 464, 2234,1626, 557]. Fagin [564]. fail [1967].fail-stop [1967]. failing [1263].failures [34, 111, 984]. failures-based [34].Fairness [660, 1311]. families [1582, 2335,2080, 1624, 84, 1343, 817]. family [1717].Fano [442]. farthest [1505]. Fast [1897,1608, 2084, 1982, 1365, 2290, 1043, 728, 1533,599, 1482, 1659, 1873, 2264, 1942, 798].Faster [926, 1180, 1115, 2381, 1366, 46, 1183].fat [1950]. Fault [1807, 1790, 1914, 1970,180, 2398, 1893, 1974].Fault-free [1807, 1970, 180].Fault-tolerant [1790, 1914, 2398, 1974].faults [255, 1609, 2306, 1807, 180, 1301, 1970].faulty [2071, 1677, 2026, 1114, 1428].Feasibility [984]. FeatherTrait [1600].

featured [1730]. Feedback [1267, 839, 530].feedforward [414]. Festschrift [2271].FET [1417].few [2345, 1950, 2089, 178, 15, 1080].fewer [1401]. FFT [2144].Fibonacci [181, 464, 829].Fibonacci-like [181]. fibrational [1067].Fibrations [1377]. field [2371].fields [553, 2110]. FIFO [1105].figures [1211]. fill [445]. fill-in [445].filter [1594]. filters [727].final [739, 2348, 756, 191, 448].find [711, 2346]. Finding [2368, 2165, 1768,2112, 986, 928, 1333, 2035, 1805, 1566, 1627,1180, 523, 480, 1279, 1810, 2264, 2375, 129].Fine [1746, 205, 1447, 59, 2184].fine-grained [59]. Finitary [1736, 191].Finite [71, 1910, 1737, 2226, 1211, 625, 800,33, 553, 1328, 1530, 1728, 2245, 2200, 461,824, 1245, 2118, 246, 9, 1163, 1889, 1033,2078, 646, 344, 1575, 1447, 1357, 973, 24,358, 650, 1917, 1808, 705, 2148, 209, 1685,349, 1344, 2182, 1094, 2076, 844, 2110, 644].finite-equational [33].finite-state [461, 1033, 973, 358, 705].finitely [881]. finiteness [895].first [741, 1364, 1056, 1559, 39, 294].first-order [39]. Fisher [1140].Fitness [1131]. five [2357]. Fixed [2314,1765, 1816, 1658, 2305, 484, 595, 2093, 236,1090, 1423, 209, 28, 490, 941, 491, 778].Fixed-parameter [2314].fixed-priority [595]. fixpoint [857].fixpoints [516]. FKP [1168]. flag [268].flat [1761, 977]. flat-tree [977].flexible [915, 1937]. flips [1195].Flow [2192, 1072, 274, 370, 555, 1630, 858,305, 1375, 963].flows [1671, 422, 555, 1174, 952].Floyd [387]. fly [329, 2286].Focusing [2327]. folded [1325, 257].following [1475]. follows [1660].forbidden [2387, 721]. forecasting [2064].forecasts [993]. forest [1051, 2008].

16

forests [1649]. Foreword [481, 1751, 1584,127, 1251, 1930, 1710, 2271, 1572, 1096, 470,2318, 1361, 2376, 2311, 838, 1532, 2288, 870,1734, 2366, 444, 136, 1342].Forewords [1614].form [583, 1905, 823, 1503, 2339, 1944].Formal [899, 860, 157, 511, 1928, 306, 906,637, 757, 1421, 1736, 891, 1660, 375, 449,1733, 1745, 1750, 845, 921].Formalising [1418]. Formalization [1240].formalized [1693].formation [1552, 1815, 1943].formats [1041]. formed [1706].former [230]. forms [749, 1025, 766, 1874].formula [1693]. formulae [74, 1502].formulas [1816, 2173, 827, 1811].forth [886]. forward [2230, 161, 1145].FOSSACS [1435].foundations [740, 755, 222, 1417, 1435].four [1444, 2294]. four-stage [2294].Fourier [1638]. fourth [1912, 1019].FPT [519]. FPTAS [2146]. fraction [2240].fractional [1609].fractions [1193, 1900, 1879, 1478].Fraenkel [2013]. fragment [680].fragments [146, 589, 1091].Frame [2284, 1073].framework [356, 1038, 1762, 1420, 1422,2190, 1067, 1064, 904, 622, 67, 1812].Free [1441, 90, 385, 386, 583, 1905, 237,1631, 2199, 2164, 433, 1231, 1563, 643, 2361,1029, 220, 310, 2059, 1807, 1374, 1413, 2136,12, 180, 2241, 119, 1894, 581, 2261, 405,1060, 621, 1555, 1824, 29, 38, 166, 1639,2317, 170, 1625, 2229, 1539, 84, 1206, 1380,1707, 16, 314, 535, 1970, 807].Free-algebra [1441]. Freedom [1139].Freeness [1410, 1319, 1972, 2325, 1987].Frege [671]. frequencies [2158, 1044].frequency [6, 1510, 1206]. frequent [791].freshness [273]. frictional [833].friendly [2144]. Fulkerson [442].Full [1437, 1030].Fully [787, 1927, 186, 943, 1772].

function [725, 259, 643, 1285, 1230, 451,2234]. Functional [1195, 278, 619, 853, 758,192, 1072, 909, 918]. functionalities [1783].functionally [1831]. functionals [708].Functions [195, 471, 1087, 989, 2257, 417,1561, 418, 179, 1550, 2361, 1430, 452, 2129,837, 450, 1791, 1574, 790, 1640, 1331, 1968,1134, 1449, 1808, 297, 1875, 472, 291, 1477,1254, 1287, 1995, 1573]. functor [191].functors [2011, 756]. fundamental [138].Furstenberg [1694]. future [1712].futures [861]. Fuzzy [385, 386, 921].

G [553, 1428, 2085].Game [286, 1799, 99, 592, 1595, 2209, 1617,451, 1491, 294, 1234, 1057, 2340, 448, 1907].Games [289, 865, 1883, 296, 492, 1885, 2045,1899, 458, 2211, 1381, 78, 1853, 543, 484,1829, 1882, 2346, 2262, 1311, 1619, 1968,2050, 1986, 700, 686, 1339]. gamma [1875].gap [1541]. gapped [2382, 2293].gaps [2258, 1111]. gas [1687]. gates [123].Gathering [1950, 168, 1425, 311, 1300].GBL [2012]. GCD [1544]. GCDM [1544].GCDs [1872]. gem [433]. GemCell [1465].gene [380, 638, 1838, 1524].General [2231, 775, 253, 1056, 1346, 475,705, 768, 1781, 496, 2338, 1748, 745].generalisation [138]. Generalised [205].Generalising [1641, 1163].generalization [1972, 2058, 1635, 2309, 346,2252, 710]. generalizations [1483, 161].Generalized [1892, 2270, 916, 1453, 1724,1218, 5, 1195, 944, 755, 2166, 1980, 1220,1791, 1311, 841, 463, 1044, 1343, 385].generated [1656, 1107, 2343, 976, 2080, 2131].Generating [583, 1905, 1173, 172, 1762, 933,1172, 1449, 813]. Generation [341, 1351,155, 1948, 1215, 1732, 397, 21, 566].generative [166]. generator [1901].generators [1394].Generic [855, 1465, 1517, 1157, 1121].generics [1924]. genes [912].genetic [912, 694, 1932].

17

genome [1978, 1535, 1313]. genomes [1535].genomic [2377]. genus [1693].geodesic [220].geometric [1178, 2151, 949, 1211, 309].Geometrical [680, 2040, 1198, 2378].geometry [365, 486, 488, 1739, 1745, 405].geotomography [1775]. GF [263, 552].Giorgio [2319, 2320]. Girard [1076].girth [2365]. given [1799, 711, 167, 2364,474, 2145, 1118, 1915, 993, 1878].Glance [1951].Global [910, 1682, 645, 1417]. Go [449, 448].Godel [1514]. Goemans [598].Going [2392]. good [1627]. gossip [384].gossiping [1265, 46, 1488, 1104, 1303].GPs [768]. grafting [1886]. grained [59].graining [769]. grammar [19, 1355, 828].grammar-compressed [828].grammars [385, 583, 1905, 823, 2199, 1021,642, 585, 1393, 1565, 960, 1919, 166, 2080,170, 894, 1380, 1707, 235, 2, 1124, 2066].granularities [1034].Graph [1493, 366, 344, 835, 432, 2019, 2092,1407, 1615, 2158, 709, 364, 577, 792, 2368,71, 805, 638, 1486, 1566, 1934, 172, 1963,612, 420, 1913, 1621, 1614, 324, 648, 1659,2034, 2028, 1118, 796, 526, 1616, 81, 265,2155, 2393, 1911, 1132, 1309, 1097, 2091].graph-driven [792].Graphical [466, 1526, 2262, 689].graphs [1898, 1407, 2114, 48, 592, 1228,1178, 1848, 1819, 2331, 634, 1814, 1799, 1469,1623, 2399, 1173, 433, 434, 1828, 1412, 1229,2390, 805, 1805, 1295, 1988, 1560, 175, 1217,1558, 2313, 2353, 2352, 381, 1780, 280, 1507,1180, 1306, 628, 631, 1396, 775, 467, 436,1246, 1122, 2151, 1264, 2370, 1792, 437, 1499,2089, 971, 719, 1016, 1909, 1056, 525, 2333,945, 180, 269, 1917, 2394, 1638, 2005, 2357,1611, 439, 1060, 1817, 1415, 2106, 1487, 1555,215, 1564, 2254, 442, 2062, 527, 2317, 1569,1781, 2373, 974, 1120, 305, 829, 972, 1636,1333, 1307, 1893, 294].graphs [1570, 2256, 531, 1225, 1290, 726,

466, 1888, 2085, 2365, 1102, 1966, 2386, 2007,1786, 1213, 2095, 2027].Gravitational [1875]. Gray [1050, 1547].greater [1221]. greed [2383].greedoid [1979]. Greedy [76, 251, 1268].Green [365]. Greibach [1905].grid [1605, 1854, 1056].grids [1048, 525, 931]. Grobner [1880].grooming [2249, 1294, 1302]. gross [1140].ground [2108]. Group [1646, 441, 1980,953, 220, 2093, 1821, 1894, 2000, 1210, 2141].Group-strategyproof [1646].groups [713, 248, 1347, 349, 16, 736].Growth [237, 1088, 259]. growths [13].GTP [2195]. GTP-binding [2195].guaranteed [1621, 1896]. guarded [357].Guest [136, 1342]. guided [593, 1352, 22].

H [435, 321]. H-Coloring [435].Hadamard [1802, 532]. Hadwiger [1996].Haines [1358]. hairpin [1943]. Hajos [429].halt [2077]. halting [1521, 1121, 1944].Hamiltonian [1807, 269, 267].Hamiltonicity [1893].Hamming [1819, 1546, 177].handling [1276, 1492, 88]. Hanoi [955].haplotype [1153]. haplotyping [134].Harary [2095]. Hard [2258, 1407, 134, 1991,670, 80, 459, 1768, 1122, 1276, 2270, 2346,1374, 345, 1651, 38, 780, 626].Hardness [2341, 2249, 1058, 2352, 1299, 2107,1566, 1499, 1392, 413, 2054, 985, 1409, 1853].hardware [2323]. HasCasl [562, 2015].hash [817]. hashes [1511]. HASSE [213].Hausdorff [633]. having [1494, 13].HD [56]. HD-automata [56]. HD0L [13].HDTP [582]. Head [968]. heads [27].heart [1591]. Hedlund [2236, 1635].helix [132]. Hennessy [33, 604].Herbelin [1593].hereditary [971, 269, 545]. heritage [1593].Herman [468]. Hermite [1873].Heuristic [1802, 1630, 582, 2139].heuristic-driven [582].

18

heuristics [611, 1333]. Hex [445].hidden [1537, 1185].hierarchical [1797, 301, 2329].Hierarchies [542, 2201, 2204, 894, 120, 101,1746, 2235, 1866].Hierarchy [2182, 337, 1353, 1623, 2399, 34,520, 902, 118, 2080, 1317, 1705, 351].High [1783, 154, 156, 492].high-level [154, 156]. higher [94, 96, 620,1072, 1073, 2015, 923, 659, 665]. higher-order [94, 96, 620, 1072, 1073, 2015, 665].highly [601]. Higman [1358].histories [1800]. history [137].hitting [2312, 1917]. Hoare [1042].hoc [1666, 1664, 157, 1665, 1104].HOL [357]. Holant [1282]. hold [1740].holds [2170]. Hole [1299]. holes [2289].Holographic [2053]. holonomic [375, 2237].homeomorphism [1054].homogeneous [2105].homomorphism [1696].homomorphisms [535]. honeycomb [371].honor [1532, 2288]. honour [1585].Hop [1949, 1296, 312].Hopcroft [2163, 2296, 2125].Hopfield [324]. Horn [1006, 1641, 1032].Horspool [728]. hospitals [1627].hospitals/residents [1627]. hotlink [1268].Huffman [2263].Hybrid [1062, 2198, 593, 1162, 1424, 2194,140, 20, 2047, 281, 1727, 913, 1691].hybridization [88]. hyperball [1763].hyperbolic [1787, 1750].hypercomputation [1516, 687].hyperconcepts [810].hypercube [1325, 1224, 1114, 2142].hypercube-like [1224, 1114, 2142].hypercubes [2310, 1973, 257].hypergraph [45].hypergraphs [1248, 2140].hypermap [1693].hypermap-formalized [1693].hypersurfaces [729]. hypotheses [1403].Hypothesis [480].

I/O [2194]. ICALP [2303].icosahedral [2033]. ideal [1470, 2148].Idealized [1439]. ideals [1479].idempotency [976].identical [779, 1157, 1109].Identification [652, 1130, 1812, 2, 1124].identifying [2062].identities [1949, 1656, 1007].Identity [1397, 1863, 2355, 735, 1888, 1812,1145].Identity-based [1397, 2355, 1812, 1145].IEEE [503, 551]. iet [1629]. If [790].II [1424, 222, 1155, 2184]. im [1250].image [1775]. images [1771].imbalance [983]. immune [1683].immunity [383]. impact [2133].imperative [858, 868]. imperfect [522].implementation [1861, 499, 571].Implementing [502]. implements [1940].implication [853]. implications [1302, 431].Implicit [369]. implicitization [1106].Impossibility [1300].Improved [1130, 2074, 1988, 797, 249, 715,2075, 834, 2247, 985, 1636, 2114, 598, 812,1544, 255, 1429, 120, 1111, 2006].improvement [553, 2313].Improving [2002].Inapproximability [2096, 2146, 1993, 1780].including [132].inclusion [752, 2260, 282, 2395].incomparable [1606]. increase [1212].increased [1252]. increases [2069].increasing [1148].Incremental [1846, 824, 782, 860, 479, 449].Independence [801, 1515, 2325, 225, 735].independence-based [2325].Independent [545, 2370, 1314, 1781, 1993,531, 2085, 534]. index [40, 61, 91, 112, 125,144, 162, 183, 198, 221, 41, 493, 759, 786,760, 494, 761, 1799, 1918, 550].indexed [388, 1582]. indexes [1372].indicating [801]. individual [134].induce [1883].Induced [974, 1353, 1229, 381, 1415, 1824].

19

Induced-path [974].Inductive [409, 1575, 1574, 479].inductively [476]. inefficient [1172].Inequalities [261, 3, 402, 426].inequationally [1386]. inertia [1764].inexact [128, 1109].inexact-suffix-tree-based [128].inferable [1579, 476]. inference [1590, 903,1575, 1836, 1574, 479, 409, 1324, 1581].Inferring [815, 1392]. infinitary [2056, 891].Infinite [1208, 1196, 1390, 1353, 458, 2057,554, 2169, 1910, 464, 1791, 1987, 399, 1997,1633, 705, 2080, 1206, 203, 1275, 39].infinite-state [705, 39].infinite-valued [2057]. infinity [1694].inflationary [484]. Influence [993].Information [1532, 1748, 336, 355, 164, 292,2213, 964, 2325, 874, 1917, 1617, 348, 1743,1375, 1109, 614]. Ingo [2304, 2303].inheritance [1097]. inhibitors [1720].initial [2348, 1622]. initialization [1664].initiative [1417]. Injective [902, 745].innocence [901, 700].input [459, 954, 1896].input-queued [1896]. insecurity [193].insertion [1352, 585, 1565, 29, 2141].insights [1907]. inspired [1718, 1943].instability [1212].instances [1296, 1202, 178].institutions [1161].integer [792, 1763, 743, 1770, 373, 68, 963].integers [1457, 942]. integral [1773].integrands [503]. Integrated [2015].Integration [1676, 579, 708].integrity [1004]. intelligence [686].intelligent [515]. intensional [756].interaction [851, 488].interactions [513, 1711].Interactive [486, 1864, 1317, 1250].Interchange [2291]. intercluster [936].interconnection [1114, 2142].Interfaces [756, 1600].Interference [1688, 1666, 1954, 1665, 1509].interleaved [1171]. intermediate [2191].

Internal [2374, 1233, 960].International [32]. interpolating [331].Interpolation [2145, 1870, 2010].interpretation [857, 2326, 1686, 1511, 163,224, 99]. interpretations [192].interrupt [881]. Intersecting [1047].Intersection [615, 882, 1592, 1590, 1255,2117, 1781, 2373, 1591].intersection-closed [1255].intersections [1248]. Interval [110, 1520,1323, 505, 1217, 1542, 506, 1953, 1796, 1913,2124, 2317, 1569, 332, 1911, 1409].Interval-valued [1520]. intervals [812].intractability [177]. intrinsic [842].Introducing [1935]. introduction [396].intruders [1604]. intrusion [225].intuitionistic [1861, 1693, 688, 2327].Invariance [917]. invariant [1205, 796].invariants [868].Inverse [1546, 345, 1219, 1449].inverter [2004].Invertible [1284, 1010, 790].Investigating [2095]. Investigations [751].irrational [169, 1113, 2240].irreducible [115]. irredundant [1846].irrefutable [622]. irregular [1594].irrevocable [622]. Ising [320, 2031].isolated [714].Isolation [2385, 2239, 1879, 1478, 2340].isomorphic [986].isomorphism [805, 349, 1076].isoperimetrically [1774]. isotopic [872].isotropic [766]. Issue [2303, 334, 1442,1614, 1532, 2288, 326, 588, 93]. issues [1278].items [1900, 1147]. Itemset [1510].Iterated [933, 1448, 976, 16, 1119].Iteration [94, 174, 374, 1439, 1995].iterations [504]. iterative [2069].iterativity [1378].

Java [54, 1418, 915, 1600].job [2152, 2154, 2335, 1489, 2139, 542].jobs [806, 794, 2250, 2362, 2335, 1055, 1976,1014]. John [1081]. join [2377, 631].

20

joining [1784, 2084]. joint [2233].Jones [1043]. Jordan [1219]. Jug [1548].Juhani [2186]. jump [2003].juntas [1281, 2342, 2270]. Justified [669].

k-Partitioning [1045]. Karhumaki [2186].Katriel [1405]. Kayles [2088]. Kelly [1619].Kemeny [2314, 460]. Kemp [632].Kerberos [899]. Kernel [1754, 1865].kernelization [1965]. kernels [2068].key [1642, 1797, 911, 2355, 2000, 2141, 1145].keyboards [80]. KGS [1145].kinematics [1116]. KLAIM [664].KLAIM-based [664]. Kleene [1660].knapsack [693, 536]. kneading [181].knock [1495, 2020]. knock-out [1495, 2020].know [1532]. knowledge [897, 669, 670,1062, 1266, 1610, 847, 2009, 1134].Kolmogorov [616, 541, 1286, 735, 1275].Korteweg [77]. Kuba [1760].

L [394, 640, 711]. L-convex [394, 640].L-shape [711]. Label [941].labeled [1173, 1244, 543].labeling [2244, 1636]. labelings [440].Labelle [1851]. labelled [98].labelling [1151]. labels [1606].laceability [215, 1224]. Lambda [1587, 615,275, 1586, 1592, 1593, 1704, 1588, 861].lambda-terms [1704]. Lambek [678].landscape [1131]. Langevin [1838].Language [2206, 1093, 2191, 2040, 933, 1356,220, 663, 1374, 1085, 510, 13, 692, 1083, 1346,426, 1158, 727, 2080, 454, 2329, 918, 614].language-based [1374]. Languages [1316,976, 2222, 278, 2322, 1241, 245, 2228, 2038,385, 386, 70, 603, 244, 1253, 2245, 2057, 241,116, 2200, 71, 2201, 2117, 1924, 8, 642, 1231,1049, 643, 2361, 2204, 2149, 2343, 1236, 1007,238, 2175, 2344, 2077, 1791, 1357, 2176, 1413,2136, 692, 1927, 1406, 1347, 25, 854, 26, 165,119, 581, 1754, 1449, 2123, 1582, 652, 858,1359, 1073, 2229, 1539, 410, 1580, 379, 235,477, 1042, 1101, 2338, 476, 895, 1057, 2131].

Laplacian [1915].Large [2370, 818, 1781, 1436, 1793, 7, 1315,1396, 1647, 1817, 81, 203, 1333, 2365].Larger [1011].largest [381, 474, 87, 909, 789]. last [2169].latency [1968]. lateness [1226].Lattice [1048, 1886, 1766, 371, 911, 2237,1687]. lattice-based [911]. Lattices [2149].law [1436, 1499, 1817]. Lawson [1750, 681].Lawvere [885]. layered [414]. lazy [1072].LCS [1892, 2290]. lead [1741].Leader [667, 961, 723, 1385].Leading [1758]. leads [1139].leaf [2315, 986, 2395]. leaf-agreement [986].learnability [2342, 1580, 1344].learnable [477]. learners [2138].Learning [1281, 1753, 1345, 1253, 1255, 846,412, 1406, 1347, 1583, 1582, 410, 411, 845,2066, 1573, 448, 471, 473, 2069, 250, 2063,414, 2071, 1795, 324, 1285, 1346, 2065, 475,1754, 910, 2067, 478, 1755, 282, 1133, 1756,1757, 472, 2360, 408, 844, 842, 1532, 479].least [1256, 491]. left [251, 983, 627].left-arm [627]. left-right-imbalance [983].left-to-right [251]. Leiss [955].lemma [2104, 2289]. lemmata [1521].length [90, 218, 2201, 381, 1649, 1264, 1541,2299, 2362, 1810, 2264].length-constrained [1810]. lengths [219].Leontief [2047]. Leontief’s [1139].less [1512]. Letter [1206, 1086, 245, 2038,1494, 2169, 2176, 2182]. letters [2261, 1044].level [1783, 154, 156, 510, 815, 1042].level-1 [815]. levels [26]. Levi [2319, 2320].lexicalized [2229]. lexicographic [172].liberal [1029]. library [505]. Life [1011].light [1234]. lightweight [1951].like [181, 2027, 606, 1430, 646, 666, 1224,1114, 2142, 878]. limit [1011, 844].limited [168, 1310, 1406, 2080, 2004, 839].Limiting [2269]. limits [2178, 1440, 1679].line [1847, 167, 219, 467, 66, 73, 2145, 1825,1801, 528, 1804, 1046, 1504, 840, 1758, 1014].Linear [421, 389, 117, 269, 569, 2004, 2140,

21

2377, 1793, 71, 741, 1245, 2047, 2097, 1179,1029, 558, 1717, 474, 207, 1965, 382, 1909, 794,2250, 581, 827, 99, 2327, 2268, 1314, 285, 1876,680, 1375, 1288, 708, 627, 1225, 552, 1058].linear-Leontief [2047]. Linear-size [2004].Linear-time [269, 1909, 1314, 1288].linearization [275]. lines [1113, 2240].link [1807, 1212, 1970]. linking [915].links [1043]. lion [1620]. Lipschitz [1257].liquid [1999]. List [437, 945, 440, 364, 2238,1643, 1176, 1786]. lists [619, 758, 540].lit [1234]. lit-only [1234]. literals [2173].lived [1266]. liveness [1360].LMNtal [2329]. Load [783, 953].loading [1603]. Local [1607, 2027, 1200,2328, 611, 685, 2313, 2149, 645, 873, 852,1917, 1013, 195, 1129, 1078, 764].localization [314].Locally [419, 277, 1656, 2344, 1985].Locating [464, 102].location [837, 157, 1013, 2258, 1291, 782].Lof [1258]. log [2004]. log-depth [2004].logarithm [1967]. Logarithmic [2095].Logic [677, 614, 1038, 1419, 2056, 1861,1514, 698, 2324, 2012, 1077, 741, 274, 1032,1507, 1239, 747, 2078, 934, 1840, 2287, 604,991, 567, 666, 1676, 578, 290, 358, 917, 913,1691, 827, 675, 676, 1091, 621, 284, 478, 1040,159, 750, 304, 1387, 1329, 1042, 189, 1440,491, 516, 680, 152, 2329, 123, 1079, 319, 921].logical [920, 1963, 903, 1578, 1417, 1464,1508].logics [1237, 702, 704, 1376, 283, 645, 892,1182, 2224, 646, 150, 620, 569, 2327, 36, 1705].Long [1891, 1266, 1854, 1415, 427, 1102].Long-lived [1266]. long-range [427].long-term [1854]. longer [88].Longest [1148, 804, 966, 180, 1540, 2380,1810, 1983, 2155, 1970]. look [2324].lookahead [1847, 264, 2362]. Looking [529].Loop [1702, 711, 1214, 1203]. Losing [1165].loss [1978]. losslessness [1002].Low [937, 108, 1312, 439, 1042, 44, 1145].low-contention [108].

low-discrepancy [44]. low-level [1042].low-power [1145]. low-weight [1312].Lower [706, 1821, 792, 1272, 1544, 2090, 1372,1190, 2178, 1908, 75, 1818, 780, 710, 214, 428].lowest [1180]. LP [598, 780].LP-based [780]. LP-relaxation [598].LPT [462]. LTL [2193, 743, 329, 2281, 39].Lucas [364]. Ludics [486]. Lungo [363].Lyapunov [87].Lyndon [890, 1906, 2236, 1207].

M. [1585]. M2M [799].Machine [212, 1859, 2351, 806, 324, 217, 834,1226, 574, 1695, 794, 2250, 1630, 2154, 943,624, 1497, 1588, 2362, 390, 1055, 1489, 1568,839, 1976, 2139, 1012, 1046, 1504, 1944].Machine-based [212].machines [278, 455, 1778, 938, 1070, 154,1706, 2351, 1889, 732, 1183, 324, 1085, 217,14, 254, 2267, 690, 2134, 2094, 2259, 159, 798,1971, 539, 687, 1678, 1634, 1109, 2111, 77,1521, 1945, 2235, 968, 1865]. Magnus [1491].Main [1817]. Main-memory [1817].maintaining [2215]. Majority [123, 1131].Majority-based [123]. makespan [1646,1059, 1226, 2154, 2094, 1489, 1568].Making [670, 1479, 1150]. malicious [1954].malleable [779]. man [446, 1620].management [1642, 2000, 2141].Manhattan [1427]. manipulating [2284].manufacturing [83].Many [626, 1032, 1652].many-sorted [1032]. Map [1306, 1894].mappings [231]. maps [957, 1852, 1737].Marcus [894]. margin [474].marked [2343, 1202].Market [2047, 292, 1141, 1139].markets [1794, 833]. Markoff [2168].Markov [1436, 115, 327, 1332, 2031, 1537,768, 98]. Markovian [87, 360].Marriage [1220]. Martin [1258].Martingale [1624]. masked [1671, 967].Masking [2292]. mass [989].massive [1805].

22

Master [41, 760, 494, 761, 1838].matchgate [1282]. Matching [1828, 926,1543, 2379, 2162, 1897, 1850, 1229, 175, 388,73, 1413, 79, 2378, 548, 1856, 2022, 130,1399, 550, 728, 2142, 1533, 1830, 2308, 131].matchings [1627, 1888]. math [2304].Mathematical [2078, 287].Mathematics [479]. Matrices [1629, 1431,1010, 1869, 1765, 1767, 1802, 978, 1770, 87,647, 2241, 1106, 580, 1800, 1773].Matrix [2101, 1218, 1443, 2330, 437, 2276,909, 625, 231, 2308].matroid [1979, 2307, 1045].matroids [2309, 525, 1564]. matters [258].Maude [1928].max [555, 1546, 462, 1820, 598, 1122, 2110].MAX-BISECTION [1122].MAX-CUT [1122]. max-flow [555].MAX-MQ [2110]. Maximal [2057, 707,2293, 1816, 469, 1826, 2298, 204, 986, 2022,1399, 2181, 1804, 813, 531, 791, 1479].Maxime [2288]. maximize [1674, 2362].Maximizing [473, 450]. Maximum [2308,2105, 1054, 1117, 795, 2211, 2313, 797, 133,2330, 2001, 1310, 1226, 2357, 1611, 2347,1810, 1399, 1051, 1302, 1412, 980, 2374].maximum-sum [1810]. may [186, 1958].Mazurkiewicz [645, 655]. MCA [1133].McCarthy [35]. MCS [2087].Meadows [2016]. mean [1940].meaning [584]. means [3, 402, 1770].measure [8, 1403, 2229].measures [1237, 1370, 1619].Measuring [1577, 139, 223, 1620, 1548].mechanical [2240]. mechanism [2046, 921].mechanisms [2212, 1646, 2210, 1982, 2129,2049, 2051, 31, 2103]. mechanized [357].media [1603]. media-on-demand [1603].medial [1768]. Median [782, 1980].medians [1052]. Meet [2285, 1803, 1612].Meets [286]. Mem [1715].membership [1010, 1253, 1032, 942].Membrane [1713, 1939, 1019, 1712, 1038,1711, 1714, 1024, 992, 118, 1720, 1027].

membranes [1713, 1711]. memetic [2133].Memoriam [1760, 2304, 363]. memory [50,1953, 2306, 2303, 1190, 1056, 1817, 159].Memoryless [1677, 710]. Menger [218].merge [33]. Mergible [7]. merging [2246].Merkle [1009]. mesh [1267, 1014].mesh-based [1267].meshes [105, 1654, 1303].Message [698, 2277].Message-passing [698]. messages [2150].meta [903, 1041]. meta-logical [903].meta-theory [1041]. metabelian [16].metabolic [1023, 1722]. Metaphors [582].method [197, 255, 962, 1247, 1638, 714,1133, 1880, 817, 1881].methods [2055, 1924, 212, 1754, 1933].Metric [1742, 1653, 2120, 2347, 550, 936,1187]. metrical [258]. metrics [876].Michaux [208]. microscope [978].midbit [472]. middle [479]. Milner [604].min [2102, 555, 2179, 1546, 462, 1820, 85].min-cut [555]. min/max [2179].minded [182]. miniaturized [521].minima [2055]. Minimal [364, 1771, 796,1911, 2110, 2367, 1764, 824, 1135, 747, 934,721, 971, 1909, 2178, 1915, 2181, 2293, 2127].Minimality [1519]. minimax [453].Minimization [1302, 2163, 457, 56, 2230,81, 2125, 778]. minimize [806, 1059, 1226,2350, 2094, 2259, 1489, 1568].minimizes [766]. Minimizing [1665, 1666,1263, 2154, 624, 390, 1409].Minimum [1890, 2315, 1013, 773, 1234, 531,2312, 1308, 2309, 175, 1544, 1427, 249, 1768,1969, 423, 1322, 1304, 1981, 62, 1153, 1129,1222, 1227, 557, 819, 1907, 1605, 1058, 963].Minimum-cost [1890].minimum-degree [2309].Minimum-Energy [1605].minimum-entropy [423]. mining [791].minor [1054]. minority [2334].Mirror [1398]. mismatch [728].mismatches [2223, 1316]. mitotic [2086].mix [424].

23

Mixed [70, 1484, 2265, 1115, 2075, 143, 1733].mixed-signal [1733]. Mixing [1237, 1178].mixture [1343]. mixtures [2063].Mobile [2017, 2396, 1672, 665, 1950, 1239,1552, 485, 2024, 1668, 157, 1425, 512, 1597,904, 60, 1300, 1488]. mobility [1418].Mobius [725, 1654]. modal [2273, 283,1163, 739, 991, 514, 1440, 921].modalities [991]. mode [391].Model [753, 1239, 703, 333, 1594, 356, 447,2228, 2216, 2193, 944, 1332, 1168, 1232, 380,1978, 1164, 355, 1128, 1523, 1525, 2035, 1805,2195, 1462, 255, 927, 915, 420, 1925, 320,1718, 1511, 1374, 731, 2286, 488, 290, 1463,1727, 1731, 864, 2291, 1141, 859, 1838, 572,313, 287, 1779, 1268, 1959, 2281, 1928, 1238,941, 306, 1893, 122, 2009, 745, 497, 452].model-based [255]. modeled [264].Modeling [2194, 1739, 1099, 132, 1527,1465, 1837, 847, 1519, 1928, 1472].Modelling [1839, 1551, 276, 513, 2190, 2189,1352]. models [1436, 615, 1292, 1653, 577,1379, 34, 836, 1280, 1998, 164, 74, 2275, 2071,1719, 2031, 1737, 55, 1695, 1927, 2028, 1740,1423, 1156, 449, 1744, 855, 1845, 877, 1094,160, 1441, 840, 1944, 563]. modern [911].modification [2341]. modified [24, 2350].Modular [592, 1376, 190, 156, 1507, 1382].modules [1084, 868, 712]. moduli [1219].modulus [909]. Mogens [2271].molecular [1027]. molecules [369].moles [784]. moment [1764].momentary [259]. monadic [278, 1507,1069, 854, 491, 273, 1698]. monads [742].monitoring [1667]. monochromatic [1304].monoid [802].monoids [201, 1631, 800, 16, 1902, 535, 807].monomials [1111].Monotone [373, 471, 1778, 1855].monotonic [5, 2176, 1909, 1274].Monotonicity [1616, 1823, 930, 894].Moore [2302, 2232]. morphic [1997].Morphically [2099]. morphism [1912].morphisms [1629, 2166, 1448, 1090, 209,

1008, 1207, 16]. morphological [1596].Morse [90, 1414]. most [2171, 1559].most-request-first [1559].Mostowksi [2013]. motes [1954].Motif [1426, 1846, 2292].motifs [2165, 1534, 2298, 2181, 2293].motion [1517, 1938]. Move [1488].Move-optimal [1488]. movement [2396].Moves [2109]. Moving [528, 1470, 1667].MQ [2110]. MSC [48]. MSO [525, 2268].MSOL [1120]. MST [2309, 1296].MTLA [512]. mu [283]. mu-calculus [283].Muller [72]. Multi [1536, 806, 1465, 2070,1103, 547, 414, 389, 510, 2260, 913, 1691,1438, 727, 312, 2182, 378, 1923, 2087].multi- [547]. Multi-agent [806].multi-armed [2070]. Multi-break [1536].multi-cellular [1465].multi-covering [2260].multi-dimensional [378]. multi-hop [312].multi-layered [414]. multi-letter [2182].multi-level [510]. Multi-MCS [2087].multi-multiway [1103].multi-priced [1438].multi-qudit [913, 1691].multi-regular [727].multi-threaded [1923].multicast [947, 2388, 1642, 799, 1429].multicolored [1304]. multicoloring [773].Multicommodity [1174, 370, 555].multicounter [1889, 14].multicover [1485]. multicuts [956].multidimensional [1198, 368, 1172, 937].multihead [1889, 650]. multihop [1960].multilayer [993].Multimodal [750, 1380, 1707].multimorphisms [1641].Multiobjective [693]. multiparty [2060].multiperiodic [1359].Multiple [2063, 1444, 1313, 716, 1169, 1306,927, 889, 1913, 1727, 1347, 317, 2189].multiple-interval [1913]. multiples [263].multiplication [553, 792, 1128, 2308].multiplicative [1561, 680].

24

multiplicity [69]. multiplier [1544, 1474].multiprocessor [734, 167, 2336].multiprocessors [1374]. multirate [1015].multirecombination [765].Multiset [1021, 1462, 1626].multiset-based [1462].multisets [619, 758]. multitape [2169, 831].multithreaded [54, 190, 918].Multitree [100]. multivalued [564].multivariate [1870]. multiway [1103].mutable [868]. Mutation [320].mutations [766]. mutual [877].mutually [2284].

Nadia [1931]. Name [666, 665, 296].Name-passing [666, 665]. nano [1837].nanorobotic [2032]. Nanowire [1858].Narayana [377]. narrations [1421].narrowing [2321, 886]. Nash [2045, 1650,2048, 1484, 2209, 293, 2346, 2262, 2050].national [268]. natural [988, 1042, 836].naturally [1741]. navigability [2081].Navigable [2345]. navigation [1551].NC [340]. NCA [539]. near [1473, 1644].near-singular [1473].nearest [2138, 425, 2062, 1878, 2007].nearest-neighbor [425].nearly [1916, 1412, 972, 2007].nearly-Euclidean [2007]. nearness [1735].Necessary [2360, 401]. negation [2004].negation-limited [2004]. negations [2269].negative [2138]. negotiation [1553].Nei [962]. neighbor [2084, 425, 2062, 2007].neighborhood [1765].neighborhoods [1805]. Nerode [2223].nested [94, 2177, 2207, 1003].net [1154, 712].nets [1436, 662, 196, 1330, 851, 663, 324,744, 2286, 1512, 2014, 2278, 1697].network [1168, 1604, 711, 1785, 610, 2081,2346, 1665, 1677, 815, 1651, 1612, 909, 1618,1667, 1928, 963].networks [781, 2198, 1783, 288, 607, 544,608, 1149, 2137, 1663, 947, 1666, 1605, 20,

547, 1427, 1262, 133, 1664, 1784, 2345, 606,558, 1842, 1951, 1015, 310, 733, 2025, 421,311, 991, 799, 1265, 110, 1954, 157, 1562,1214, 324, 1298, 1968, 1299, 1782, 2023, 1212,2026, 1423, 2096, 427, 313, 2246, 1487, 1960,1224, 1864, 1942, 317, 1267, 994, 1136, 1429,904, 1114, 2142, 982, 1301, 609, 46, 1464, 599,611, 314, 1970, 997, 1104, 1682, 2105, 1527].neural [1330, 2119, 250, 991, 1025, 909, 317,1682, 1527, 2131]. News [1, 560].Newton [504, 714]. Newtonian [989].NFA [402, 7, 3, 1795, 2178].NFAs [1184, 2348]. Nielsen [2271].NL [616]. NL-printable [616].NLC [382, 1016]. NLC-width [382, 1016].no [33, 391, 1225]. node [1097, 2088].noise [1281]. noisy [1171, 2062, 1119].nominal [1672, 1701, 2013].Non [1552, 2086, 2325, 1286, 291, 1348,1210, 685, 1433, 342, 2031, 574, 911, 930,1518, 1771, 1090, 372, 910, 1616, 2237, 2269,477, 68, 2293, 1521, 1401, 1250, 1682].Non-asymptotic [1348].non-autonomous [1682].non-Boolean [68]. non-codeletable [1771].non-controllable [574].Non-cooperative [291].non-deletable [1771].non-deterministic [1616, 2269, 1521].non-erasing [1090]. non-gapped [2293].non-holonomic [2237].non-interactive [1250].non-learnable [477]. non-local [685].Non-mitotic [2086].non-monotonicity [930].non-parametrizability [342].non-quantum [911]. Non-reducible [1286].non-saturated [2031].non-standard [1401]. Non-strict [2325].Non-uniform [1552].Non-unique [1210, 1433].non-uniqueness [372]. non-unitary [1518].non-zero-approaching [910].nonblocking [547]. nonclairvoyant [803].

25

nondeterminism [318, 1092, 2221, 2229].Nondeterministic [2257, 1523, 2177, 616,2272, 639, 9, 290, 621, 30].nonidentical [2154].noninvertibility [1640].noninvertible [790]. nonlinear [1908].nonmonotonic [189]. nonnegative [87].nonparametric [735].Nonstochastic [1576].nonuniform [648, 121]. norm [783, 1544].Normal [749, 1025, 583, 1905, 823, 1110,1874, 1944]. Normalisation [96, 1591].normalization [1590, 1593]. note [2158,1826, 2363, 89, 2048, 718, 1204, 2154, 2028,960, 2134, 982, 2398, 996, 398, 2009].notions [843]. NP [1407, 1228, 1108, 1525,1566, 193, 1768, 1122, 2270, 970, 790, 2112,1831, 1801, 985, 678, 814, 780].NP-complete [1525, 2112, 1801, 678, 814].NP-completeness [1228, 1831].NP-hard [1407, 1768, 1122, 2270, 780].NP-hardness [1566]. NP-pairs [970].NRL [903]. nucleic [1933]. number [1948,1442, 2164, 19, 1975, 806, 205, 1355, 1792,1503, 2179, 1204, 1406, 1221, 774, 2362, 28,1158, 1302, 557, 1996, 1234, 1401, 1888, 82].numbers [1436, 1110, 2058, 417, 2020, 2168,169, 499, 436, 1871, 1659, 2251, 1628, 257,954, 377, 498, 500]. numeration [716].numerical [1840, 1881, 324].numerous [1157].

O [1846, 2194]. obfuscation [1570].object [1761, 1924, 301, 867, 864, 304, 1923].object-oriented [1924, 864, 304, 1923].objectives [1381]. objects [186, 1667, 59].obligatory [2356].Oblivious [250, 1552, 1815, 1425, 105, 1679].obliviousness [107]. observability [486].Observational [142, 1100].Observations [830]. obstacles [941].obstructions [1773]. Obtaining [973].Occurrences [533, 2171, 178, 801].occurring [557]. Ockham [1279].

octrees [811]. off [1009, 430].Offline [1620, 1500]. offspring [1278].offspring-producing [1278]. OJAn [1133].Oja’s [910]. Old [1712]. Olympus [1131].on-demand [1644]. On-line [66, 1804, 1046,1014, 1847, 219, 1825, 1504, 840, 1758].On-the-fly [2286, 329]. once [792, 706].One [336, 968, 2138, 201, 245, 2038, 50,2171, 9, 1889, 320, 1640, 254, 2130, 1134,347, 1685, 81, 2051, 1116].one-dimensional [320, 1116].one-letter [245, 2038]. one-pebble [254].one-reversal [1889]. One-shot [2138].one-sided [81].one-way [1640, 2130, 1134, 347, 1685].ones [1308, 2083].Online [785, 1796, 1788, 1059, 73, 1645, 2267,2362, 2350, 2094, 2259, 1432, 2235, 1498,2212, 812, 1485, 1232, 1295, 2351, 217, 803,1, 560, 816, 1405, 1971, 1012, 1109, 2111].only [1234]. onto [180, 535].Open [781, 1341, 1420, 1813, 188, 2124].open-shop [1813]. opened [97].Operational [1154, 2207, 1038, 604, 511,1386]. Operations [603, 2242, 245, 1450,1127, 2172, 1356, 2205, 2206, 2136, 752, 25,995, 1943, 2126, 1273].operators [569, 514, 807]. Opponent [452].Opponent-Model [452].opportunities [1794].optical [781, 218, 109, 122]. Optimal [1603,1332, 1009, 2396, 2025, 2306, 1372, 1214, 217,1518, 2215, 1438, 2062, 1005, 105, 1012, 1303,2141, 1169, 2257, 939, 2115, 929, 2255, 427,2000, 728, 1488, 1644, 1774, 1557, 431].Optimality [1375, 581].Optimally [2238, 727, 817].Optimization [1861, 1272, 597, 1641, 322,1499, 1364, 1170, 2307]. Optimizing [1642].optimum [1968]. oracle [633].Oracles [252, 1130, 1345, 2355].orbits [2161, 2104]. Orc [1680].order [94, 96, 741, 665, 2282, 1507, 1471,172, 620, 1072, 1555, 328, 1073, 296, 1439,

26

2281, 2015, 39, 294].Ordered [476, 541, 463, 1977, 2155].Ordering [189, 1550, 1405].orderings [1245, 1619, 252].orders [1107, 873, 426, 138, 2268, 2227].ordinal [1519, 843]. ordinary [1704].organizing [1952]. orientation [1060].oriented [1237, 1924, 1925, 1695, 864, 304,1923]. orthogonal [2310, 376].other [1646, 290, 692, 1248].out-branching [2315]. outline [304].outputs [2246]. Overlap [1987, 2241].Overlap-free [2241].Overlap-freeness [1987]. overlay [607].overloaded [1896].

P [990, 340, 1020, 2119, 1135, 1022, 1717,1023, 23, 11, 790, 318, 118, 692, 1025, 995,1722, 1624, 120, 1993, 1724, 2131].PA [1512]. PAC [1285, 1344].PAC-learnability [1344]. packed [1181].packet [1060, 1896].packing [2253, 2354, 1482, 795, 1900, 1884,1115, 1796, 2310, 1432, 1501]. PAFAS [139].page [1551]. Paging [1105, 2243].pair [1641, 1830]. paired [2353, 2352].paired-domination [2353, 2352].pairing [132]. Pairs [1502, 1916, 970, 1554].Pairwise [959]. Palindrome [1563].palindromes [1193, 533, 2382, 1983, 2180].Palindromic [240, 1196, 2183, 1398].palindromization [1894].pancake [215, 1893].Panconnectivity [1114, 1428, 1325].pancyclicity [1558, 1114, 1428].paper [1530]. papers [32, 1435, 1417].paradigmatic [1276]. Parallel [1330, 2250,1497, 1809, 2114, 938, 1907, 1495, 2020, 2152,695, 1355, 788, 1059, 1183, 1562, 1524, 746,1568, 1772, 539, 1976, 2111, 321, 2235, 866].parallel-batch [1976].Parallel-machine [2250, 1497].Parallelism [2069, 1135, 1024].parallelization [2325].

Parallelizing [2132]. parameter [2314].Parameterised [302, 1730].Parameterized [2342, 2389, 522, 2153, 527,526, 530, 591, 212, 521, 2087, 2143, 1913,2380, 2307, 1857, 2392]. parameters [1332].Parametric [1672, 1589, 1379, 1739, 478].parametricity [1386].parametrizability [342].parametrization [2133].parametrized [1378]. parentheses [929].Pareto [1150]. Parikh [1431, 2361].Parity [792, 1494, 706]. parses [1394].Parsing [246, 386].Part [1424, 1162, 385, 386, 534].Partial [1318, 459, 158, 584, 876, 956, 336,863, 1972, 1991, 873, 1987, 328, 1410, 514,2091, 2281, 562, 1109, 2227, 1422, 401].partially [1631, 1889, 541, 650, 463, 1957,1632, 1902]. participation [1674].particle [1116]. particles [2156].particular [2109]. partition [1979, 418,1148, 1217, 1304, 974, 462, 1045, 963].Partitioned [1560]. Partitioning [2333,1045, 2024, 1569, 1120, 1132].partitions [437, 1395]. partizan [78].partners [1169]. parts [2333]. pass [2063].passing [698, 665, 666]. password [551].password-based [551].Path [1305, 2035, 1732, 1294, 506, 1620, 106,630, 974, 1914, 1409, 267].path-connected [506]. pathology [453].Paths [1898, 1564, 2082, 2359, 1916, 1450,1649, 1263, 109, 959, 2088, 719, 524, 180,1389, 1611, 1415, 1810, 1790, 703, 972, 2358,1970, 1554, 1102, 2368].pathways [1719, 1463].Pattern [202, 647, 2180, 1830, 1257, 926,1256, 1542, 1547, 1815, 1413, 2378, 707, 130,727, 410, 1580, 1875, 477, 1581].patterns [1426, 2292, 638, 846, 128, 1891,1004, 463, 1587, 2124, 282, 129, 131, 791].payment [1982]. PCA [910]. PCP [1202].pebble [254]. pebbles [27].pebbling [1176]. Pedagogical [2282].

27

peer [607, 1948]. peer-to-peer [607, 1948].penalty [951, 1541]. asynchronous [1925].max [2179]. pencils [1218]. people [1532].PEPA [2190, 1719]. perceptron [993].percolation [609].perfect [2331, 175, 1888, 227].Perfectly [2039].Performance [47, 1237, 139, 746, 1928].Periodic [2356, 1047, 599].periodical [396]. Periodicity [2161, 743,399, 1448, 1458, 2289].periods [205, 546, 2184]. peripheral [1714].permutation [544, 1767, 2098, 2248].permutations [583, 1905, 1456, 1547, 424,347, 1679, 429]. Permuting [455].Personal [2320]. perspective [1653, 396].PEsort [932]. Petri [1697, 712, 196, 663,1154, 744, 2286, 1512, 2014, 2278].Phase [1424, 694, 626].phylogenetic [519, 133, 962, 986, 815, 814].phylogenies [1392]. phylogeny [522].Physical [1516, 1940]. physics [1514].pi [1599]. pi-calculus [1599]. Pict [1922].Picture [642, 164, 1061, 235, 895].Pictures [2040]. pigeonhole [1271, 2157].PIN [906]. PIOA [866]. Pipelined [1854].Pisa [2319]. Pisot [1194, 716]. pixel [939].plan [515]. planar [1852, 2396, 1173, 945,2391, 1570, 1309, 1225, 1290, 2365, 1786].planarity [634, 1526]. plane [1950, 1665,1787, 2237, 2156, 466, 1888].planning [1620, 1157]. plateau [2129].platform [1465]. player [2045, 78].player-specific [2045]. players [1119].Playing [1904]. plurality [176].point [1658, 2305, 1389, 1423, 490, 941, 491,1476]. point-shaped [941]. pointer [539].pointers [2284]. points [1848, 1763, 484,2093, 1172, 1938, 1090, 209, 729, 716, 1505].polarization [2327]. Polarized [300, 295].policies [528]. policy [1143]. Poly [216].Poly- [216]. polyforms [1774].polygon [1401]. polygonal [1162, 1424].polygons [1769, 600, 1389, 1288].

polygraphic [744]. Polyhedra [1693].polyhedral [2323, 1763].Polylogarithmic [1317].Polylogarithmic-round [1317].polymorphic [56, 1437].polymorphism [1379].Polynomial [134, 1169, 671, 2050, 2068, 2,1124, 1523, 1701, 846, 250, 1029, 1871, 739,935, 150, 2206, 718, 943, 1219, 475, 714, 568,1414, 1874, 2051, 679, 1878, 1477, 476, 1881].Polynomial-size [671].Polynomial-time [2, 1124, 568, 2051, 679].polynomially [332].Polynomials [1091, 1869, 2163, 1870, 2361,2145, 1872, 263, 1043, 778].Polyomino [1628, 1882].polyominoes [394, 640, 371, 376].Population [1689]. port [1659].portrait [1424, 2320]. poset [725, 981].posets [720, 2285]. positional [543].positioning [312].positions [1563, 2264, 448].Positive [379, 272, 1253, 1471, 412, 747, 766,1406, 2138, 1582, 1580, 1579, 2068, 476, 845,2, 1124, 2066]. possibility [1757, 1250].possible [1161, 474, 1067].possible-world [1067]. possibly [1910].post [2176]. postponed [516].potential [1551]. Power [726, 90, 1847, 248,2164, 757, 685, 2053, 2069, 1866, 695, 664,2121, 891, 1918, 1499, 663, 14, 1660, 27, 1817,454, 491, 323, 2397, 2395, 1557, 214, 1145].power-index [1918].power-law [1499, 1817]. powerful [2261].Powers [1201, 969, 2390, 1912, 2234].PP [398]. pre [1603, 1839].pre-buffering [1603]. pre-loading [1603].pre-rRNA [1839].Precedence [282, 2253, 1647].precision [77]. preclusion [2142].Predecessor [1328, 1530].predicate [593, 969, 2169, 747].Predictable [2202]. predicting [1258, 132].Prediction [413, 1933, 1283, 1758].

28

Prediction-hardness [413].predictions [840]. preemptive [217].Preface [1844, 315, 361, 415, 507, 613, 657,683, 696, 771, 820, 1241, 1292, 1269, 1336,1466, 1531, 1613, 1669, 1692, 1725, 1776,1843, 1946, 2043, 2079, 2113, 2135, 2160,2196, 2052, 407, 668, 658, 1167, 1337, 1759,1442, 635, 1868, 1921, 1192, 1270, 1835, 2197,2188, 353, 1146, 809, 1280, 1998, 1242, 18,1066, 495, 896, 1138, 1236, 416, 999, 888,879, 1602, 2303, 1468, 93, 200, 2073, 856,2219, 2061, 1177, 772, 2030, 2037, 1777, 4,335, 1260, 605, 145, 1350, 596, 1752, 508,1726, 2208, 832, 1670, 1037, 308, 1662, 42,1293, 104, 362, 2018, 1460, 113, 316, 684].Preface [908, 1126, 1327, 1522, 1681, 1709,1834, 1929, 2029, 2036, 2072, 2128, 2187, 925,482, 2044, 763, 2384, 53, 299, 862, 229, 849,1947, 588]. preferential [563].Prefix [1413, 1319, 2214, 654].Prefix-free [1413]. prefix-freeness [1319].prefixing [662]. preliminary [67].Presburger [1903]. Prescribed [2065].presence [919, 288, 1281, 2306, 619, 758,2189]. presentations [672, 744].preserving [1629, 822, 603, 2172, 83, 2227,1298]. presheaves [2274]. price [935, 1968].priced [1648, 1438]. pricing [1139].primal [1140]. primal-dual [1140].Prime [823, 2279, 971, 1089]. primes [1694].primitive [236, 649, 263, 2099, 845].primitivity [2172].principle [2275, 1908, 2157].principled [160].principles [1364, 1271, 1362, 1722].printable [616]. priorities [23].priority [455, 595, 542]. priors [841].prisms [1048]. Prisoner [1119].Private [2060]. Probabilistic [2272, 268,283, 1463, 357, 1556, 2254, 699, 1436, 661,338, 196, 1159, 1422, 1729, 1033, 2275, 2077,358, 1578, 571, 373, 568, 468, 1539, 1344,223, 1094, 49, 754, 2017].probabilities [327, 360, 728].

Probability [623, 1172, 2076].Probable [901].Probe [2331, 1560, 1433, 1175, 1186, 1210].probes [606]. problem [201, 176, 975, 288,2312, 1979, 1103, 955, 134, 1320, 795, 980,805, 1308, 1495, 2388, 1826, 1980, 979, 2309,2363, 268, 1217, 2305, 1975, 2087, 1780, 1296,1542, 401, 737, 715, 1620, 1276, 733, 948,111, 438, 950, 978, 370, 2176, 423, 564, 1990,13, 1540, 1013, 1904, 630, 1393, 165, 943,1185, 1611, 1449, 1808, 1322, 693, 1981, 1112,1153, 1546, 328, 2041, 2383, 1787, 2391, 537,1569, 1492, 1129, 966, 2083, 539, 2398, 1051,1992, 2374, 1809, 1302, 1227, 2139, 1132,1288, 1131, 710, 267, 1501, 1291, 2008, 1974,367, 1412, 401, 1402, 1121, 963, 2398].problems [1407, 1847, 1054, 2341, 1223, 1228,1328, 1530, 2101, 1443, 1149, 1814, 1485, 2389,171, 341, 1650, 1229, 1646, 1308, 1525, 8, 1714,1980, 961, 521, 836, 2353, 797, 597, 2330, 1641,467, 1115, 1620, 419, 1276, 173, 420, 1913,1484, 1220, 549, 837, 1647, 2315, 2310, 834,290, 269, 2258, 802, 1856, 1172, 1404, 2054,1832, 1304, 2124, 62, 2153, 527, 526, 2307,15, 2091, 1971, 454, 1093, 1249, 530, 1120,68, 2358, 1132, 1109, 2140, 942, 780, 1385,1822, 462, 1045, 536, 1290, 1823, 2105, 1213].procedure [193]. procedures [590, 2284].Process [140, 1862, 141, 137, 662, 300, 753,1461, 2195, 1276, 509, 360, 1537, 568, 579,1385].Processes [757, 1720, 327, 1420, 1031, 485,746, 1030, 1755, 38, 1958, 667, 39, 1278, 98].processing [1002, 167, 1059, 1190, 1645,1695, 2154, 1497, 1055, 1080].processing-oriented [1695].processor [111].processors [2198, 1498, 20, 1942, 994, 1136].producing [1278].product [958, 641, 836, 87, 1636, 1966].production [2042, 1141].products [709, 641, 1963, 263].Prof. [2304, 2288]. Professor [656, 1532].profile [1533]. program [1419, 740, 1029,

29

2325, 1676, 1176, 880, 1708, 2015].programmability [1690].programmable [2032].programming [2322, 1241, 2040, 2324, 1236,1925, 1926, 859, 284, 449, 750, 304, 68, 2329].programs [792, 1159, 2280, 1383, 1842,1335, 190, 2145, 706, 1072, 1895, 1801, 354,756, 296, 189, 121, 1923]. Progresses [2334].progressions [1454]. Progressive [788].project [1040]. projection [582, 2148].projections [1766, 928, 376].Projective [871]. prologue [562].prolongation [2148]. promoters [1720].Proof [857, 1335, 54, 1694, 850, 1496, 2257,741, 259, 1062, 2090, 2283, 890, 1693, 739,480, 970, 666, 2112, 206, 304, 1678].Proof-carrying [857]. proofs [671, 1098,675, 676, 1317, 1289, 565, 1591].properties [2242, 146, 753, 554, 2280, 164,1472, 1163, 940, 1553, 903, 852, 2104, 1448,254, 119, 2122, 581, 2285, 1156, 1360, 2373,538, 333]. Property [1543, 83, 1257, 1586,339, 2167, 280, 234, 1140, 1733, 736].Property-preserving [83]. proposed [551].propositional [1861, 850, 934, 618, 970, 921].Protean [2394].proteins [1713, 2195, 1714, 1939, 1721, 132].Protocol [903, 1421, 193, 1784, 551, 1145].protocols [897, 898, 1663, 95, 197, 900,1422, 50, 1953, 568, 905, 314].provably [1797]. provably-secure [1797].prove [506]. prover [331]. proving [2178].pruning [1886]. pruning-grafting [1886].pseudo [1975, 1331].pseudo-achromatic [1975].pseudo-boolean [1331].pseudoknots [1526]. pseudometric [49].pseudometrics [1741].Pseudopalindrome [807].PSPACE [2368, 290, 1520].PSPACE-completeness [2368, 290].PTAS [216, 2152, 2386, 778].PTAS-completeness [216]. public [911].Pure [2045, 37, 539]. purity [1100].

push [2309].Pushdown [1216, 1164, 1092, 2221, 1329].puzzles [290]. pyramids [1773].python [502].

Q [397, 63]. Q-convex [397, 63].QBDs [1238].quadratic [1964, 2363, 766, 1992, 1888].Quadrature [503]. qualitative [1860].quality [993]. quantified [1816].Quantifier [969, 621, 905].Quantifier-free [621].quantifiers [704, 187].Quantitative [355, 1236, 359, 916, 1241].quantities [801]. Quantization [686].Quantum [1934, 1575, 1359, 121, 325, 124,1130, 2074, 338, 244, 637, 2132, 2078, 1335,1690, 2075, 911, 2130, 1134, 347, 1518, 913,1691, 1185, 1026, 690, 1685, 2134, 686, 84,1329, 2182, 2375, 2076, 319]. quarter [2237].quartic [1766]. Quasi [2097, 1550, 1107,2361, 188, 426, 876, 1741, 1212].Quasi-linear [2097]. quasi-metrics [876].quasi-open [188]. quasi-ordering [1550].quasi-orders [1107, 426].quasi-polynomials [2361].quasi-pseudometrics [1741].Quasi-Static [1212].Quasiperiodic [1906, 1008].quasiseparable [1869]. qudit [913, 1691].queries [919, 1253, 147, 1806, 148, 1004, 620,413, 1346, 410, 982, 67, 1914, 2360].Query [1274, 1389, 1001, 336, 1002, 149, 150,1190, 1185, 1505]. Query-monotonic [1274].Query-point [1389]. querying [1951].question [1885, 955].question/answer [1885]. questions [1625].queued [1896]. queueing [1232].queues [455]. queuing [219, 1961].Quicksort [2109]. quiescent [787].quilted [2039]. Quorum [990].quotient [1747]. quotient-universal [1747].

r.e [2065]. Rabin [257]. radiian [1822].

30

radio [288, 1262, 1664, 558, 799, 1265, 1782,107, 1104]. radius [962, 1915, 1822].Rainer [632]. Rambo [1266].Random [1319, 397, 21, 1792, 1178, 1948,1215, 1173, 1978, 1021, 1296, 2345, 1502, 436,1246, 2151, 2370, 1962, 1240, 1258, 1917,2355, 1986, 928, 373, 1811, 1189, 1781, 2373,984, 1333, 2256]. randomised [2137].randomization [107]. Randomized [1112,1129, 1485, 458, 1784, 2217, 14, 2357, 1312,1648, 143, 1858, 65, 1333, 2064].randomized-contact [1858].randomness [253]. Range [558, 288, 1586,427, 67, 314, 332, 2006, 2103].range-efficient [2006]. range-free [314].Rank [2300, 1371, 2367, 1793, 1245, 2090,737, 2276, 1372, 2299, 1399, 2157].rank-maximal [1399].Rank/select [2300, 2299].Ranking [1117, 2394]. rankings [2314].Ranks [1060]. Raphson [504].Rapid [2026]. rate [1461, 910].rates [461, 2031].ratio [1088, 1549, 555, 462, 2110].Rational [1902, 1631, 1245, 1088, 1231, 69,1877, 954, 2126, 1679].Rationality [725, 1139]. Rauzy [2158, 378].rays [63]. razor [1279]. RBIBDs [817].rCOS [867]. re [1630, 307].re-entrant [1630]. re-use [307].reachability [327, 1553, 1438, 886, 1339,1162]. reachable [256].reaction [1084, 1935, 102, 1682].reaction-diffusion [1682].Reactive [2274, 300, 1576, 1757, 712].Reactors [1925]. read [792, 706].Read&Modify&Write [108].read-once [792, 706]. ready [1030].ready-tree [1030]. Real [1871, 2058, 417,502, 499, 1098, 1374, 1221, 2148, 354, 909,1158, 1959, 44, 1879, 1478, 498, 500, 1928].real-number [1158].real-time [1098, 1374, 354, 1959, 1928].Realizability [48]. realizes [711].

RealLife [1011]. reals [969, 1319, 2367].Rearrangeability [544].rearrangeable [1015].rearrangement [2297, 1978, 2291, 1535,1313]. rearrangements [1536].reasonable [1588]. Reasoning [1159, 934,57, 688, 1078, 411, 152, 921, 868].reciprocal [1875]. recognisable [802].recognition [2092, 1850, 1875, 1452, 386].recognizability [280, 238, 1165].recognizable [2228, 2077, 1061].recognizing [244]. recombinant [1153].recombination [22, 320].Reconciling [380]. reconfigurable [142].reconstructed [369].Reconstruction [1765, 1766, 376, 1626,2256, 872, 1767, 640, 962, 522, 1775].records [619, 758]. recover [1958].rectangles [1753].Rectangular [1882, 2039, 1770].rectilinear [600]. recurrence [2234].recurrences [532]. recurrent [1196, 317].recursion [1039].recursive [592, 417, 1706, 147, 324, 1574, 409,1582, 880, 1708, 1428, 2284, 2085, 1573, 1517].Recursively [1187]. Redei [736].reduced [1942]. reducibilities [336, 1746].Reducibility [638, 351]. reducible [1286].Reducing [1399]. Reduction [370, 3, 402,2283, 509, 1943, 831, 405].Reductions [1855, 629, 1274, 83].Reeb [1469]. Reed [1171]. Rees [1470, 625].reference [860, 2009]. Referential [676].Refined [1123]. Refinement [586, 863, 867,512, 517, 1384, 161, 59, 1375].refinements [1927]. reflected [675].Reflection [1032]. reflections [1362].Reflective [1574]. reflexive [116].reformulation [148]. refutations [523].regarding [955, 1625]. regex [2117].regimes [1838]. region [2396].regions [1472]. register [1801].regression [1729].Regular [6, 241, 2042, 1449, 426, 2222, 245,

31

1728, 603, 244, 1897, 1650, 116, 753, 1566,2117, 846, 3, 402, 1354, 1471, 2343, 1396, 1246,2370, 238, 1374, 2206, 973, 1413, 2136, 25,727, 1625, 1539, 1451, 1360, 1914, 1290, 1057].regularity [2095, 38, 195].regularized [1256].Regulated [1352, 2221, 31].regulation [2193]. regulatory [1464].rejection [1482, 2152, 1568]. relabel [2309].related [1778, 2389, 171, 1650, 1308, 2168, 8,961, 2330, 2315, 392, 1393, 1248, 309].Relating [1719].Relation [2234, 2012, 1639, 789, 411].Relational [1408, 1079, 1737, 564, 282, 1003].relations [1368, 1490, 1088, 1231, 749, 1069,1789, 194, 281, 392, 571, 2240, 1508].relationship [1002, 979, 382, 780].relative [2243]. relator [201].relaxation [598]. relaxations [1872].relays [2215].release [2253, 1813, 390, 1489, 1568, 1432].reliability [110, 26]. reliable [218].remarks [2174]. remote [948].renaming [2021].rendezvous [1606, 628, 2100].renewal [2147].Reoptimization [2218, 2107].repairman [1, 560]. repeats [804, 1804].repetition [237, 1825, 346, 1206].repetition-free [237, 1206].Repetitions [2369, 2161, 204, 1454].reporter [2034]. reporting [469, 1826].representable [1108].Representation [639, 1351, 35, 1736, 406,929, 689]. representations [1852, 26, 2028,1034, 2181, 767, 2293].representatives [1000].represented [1477].representing [474, 2226, 991].request [1559, 1500]. required [2104].requirements [1013]. residents [1627].resilient [2306]. resolution [671, 1566,2326, 523, 2112, 1289, 1348].resolution-based [2326]. resolved [2053].

Resource [701, 348, 383, 82, 951, 795, 1673,734, 549, 1403, 265].resource-bounded [1403].Resource-sharing [82].Resources [1078, 1419, 665, 83].respect [1446]. Responsiveness [1862].Restarting [826, 930, 894]. restarts [1059].restricted [1016, 706, 1895, 826, 703, 905, 68].restriction [742]. restrictions [1799].result [922, 321]. Results [263, 2114, 1228,115, 456, 1164, 1805, 2352, 1780, 1853, 1299,995, 2054, 994, 1136, 768, 67, 1385].retrospective [2324].Reversal [1052, 1655, 9, 1889, 360].reversal-bounded [9].Reversals [1193, 2214]. reverse [391].Reversibilities [1329].Reversible [1529, 404, 2344, 2077, 1902, 123].review [237]. Revising [1254].Revision [622, 515]. revisited [2321, 1001,1922, 1318, 1851, 1341, 435, 977, 901, 1075,1655, 348, 1453, 1371, 1748, 1591].rewards [1237]. rewrite [753, 755, 2108].Rewriting [919, 1004, 120, 1038, 1352, 1002,642, 1032, 1107, 903, 1040, 1702, 1579, 235,31]. rewriting-based [903].rewritten [1687]. Reynolds [1081, 1076].Rho [2195]. Rich [1827, 2167, 1285].richness [2183]. right [1123, 251, 983, 627].right-arm [1123, 627].ring [1668, 1397, 1425, 1957].rings [1475, 667, 1302]. Rivas [1526].Rivest [387]. RMI [1418].RNA [1352, 927, 1526, 130, 1411, 131].robber [1617]. Roberts [961]. robot [1607].robotic [2363, 1992]. robots [1950, 1552,2024, 168, 1815, 1425, 1300].Robust [1948, 1956, 280, 384, 2378, 265].Robustness [2287, 1462, 2217, 549].Rocca [1585]. Role [1598, 438, 1617].Role-based [1598]. rollback [1176].Ronchi [1585]. Roommates [1220].root [954, 1879, 1478]. rooted [815].roots [2122, 814]. rotation [1123, 2378].

32

rotations [926, 1321, 1197, 388, 627].round [1317]. rounding [1427].roundings [44]. route [1288].routing [1847, 218, 1949, 1232, 2211, 2388,547, 1143, 1484, 2213, 109, 2209, 110, 1214,106, 1060, 427, 1779, 105, 309, 1409].routings [1429]. row [1311]. rows [394].rRNA [1839]. RRWW [2229].RRWW-automata [2229]. RSA [1397].rule [1200, 2284, 1820]. rules [1335, 15, 745].run [1541, 2299, 2264].run-length [1541, 2299, 2264].runs [373, 1652]. runtime [155, 2217, 1689].

S [2324]. S-semantics [2324]. S. [1585].S4 [1380, 1707]. SA [115].Safe [1958, 1620, 864]. safely [1071].safety [1393]. SAIL [1532]. Saitou [962].same [1494]. sample [932].Sampling [2055, 1792, 2060, 408].Sand [2266, 1209]. sandpiles [1209, 964].sandwich [1213]. SAT [598, 1502, 992, 178,1731, 1026, 1811, 1733].SAT-assignments [1502].SAT-based [1731, 1733]. Satgraphs [534].satisfaction [419, 2258, 2054, 431].satisfiability [1510, 2173, 1811, 68, 428, 86].saturated [2274, 2031]. say [1940].Scala [1926]. Scalable [609]. scalar [1010].Scale [310, 2317]. Scale-free [310].scaled [436]. scaling [2316, 2378].scan [2105]. Scanning [1770].scattered [1245, 1919, 1394, 2080].scenarios [731, 2014]. Schedulability [595].scheduler [1644]. schedules [1813, 803].Scheduling [594, 951, 1674, 794, 2336, 2335,1055, 781, 1778, 938, 1498, 2212, 1646, 2152,734, 2363, 167, 806, 866, 779, 732, 549, 1059,2146, 1183, 1647, 834, 1226, 1559, 1645, 2049,1556, 2250, 1497, 2267, 2362, 2350, 2094,2259, 1489, 1568, 528, 1492, 1971, 1976, 1992,2356, 1896, 2139, 1109, 1046, 1504, 2111, 780,1014, 82, 2103, 2235, 542]. schemas [1029].scheme [2354, 1482, 1017, 943, 1312, 1567,

1967]. schemes [94, 939, 1797, 715, 1553,732, 1982, 2081, 345, 1821, 106, 2394, 1151,390, 880, 1708, 1249, 1409, 536, 1812].Schroder [377]. Schur [1876].Schutzenberger [116, 890, 1660].Sci [1530, 2399, 402, 1691, 560, 1136, 1708,2397, 1124, 923]. Science [286, 1435, 1746].sciences [988]. scientific [632]. score [448].sealing [1074]. search [1001, 1332, 741,1794, 452, 733, 204, 1677, 1056, 210, 425,983, 1500, 1152, 1129, 453, 629, 609, 1333,1132, 767, 764, 1823, 1299].search-tree [1001]. searches [1486, 2232].Searching [2382, 1615, 1368, 981, 785, 2306,1621, 1614, 1616, 2019].second [2282, 1507, 296, 1076].second-order [2282, 1507, 296].secondary [1933, 1526, 130, 1411, 131].secrecy [1145]. secret [1298].Secrets [1422]. sector [436]. secure [865,1642, 1797, 1821, 2355, 159, 1949].Securing [859]. Security [1675, 551, 897,197, 900, 222, 1676, 904, 905]. Seeing [1651].seeking [764]. segment [1505].Segmental [463]. segments [1810].select [1372, 2300, 2299, 1371, 387].Selected [32, 271, 1435, 1233].selected-internal [1233].Selecting [452, 2330].selection [1433, 1112, 1249, 1259, 1210].Selective [1386].Self [1049, 1668, 1446, 1111, 2040, 1716, 1952,1610, 2031, 1956, 1937, 1941, 2022, 468, 1952].self-assembling [1937].Self-assembly [1049, 2040, 1716, 2031, 1941].Self-deployment [1668]. Self-dual [1446].Self-improved [1111].self-organizing [1952].self-stabilizing [1610, 1956, 2022, 468, 1952].Selfish [422, 288, 938, 1484, 2209, 2049, 1779].Semantic [755, 1599, 303, 55, 1417, 356,1420, 2010, 1003].Semantics [1158, 515, 1038, 1528, 226, 2274,757, 156, 2324, 1421, 1077, 900, 1461, 2326,

33

1595, 1161, 149, 1069, 604, 163, 1154, 884,1067, 1859, 186, 99, 295, 1864, 328, 1030,1040, 271, 1042, 51, 562, 273, 680, 1386, 1680].Semenov [1445].Semi [1498, 2351, 167, 1733, 1109, 2274, 420,217, 15, 1971, 1977, 1333, 1012].semi- [2274]. Semi-formal [1733].Semi-on-line [167]. Semi-online [1498, 2351, 1109, 217, 1971, 1012].semi-ordered [1977]. semi-random [1333].semi-streaming [420]. semi-Thue [15].semiautomata [639, 2202].semidefinite [2068]. semigroup [12].semigroups [2349, 1656, 949, 573, 625, 535].semimeasures [1258]. Seminormal [1475].semiretract [950]. semiring [1696].semirings [400, 359, 580].Semisimple [2367]. semistructured [1305].sense [547]. sensing [990, 1664].sensitive [339, 1070, 692].sensitivity [1622, 1287].sensor [1783, 1663, 1666, 1951, 310, 311,2023, 313, 1487, 1667, 1928, 982, 314].sensors [2396, 1668, 1954].sentences [852, 1394]. separability [1231].Separable [360]. Separating [2071].Separation [1340, 2251, 1077, 526, 516,1385, 1079]. separations [1403, 1820].separator [980]. separators [1412, 294].Sequence [2277, 2161, 2168, 1500, 1810, 44,2155, 191].Sequences [207, 724, 2292, 181, 2115, 912,2298, 1989, 2300, 1909, 1258, 967, 1474, 689,2004, 1625, 2233, 1044, 1398, 88, 627, 552].Sequencing [88]. Sequential [1907, 1884,388, 2179, 1524, 653, 297, 539, 408, 1006, 933,1159, 690, 2134, 1158]. serial [1562, 735].series [1631, 757, 891, 1840, 1660, 213, 893,375, 1061, 735]. server [1847, 1232, 948].service [1951, 1890, 157].services [226, 264]. session [918].sessions [1924]. SET [85, 1412, 2260, 546,2312, 1653, 1320, 1485, 2218, 2102, 1308,1988, 50, 1969, 506, 1882, 2248, 2021, 1955,

423, 815, 1808, 2391, 1700, 1576, 1300, 530,2398, 878, 1227, 1259, 1749, 191, 1974, 980].set-agreement [1955]. set-up [1653].set-valued [2248].sets [616, 1762, 1991, 1323, 1764, 397, 1766,1245, 256, 280, 63, 889, 2370, 2270, 2025,541, 396, 2013, 2086, 1358, 619, 758, 722,1203, 501, 2357, 1771, 1960, 2254, 1267, 796,703, 265, 1781, 76, 16, 1307, 942, 531, 2127].Setting [1659, 1627, 1578]. setups [1961].Severe [622]. shape [1469, 711, 1768].shaped [941]. shared [83, 1923].shared-variable [1923].Sharing [947, 1646, 2325, 868, 82].shelf [536]. Sherali [2090].Shewchuk [1851]. shift [337, 2301, 1276].shifts [337, 2338]. shop [1813, 1630].Short [218, 1967, 523, 1406, 1225, 1786].shorter [973]. Shortest [2263, 1916, 2055,1263, 959, 106, 1389, 2383, 972, 1409].shortest-path [106]. shot [2138, 2051].shrinking [1901].Shuffle [1450, 2245, 1107, 64].shuffles [260, 1208]. Shyr [2337]. sided [81].Sierpinski [1941].Signal [847, 1875, 305, 1733].signalling [1999, 1719]. signals [2287].signature [1567, 1967].signatures [1255, 977, 1397]. signed [2114].signing [898]. signs [2265]. similar [608].Similarity [563, 2120, 1829, 1541].Simple [1456, 2175, 424, 823, 1087, 2313,1017, 2129, 929, 1203, 1331, 2250, 1312, 1389,1721, 1524, 1567, 1333, 1288, 535, 1689, 2,1124, 2066, 623]. simpler [1115, 1363].simplex [778]. Simplicial [2390].simplicity [383]. simplification [1997].Simplifying [520]. simulate [1842].simulated [912, 1331]. Simulating [1889].Simulation [194, 2191, 2194, 1837, 161, 98].simulations [606]. simultaneous [2083].Single [1909, 106, 1489, 1976, 806, 421, 834,182, 794, 1968, 2154, 943, 624, 1055, 1046,1504]. Single-edge [1909].

34

single-minded [182]. singular [1473].singularities [714]. singularity [503].singularization [1455]. site [1850].six [2171]. size [2198, 2302, 244, 1765, 2201,671, 20, 1181, 1358, 2206, 718, 1184, 2178,1986, 1060, 2004, 831, 266, 1818, 1289, 1689].sizes [2154, 2336]. SJF [734].Skew [891, 909, 1636]. skip [540].Slicing [307, 740, 720, 2005].sliding [290, 1984]. sliding-block [290].slopes [1113, 2240]. slow [1755].Small [2216, 244, 798, 80, 1022, 612, 1871,523, 1365, 1535, 1942, 1504, 1818, 1945, 2345].small-world [612, 2345].smallest [474, 789].Smooth [262, 1494, 554].Smoothed [1152, 1150, 258]. snake [2039].snapshots [2281]. SNP [2179]. social [935].sofic [243, 337, 636, 2301]. Soft [1696].Software [1435, 57, 2323, 1731].Soittola [1496]. solar [2316].Solitaire [2372]. Solitar [220].Solomon [1171].solution [992, 1402, 880, 1708, 2091, 77, 367].solutions [788, 1023, 2255, 426, 1811, 1058].solvability [559]. solvable [332].solve [459, 1026]. Solving [1793, 1525, 445,1657, 972, 1717, 1276, 1840, 1874, 1384].Some [637, 456, 1217, 2172, 401, 2174, 254,768, 1579, 644, 2242, 1054, 1228, 1762, 364,244, 1198, 365, 1355, 2031, 790, 1596, 25,843, 1359, 1625, 1094, 67, 31, 1620].SONET [457, 1302]. sort [932].Sorted [585, 1032]. sorting [1964, 2214,2306, 2002, 1365, 1366, 2246].SOS [1872, 1041]. Sound [1511].source [421, 1013]. Space [1031, 204, 989,355, 1272, 253, 509, 254, 1365, 1740, 1741,2231, 1314, 1809, 121, 1132, 1750, 1409].Space-aware [1031]. space-bounded [121].spaces [1737, 1738, 916, 1742, 2236, 496,1744, 601, 2007, 1187, 873]. spanner [173].Spanners [1264, 2216, 381, 1608].Spanning [2374, 1985, 1312, 1981, 1224,

1546, 1129, 611, 2085].sparse [381, 1231, 1870, 643, 2361, 1608,1792, 1172, 1817, 1872, 580, 1333].Spatial [1673, 704, 874, 666, 569, 36].Spatial-behavioral [1673].Special [334, 2303, 1532, 326, 1442, 837, 974,1614, 588, 93, 2288]. species [380, 986].specific [2045]. Specification [512, 571,1237, 2016, 301, 579, 2015, 306].specifications [900, 2287, 509, 510, 705].specified [1883]. spectra [2241].spectral [1915, 2007]. spectrum [1745].Speed [2316, 748, 497]. spike [2179].spiking [1330, 2119, 1025, 1527, 2131].splicing [241, 116, 2343, 691, 1334, 1942,994, 1136]. split [1057]. splittable [952].Splitting [1071]. sponsored [1794].Spreading [2150, 1607].square [1563, 2261, 816, 1303].square-free [1563, 2261].squares [1256, 1204, 2264, 1877, 203, 1545].SRPT [734]. st [671, 1857].Stability [497, 317].stabilization [1880, 1944].stabilizers [2174, 1633].stabilizing [1952, 1610, 1956, 2022, 468].Stable [1412, 1874, 1169, 920, 1627, 1986,297, 980, 1220]. Stackelberg [1968].stage [1015, 1856, 2294]. stagnation [259].stale [2213]. stamps [655]. standard [2162,216, 1511, 1201, 261, 1207, 1401, 1240].star [1558, 1446, 180, 215, 2393, 1970].star-duality [1446]. stars [529].start [1559]. start-up [1559].starting [504]. State [2201, 2121, 509, 2136,25, 2126, 1865, 1273, 154, 461, 1706, 1033,2078, 2205, 2075, 1357, 1085, 973, 2177, 360,358, 574, 2226, 1512, 2123, 705, 170, 195,159, 868, 1344, 2207, 1733, 39].state-alternating [170].State-complexity [2201].state-extended [1512]. stateless [883].statements [1740].states [7, 11, 2348, 1744].

35

Static [1741, 449, 2192, 36, 1212].stationary [1755].Statistical [1134, 2104, 847].statistics [2248, 647, 2105]. steady [1733].Steiner [2218, 1780, 1233, 1400, 2008].stepped [1195, 1200]. STG [1384].Stochastic [2189, 1343, 2191, 1841, 1239,1856, 2334, 844]. Stone [1736, 708].stop [1967]. storage [1017].straight [2145, 1801].straight-line [2145, 1801]. strands [2034].Strassen [43]. Strategic [1901].Strategies [590, 592, 765, 547, 1986, 2215,1758]. strategy [446, 767].strategyproof [1646]. stratification [285].stream [1805, 574, 1695, 305].streaming [2216, 2063, 420, 1190].streams [1147]. strength [37].stretch [2216, 734, 1263].Strict [1941, 1395, 1201, 2325, 392].strictly [272, 2268]. strictness [1386].strikes [1105].String [1532, 1351, 2379, 1846, 2295, 2162, 79,548, 2264, 550, 728, 2181, 1652, 2293, 2009].string-matching [2162].strings [364, 2263, 2369, 1049, 1017, 1541,1073, 966, 1538, 2289]. Strip [2253].Strong [1157, 257, 1590, 2283, 1593, 1640].Strongly [2051, 790, 1960, 297, 1121, 1213].Structural [146, 1903, 404, 2165, 927, 604,1723, 152, 1386].Structure [293, 565, 2322, 458, 1623, 2399,116, 1806, 1933, 643, 1142, 2209, 1737, 2112,1382, 130, 1073, 829, 1411, 2395, 131].structured [1368, 1793, 1020, 1029, 324].Structures [1435, 1163, 1175, 1526, 2033,1370, 2034, 2299, 878, 699, 2141, 2278].structuring [741]. student [1081].students [230].study [662, 2013, 2391, 2334].Sturmian [208, 232, 2162, 2168, 233, 1199,2296, 533, 1008, 2234, 261, 1207, 378, 644,1827]. stuttering [917]. sub [417, 2330].sub-matrix [2330]. subadditive [837].

subclass [846]. subclasses [1228, 241, 2353].subdivided [873]. subdivision [1981].subdivision-constrained [1981].subexponential [458].subgraph [1054, 1650, 1229, 1304].subgraphs [2027, 2089, 1312, 2239, 1824,611]. subgroup [1185]. subject [2267].Subjective [1143]. Subjective-cost [1143].sublanguages [1583].sublinear [2354, 1222].sublinear-time [2354].Sublogarithmic [352, 254].submodularity [1641].submonoids [654, 1451, 535]. subnet [83].subregular [2200]. subregularly [2204].subsequence [2295, 1887, 1540, 2380, 966,2155, 266]. subsequences [1148].subset [1249, 1809]. subset-sum [1809].subsets [1323, 523, 496, 1902].subshifts [1445, 2226]. subspace [1755].subspace-learning [1755].substitutability [1140].substitution [940, 2013, 2261, 516].substitutions [1195, 96, 1200, 2093, 1398,378]. substrings [1983].substructures [1456]. Subthreshold [764].Subthreshold-seeking [764]. subtle [1534].subtrees [986, 789, 946].subtyping [1599, 677].Subword [1800, 2093, 1414, 2233, 829, 801].subwords [231]. successive [2055].successors [2268].Succinct [1852, 26, 1175, 430].succinctly [1368]. suffice [421].sufficient [23, 372, 2360, 1309].Suffix [2298, 128, 2223, 2381, 2136, 548,1365, 1366, 2231, 1314, 1804, 829, 1538].suffix-free [2136]. suffixes [1846].suites [1729].sum [1112, 1810, 1546, 773, 1877, 1809, 673].sum-type [1546]. summaries [2068].summary [1324]. sums [1117, 797].super [215]. supercover [1761].superlinear [345].

36

superpolynomial [2368].superstring [2383]. supertrees [789].supply [836]. support [1986, 1477].surface [872, 369, 1772, 2393].surface-thinning [1772].surfaces [1195, 1472, 1200, 1473, 1477].survey [171, 322, 114, 1582, 1535, 1529,1533, 1945, 1573]. survivable [2096].suspicious [1954]. Swapping [1263].swaps [1313]. swarm [2024]. Swept [1472].Switched [866]. switches [1896].switching [219]. symbol [2155].symbol-wise [2155]. symbolic [1197, 197,164, 968, 1511, 571, 2338, 886].symbolic-probabilistic [571].symbols [826].symmetric [1561, 1593, 1549, 1287].symmetries [2158]. Symmetrized [1457].symmetry [371, 2033, 348, 694, 1132].symport [692]. symport/antiport [692].Synapses [1841]. synchronisation [902].Synchronization [648, 1353, 1179].synchronizations [1672].Synchronized [260, 2199, 166].Synchronizing [5, 1086, 713, 2227, 2263,1462, 727]. synchronous [701, 1340, 1088,1925, 1301, 895]. synchronous/asynchronous [1925].synopses [1176, 1005].Syntactic [487, 1070, 1509, 535].Syntax [295, 562, 2225].syntax-directed [2225].Synthesis [913, 1691, 1839].system [54, 154, 912, 660, 2090, 1595, 903,1059, 1863, 1676, 1940, 1958, 1874, 82, 921].systematic [10].systems [593, 1465, 661, 1038, 1162, 1424,2056, 1948, 2323, 2191, 1328, 1530, 591, 636,989, 2273, 1732, 140, 990, 2257, 2274, 19,185, 1793, 753, 1841, 1713, 142, 1020, 1673,1730, 1711, 1062, 1714, 2119, 642, 1135, 2190,1607, 139, 1022, 695, 2171, 1355, 2343, 1430,1717, 1084, 1935, 1871, 1686, 595, 2059, 1023,23, 11, 1098, 1936, 1374, 970, 2042, 302,

1024, 281, 1203, 2147, 13, 83, 1645, 318, 118,692, 825, 1025, 2179, 1695, 867, 864, 1720,512, 1382, 995, 705, 572, 858, 1395, 714,2153, 1334, 571, 1722, 29, 15, 1027, 120, 349].systems [454, 1876, 223, 1579, 225, 716, 258,2338, 1748, 1683, 845, 2108, 321, 1724, 2131,1820, 49, 754, 1528, 1932].

table [981, 106, 1367]. tabled [895].TACAS [588]. Tag [1430]. tagging [95].tail [1381]. tandem [1978]. tape [1910].tardiness [943, 624, 2350]. tardy [806].Tarjan [329]. Tarski [1658].task [1645, 258].tasks [938, 783, 779, 2336, 2100]. taut [742].tautologies [623]. taxonomic [411].Taylor [1704]. tccp [356].TCP [948, 1984, 287]. TCTL [2286].teachability [1577]. teachers [2071].teaching [1577]. team [1119].technique [1730, 2178, 2125, 1455].techniques [1861, 1620, 2013, 1188, 1678,1880, 831, 408, 307]. Template [22, 388].Template-guided [22]. templates [1875].Temporal [285, 1464, 283, 645, 1840, 2287,567, 569, 917, 827, 1091, 1705, 67, 333].temporary [783]. tennis [367].tensor [673]. tensors [1282]. Tenth [32].term [1854, 1702, 1579, 476, 2108].terminal [2218, 1400].Termination [2321, 95, 150, 1958].terms [975, 1704, 692, 1344]. ternary [1563].test [155, 255, 253, 752, 347, 16].testable [1656]. Testing [1991, 45, 574,1695, 1824, 1340, 186, 571, 735, 1210, 98].tests [486, 285]. texts [2232, 2299].their [1861, 1062, 841, 1651, 2122, 1449, 705,909, 263, 1394, 1520, 376, 530].theme [1788]. themes [202].theorem [218, 1496, 1318, 2058, 1635, 1658,1910, 1736, 205, 2337, 1693, 406, 1445, 368,2371, 1660, 138, 331, 756, 1080, 2236, 708,745, 365, 1282, 890]. theorems [1944].Theoret [1530, 2399, 402, 1691, 560, 1136,

37

1708, 2397, 1124, 923].theoretic [975, 364, 880, 1708].Theoretical [286, 740, 222, 312, 1683, 1379,480, 1746].theories [897, 755, 885, 854, 621, 1589, 189].Theory [286, 1280, 114, 1391, 115, 1586, 850,1442, 34, 212, 521, 485, 10, 322, 739, 1085,582, 1083, 581, 1961, 916, 354, 1334, 1743,756, 1041, 1329, 878, 408, 319, 98, 1292, 606].There [391]. Thierry [1475].thinning [1772]. Third [1439].Third-order [1439]. thousand [2040].thread [1383, 1926, 306].thread-based [1926]. threaded [1923].threads [701].Three [78, 1026, 496, 377, 176, 1444, 2171,2173, 1015, 370, 524, 2247, 465].three-dimensional [370].Three-player [78]. three-stage [1015].threshold [2331, 2173, 346, 1811, 1254, 1818].thresholds [1609]. throughput [1302].Thue [90, 1972, 15, 1414]. tier [836].Tight [1561, 2090, 1190, 1295, 1179, 1405].tightly [1181].Tile [235, 1128, 1523, 1525, 2035, 142, 642].tiles [2040, 1937].Tiling [1814, 2228, 2041, 642].tilings [2039, 2097, 1446, 2042, 716].Time [1615, 1265, 107, 1820, 655, 1178,1653, 327, 1169, 1916, 2354, 989, 1964, 2377,1849, 1164, 1523, 1766, 846, 2280, 2143, 167,249, 1029, 1797, 1717, 1935, 1840, 2287, 1098,1374, 567, 648, 2286, 1174, 360, 1909, 269,1645, 1739, 1895, 1740, 1497, 1034, 572, 354,390, 2259, 568, 1959, 1314, 1492, 468, 2373,285, 1222, 1133, 2051, 735, 1809, 2308, 679,476, 1288, 1046, 813, 321, 1944, 627, 1682, 2,1124, 1554, 428, 1697, 1928].time-bound [1797]. time-bounded [327].time-restricted [1895].Time-stamps [655].time-varying [321, 1682].timed [594, 1732, 1697, 196, 595, 55, 1927,572, 1438, 1864, 328, 703, 39, 1680, 1697].

timed-probabilistic [196].times [2253, 1813, 1917, 1741, 1497, 1055,1492, 1432, 1504, 1521, 1944]. timeslot [951].timing [1820]. Tissue [11, 2194, 1717].tolerant [1790, 2398, 1914, 1893, 1974].tolls [421]. tomographic [1767, 1766].tomographical [396, 978].tomography [370, 372]. tonic [2004].tools [1424, 637, 1927]. top [1806, 151].top- [1806]. top-down [151]. topics [271].topological [1955, 1737, 1738, 1405, 247,2155]. topologies [805, 1736].Topology [2116, 1743, 258, 871, 872, 681,682, 1298, 1739, 478, 1747, 1749, 1750].tori [931]. torus [1321, 1638]. total [734,167, 806, 945, 943, 624, 390, 2350, 2259].totality [1640]. totally [2155, 1035].tournament [1641, 1119].tournaments [530]. Tower [955].TPAL [196]. traceroute [606].traceroute-like [606].traces [822, 645, 1091, 655].tractable [1034, 1641]. trade [1009, 430].trade-off [1009, 430]. tradeoff [2070].Tradeoffs [777, 1849, 325]. Trading [1266].Traffic [1294, 2249, 1302, 1896].Tragedy [287]. trails [1898].training [1663]. trajectories [940, 889, 64].trajectory [343]. trajectory-based [343].transcendental [1657].transcription [1838].transcriptional [2193, 1839].transducers [933, 1021, 389, 800, 2108].transductions [247]. transductive [839].transfer [2371, 2067].transfinite [1521, 1944]. transform [1364,532, 1873, 540, 2183, 2294, 1369].transformation [89, 511, 627, 1097].transformations [2097, 213, 893, 151].Transforming [163]. Transition [185, 1356,2273, 1020, 1357, 49, 754].transitions [185, 1184, 694, 626].transitive [150, 1567, 580].transitive-closure [150].

38

translation [196, 586]. translations [2225].translocation [556].transmembrane [132]. transmission [984].transmissions [947].transport [1714, 1939]. Transposing [863].Transposition [1205, 1052].transversals [522]. trapezoidal [1827].traveling [1, 560]. traversal [1009, 1176].treatment [1955]. Tree [483, 50, 1101, 1223,1001, 1368, 1332, 1009, 1253, 171, 702, 380,2388, 977, 128, 1780, 2204, 1263, 1264, 892,238, 2298, 389, 2112, 2230, 1233, 358, 1151,581, 1500, 1981, 1810, 1546, 828, 1030, 213,893, 2290, 1129, 379, 2225, 476, 72, 2108,1234, 267, 936, 627, 2141, 2374].tree-length [1264]. tree-structured [1368].tree-to-tree-series [213].Tree-walking [483]. Trees [525, 1886, 2218,519, 1244, 1980, 2098, 1785, 646, 2381, 1962,731, 2244, 210, 986, 1985, 2251, 1651, 983,1648, 956, 2000, 1915, 828, 1152, 1400, 773,1567, 1977, 829, 629, 2358, 1822, 946, 2085].Treewidth [1963, 634, 434, 1120].triangle [2042, 1817]. triangles [1941, 818].Triangulating [1401, 1907].triangulations [289]. triconnected [265].trinucleotide [1639]. trip [1535].triplet [1392].triplet-dissimilarities [1392].triplets [815]. trivially [2331].True [1436, 1338, 700].True-concurrency [1436, 1338].truncated [2144]. trust [2275, 1423].truth [674, 1155, 1279].truth-finding [1279].Truthful [938, 2103, 2212, 1982, 2051].TSP [2107, 1549, 2347]. TTL [47].TTL-based [47]. Tuning [450].tuple [355, 1227]. Turing [1110, 1274, 254,798, 1634, 77, 1521, 1944, 1945]. turn [785].turned [612]. Tutorial [1385, 305].Twin [2122]. Twin-roots [2122].twisted [1807, 1985].Two [958, 2204, 1297, 744, 875, 1832, 1943,

2237, 1971, 2006, 2240, 926, 1498, 245, 2228,2038, 969, 912, 1980, 2351, 1649, 1802, 242,179, 9, 2149, 388, 23, 1770, 964, 217, 834,2378, 1630, 2226, 707, 2336, 1404, 2267, 2124,2094, 28, 2268, 265, 1458, 1094, 1109, 2111,2076, 2103, 2235, 1856]. two-bit [912].two-dimensional [926, 245, 2228, 2038, 242,179, 2149, 388, 964, 2378, 2226, 707, 1458].two-range-values [2103].Two-stage [1856].two-way [9, 28, 1094, 2076].Type [858, 918, 1590, 1595, 1863, 1676, 864,1546, 625, 1324, 756, 1097, 1003, 1591].type-checking [1003]. type-safe [864].typechecking [151]. typed [1592, 485].types [272, 615, 1585, 1592, 1673, 1675,1686, 56, 918].

ubiquitous [1301]. UET [2336].ultrametric [916]. Ultraproducts [1161].UML [512]. unambiguous [2038, 636].unary [30]. Unavoidable [722, 1456].unbalance [1310].unbounded [1383, 1568, 1576].uncertain [1806].uncertainty [1908, 1157, 1856, 1252, 314].Unconditional [1481]. uncountable [496].undecidability [1443, 704, 922, 195, 1121].undecidable [1832, 2041, 1787].undirected [2359]. unfair [1208].unfoldings [1702]. unification [1701].unified [1243, 1627, 748].Uniform [253, 1473, 471, 1498, 327, 1762,1650, 2201, 2351, 1552, 1717, 1953, 992, 217,2267, 2094, 2259, 1971, 842, 1240].Uniformity [1704, 84, 1552].uniformly [1196, 1173, 373].Unifying [478, 622, 1926]. unions [1753].unique [1088, 1433, 1202, 649, 1643, 2126,1210]. Uniqueness [578, 2245, 2168, 372].unit [1900, 1969, 1122, 1788, 818, 2362, 531,2386, 2027]. unitary [1518].unitation [1331]. UNITY [1099].Universal [1789, 2081, 1795, 347, 2054, 1849,

39

1022, 23, 589, 841, 1283, 825, 1377, 1565,1942, 2067, 798, 735, 1747, 817, 1945, 2009].Universality [1690, 995]. universe [618].unknown [2137, 1306, 1298, 75].unknowns [2171]. unlabeled [412].unoriented [966]. unpredictable [1845].unpublished [1110].unrelated [732, 1183, 2103].Unresolved [454]. unrooted [519].unsatisfiable [523, 178]. unsigned [556].unsolvability [1277]. unsplittable [422].unstructured [607]. Unsupervised [1755].untranquil [1535]. up-to [1188].updatability [1377]. update [1147].updates [158, 2000]. updating [941, 2294].Upper [2020, 2214, 1123, 934, 87, 2254,1809, 1636, 2240]. upper-bounds [1809].Upward [1403, 2127].upward-closed [2127]. usability [141].use [307, 1479]. useful [1085].Using [1020, 506, 1678, 225, 919, 2070, 115,1762, 1577, 2194, 1332, 638, 47, 1004, 56,595, 1059, 2013, 2325, 666, 992, 503, 548,1917, 574, 766, 2138, 1638, 1073, 1314, 728,1702, 2032, 1879, 2375, 886, 1478, 627].utilities [2047]. utility [1139].Utilization [803, 826].

V [553, 793]. vacations [2356].Valiant [1282]. validation [586].valuation [1144]. value [853].valued [2057, 1866, 2248, 913, 1691, 1520].values [504, 2103]. Vandermonde [647].VaR [1144].variable [957, 1240, 178, 317, 1923].variables [373, 1189]. variance [2070].variant [1978, 728, 2103]. variants [1577,958, 597, 1620, 776, 1540, 1832, 1271].variation [1344]. variational [1343].variations [1534, 202, 1094, 1788].varieties [641, 1803, 379, 1101].variety [1656, 2394, 1091, 2148].various [547]. varying [321, 1682].VC [843]. VC-dimension [843].

vector [1884, 2060, 1903].vectors [2055, 1804]. vehicle [1492].Verification [95, 1706, 1383, 1860, 59, 48,155, 2323, 591, 1982, 190, 329, 511, 1731, 58,566, 1733, 306, 307]. verifying [1730].version [457, 440, 708].versus [1515, 1196, 642, 320, 1338, 318,1578, 1289, 1689, 124, 497].Vertex [719, 175, 1558, 66, 180, 1013, 1267,796, 1222, 252, 819, 2386].vertex-covering [66].vertex-weighted [796]. vertices [608, 524].very [1817, 2, 1124, 2066]. via [2377, 1485,116, 1340, 2313, 866, 283, 1853, 187, 1364,360, 2260, 1908, 1030, 294, 1385].video [1501]. video-on-demand [1501].View [1002, 141, 874, 1377, 1597, 2307, 789,1476, 1131]. View-based [1002].views [919, 1004, 1727]. Villemaire [208].virtual [445]. virtuality [1936, 996].visibility [168, 1389]. visible [601].visited [1938]. Visual [939, 1063].visualization [369, 1739]. VLSI [1849].volume [2330]. volumetric [1472].voting [2153]. VPSPACE [2371].Vries [77]. vs [107, 1524, 295, 2156].

W [836]. walk [2375]. walking [483].walks [1917, 1518, 2237, 2256].Walrasian [182]. Walsh [532].watchman [1288]. Watson [695, 2203].wave [1875]. wavebands [109].wavelet [1005]. way [9, 1640, 2130, 1134,347, 1685, 2041, 28, 1094, 2076].WCET [1374]. Weak [275, 1558, 38, 72,1882, 1863, 1588, 1271, 1188, 819].Weak-vertex-pancyclicity [1558].Weakening [227]. weaker [1403, 2268].weakly [1697, 1287].web [226, 1675, 1551, 276]. Week [1019].weft [520]. Wegener [2304, 2303].Weight [1412, 236, 1956, 1565, 1312, 1810,1399, 2308, 819, 980]. weight-based [1956].weight-constrained [1810].

REFERENCES 40

Weighted [765, 892, 1182, 2224, 1053, 1698,2045, 1543, 1899, 2392, 1490, 2265, 1217,2352, 806, 1969, 775, 1638, 943, 624, 835,390, 2259, 796, 1005, 1569, 267, 1546].Well [1107, 840, 1003, 1706, 1020, 424, 426].Well-calibrated [840].Well-definedness [1003].well-formed [1706].well-structured [1020]. Weyl [2236].whack [784]. Wheeler [1369, 89, 1362, 1364,1363, 2183, 2294]. Wheeler-based [1363].where [2348]. whether [1824].which [1740, 476]. who [1532].whose [1953, 1657]. Wide [547, 79].Wide-sense [547]. widenings [332].Width [1289, 1246, 382, 719, 1016, 1120].Wiener [1272]. Wilf [205, 2184].Williamson [598]. window [79, 1984].windows [1148, 1770, 1492]. winning [492].winnowing [1485].wireless [1783, 947, 1605, 1951, 733, 1954,1665, 313, 1487, 1960, 904, 1928, 2105].wise [2155]. withdrawal [622].within [1728, 1119].without [1319, 2192, 185, 1063, 23, 945,1184, 2355, 1415, 332, 1786, 1187].Word [721, 802, 90, 975, 464, 342, 2171,1107, 2177, 1203, 1204, 2229, 2207, 1626].word-expansion [2229].word-shuffle [1107]. Words [232, 1454, 90,2222, 208, 1431, 1196, 2162, 1390, 237, 262,2245, 1318, 1972, 1991, 2164, 240, 1198, 554,1494, 639, 1483, 2166, 2167, 2116, 233, 1199,2296, 2098, 242, 2169, 169, 1563, 1444, 2172,2364, 721, 533, 1201, 1447, 1906, 1791, 1408,1987, 236, 399, 649, 1997, 1503, 2339, 2241,707, 2122, 1633, 1205, 1008, 1410, 2234, 1206,2252, 1452, 261, 1458, 203, 2099, 1207, 829,1047, 1275, 378, 2184, 557, 2240, 644, 1827].Work [1532]. workflow [566].working [1314, 1259]. workload [1005].workload-based [1005]. works [632, 2383].Workshop [32].World [1700, 612, 1067, 1535, 284, 2345].

World-set [1700]. worlds [1161].worst [777, 2163, 1142, 1640, 813].worst-case [777, 2163, 1142, 1640, 813].worth [2040]. wreath [641].

X [63, 574, 1695]. X-machine [574, 1695].X-rays [63]. XML [148, 151, 152].XOR [193]. XPath [146, 828]. xyz [342].

Yao [2027, 224, 227]. Yao-like [2027].years [1041]. yeast [1839]. Yu [2337].

Zariski [1745]. Zeno [687]. zero [1062, 910,1878, 2009, 1134]. zero-knowledge [1062,2009]. zeta [1230].

References

Krumke:2003:NOT

[1] Sven O. Krumke, Willem E. de Paepe,Diana Poensgen, and Leen Stougie.News from the online traveling repair-man. Theoretical Computer Science,295(1–3):279–294, February 24, 2003.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic). See er-ratum [560].

Yokomori:2003:PTI

[2] Takashi Yokomori. Polynomial-timeidentification of very simple grammarsfrom positive data. Theoretical Com-puter Science, 298(1):179–206, April 4,2003. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).See erratum [1124].

Champarnaud:2004:NRA

[3] J.-M. Champarnaud and F. Coulon.NFA reduction algorithms by means ofregular inequalities. Theoretical Com-puter Science, 327(3):241–253, Novem-ber 2, 2004. CODEN TCSCDI. ISSN

REFERENCES 41

0304-3975 (print), 1879-2294 (elec-tronic). See erratum [402].

Karhumaki:2005:P

[4] Juhani Karhumaki and GrzegorzRozenberg. Preface. Theoretical Com-puter Science, 330(1):1, January 31,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ananichev:2005:SGM

[5] D. S. Ananichev and M. V. Volkov.Synchronizing generalized monotonicautomata. Theoretical Computer Sci-ence, 330(1):3–13, January 31, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Austinat:2005:RFC

[6] Holger Austinat, Volker Diekert, Ul-rich Hertrampf, and Holger Petersen.Regular frequency computations. The-oretical Computer Science, 330(1):15–21, January 31, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Campeanu:2005:MSL

[7] Cezar Campeanu, Nicolae Santean,and Sheng Yu. Mergible states inlarge NFA. Theoretical Computer Sci-ence, 330(1):23–34, January 31, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Carpi:2005:CML

[8] Arturo Carpi and Aldo de Luca. Com-pletions in measure of languages andrelated combinatorial problems. The-oretical Computer Science, 330(1):35–57, January 31, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dang:2005:TWN

[9] Zhe Dang, Oscar H. Ibarra, and Zhi-Wei Sun. On two-way nondeterminis-tic finite automata with one reversal-bounded counter. Theoretical Com-puter Science, 330(1):59–79, January31, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Ding:2005:CTC

[10] Cunsheng Ding and Xuesong Wang.A coding theory construction of newsystematic authentication codes. The-oretical Computer Science, 330(1):81–99, January 31, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Freund:2005:TPS

[11] Rudolf Freund, Gheorghe Paun, andMario J. Perez-Jimenez. Tissue Psystems with channel states. Theo-retical Computer Science, 330(1):101–116, January 31, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Harju:2005:EFS

[12] Tero Harju and Dirk Nowotka. Onthe equation xk = zk1

1 zk22 · · · zknn in a

free semigroup. Theoretical ComputerScience, 330(1):117–121, January 31,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Honkala:2005:LEP

[13] Juha Honkala. The language equiva-lence problem for HD0L systems havingD0L growths. Theoretical ComputerScience, 330(1):123–133, January 31,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 42

Hromkovic:2005:PRM

[14] Juraj Hromkovic and Georg Schnitger.On the power of randomized multi-counter machines. Theoretical Com-puter Science, 330(1):135–144, January31, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Matiyasevich:2005:DPS

[15] Yuri Matiyasevich and Geraud Senizergues.Decision problems for semi-Thue sys-tems with a few rules. Theoretical Com-puter Science, 330(1):145–169, January31, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Ruohonen:2005:ETS

[16] Keijo Ruohonen. Explicit test setsfor iterated morphisms in free monoidsand metabelian groups. Theoreti-cal Computer Science, 330(1):171–191,January 31, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:EBa

[17] Anonymous. Editorial board. The-oretical Computer Science, 330(1):v–ix, January 31, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Csuhaj-Varju:2005:P

[18] E. Csuhaj-Varju and D. Wotschke.Preface. Theoretical Computer Sci-ence, 330(2):193, February 2, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bordihn:2005:NCC

[19] Henning Bordihn. On the number ofcomponents in cooperating distributedgrammar systems. Theoretical Com-puter Science, 330(2):195–204, Febru-ary 2, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Castellanos:2005:SCH

[20] Juan Castellanos, Peter Leupold, andVictor Mitrana. On the size complex-ity of hybrid networks of evolution-ary processors. Theoretical ComputerScience, 330(2):205–220, February 2,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Champarnaud:2005:RGD

[21] Jean-Marc Champarnaud and ThomasParanthoen. Random generation ofDFAs. Theoretical Computer Science,330(2):221–235, February 2, 2005. CO-DEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Daley:2005:TGD

[22] Mark Daley and Ian McQuillan.Template-guided DNA recombination.Theoretical Computer Science, 330(2):237–250, February 2, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Freund:2005:CUP

[23] Rudolf Freund, Lila Kari, Marion Os-wald, and Petr Sosık. Computation-ally universal P systems without prior-ities: two catalysts are sufficient. The-oretical Computer Science, 330(2):251–266, February 2, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 43

Holzer:2005:DCF

[24] Markus Holzer and Martin Kutrib.On the descriptional complexity of fi-nite automata with modified accep-tance conditions. Theoretical ComputerScience, 330(2):267–285, February 2,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jiraskova:2005:SCS

[25] Galina Jiraskova. State complexityof some operations on binary regu-lar languages. Theoretical ComputerScience, 330(2):287–298, February 2,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kappes:2005:SRL

[26] Martin Kappes and Frank Nießner.Succinct representations of languagesby DFA with different levels of relia-bility. Theoretical Computer Science,330(2):299–310, February 2, 2005. CO-DEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Kutrib:2005:DPH

[27] Martin Kutrib. On the descriptionalpower of heads, counters, and pebbles.Theoretical Computer Science, 330(2):311–324, February 2, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Malcher:2005:TWC

[28] Andreas Malcher. On two-way com-munication in cellular automata witha fixed number of cells. Theoreti-cal Computer Science, 330(2):325–338,February 2, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Margenstern:2005:CFI

[29] Maurice Margenstern, Gheorghe Paun,Yurii Rogozhin, and Sergey Verlan.Context-free insertion–deletion sys-tems. Theoretical Computer Science,330(2):339–348, February 2, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Mera:2005:CUN

[30] Filippo Mera and Giovanni Pighizzini.Complementing unary nondeterminis-tic automata. Theoretical ComputerScience, 330(2):349–360, February 2,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Vaszil:2005:DCS

[31] Gyorgy Vaszil. On the descriptionalcomplexity of some rewriting mecha-nisms regulated by context conditions.Theoretical Computer Science, 330(2):361–373, February 2, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Corradini:2005:SPT

[32] Flavio Corradini and Uwe Nestmann.Selected papers of the Tenth Interna-tional Workshop on Expressiveness inConcurrency (EXPRESS 2003). The-oretical Computer Science, 330(3):375–376, February 9, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Aceto:2005:CHM

[33] Luca Aceto, Wan Fokkink, AnnaIngolfsdottir, and Bas Luttik. CCSwith Hennessy’s merge has no finite-equational axiomatization. Theoreti-cal Computer Science, 330(3):377–405,

REFERENCES 44

February 9, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bolton:2005:HFB

[34] Christie Bolton and Gavin Lowe. A hi-erarchy of failures-based models: the-ory and application. Theoretical Com-puter Science, 330(3):407–438, Febru-ary 9, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Carayol:2005:RMA

[35] Arnaud Carayol, Daniel Hirschkoff,and Davide Sangiorgi. On the rep-resentation of McCarthy’s amb inthe π-calculus. Theoretical ComputerScience, 330(3):439–473, February 9,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lozes:2005:ESC

[36] Etienne Lozes. Elimination of spatialconnectives in static spatial logics. The-oretical Computer Science, 330(3):475–499, February 9, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Maffeis:2005:CSP

[37] Sergio Maffeis and Iain Phillips. Onthe computational strength of pure am-bient calculi. Theoretical ComputerScience, 330(3):501–551, February 9,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Mayr:2005:WBR

[38] Richard Mayr. Weak bisimilarity andregularity of context-free processes is

EXPTIME-hard. Theoretical Com-puter Science, 330(3):553–575, Febru-ary 9, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Valencia:2005:DIS

[39] Frank D. Valencia. Decidability ofinfinite-state timed CCP processes andfirst-order LTL. Theoretical ComputerScience, 330(3):577–607, February 9,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:AIa

[40] Anonymous. Author index. Theo-retical Computer Science, 330(3):609–610, February 9, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:MI

[41] Anonymous. Master index. Theo-retical Computer Science, 330(3):611–622, February 9, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Orejas:2005:P

[42] Fernando Orejas and Jan van Leeuwen.Preface. Theoretical Computer Sci-ence, 331(1):1–2, February 15, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Blaser:2005:BAS

[43] Markus Blaser. Beyond the Alder–Strassen bound. Theoretical ComputerScience, 331(1):3–21, February 15,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 45

Sadakane:2005:CAL

[44] Kunihiko Sadakane, Nadia Takki-Chebihi, and Takeshi Tokuyama. Com-binatorics and algorithms for low-discrepancy roundings of a real se-quence. Theoretical Computer Sci-ence, 331(1):23–36, February 15, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Czumaj:2005:THC

[45] Artur Czumaj and Christian Sohler.Testing hypergraph colorability. The-oretical Computer Science, 331(1):37–52, February 15, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Sibeyn:2005:FGB

[46] Jop F. Sibeyn. Faster gossiping on but-terfly networks. Theoretical ComputerScience, 331(1):53–72, February 15,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cohen:2005:PAD

[47] Edith Cohen, Eran Halperin, and HaimKaplan. Performance aspects of dis-tributed caches using TTL-based con-sistency. Theoretical Computer Sci-ence, 331(1):73–96, February 15, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Alur:2005:RVM

[48] Rajeev Alur, Kousha Etessami, andMihalis Yannakakis. Realizability andverification of MSC graphs. Theo-retical Computer Science, 331(1):97–114, February 15, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

vanBreugel:2005:BPP

[49] Franck van Breugel and James Wor-rell. A behavioural pseudometric forprobabilistic transition systems. The-oretical Computer Science, 331(1):115–142, February 15, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Comon:2005:TAO

[50] Hubert Comon and Veronique Cortier.Tree automata with one memory setconstraints and cryptographic proto-cols. Theoretical Computer Science,331(1):143–214, February 15, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Schroder:2005:ASC

[51] Lutz Schroder, Till Mossakowski, An-drzej Tarlecki, Bartek Klin, and PiotrHoffman. Amalgamation in the seman-tics of CASL. Theoretical ComputerScience, 331(1):215–247, February 15,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:EBb

[52] Anonymous. Editorial board. The-oretical Computer Science, 331(1):v–ix, February 15, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

deBoer:2005:Pa

[53] Frank de Boer and Marcello Bon-sangue. Preface. Theoretical ComputerScience, 331(2–3):249–250, February25, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

REFERENCES 46

Abraham:2005:ABP

[54] Erika Abraham, Frank S. de Boer,Willem-Paul de Roever, and MartinSteffen. An assertion-based proof sys-tem for multithreaded Java. Theoret-ical Computer Science, 331(2–3):251–290, February 25, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hooman:2005:SMT

[55] Jozef Hooman and Jaco van de Pol. Se-mantic models of a timed distributeddataspace architecture. TheoreticalComputer Science, 331(2–3):291–323,February 25, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ferrari:2005:CMH

[56] Gianluigi Ferrari, Ugo Montanari, andEmilio Tuosto. Coalgebraic minimiza-tion of HD-automata for the π-calculususing polymorphic types. Theoreti-cal Computer Science, 331(2–3):325–365, February 25, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Achermann:2005:CRA

[57] Franz Achermann and Oscar Nier-strasz. A calculus for reasoningabout software composition. Theoret-ical Computer Science, 331(2–3):367–396, February 25, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kesten:2005:CAC

[58] Yonit Kesten and Amir Pnueli. A com-positional approach to CTL∗ verifica-tion. Theoretical Computer Science,

331(2–3):397–428, February 25, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Sekerinski:2005:VRF

[59] Emil Sekerinski. Verification andrefinement with fine-grained action-based concurrent objects. Theoreti-cal Computer Science, 331(2–3):429–455, February 25, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Pattinson:2005:CAM

[60] Dirk Pattinson and Martin Wirsing. Acoordination approach to mobile com-ponents. Theoretical Computer Sci-ence, 331(2–3):457–483, February 25,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:AIb

[61] Anonymous. Author index. Theoret-ical Computer Science, 331(2–3):485–486, February 25, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lim:2005:CPM

[62] Andrew Lim, Brian Rodrigues, FanWang, and Zhou Xu. k-Center prob-lems with minimum coverage. Theo-retical Computer Science, 332(1–3):1–17, February 28, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Daurat:2005:DQC

[63] Alain Daurat. Determination of Q-convex sets by X-rays. Theoreti-cal Computer Science, 332(1–3):19–45,February 28, 2005. CODEN TC-

REFERENCES 47

SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kari:2005:ASD

[64] Lila Kari and Petr Sosık. Aspectsof shuffle and deletion on trajectories.Theoretical Computer Science, 332(1–3):47–61, February 28, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Seiden:2005:NBR

[65] Steven S. Seiden, Peter P. Chen, R. F.Lax, J. Chen, and Guoli Ding. Newbounds for randomized busing. Theo-retical Computer Science, 332(1–3):63–81, February 28, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Demange:2005:LVC

[66] Marc Demange and Vangelis Th.Paschos. On-line vertex-covering. The-oretical Computer Science, 332(1–3):83–108, February 28, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Shi:2005:NFA

[67] Qingmin Shi and Joseph JaJa. Anew framework for addressing tempo-ral range queries and some preliminaryresults. Theoretical Computer Science,332(1–3):109–121, February 28, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Serna:2005:ANB

[68] Maria Serna, Luca Trevisan, and FatosXhafa. The approximability of non-Boolean satisfiability problems and re-stricted integer programming. Theoret-ical Computer Science, 332(1–3):123–

139, February 28, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lombardy:2005:DRE

[69] Sylvain Lombardy and Jacques Sakarovitch.Derivatives of rational expressions withmultiplicity. Theoretical Computer Sci-ence, 332(1–3):141–177, February 28,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Berstel:2005:ML

[70] Jean Berstel, Luc Boasson, and MichelLatteux. Mixed languages. Theoret-ical Computer Science, 332(1–3):179–198, February 28, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Brandenburg:2005:FGA

[71] F. J. Brandenburg and K. Skodinis.Finite graph automata for linear andboundary graph languages. Theoret-ical Computer Science, 332(1–3):199–232, February 28, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Torre:2005:WMA

[72] Salvatore La Torre, Aniello Murano,and Margherita Napoli. Weak Mulleracceptance conditions for tree au-tomata. Theoretical Computer Science,332(1–3):233–250, February 28, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Fuchs:2005:OML

[73] Bernhard Fuchs, Winfried Hochstattler,and Walter Kern. Online matchingon a line. Theoretical Computer Sci-ence, 332(1–3):251–264, February 28,

REFERENCES 48

2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dahllof:2005:CMF

[74] Vilhelm Dahllof, Peter Jonsson, andMagnus Wahlstrom. Counting modelsfor 2SAT and 3SAT formulae. Theoret-ical Computer Science, 332(1–3):265–291, February 28, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jevtic:2005:LBC

[75] Nikola Jevtic, Alon Orlitsky, andNarayana P. Santhanam. A lowerbound on compression of unknown al-phabets. Theoretical Computer Sci-ence, 332(1–3):293–311, February 28,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Pedicini:2005:GES

[76] Marco Pedicini. Greedy expansionsand sets with deleted digits. Theoret-ical Computer Science, 332(1–3):313–336, February 28, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Weihrauch:2005:CSK

[77] Klaus Weihrauch and Ning Zhong.Computing the solution of theKorteweg–de Vries equation with ar-bitrary precision on Turing machines.Theoretical Computer Science, 332(1–3):337–366, February 28, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Cincotti:2005:TPP

[78] A. Cincotti. Three-player partizangames. Theoretical Computer Science,332(1–3):367–389, February 28, 2005.

CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

He:2005:WWS

[79] Longtao He, Binxing Fang, and Jie Sui.The wide window string matching al-gorithm. Theoretical Computer Sci-ence, 332(1–3):391–404, February 28,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cardinal:2005:DSK

[80] Jean Cardinal and Stefan Langer-man. Designing small keyboards ishard. Theoretical Computer Science,332(1–3):405–415, February 28, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Nagamochi:2005:OSC

[81] Hiroshi Nagamochi. On the one-sidedcrossing minimization in a bipartitegraph with large degrees. Theoreti-cal Computer Science, 332(1–3):417–446, February 28, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Yeh:2005:RSS

[82] Hong-Gwa Yeh and Xuding Zhu.Resource-sharing system schedulingand circular chromatic number. The-oretical Computer Science, 332(1–3):447–460, February 28, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Huang:2005:PPS

[83] H. J. Huang, L. Jiao, and T. Y. Che-ung. Property-preserving subnet reduc-tions for designing manufacturing sys-tems with shared resources. Theoret-ical Computer Science, 332(1–3):461–

REFERENCES 49


Nishimura:2005:UQC

[84] Harumichi Nishimura and MasanaoOzawa. Uniformity of quantum circuitfamilies for error-free algorithms. The-oretical Computer Science, 332(1–3):487–496, February 28, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Bazgan:2005:DAM

[85] Cristina Bazgan, Jerome Monnot, Van-gelis Th. Paschos, and Fabrice Serriere.On the differential approximation ofMIN SET COVER. TheoreticalComputer Science, 332(1–3):497–513,February 28, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Byskov:2005:NAE

[86] Jesper Makholm Byskov, Bolette Am-mitzbøll Madsen, and Bjarke Skjer-naa. New algorithms for Exact Sat-isfiability. Theoretical Computer Sci-ence, 332(1–3):515–541, February 28,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gharavi:2005:UBL

[87] Reza Gharavi and V. Anantharam.An upper bound for the largest Lya-punov exponent of a Markovian prod-uct of nonnegative matrices. Theoret-ical Computer Science, 332(1–3):543–557, February 28, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Tsur:2005:SHE

[88] Dekel Tsur. Sequencing by hybridiza-tion with errors: handling longer se-quences. Theoretical Computer Sci-ence, 332(1–3):559–566, February 28,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Crochemore:2005:NBW

[89] Maxime Crochemore, Jacques Desarmenien,and Dominique Perrin. A note onthe Burrows–Wheeler transformation.Theoretical Computer Science, 332(1–3):567–572, February 28, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Aberkane:2005:TMW

[90] Ali Aberkane and James D. Currie.The Thue–Morse word contains circu-lar 5/2+ power free words of everylength. Theoretical Computer Science,332(1–3):573–581, February 28, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Anonymous:2005:AIc

[91] Anonymous. Author index. Theoret-ical Computer Science, 332(1–3):583–584, February 28, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:EBc

[92] Anonymous. Editorial board. Theo-retical Computer Science, 332(1–3):v–ix, February 28, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 50

Gordon:2005:PSI

[93] Andrew D. Gordon, Programme ChairFOSSACS 2003. Preface for the SpecialIssue. Theoretical Computer Science,333(1–2):1, March 1, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Abel:2005:ICS

[94] Andreas Abel, Ralph Matthes, andTarmo Uustalu. Iteration and coit-eration schemes for higher-order andnested datatypes. Theoretical Com-puter Science, 333(1–2):3–66, March 1,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Blanchet:2005:VCP

[95] Bruno Blanchet and Andreas Podel-ski. Verification of cryptographic pro-tocols: tagging enforces termination.Theoretical Computer Science, 333(1–2):67–90, March 1, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bonelli:2005:NHO

[96] Eduardo Bonelli. Normalisation forhigher-order calculi with explicit sub-stitutions. Theoretical Computer Sci-ence, 333(1–2):91–125, March 1, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Boneva:2005:WAC

[97] Iovka Boneva and Jean-Marc Talbot.When ambients cannot be opened.Theoretical Computer Science, 333(1–2):127–169, March 1, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

vanBreugel:2005:DTT

[98] Franck van Breugel, Michael Mislove,Joel Ouaknine, and James Worrell. Do-main theory, testing and simulation forlabelled Markov processes. Theoret-ical Computer Science, 333(1–2):171–197, March 1, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Laird:2005:GSL

[99] J. Laird. Game semantics and lin-ear CPS interpretation. Theoreti-cal Computer Science, 333(1–2):199–224, March 1, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lugiez:2005:MAC

[100] Denis Lugiez. Multitree automatathat count. Theoretical Computer Sci-ence, 333(1–2):225–263, March 1, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Santocanale:2005:ACC

[101] Luigi Santocanale and Andre Arnold.Ambiguous classes in µ-calculi hier-archies. Theoretical Computer Sci-ence, 333(1–2):265–296, March 1, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Sassone:2005:LRC

[102] Vladimiro Sassone and Pawe l Sobocinski.Locating reaction with 2-categories.Theoretical Computer Science, 333(1–2):297–327, March 1, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 51

Anonymous:2005:EBd

[103] Anonymous. Editorial board. The-oretical Computer Science, 333(1–2):v–ix, March 1, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Peleg:2005:P

[104] David Peleg and Jop Sibeyn. Preface.Theoretical Computer Science, 333(3):329–330, March 3, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Osterloh:2005:OOR

[105] Andre Osterloh. Optimal obliviousrouting on d-dimensional meshes. The-oretical Computer Science, 333(3):331–346, March 3, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ito:2005:SBT

[106] Hiro Ito, Kazuo Iwama, Yasuo Ok-abe, and Takuya Yoshihiro. Singlebackup table schemes for shortest-pathrouting. Theoretical Computer Sci-ence, 333(3):347–353, March 3, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Kowalski:2005:TCR

[107] Dariusz R. Kowalski and Andrzej Pelc.Time complexity of radio broadcast-ing: adaptiveness vs. obliviousness andrandomization vs. determinism. Theo-retical Computer Science, 333(3):355–371, March 3, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Busch:2005:CCL

[108] Costas Busch, Marios Mavronico-las, and Paul Spirakis. Thecost of concurrent, low-contentionRead&Modify&Write. TheoreticalComputer Science, 333(3):373–400,March 3, 2005. CODEN TCSCDI.ISSN 0304-3975 (print), 1879-2294(electronic).

Flammini:2005:RWA

[109] Michele Flammini, Alfredo Navarra,and Andrzej Proskurowski. On routingof wavebands for all-to-all communica-tions in all-optical paths and cycles ,.Theoretical Computer Science, 333(3):401–413, March 3, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gavoille:2005:IRR

[110] Cyril Gavoille and Martin Nehez. In-terval routing in reliability networks.Theoretical Computer Science, 333(3):415–432, March 3, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fernandez:2005:DAP

[111] Antonio Fernandez, Chryssis Geor-giou, Alexander Russell, and Alex A.Shvartsman. The Do-All problem withByzantine processor failures. Theo-retical Computer Science, 333(3):433–454, March 3, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:AId

[112] Anonymous. Author index. Theo-retical Computer Science, 333(3):455–456, March 3, 2005. CODEN TC-

REFERENCES 52


Rozenberg:2005:Pa

[113] G. Rozenberg. Preface. TheoreticalComputer Science, 334(1–3):1–2, April15, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Kari:2005:TCA

[114] Jarkko Kari. Theory of cellular au-tomata: A survey. Theoretical Com-puter Science, 334(1–3):3–33, April 15,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Auger:2005:CRS

[115] Anne Auger. Convergence results forthe (1, λ)-SA-ES using the theory ofφ-irreducible Markov chains. Theo-retical Computer Science, 334(1–3):35–69, April 15, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bonizzoni:2005:SRR

[116] Paola Bonizzoni, Clelia De Felice, andRosalba Zizza. The structure of re-flexive regular splicing languages viaSchutzenberger constants. Theoret-ical Computer Science, 334(1–3):71–98, April 15, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gaborit:2005:LCD

[117] Philippe Gaborit and Oliver D. King.Linear constructions for DNA codes.Theoretical Computer Science, 334(1–3):99–113, April 15, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ibarra:2005:MHP

[118] Oscar H. Ibarra. On membrane hierar-chy in P systems. Theoretical ComputerScience, 334(1–3):115–129, April 15,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kari:2005:PBF

[119] Lila Kari, Stavros Konstantinidis, andPetr Sosık. On properties of bond-freeDNA languages. Theoretical ComputerScience, 334(1–3):131–159, April 15,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Mutyam:2005:RPS

[120] Madhu Mutyam. Rewriting P sys-tems: improved hierarchies. Theoret-ical Computer Science, 334(1–3):161–175, April 15, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Sauerhoff:2005:QBP

[121] Martin Sauerhoff and Detlef Siel-ing. Quantum branching programsand space-bounded nonuniform quan-tum complexity. Theoretical ComputerScience, 334(1–3):177–225, April 15,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Woods:2005:OMC

[122] Damien Woods and Thomas J.Naughton. An optical model of com-putation. Theoretical Computer Sci-ence, 334(1–3):227–258, April 15, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 53

Yang:2005:MBR

[123] Guowu Yang, William N. N. Hung,Xiaoyu Song, and Marek Perkowski.Majority-based reversible logic gates.Theoretical Computer Science, 334(1–3):259–274, April 15, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Yamasaki:2005:QVD

[124] Tomohiro Yamasaki, Hirotada Kobaya-shi, and Hiroshi Imai. Quantum versusdeterministic counter automata. The-oretical Computer Science, 334(1–3):275–297, April 15, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:AIe

[125] Anonymous. Author index. The-oretical Computer Science, 334(1–3):299, April 15, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:EBe

[126] Anonymous. Editorial board. The-oretical Computer Science, 334(1–3):v–ix, April 15, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Apostolico:2005:F

[127] Alberto Apostolico and Raffaele Gian-carlo. Foreword. Theoretical ComputerScience, 335(1):1–2, May 20, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Chattaraj:2005:IST

[128] Abhijit Chattaraj and Laxmi Parida.An inexact-suffix-tree-based algorithm

for detecting extensible patterns. The-oretical Computer Science, 335(1):3–14, May 20, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Wang:2005:CFE

[129] Lusheng Wang, Hao Zhao, GuozhuDong, and Jianping Li. On the com-plexity of finding emerging patterns.Theoretical Computer Science, 335(1):15–27, May 20, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Mauri:2005:APM

[130] Giancarlo Mauri and Giulio Pavesi. Al-gorithms for pattern matching and dis-covery in RNA secondary structure.Theoretical Computer Science, 335(1):29–51, May 20, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Xu:2005:EMR

[131] Ying Xu, Lusheng Wang, Hao Zhao,and Jianping Li. Exact matchingof RNA secondary structure patterns.Theoretical Computer Science, 335(1):53–66, May 20, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Waldispuhl:2005:MPA

[132] Jerome Waldispuhl and Jean-MarcSteyaert. Modeling and predicting all-α transmembrane proteins includinghelix–helix pairing. Theoretical Com-puter Science, 335(1):67–92, May 20,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 54

Choy:2005:CMA

[133] Charles Choy, Jesper Jansson, Kuni-hiko Sadakane, and Wing-Kin Sung.Computing the maximum agreementof phylogenetic networks. TheoreticalComputer Science, 335(1):93–107, May20, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Bafna:2005:PAH

[134] Vineet Bafna, Sorin Istrail, GiuseppeLancia, and Romeo Rizzi. Polynomialand APX-hard cases of the individualhaplotyping problem. Theoretical Com-puter Science, 335(1):109–125, May 20,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:EBf

[135] Anonymous. Editorial board. The-oretical Computer Science, 335(1):v–ix, May 20, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Aceto:2005:GEF

[136] Luca Aceto, Wan Fokkink, Anna In-golfsdottir, and Zoltan Esik. Guest ed-itors’ foreword. Theoretical ComputerScience, 335(2–3):127–129, May 23,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Baeten:2005:BHP

[137] J. C. M. Baeten. A brief history of pro-cess algebra. Theoretical Computer Sci-ence, 335(2–3):131–146, May 23, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Luttik:2005:DOA

[138] Bas Luttik and Vincent van Oostrom.Decomposition orders — another gen-eralisation of the fundamental theoremof arithmetic. Theoretical ComputerScience, 335(2–3):147–186, May 23,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Corradini:2005:MPA

[139] F. Corradini and W. Vogler. Measuringthe performance of asynchronous sys-tems with PAFAS. Theoretical Com-puter Science, 335(2–3):187–213, May23, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Bergstra:2005:PAH

[140] J. A. Bergstra and C. A. Middelburg.Process algebra for hybrid systems.Theoretical Computer Science, 335(2–3):215–280, May 23, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Aldini:2005:UPA

[141] Alessandro Aldini and Marco Bernardo.On the usability of process algebra: Anarchitectural view. Theoretical Com-puter Science, 335(2–3):281–329, May23, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Bruni:2005:OCD

[142] Roberto Bruni, Ugo Montanari, andVladimiro Sassone. Observationalcongruences for dynamically reconfig-urable tile systems. Theoretical Com-puter Science, 335(2–3):331–372, May23, 2005. CODEN TCSCDI. ISSN

REFERENCES 55

0304-3975 (print), 1879-2294 (elec-tronic).

Palamidessi:2005:REC

[143] Catuscia Palamidessi and Oltea Mi-haela Herescu. A randomized encod-ing of the π-calculus with mixed choice.Theoretical Computer Science, 335(2–3):373–404, May 23, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Anonymous:2005:AIf

[144] Anonymous. Author index. Theoret-ical Computer Science, 335(2–3):405–406, May 23, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lenzerini:2005:P

[145] Maurizio Lenzerini. Preface. Theoret-ical Computer Science, 336(1):1, May25, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Benedikt:2005:SPX

[146] Michael Benedikt, Wenfei Fan, andGabriel Kuper. Structural propertiesof XPath fragments. Theoretical Com-puter Science, 336(1):3–31, May 25,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Calvanese:2005:DCR

[147] Diego Calvanese, Giuseppe De Gia-como, and Moshe Y. Vardi. Decid-able containment of recursive queries.Theoretical Computer Science, 336(1):33–56, May 25, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Deutsch:2005:XQC

[148] Alin Deutsch and Val Tannen. XMLqueries and constraints, containmentand reformulation. Theoretical Com-puter Science, 336(1):57–87, May 25,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fagin:2005:DES

[149] Ronald Fagin, Phokion G. Kolaitis,Renee J. Miller, and Lucian Popa. Dataexchange: semantics and query answer-ing. Theoretical Computer Science, 336(1):89–124, May 25, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Geerts:2005:DTQ

[150] Floris Geerts and Bart Kuijpers. Onthe decidability of termination of queryevaluation in transitive-closure logicsfor polynomial constraint databases.Theoretical Computer Science, 336(1):125–151, May 25, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Martens:2005:CTT

[151] Wim Martens and Frank Neven. Onthe complexity of typechecking top-down XML transformations. Theo-retical Computer Science, 336(1):153–180, May 25, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Toman:2005:RAS

[152] David Toman and Grant Weddell. Onreasoning about structural equality inXML: a description logic approach.Theoretical Computer Science, 336(1):

REFERENCES 56

181–203, May 25, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:EBg

[153] Anonymous. Editorial board. The-oretical Computer Science, 336(1):v–ix, May 25, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Borger:2005:ASM

[154] Egon Borger. Abstract state machinesand high-level system design and analy-sis. Theoretical Computer Science, 336(2–3):205–207, May 26, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Artho:2005:CTC

[155] Cyrille Artho, Howard Barringer, AllenGoldberg, Klaus Havelund, SarfrazKhurshid, Mike Lowry, Corina Pasare-anu, Grigore Rosu, Koushik Sen,Willem Visser, and Rich Washing-ton. Combining test case generationand runtime verification. Theoreti-cal Computer Science, 336(2–3):209–234, May 26, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Borger:2005:HLM

[156] Egon Borger, Nicu G. Fruja, VincenzoGervasi, and Robert F. Stark. A high-level modular definition of the seman-tics of C#. Theoretical ComputerScience, 336(2–3):235–284, May 26,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).URL http://www.only4gurus.net/

miscellaneous/cs03.pdf.

Glasser:2005:FDA

[157] Uwe Glasser and Qian-Ping Gu. For-mal description and analysis of a dis-tributed location service for mobile adhoc networks. Theoretical ComputerScience, 336(2–3):285–309, May 26,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gurevich:2005:PU

[158] Yuri Gurevich and Nikolai Tillmann.Partial updates. Theoretical ComputerScience, 336(2–3):311–342, May 26,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Nanchen:2005:LSM

[159] Stanislas Nanchen and Robert F.Stark. A logic for secure memory ac-cess of abstract state machines. The-oretical Computer Science, 336(2–3):343–365, May 26, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Roman:2005:PEC

[160] Gruia-Catalin Roman and Jamie Pay-ton. A principled exploration of coor-dination models. Theoretical ComputerScience, 336(2–3):367–401, May 26,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Schellhorn:2005:ARG

[161] Gerhard Schellhorn. ASM refinementand generalizations of forward simula-tion in data refinement: a comparison.Theoretical Computer Science, 336(2–3):403–435, May 26, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 57

Anonymous:2005:AIg

[162] Anonymous. Author index. Theoret-ical Computer Science, 336(2–3):437–438, May 26, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Giacobazzi:2005:TSA

[163] Roberto Giacobazzi and Isabella Mas-troeni. Transforming semantics by ab-stract interpretation. Theoretical Com-puter Science, 337(1–3):1–50, June 9,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Costagliola:2005:ASI

[164] Gennaro Costagliola, Filomena Fer-rucci, and Carmine Gravino. Addingsymbolic information to picture mod-els: definitions and properties. The-oretical Computer Science, 337(1–3):51–104, June 9, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Karhumaki:2005:CDC

[165] Juhani Karhumaki, Wojciech Plandowski,and Wojciech Rytter. On the com-plexity of decidable cases of the com-mutation problem of languages. The-oretical Computer Science, 337(1–3):105–118, June 9, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

McQuillan:2005:GCB

[166] I. McQuillan. The generative capac-ity of block-synchronized context-freegrammars. Theoretical Computer Sci-ence, 337(1–3):119–133, June 9, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Cheng:2005:SLM

[167] T. C. Edwin Cheng, Hans Kellerer,and Vladimir Kotov. Semi-on-line mul-tiprocessor scheduling with given to-tal processing time. Theoretical Com-puter Science, 337(1–3):134–146, June9, 2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Flocchini:2005:GAR

[168] Paola Flocchini, Giuseppe Prencipe,Nicola Santoro, and Peter Widmayer.Gathering of asynchronous robots withlimited visibility. Theoretical Com-puter Science, 337(1–3):147–168, June9, 2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chuan:2005:FCW

[169] Wai-Fong Chuan. Factors of character-istic words of irrational numbers. The-oretical Computer Science, 337(1–3):169–182, June 9, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Moriya:2005:SAC

[170] Etsuro Moriya, Dieter Hofbauer, MariaHuber, and Friedrich Otto. On state-alternating context-free grammars.Theoretical Computer Science, 337(1–3):183–216, June 9, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bille:2005:STE

[171] Philip Bille. A survey on tree editdistance and related problems. The-oretical Computer Science, 337(1–3):217–239, June 9, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 58

Dias:2005:GBG

[172] Vania M. F. Dias, Celina M. H.de Figueiredo, and Jayme L. Szwarc-fiter. Generating bicliques of a graph inlexicographic order. Theoretical Com-puter Science, 337(1–3):240–248, June9, 2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Elkin:2005:ASP

[173] Michael Elkin and David Peleg. Ap-proximating k-spanner problems fork > 2. Theoretical Computer Sci-ence, 337(1–3):249–277, June 9, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Guelev:2005:CDD

[174] Dimitar P. Guelev and Dang VanHung. On the completeness and de-cidability of duration calculus with it-eration. Theoretical Computer Sci-ence, 337(1–3):278–304, June 9, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Chen:2005:AMV

[175] Jianer Chen and Iyad A. Kanj. On ap-proximating minimum vertex cover forgraphs with perfect matching. The-oretical Computer Science, 337(1–3):305–318, June 9, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Aigner:2005:PPT

[176] Martin Aigner, Gianluca De Marco,and Manuela Montangero. The plural-ity problem with three colors and more.Theoretical Computer Science, 337(1–3):319–330, June 9, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Manthey:2005:ICH

[177] Bodo Manthey and Rudiger Reischuk.The intractability of computing theHamming distance. Theoretical Com-puter Science, 337(1–3):331–346, June9, 2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hoory:2005:CUS

[178] Shlomo Hoory and Stefan Szeider.Computing unsatisfiable k-SAT in-stances with few occurrences per vari-able. Theoretical Computer Science,337(1–3):347–359, June 9, 2005. CO-DEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Chou:2005:CCD

[179] Arthur W. Chou and Ker-I Ko. Thecomputational complexity of distancefunctions of two-dimensional domains.Theoretical Computer Science, 337(1–3):360–369, June 9, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hsieh:2005:ELF

[180] Sun-Yuan Hsieh. Embedding longestfault-free paths onto star graphs withmore vertex faults. Theoretical Com-puter Science, 337(1–3):370–378, June9, 2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bruin:2005:CFL

[181] H. Bruin and O. Volkova. The com-plexity of Fibonacci-like kneading se-quences. Theoretical Computer Sci-ence, 337(1–3):379–389, June 9, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 59

Huang:2005:AWE

[182] Li-Sha Huang, Minming Li, andBo Zhang. Approximation of Walrasianequilibrium in single-minded auctions.Theoretical Computer Science, 337(1–3):390–398, June 9, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:AIh

[183] Anonymous. Author index. The-oretical Computer Science, 337(1–3):399–400, June 9, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:EBh

[184] Anonymous. Editorial board. The-oretical Computer Science, 337(1–3):v–ix, June 9, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Borzyszkowski:2005:TST

[185] Andrzej M. Borzyszkowski and PhilippeDarondeau. Transition systems with-out transitions. Theoretical ComputerScience, 338(1–3):1–16, June 10, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Jeffrey:2005:FAM

[186] Alan Jeffrey and Julian Rathke. Afully abstract may testing semantics forconcurrent objects. Theoretical Com-puter Science, 338(1–3):17–63, June 10,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

DAgostino:2005:ABQ

[187] Giovanna D’Agostino and GiacomoLenzi. An axiomatization of bisim-

ulation quantifiers via the µ-calculus.Theoretical Computer Science, 338(1–3):64–95, June 10, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fu:2005:QOB

[188] Yuxi Fu. On quasi-open bisimulation.Theoretical Computer Science, 338(1–3):96–126, June 10, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Sakama:2005:ODT

[189] Chiaki Sakama. Ordering default theo-ries and nonmonotonic logic programs.Theoretical Computer Science, 338(1–3):127–152, June 10, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Flanagan:2005:MVM

[190] Cormac Flanagan, Stephen N. Freund,Shaz Qadeer, and Sanjit A. Seshia.Modular verification of multithreadedprograms. Theoretical Computer Sci-ence, 338(1–3):153–183, June 10, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Worrell:2005:FSF

[191] James Worrell. On the final sequenceof a finitary set functor. Theoreti-cal Computer Science, 338(1–3):184–199, June 10, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hernest:2005:CAF

[192] Mircea-Dan Hernest and Ulrich Kohlen-bach. A complexity analysis of func-tional interpretations. TheoreticalComputer Science, 338(1–3):200–246,

REFERENCES 60

June 10, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Chevalier:2005:NDP

[193] Yannick Chevalier, Ralf Kusters,Michael Rusinowitch, and Mathieu Tu-ruani. An NP decision procedure forprotocol insecurity with XOR. The-oretical Computer Science, 338(1–3):247–274, June 10, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fritz:2005:SRA

[194] Carsten Fritz and Thomas Wilke. Sim-ulation relations for alternating Buchiautomata. Theoretical Computer Sci-ence, 338(1–3):275–314, June 10, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Murawski:2005:FLS

[195] Andrzej S. Murawski. Functions withlocal state: Regularity and undecid-ability. Theoretical Computer Sci-ence, 338(1–3):315–349, June 10, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bueno:2005:TTC

[196] Antonio Bueno, Valentın Valero, andFernando Cuartero. A translationof TPALp into a class of timed-probabilistic Petri nets. Theoreti-cal Computer Science, 338(1–3):350–392, June 10, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Boreale:2005:MSA

[197] Michele Boreale and Maria GraziaBuscemi. A method for symbolic anal-

ysis of security protocols. Theoreti-cal Computer Science, 338(1–3):393–425, June 10, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:AIi

[198] Anonymous. Author index. The-oretical Computer Science, 338(1–3):426, June 10, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:EBi


Harju:2005:P

[200] T. Harju, J. Karhumaki, and A. Restivo.Preface. Theoretical Computer Science,339(1):1–2, June 11, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Adian:2005:DPO

[201] S. I. Adian. Divisibility problem for onerelator monoids. Theoretical ComputerScience, 339(1):3–6, June 11, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Currie:2005:PAT

[202] James D. Currie. Pattern avoid-ance: themes and variations. The-oretical Computer Science, 339(1):7–18, June 11, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 61

Rampersad:2005:ALS

[203] Narad Rampersad, Jeffrey Shallit, andMing wei Wang. Avoiding largesquares in infinite binary words. The-oretical Computer Science, 339(1):19–34, June 11, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gasieniec:2005:SES

[204] Leszek Gasieniec, Roman Kolpakov,and Igor Potapov. Space efficientsearch for maximal repetitions. The-oretical Computer Science, 339(1):35–48, June 11, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Constantinescu:2005:GFW

[205] Sorin Constantinescu and Lucian Ilie.Generalised fine and Wilf’s theorem forarbitrary number of periods. Theo-retical Computer Science, 339(1):49–60, June 11, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Holub:2005:PED

[206] Stepan Holub. A proof of the extendedDuval’s conjecture. Theoretical Com-puter Science, 339(1):61–67, June 11,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Frid:2005:SLA

[207] A. E. Frid. Sequences of linear arith-metical complexity. Theoretical Com-puter Science, 339(1):68–87, June 11,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Araujo:2005:SWC

[208] Isabel M. Araujo and VeroniqueBruyere. Sturmian words and a cri-terium by Michaux–Villemaire. The-oretical Computer Science, 339(1):88–102, June 11, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Leve:2005:CAF

[209] F. Leve and G. Richomme. On aconjecture about finite fixed points ofmorphisms. Theoretical Computer Sci-ence, 339(1):103–128, June 11, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Hivert:2005:ABS

[210] F. Hivert, J.-C. Novelli, and J.-Y. Thi-bon. The algebra of binary search trees.Theoretical Computer Science, 339(1):129–165, June 11, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:EBj

[211] Anonymous. Editorial board. The-oretical Computer Science, 339(1):v–ix, June 11, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chen:2005:MBM

[212] Yijia Chen, Jorg Flum, and MartinGrohe. Machine-based methods in pa-rameterized complexity theory. The-oretical Computer Science, 339(2–3):167–199, June 12, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 62

Maletti:2005:HDC

[213] Andreas Maletti. HASSE diagrams forclasses of deterministic bottom-up tree-to-tree-series transformations. Theoret-ical Computer Science, 339(2–3):200–240, June 12, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zhang:2005:PAL

[214] Shengyu Zhang. On the power ofAmbainis lower bounds. Theoreti-cal Computer Science, 339(2–3):241–256, June 12, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lin:2005:SCP

[215] Cheng-Kuan Lin, Hua-Min Huang, andLih-Hsing Hsu. The super connectiv-ity of the pancake graphs and the su-per laceability of the star graphs. The-oretical Computer Science, 339(2–3):257–271, June 12, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bazgan:2005:CSD

[216] Cristina Bazgan, Bruno Escoffier, andVangelis Th. Paschos. Complete-ness in standard and differential ap-proximation classes: Poly-(D)APX-and (D)PTAS-completeness. Theoret-ical Computer Science, 339(2–3):272–292, June 12, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

He:2005:OSO

[217] Yong He and Yiwei Jiang. Opti-mal semi-online preemptive algorithmsfor machine covering on two uniform

machines. Theoretical Computer Sci-ence, 339(2–3):293–314, June 12, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bagchi:2005:SLM

[218] Amitabha Bagchi, Amitabh Chaud-hary, and Petr Kolman. Short lengthMenger’s theorem and reliable opticalrouting. Theoretical Computer Sci-ence, 339(2–3):315–332, June 12, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Damaschke:2005:QLL

[219] Peter Damaschke and Zhen Zhou. Onqueuing lengths in on-line switching.Theoretical Computer Science, 339(2–3):333–343, June 12, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Elder:2005:CFC

[220] Murray Elder. A context-free anda 1-counter geodesic language for aBaumslag–Solitar group. Theoreti-cal Computer Science, 339(2–3):344–371, June 12, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:AIj

[221] Anonymous. Author index. Theoret-ical Computer Science, 339(2–3):372–373, June 12, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gorrieri:2005:TFS

[222] Roberto Gorrieri and Fabio Mar-tinelli. Theoretical foundations of se-curity analysis and design II. The-oretical Computer Science, 340(1):1–

REFERENCES 63

2, June 13, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Pierro:2005:MCP

[223] Alessandra Di Pierro, Chris Hankin,and Herbert Wiklicky. Measuring theconfinement of probabilistic systems.Theoretical Computer Science, 340(1):3–56, June 13, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Herzog:2005:CID

[224] Jonathan Herzog. A computational in-terpretation of Dolev–Yao adversaries.Theoretical Computer Science, 340(1):57–81, June 13, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Rohrmair:2005:UDI

[225] Gordon Thomas Rohrmair and GavinLowe. Using data-independence in theanalysis of intrusion detection systems.Theoretical Computer Science, 340(1):82–101, June 13, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bhargavan:2005:SWS

[226] Karthikeyan Bhargavan, Cedric Four-net, and Andrew D. Gordon. A seman-tics for web services authentication.Theoretical Computer Science, 340(1):102–153, June 13, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zunino:2005:WPE

[227] Roberto Zunino and Pierpaolo Degano.Weakening the perfect encryption as-sumption in Dolev–Yao adversaries.

Theoretical Computer Science, 340(1):154–178, June 13, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:EBk


deLuca:2005:P

[229] A. de Luca, F. Mignosi, D. Perrin,and G. Rozenberg. Preface. Theo-retical Computer Science, 340(2):179–185, June 27, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:EAF

[230] Anonymous. Editorial: From Antonio’sformer students. Theoretical ComputerScience, 340(2):186–187, June 27, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Salomaa:2005:CBS

[231] Arto Salomaa. Connections betweensubwords and certain matrix mappings.Theoretical Computer Science, 340(2):188–203, June 27, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Araujo:2005:WDS

[232] Isabel M. Araujo and VeroniqueBruyere. Words derivated from Stur-mian words. Theoretical Computer Sci-ence, 340(2):204–219, June 27, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 64

Carpi:2005:CCS

[233] Arturo Carpi and Aldo de Luca. Codesof central Sturmian words. Theo-retical Computer Science, 340(2):220–239, June 27, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Felice:2005:EPF

[234] Clelia De Felice. An enhanced propertyof factorizing codes. Theoretical Com-puter Science, 340(2):240–256, June 27,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Reghizzi:2005:TRG

[235] Stefano Crespi Reghizzi and MatteoPradella. Tile rewriting grammars andpicture languages. Theoretical Com-puter Science, 340(2):257–272, June 27,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Harju:2005:CBP

[236] Tero Harju and Dirk Nowotka. Count-ing bordered and primitive words witha fixed weight. Theoretical ComputerScience, 340(2):273–279, June 27, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Berstel:2005:GRF

[237] Jean Berstel. Growth of repetition-freewords — a review. Theoretical Com-puter Science, 340(2):280–290, June 27,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Esik:2005:ARR

[238] Zoltan Esik and Pascal Weil. Al-gebraic recognizability of regular tree

languages. Theoretical Computer Sci-ence, 340(2):291–321, June 27, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Karhumaki:2005:CC

[239] Juhani Karhumaki, Michel Latteux,and Ion Petre. Commutation withcodes. Theoretical Computer Sci-ence, 340(2):322–333, June 27, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Borel:2005:PFB

[240] J.-P. Borel and C. Reutenauer. Palin-dromic factors of billiard words. Theo-retical Computer Science, 340(2):334–348, June 27, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bonizzoni:2005:RSL

[241] Paola Bonizzoni and Giancarlo Mauri.Regular splicing languages and sub-classes. Theoretical Computer Sci-ence, 340(2):349–363, June 27, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Choffrut:2005:CTD

[242] Christian Choffrut and Berke Durak.Collage of two-dimensional words. The-oretical Computer Science, 340(2):364–380, June 27, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Beal:2005:CSC

[243] Marie-Pierre Beal and Dominique Per-rin. Codes and sofic constraints. Theo-retical Computer Science, 340(2):381–393, June 27, 2005. CODEN TC-

REFERENCES 65


Bertoni:2005:SSQ

[244] Alberto Bertoni, Carlo Mereghetti, andBeatrice Palano. Small size quan-tum automata recognizing some regu-lar languages. Theoretical ComputerScience, 340(2):394–407, June 27, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Anselmo:2005:NOR

[245] Marcella Anselmo, Dora Giammarresi,and Maria Madonia. New opera-tions and regular expressions for two-dimensional languages over one-letteralphabet. Theoretical Computer Sci-ence, 340(2):408–431, June 27, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Clement:2005:PFD

[246] Julien Clement, Jean-Pierre Duval,Giovanna Guaiana, Dominique Perrin,and Giuseppina Rindone. Parsing witha finite dictionary. Theoretical Com-puter Science, 340(2):432–442, June 27,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Pin:2005:TAT

[247] Jean-Eric Pin and Pedro V. Silva. Atopological approach to transductions.Theoretical Computer Science, 340(2):443–456, June 27, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Auinger:2005:CDP

[248] K. Auinger and B. Steinberg. Con-structing divisions into power groups.

Theoretical Computer Science, 341(1–3):1–21, September 5, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Chlamtac:2005:IAM

[249] Eden Chlamtac and Uriel Feige. Im-proved approximation of the minimumcover time. Theoretical Computer Sci-ence, 341(1–3):22–38, September 5,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chang:2005:OPE

[250] Yan-Cheng Chang and Chi-Jen Lu.Oblivious polynomial evaluation andoblivious neural learning. Theoreti-cal Computer Science, 341(1–3):39–54,September 5, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Heuberger:2005:AGE

[251] Clemens Heuberger, Rajendra Katti,Helmut Prodinger, and Xiaoyu Ruan.The alternating greedy expansion andapplications to computing digit expan-sions from left-to-right in cryptography.Theoretical Computer Science, 341(1–3):55–72, September 5, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Sawada:2005:OVE

[252] J. Sawada. Oracles for vertex elimina-tion orderings. Theoretical ComputerScience, 341(1–3):73–90, September 5,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gacs:2005:UTA

[253] Peter Gacs. Uniform test of algorithmicrandomness over a general space. Theo-

REFERENCES 66

retical Computer Science, 341(1–3):91–137, September 5, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Inoue:2005:SPO

[254] Atsuyuki Inoue, Akira Ito, Katsushi In-oue, and Tokio Okazaki. Some prop-erties of one-pebble Turing machineswith sublogarithmic space. Theoret-ical Computer Science, 341(1–3):138–149, September 5, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cheng:2005:IMB

[255] Xiaochun Cheng, Dantong Ouyang,Jiang Yunfei, and Chengqi Zhang. Animproved model-based method to testcircuit faults. Theoretical ComputerScience, 341(1–3):150–161, September5, 2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Collins:2005:CCR

[256] Pieter Collins. Continuity and com-putability of reachable sets. Theoret-ical Computer Science, 341(1–3):162–195, September 5, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lai:2005:SRN

[257] Cheng-Nan Lai and Gen-Huey Chen.Strong Rabin numbers of folded hy-percubes. Theoretical Computer Sci-ence, 341(1–3):196–215, September 5,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Schafer:2005:TMS

[258] Guido Schafer and Naveen Sivadasan.Topology matters: Smoothed competi-

tiveness of metrical task systems. The-oretical Computer Science, 341(1–3):216–246, September 5, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Cases:2005:TPD

[259] Blanca Cases and Manuel Alfonseca.Towards a proof of the decidabilityof the momentary stagnation of thegrowth function of D. TheoreticalComputer Science, 341(1–3):247–262,September 5, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

terBeek:2005:SS

[260] Maurice H. ter Beek, Carlos Martın-Vide, and Victor Mitrana. Synchro-nized shuffles. Theoretical ComputerScience, 341(1–3):263–275, September5, 2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Pirillo:2005:ICS

[261] Giuseppe Pirillo. Inequalities charac-terizing standard Sturmian and epis-turmian words. Theoretical ComputerScience, 341(1–3):276–292, September5, 2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Berthe:2005:SWA

[262] Valerie Berthe, Srecko Brlek, andPhilippe Choquette. Smooth wordsover arbitrary alphabets. Theoreti-cal Computer Science, 341(1–3):293–310, September 5, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 67

Maitra:2005:RMP

[263] Subhamoy Maitra, Kishan ChandGupta, and Ayineedi Venkateswarlu.Results on multiples of primitive poly-nomials and their products over GF(2).Theoretical Computer Science, 341(1–3):311–343, September 5, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Dang:2005:CLD

[264] Zhe Dang, Oscar H. Ibarra, and Jian-wen Su. On composition and looka-head delegation of e-services modeledby automata. Theoretical ComputerScience, 341(1–3):344–363, September5, 2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Nagamochi:2005:RAB

[265] Hiroshi Nagamochi, Kengo Iwata, andToshimasa Ishii. A robust algorithm forbisecting a triconnected graph with tworesource sets. Theoretical ComputerScience, 341(1–3):364–378, September5, 2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Tronicek:2005:SSA

[266] Zdenek Tronıcek and Ayumi Shino-hara. The size of subsequence au-tomaton. Theoretical Computer Sci-ence, 341(1–3):379–384, September 5,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Wu:2005:AWH

[267] Quincy Wu, Chin Lung Lu, andRichard Chia-Tung Lee. The ap-proximability of the weighted Hamil-tonian path completion problem on atree. Theoretical Computer Science,

341(1–3):385–397, September 5, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Chen:2005:PAA

[268] Wei-Mei Chen. Probabilistic analysis ofalgorithms for the Dutch national flagproblem. Theoretical Computer Sci-ence, 341(1–3):398–410, September 5,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hung:2005:LTA

[269] Ruo-Wei Hung and Maw-Shang Chang.Linear-time algorithms for the Hamil-tonian problems on distance-hereditarygraphs. Theoretical Computer Science,341(1–3):411–440, September 5, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Anonymous:2005:EBl

[270] Anonymous. Editorial board. Theo-retical Computer Science, 341(1–3):v–ix, September 5, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Moggi:2005:ASS

[271] Eugenio Moggi. Applied semantics:Selected topics. Theoretical Com-puter Science, 342(1):1–2, September6, 2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Abbott:2005:CCS

[272] Michael Abbott, Thorsten Altenkirch,and Neil Ghani. Containers: Con-structing strictly positive types. The-oretical Computer Science, 342(1):3–27, September 6, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 68

Shinwell:2005:MSF

[273] Mark R. Shinwell and Andrew M. Pitts.On a monadic semantics for freshness.Theoretical Computer Science, 342(1):28–55, September 6, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Cachera:2005:EDF

[274] David Cachera, Thomas Jensen, DavidPichardie, and Vlad Rusu. Extract-ing a data flow analyser in construc-tive logic. Theoretical Computer Sci-ence, 342(1):56–78, September 6, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Alves:2005:WLL

[275] Sandra Alves and Mario Florido. Weaklinearization of the lambda calculus.Theoretical Computer Science, 342(1):79–103, September 6, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Gardner:2005:MDW

[276] Philippa Gardner and Sergio Maffeis.Modelling dynamic web data. Theo-retical Computer Science, 342(1):104–131, September 6, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Laird:2005:LBD

[277] J. Laird. Locally Boolean domains.Theoretical Computer Science, 342(1):132–148, September 6, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Ager:2005:FCB

[278] Mads Sig Ager, Olivier Danvy, andJan Midtgaard. A functional corre-spondence between monadic evaluatorsand abstract machines for languageswith computational effects. Theoreti-cal Computer Science, 342(1):149–172,September 6, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:EBm

[279] Anonymous. Editorial board. The-oretical Computer Science, 342(1):v–ix, September 6, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Courcelle:2005:RSG

[280] Bruno Courcelle and Pascal Weil. Therecognizability of sets of graphs is a ro-bust property. Theoretical ComputerScience, 342(2–3):173–228, September7, 2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Haghverdi:2005:BRD

[281] Esfandiar Haghverdi, Paulo Tabuada,and George J. Pappas. Bisimulationrelations for dynamical, control, andhybrid systems. Theoretical ComputerScience, 342(2–3):229–261, September7, 2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Oles:2005:PIP

[282] Frank J. Oles. Precedence–inclusionpatterns and relational learning. The-oretical Computer Science, 342(2–3):262–315, September 7, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 69

Cleaveland:2005:PTL

[283] Rance Cleaveland, S. PurushothamanIyer, and Murali Narasimha. Proba-bilistic temporal logics via the modalmu-calculus. Theoretical ComputerScience, 342(2–3):316–350, September7, 2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Loyer:2005:WAL

[284] Yann Loyer and Umberto Straccia.Any-world assumptions in logic pro-gramming. Theoretical Computer Sci-ence, 342(2–3):351–381, September 7,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Nomikos:2005:TST

[285] Christos Nomikos, Panos Rondogian-nis, and Manolis Gergatsoulis. Tem-poral stratification tests for linear andbranching-time deductive databases.Theoretical Computer Science, 342(2–3):382–415, September 7, 2005. CO-DEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Abramsky:2005:GTM

[286] Samson Abramsky and Marios Mavron-icolas. Game theory meets theoreticalcomputer science. Theoretical Com-puter Science, 343(1–2):1–3, October10, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Lopez:2005:MMT

[287] Luis Lopez, Gemma del Rey Al-mansa, Stephane Paquelet, and Anto-nio Fernandez. A mathematical modelfor the TCP Tragedy of the Commons.

Theoretical Computer Science, 343(1–2):4–26, October 10, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Ambuhl:2005:ARA

[288] Christoph Ambuhl, Andrea E. F.Clementi, Paolo Penna, GianlucaRossi, and Riccardo Silvestri. On theapproximability of the range assign-ment problem on radio networks inpresence of selfish agents. Theoret-ical Computer Science, 343(1–2):27–41, October 10, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Aichholzer:2005:GT

[289] Oswin Aichholzer, David Bremner,Erik D. Demaine, Ferran Hurtado,Evangelos Kranakis, Hannes Krasser,Suneeta Ramaswami, Saurabh Sethia,and Jorge Urrutia. Games on tri-angulations. Theoretical ComputerScience, 343(1–2):42–71, October 10,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hearn:2005:PCS

[290] Robert A. Hearn and Erik D. Demaine.PSPACE-completeness of sliding-blockpuzzles and other problems throughthe nondeterministic constraint logicmodel of computation. Theoreti-cal Computer Science, 343(1–2):72–96, October 10, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Shoham:2005:NCC

[291] Yoav Shoham and Moshe Tennen-holtz. Non-cooperative computation:Boolean functions with correctness and

REFERENCES 70

exclusivity. Theoretical Computer Sci-ence, 343(1–2):97–113, October 10,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Feigenbaum:2005:CDI

[292] Joan Feigenbaum, Lance Fortnow,David M. Pennock, and Rahul Sami.Computation in a distributed informa-tion market. Theoretical Computer Sci-ence, 343(1–2):114–132, October 10,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gairing:2005:SCE

[293] M. Gairing, T. Lucking, M. Mavronico-las, B. Monien, and P. Spirakis. Struc-ture and complexity of extreme Nashequilibria. Theoretical Computer Sci-ence, 343(1–2):133–157, October 10,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Verbitsky:2005:FOD

[294] Oleg Verbitsky. The first order de-finability of graphs with separatorsvia the Ehrenfeucht game. Theoret-ical Computer Science, 343(1–2):158–176, October 10, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Laurent:2005:SVS

[295] Olivier Laurent. Syntax vs. seman-tics: A polarized approach. Theoret-ical Computer Science, 343(1–2):177–206, October 10, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Murawski:2005:GCS

[296] Andrzej S. Murawski. Games for com-plexity of second-order call-by-name

programs. Theoretical Computer Sci-ence, 343(1–2):207–236, October 10,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Mellies:2005:SAS

[297] Paul-Andre Mellies. Sequential algo-rithms and strongly stable functions.Theoretical Computer Science, 343(1–2):237–281, October 10, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Anonymous:2005:EBn

[298] Anonymous. Editorial board. Theo-retical Computer Science, 343(1–2):v–ix, October 10, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

deBoer:2005:Pb

[299] Frank de Boer and Marcello Bon-sangue. Preface. Theoretical ComputerScience, 343(3):283–284, October 17,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bergstra:2005:PPA

[300] J. A. Bergstra and I. Bethke. Po-larized process algebra with reactivecomposition. Theoretical ComputerScience, 343(3):285–304, October 17,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Diaconescu:2005:BSH

[301] Razvan Diaconescu. Behavioural spec-ification for hierarchical object compo-sition. Theoretical Computer Science,343(3):305–331, October 17, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 71

Groote:2005:PBE

[302] Jan Friso Groote and Tim A. C.Willemse. Parameterised Booleanequation systems. Theoretical Com-puter Science, 343(3):332–369, October17, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Gurevich:2005:SEA

[303] Yuri Gurevich, Benjamin Rossman,and Wolfram Schulte. Semantic essenceof AsmL. Theoretical Computer Sci-ence, 343(3):370–412, October 17,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Pierik:2005:POL

[304] Cees Pierik and Frank S. de Boer. Aproof outline logic for object-orientedprogramming. Theoretical ComputerScience, 343(3):413–442, October 17,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Rutten:2005:TCS

[305] J. J. M. M. Rutten. A tutorial oncoinductive stream calculus and sig-nal flow graphs. Theoretical ComputerScience, 343(3):443–481, October 17,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Stark:2005:FSV

[306] Robert F. Stark. Formal specifi-cation and verification of the C#thread model. Theoretical ComputerScience, 343(3):482–508, October 17,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Wehrheim:2005:STV

[307] Heike Wehrheim. Slicing techniques forverification re-use. Theoretical Com-puter Science, 343(3):509–528, October17, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Nikoletseas:2005:P

[308] Sotiris Nikoletseas and Jose Rolim.Preface. Theoretical Computer Sci-ence, 344(1):1–2, November 11, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Papadimitriou:2005:CRG

[309] Christos H. Papadimitriou and DavidRatajczak. On a conjecture related togeometric routing. Theoretical Com-puter Science, 344(1):3–14, November11, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Enachescu:2005:SFA

[310] Mihaela Enachescu, Ashish Goel,Ramesh Govindan, and Rajeev Mot-wani. Scale-free aggregation in sensornetworks. Theoretical Computer Sci-ence, 344(1):15–29, November 11, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Floreen:2005:EAB

[311] Patrik Floreen, Petteri Kaski, JukkaKohonen, and Pekka Orponen. Ex-act and approximate balanced datagathering in energy-constrained sensornetworks. Theoretical Computer Sci-ence, 344(1):30–46, November 11, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 72

ODell:2005:TAC

[312] R. O’Dell and R. Wattenhofer. The-oretical aspects of connectivity-basedmulti-hop positioning. Theoreti-cal Computer Science, 344(1):47–68,November 11, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Leone:2005:TDM

[313] Pierre Leone and Jose Rolim. Towardsa dynamical model for wireless sensornetworks. Theoretical Computer Sci-ence, 344(1):69–85, November 11, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Stupp:2005:EUR

[314] Gideon Stupp and Moshe Sidi. Theexpected uncertainty of range-free lo-calization protocols in sensor networks.Theoretical Computer Science, 344(1):86–99, November 11, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Anonymous:2005:Pa

[315] Anonymous. Preface. Theoretical Com-puter Science, 344(1):v–ix, November11, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Rozenberg:2005:Pb

[316] G. Rozenberg. Preface. Theoreti-cal Computer Science, 344(2–3):101–102, November 17, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lu:2005:AES

[317] Hongtao Lu, Ruiming Shen, and Fu-Lai Chung. Absolute exponential sta-bility of a class of recurrent neural net-works with multiple and variable de-lays. Theoretical Computer Science,344(2–3):103–119, November 17, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ibarra:2005:DVN

[318] Oscar H. Ibarra. On determinism ver-sus nondeterminism in P systems. The-oretical Computer Science, 344(2–3):120–133, November 17, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Ying:2005:TCB

[319] Mingsheng Ying. A theory of computa-tion based on quantum logic (I). The-oretical Computer Science, 344(2–3):134–207, November 17, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Fischer:2005:ODI

[320] Simon Fischer and Ingo Wegener. Theone-dimensional Ising model: Muta-tion versus recombination. Theoret-ical Computer Science, 344(2–3):208–225, November 17, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Verlan:2005:BRE

[321] Sergey Verlan. A boundary resulton enhanced time-varying distributedH systems with parallel computa-tions. Theoretical Computer Science,344(2–3):226–242, November 17, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 73

Dorigo:2005:ACO

[322] Marco Dorigo and Christian Blum. Antcolony optimization theory: A sur-vey. Theoretical Computer Science,344(2–3):243–278, November 17, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Soloveichik:2005:CPB

[323] David Soloveichik and Erik Winfree.The computational power of Benensonautomata. Theoretical Computer Sci-ence, 344(2–3):279–297, November 17,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).See erratum [2397].

Goulon-Sigwalt-Abram:2005:HNR

[324] Aurelie Goulon-Sigwalt-Abram, ArthurDuprat, and Gerard Dreyfus. FromHopfield nets to recursive networks tograph machines: Numerical machinelearning for structured data. Theoret-ical Computer Science, 344(2–3):298–334, November 17, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Shi:2005:QCT

[325] Yaoyun Shi. Quantum and classicaltradeoffs. Theoretical Computer Sci-ence, 344(2–3):335–345, November 17,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jensen:2005:SI

[326] Kurt Jensen and Andreas Podelski.Special issue. Theoretical ComputerScience, 345(1):1, November 21, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Baier:2005:ECT

[327] Christel Baier, Holger Hermanns,Joost-Pieter Katoen, and Boudewijn R.Haverkort. Efficient computation oftime-bounded reachability probabili-ties in uniform continuous-time Markovdecision processes. Theoretical Com-puter Science, 345(1):2–26, November21, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Lugiez:2005:POS

[328] D. Lugiez, P. Niebert, and S. Zennou.A partial order semantics approach tothe clock explosion problem of timedautomata. Theoretical Computer Sci-ence, 345(1):27–59, November 21, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Geldenhuys:2005:MEF

[329] Jaco Geldenhuys and Antti Valmari.More efficient on-the-fly LTL verifica-tion with Tarjan’s algorithm. The-oretical Computer Science, 345(1):60–82, November 21, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kupferman:2005:CC

[330] Orna Kupferman and Moshe Y. Vardi.From complementation to certification.Theoretical Computer Science, 345(1):83–100, November 21, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

McMillan:2005:ITP

[331] K. L. McMillan. An interpolating the-orem prover. Theoretical ComputerScience, 345(1):101–121, November 21,

REFERENCES 74


Su:2005:CPS

[332] Zhendong Su and David Wagner. Aclass of polynomially solvable rangeconstraints for interval analysis with-out widenings. Theoretical ComputerScience, 345(1):122–138, November 21,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

deAlfaro:2005:MCD

[333] Luca de Alfaro, Marco Faella,Thomas A. Henzinger, Rupak Majum-dar, and Marielle Stoelinga. Modelchecking discounted temporal proper-ties. Theoretical Computer Science,345(1):139–170, November 21, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Anonymous:2005:SI

[334] Anonymous. Special issue. Theo-retical Computer Science, 345(1):v–ix,November 21, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Koubek:2005:P

[335] V. Koubek and J. Kratochvıl. Pref-ace. Theoretical Computer Science,345(2–3):171–172, November 22, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bab:2005:OQR

[336] Sebastian Bab and Arfst Nickelsen.One query reducibilities between par-tial information classes. TheoreticalComputer Science, 345(2–3):173–189,November 22, 2005. CODEN TC-


Beal:2005:HSE

[337] Marie-Pierre Beal, Francesca Fiorenzi,and Dominique Perrin. A hierarchy ofshift equivalent sofic shifts. Theoret-ical Computer Science, 345(2–3):190–205, November 22, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Beaudry:2005:CAD

[338] Martin Beaudry, Jose M. Fernandez,and Markus Holzer. A common alge-braic description for probabilistic andquantum computations. TheoreticalComputer Science, 345(2–3):206–234,November 22, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bernardi:2005:NDS

[339] Vincent Bernardi, Bruno Durand, En-rico Formenti, and Jarkko Kari. A newdimension sensitive property for cellu-lar automata. Theoretical ComputerScience, 345(2–3):235–247, November22, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Beygelzimer:2005:EPC

[340] Alina Beygelzimer and Mitsunori Ogi-hara. The enumerability of P collapsesP to NC. Theoretical Computer Sci-ence, 345(2–3):248–259, November 22,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bohler:2005:GP

[341] E. Bohler, C. Glaßer, B. Schwarz, andK. W. Wagner. Generation prob-

REFERENCES 75

lems. Theoretical Computer Science,345(2–3):260–295, November 22, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Czeizler:2005:NPW

[342] Elena Czeizler. The non-parametrizabilityof the word equation xyz. Theoret-ical Computer Science, 345(2–3):296–303, November 22, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Domaratzki:2005:DTB

[343] Michael Domaratzki and Kai Salomaa.Decidability of trajectory-based equa-tions. Theoretical Computer Science,345(2–3):304–330, November 22, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Fraigniaud:2005:GEF

[344] Pierre Fraigniaud, David Ilcinkas, GuyPeer, Andrzej Pelc, and David Peleg.Graph exploration by a finite automa-ton. Theoretical Computer Science,345(2–3):331–344, November 22, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Hemaspaandra:2005:ASI

[345] Edith Hemaspaandra, Lane A. Hemas-paandra, and Harald Hempel. All su-perlinear inverse schemes are coNP-hard. Theoretical Computer Science,345(2–3):345–358, November 22, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ilie:2005:GRT

[346] Lucian Ilie, Pascal Ochem, and JeffreyShallit. A generalization of repetition

threshold. Theoretical Computer Sci-ence, 345(2–3):359–369, November 22,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kawachi:2005:UTQ

[347] Akinori Kawachi, Hirotada Kobaya-shi, Takeshi Koshiba, and Raymond H.Putra. Universal test for quantumone-way permutations. TheoreticalComputer Science, 345(2–3):370–385,November 22, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lee:2005:RBS

[348] Troy Lee and Andrei Romashchenko.Resource bounded symmetry of infor-mation revisited. Theoretical ComputerScience, 345(2–3):386–405, November22, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Nordh:2005:CEI

[349] Gustav Nordh. The complexity ofequivalence and isomorphism of sys-tems of equations over finite groups.Theoretical Computer Science, 345(2–3):406–424, November 22, 2005. CO-DEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Okhotin:2005:DC

[350] Alexander Okhotin. The dual of con-catenation. Theoretical Computer Sci-ence, 345(2–3):425–447, November 22,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Selivanov:2005:RDD

[351] Victor L. Selivanov and Klaus W. Wag-ner. A reducibility for the dot-depth

REFERENCES 76

hierarchy. Theoretical Computer Sci-ence, 345(2–3):448–472, November 22,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Wich:2005:SA

[352] Klaus Wich. Sublogarithmic ambi-guity. Theoretical Computer Science,345(2–3):473–504, November 22, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Cerone:2005:P

[353] Antonio Cerone and Alessandra DiPierro. Preface. Theoretical Com-puter Science, 346(1):1–2, November23, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Lermer:2005:TET

[354] Karl Lermer, Colin J. Fidge, and Ian J.Hayes. A theory for execution-timederivation in real-time programs. The-oretical Computer Science, 346(1):3–27, November 23, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bravetti:2005:QIT

[355] Mario Bravetti, Roberto Gorrieri,Roberto Lucchi, and Gianluigi Zavat-taro. Quantitative information in thetuple space coordination model. The-oretical Computer Science, 346(1):28–57, November 23, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Alpuente:2005:SFA

[356] Marıa Alpuente, Marıa del Mar Gal-lardo, Ernesto Pimentel, and AliciaVillanueva. A semantic framework for

the abstract model checking of tccp.Theoretical Computer Science, 346(1):58–95, November 23, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Hurd:2005:PGC

[357] Joe Hurd, Annabelle McIver, and Car-roll Morgan. Probabilistic guardedcommands mechanized in HOL. The-oretical Computer Science, 346(1):96–112, November 23, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Huth:2005:FSA

[358] Michael Huth. On finite-state ap-proximants for probabilistic computa-tion tree logic. Theoretical ComputerScience, 346(1):113–134, November 23,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lluch-Lafuente:2005:QCC

[359] Alberto Lluch-Lafuente and Ugo Mon-tanari. Quantitative µ-calculus andCTL defined over constraint semirings.Theoretical Computer Science, 346(1):135–160, November 23, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Harrison:2005:SES

[360] P. G. Harrison and T. T. Lee. Separa-ble equilibrium state probabilities viatime reversal in Markovian process al-gebra. Theoretical Computer Science,346(1):161–182, November 23, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 77

Anonymous:2005:Pb


Pergola:2005:P

[362] Elisa Pergola and Simone Rinaldi.Preface. Theoretical Computer Sci-ence, 346(2–3):183, November 28, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Pergola:2005:MAD

[363] E. Pergola and S. Rinaldi. In memo-riam: Alberto Del Lungo (1965–2003). Theoretical Computer Science,346(2–3):184–188, November 28, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Baril:2005:MCL

[364] Jean-Luc Baril and Vincent Va-jnovszki. Minimal change list for Lucasstrings and some graph theoretic con-sequences. Theoretical Computer Sci-ence, 346(2–3):189–199, November 28,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Brlek:2005:DGT

[365] S. Brlek, G. Labelle, and A. Lacasse.The discrete Green Theorem and someapplications in discrete geometry. The-oretical Computer Science, 346(2–3):200–225, November 28, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Chavanon:2005:GED

[366] Frederic Chavanon, Matthieu Latapy,Michel Morvan, Eric Remila, and Lau-rent Vuillon. Graph encoding of 2D. Theoretical Computer Science,346(2–3):226–253, November 28, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

deMier:2005:STB

[367] Anna de Mier and Marc Noy. A solu-tion to the tennis ball problem. The-oretical Computer Science, 346(2–3):254–264, November 28, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Epifanio:2005:MCF

[368] Chiara Epifanio and Filippo Mignosi. Amultidimensional critical factorizationtheorem. Theoretical Computer Sci-ence, 346(2–3):265–280, November 28,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Garduno:2005:ISV

[369] Edgar Garduno and Gabor T. Herman.Implicit surface visualization of recon-structed biological molecules. Theoret-ical Computer Science, 346(2–3):281–299, November 28, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gerard:2005:RTD

[370] Y. Gerard. Reduction from three-dimensional discrete tomography tomulticommodity flow problem. The-oretical Computer Science, 346(2–3):300–306, November 28, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 78

Gouyou-Beauchamps:2005:ESC

[371] Dominique Gouyou-Beauchamps andPierre Leroux. Enumeration of sym-metry classes of convex polyominoeson the honeycomb lattice. Theoret-ical Computer Science, 346(2–3):307–334, November 28, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kuba:2005:SCN

[372] Attila Kuba and Murice Nivat. Asufficient condition for non-uniquenessin binary tomography with absorp-tion. Theoretical Computer Science,346(2–3):335–357, November 28, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Louchard:2005:MRU

[373] Guy Louchard. Monotone runs of uni-formly distributed integer random vari-ables: A probabilistic analysis. The-oretical Computer Science, 346(2–3):358–387, November 28, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Martinez:2005:EIA

[374] Conrado Martınez and Xavier Mo-linero. Efficient iteration in admis-sible combinatorial classes. Theoret-ical Computer Science, 346(2–3):388–417, November 28, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Massazza:2005:CCB

[375] P. Massazza and R. Radicioni. Oncomputing the coefficients of bivari-ate holonomic formal series. Theoret-ical Computer Science, 346(2–3):418–

438, November 28, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Picouleau:2005:RCP

[376] C. Picouleau. Reconstruction of con-vex polyominoes from orthogonal pro-jections of their contours. Theoret-ical Computer Science, 346(2–3):439–454, November 28, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Sulanke:2005:TDN

[377] Robert A. Sulanke. Three dimensionalNarayana and Schroder numbers. The-oretical Computer Science, 346(2–3):455–468, November 28, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Tijdeman:2005:RSM

[378] Robert Tijdeman. Rauzy substitu-tions and multi-dimensional Sturmianwords. Theoretical Computer Science,346(2–3):469–489, November 28, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Petkovic:2005:PVT

[379] Tatjana Petkovic and Saeed Salehi.Positive varieties of tree languages.Theoretical Computer Science, 347(1–2):1–35, November 30, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Bonizzoni:2005:RGT

[380] Paola Bonizzoni, Gianluca Della Ve-dova, and Riccardo Dondi. Reconcil-ing a gene tree to a species tree un-der the duplication cost model. Theo-retical Computer Science, 347(1–2):36–

REFERENCES 79


Chepoi:2005:ASS

[381] Victor D. Chepoi, Feodor F. Dragan,and Chenyu Yan. Additive sparse span-ners for graphs with bounded lengthof largest induced cycle. Theoreti-cal Computer Science, 347(1–2):54–75,November 30, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gurski:2005:RBN

[382] Frank Gurski and Egon Wanke. Onthe relationship between NLC-widthand linear NLC-width. Theoreti-cal Computer Science, 347(1–2):76–89,November 30, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Yamakami:2005:RBI

[383] Tomoyuki Yamakami and ToshioSuzuki. Resource bounded immunityand simplicity. Theoretical ComputerScience, 347(1–2):90–129, November30, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Georgiou:2005:EGR

[384] Chryssis Georgiou, Dariusz R. Kowal-ski, and Alexander A. Shvartsman. Ef-ficient gossip and robust distributedcomputation. Theoretical ComputerScience, 347(1–2):130–166, November30, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Asveld:2005:FCFa

[385] Peter R. J. Asveld. Fuzzy context-free languages—Part 1: Generalizedfuzzy context-free grammars. Theoret-ical Computer Science, 347(1–2):167–190, November 30, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Asveld:2005:FCFb

[386] Peter R. J. Asveld. Fuzzy context-free languages—Part 2: Recognitionand parsing algorithms. TheoreticalComputer Science, 347(1–2):191–213,November 30, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kiwiel:2005:FRS

[387] Krzysztof C. Kiwiel. On Floyd andRivest’s SELECT algorithm. Theoret-ical Computer Science, 347(1–2):214–238, November 30, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fredriksson:2005:SIT

[388] Kimmo Fredriksson, Gonzalo Navarro,and Esko Ukkonen. Sequential andindexed two-dimensional combinato-rial template matching allowing rota-tions. Theoretical Computer Science,347(1–2):239–275, November 30, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Fulop:2005:LDM

[389] Zoltan Fulop, Armin Kuhnemann, andHeiko Vogler. Linear deterministicmulti bottom-up tree transducers. The-oretical Computer Science, 347(1–2):276–287, November 30, 2005. CODEN

REFERENCES 80

TCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Liu:2005:ASM

[390] Zhaohui Liu and T. C. Edwin Cheng.Approximation schemes for minimiz-ing total (weighted) completion timewith release dates on a batch ma-chine. Theoretical Computer Science,347(1–2):288–298, November 30, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Schost:2005:TNE

[391] Eric Schost. There is no efficient reversederivation mode for discrete deriva-tives. Theoretical Computer Science,347(1–2):299–305, November 30, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Hsiao:2005:DRS

[392] H. K. Hsiao, Y. T. Yeh, and S. S. Yu.Dependences related to strict binaryrelations. Theoretical Computer Sci-ence, 347(1–2):306–324, November 30,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Miltersen:2005:CCD

[393] Peter Bro Miltersen, Jaikumar Rad-hakrishnan, and Ingo Wegener. Onconverting CNF to DNF. Theoreti-cal Computer Science, 347(1–2):325–335, November 30, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Castiglione:2005:ECP

[394] G. Castiglione, A. Frosini, A. Restivo,and S. Rinaldi. Enumeration ofL-convex polyominoes by rows and

columns. Theoretical Computer Sci-ence, 347(1–2):336–352, November 30,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Munarini:2005:CC

[395] Emanuele Munarini and DamianoTorri. Cayley continuants. Theoret-ical Computer Science, 347(1–2):353–369, November 30, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Frosini:2005:IPD

[396] Andrea Frosini, Maurice Nivat, andLaurent Vuillon. An introduction toperiodical discrete sets from a to-mographical perspective. TheoreticalComputer Science, 347(1–2):370–392,November 30, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Brunetti:2005:RGQ

[397] Sara Brunetti and Alain Daurat. Ran-dom generation of Q-convex sets. The-oretical Computer Science, 347(1–2):393–414, November 30, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Vinodchandran:2005:NCC

[398] N. V. Vinodchandran. A note on thecircuit complexity of PP. Theoreti-cal Computer Science, 347(1–2):415–418, November 30, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Harju:2005:CPB

[399] Tero Harju, Arto Lepisto, and DirkNowotka. A characterization of peri-odicity of bi-infinite words. Theoret-

REFERENCES 81

ical Computer Science, 347(1–2):419–422, November 30, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Feng:2005:SS

[400] Feng Feng, Xianzhong Zhao, andYoung Bae Jun. *-µ-semirings and *-λ-semirings. Theoretical Computer Sci-ence, 347(1–2):423–431, November 30,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Daurat:2005:SNC

[401] A. Daurat, Y. Gerard, and M. Nivat.Some necessary clarifications about thechords’ problem and the Partial DigestProblem. Theoretical Computer Sci-ence, 347(1–2):432–436, November 30,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Champarnaud:2005:ENR

[402] J.-M. Champarnaud and F. Coulon.Erratum to “NFA reduction algorithmsby means of regular inequalities” [The-oret. Comput. Sci. 327 (2004) 241–253]. Theoretical Computer Science,347(1–2):437–440, November 30, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic). See [3].

Anonymous:2005:EBo

[403] Anonymous. Editorial board. Theo-retical Computer Science, 347(1–2):v–ix, November 30, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Abramsky:2005:SAR

[404] Samson Abramsky. A structural ap-proach to reversible computation. The-oretical Computer Science, 347(3):441–

464, December 1, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Khasidashvili:2005:CFR

[405] Zurab Khasidashvili and John Glauert.The conflict-free Reduction Geometry.Theoretical Computer Science, 347(3):465–497, December 1, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Duntsch:2005:RTB

[406] Ivo Duntsch and Michael Winter. Arepresentation theorem for Booleancontact algebras. Theoretical ComputerScience, 347(3):498–512, December 1,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Arimura:2005:P

[407] H. Arimura and S. Jain. Preface. The-oretical Computer Science, 348(1):1–2, December 2, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Watanabe:2005:SST

[408] Osamu Watanabe. Sequential sam-pling techniques for algorithmic learn-ing theory. Theoretical Computer Sci-ence, 348(1):3–14, December 2, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Lange:2005:IIA

[409] Steffen Lange, Gunter Grieser, andThomas Zeugmann. Inductive infer-ence of approximations for recursiveconcepts. Theoretical Computer Sci-ence, 348(1):15–40, December 2, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 82

Nessel:2005:LEP

[410] Jochen Nessel and Steffen Lange.Learning erasing pattern languageswith queries. Theoretical ComputerScience, 348(1):41–57, December 2,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Satoh:2005:LTR

[411] Ken Satoh. Learning taxonomic re-lation by case-based reasoning. The-oretical Computer Science, 348(1):58–69, December 2, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Denis:2005:LPU

[412] Francois Denis, Remi Gilleron, and Fa-bien Letouzey. Learning from posi-tive and unlabeled examples. Theo-retical Computer Science, 348(1):70–83, December 2, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hirata:2005:PHA

[413] Kouichi Hirata. Prediction-hardnessof acyclic conjunctive queries. The-oretical Computer Science, 348(1):84–94, December 2, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

DasGupta:2005:ALM

[414] Bhaskar DasGupta and Barbara Ham-mer. On approximate learning bymulti-layered feedforward circuits.Theoretical Computer Science, 348(1):95–127, December 2, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Anonymous:2005:Pc

[415] Anonymous. Preface. Theoretical Com-puter Science, 348(1):v–ix, December2, 2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Diaz:2005:P

[416] Josep Dıaz and Juhani Karhumaki.Preface. Theoretical Computer Sci-ence, 348(2–3):129, December 8, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bournez:2005:ECF

[417] Olivier Bournez and Emmanuel Hainry.Elementarily computable functionsover the real numbers and R-sub-recursive functions. Theoretical Com-puter Science, 348(2–3):130–147, De-cember 8, 2005. CODEN TCSCDI.ISSN 0304-3975 (print), 1879-2294(electronic).

Bulatov:2005:CPF

[418] Andrei Bulatov and Martin Grohe. Thecomplexity of partition functions. The-oretical Computer Science, 348(2–3):148–186, December 8, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Dvorak:2005:LCC

[419] Zdenek Dvorak, Daniel Kral’, andOndrej Pangrac. Locally consistentconstraint satisfaction problems. The-oretical Computer Science, 348(2–3):187–206, December 8, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 83

Feigenbaum:2005:GPS

[420] Joan Feigenbaum, Sampath Kannan,Andrew McGregor, Siddharth Suri,and Jian Zhang. On graph problemsin a semi-streaming model. Theoret-ical Computer Science, 348(2–3):207–216, December 8, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fleischer:2005:LTS

[421] Lisa Fleischer. Linear tolls suffice:New bounds and algorithms for tollsin single source networks. Theoret-ical Computer Science, 348(2–3):217–225, December 8, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fotakis:2005:SUF

[422] Dimitris Fotakis, Spyros Kontogiannis,and Paul Spirakis. Selfish unsplittableflows. Theoretical Computer Science,348(2–3):226–239, December 8, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Halperin:2005:MES

[423] Eran Halperin and Richard M. Karp.The minimum-entropy set cover prob-lem. Theoretical Computer Science,348(2–3):240–250, December 8, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Hoory:2005:SPM

[424] Shlomo Hoory, Avner Magen, StevenMyers, and Charles Rackoff. Sim-ple permutations mix well. Theoret-ical Computer Science, 348(2–3):251–261, December 8, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Krauthgamer:2005:BBC

[425] Robert Krauthgamer and James R.Lee. The black-box complexity ofnearest-neighbor search. TheoreticalComputer Science, 348(2–3):262–276,December 8, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kunc:2005:RSL

[426] Michal Kunc. Regular solutions oflanguage inequalities and well quasi-orders. Theoretical Computer Science,348(2–3):277–293, December 8, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Lebhar:2005:COD

[427] Emmanuelle Lebhar and Nicolas Sch-abanel. Close to optimal decentral-ized routing in long-range contact net-works. Theoretical Computer Science,348(2–3):294–310, December 8, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

vanMelkebeek:2005:TLB

[428] Dieter van Melkebeek and Ran Raz. Atime lower bound for satisfiability. The-oretical Computer Science, 348(2–3):311–320, December 8, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Soltys:2005:PHC

[429] Michael Soltys. LA, permutations,and the Hajos Calculus. Theoreti-cal Computer Science, 348(2–3):321–333, December 8, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 84

Vassilvitskii:2005:ECS

[430] Sergei Vassilvitskii and Mihalis Yan-nakakis. Efficiently computing succincttrade-off curves. Theoretical ComputerScience, 348(2–3):334–356, December8, 2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Williams:2005:NAO

[431] Ryan Williams. A new algorithm foroptimal 2-constraint satisfaction andits implications. Theoretical ComputerScience, 348(2–3):357–365, December8, 2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Nesetril:2005:GC

[432] Jaroslav Nesetril and Gerhard Woegin-ger. Graph colorings. Theoretical Com-puter Science, 349(1):1, December 12,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bodlaender:2005:AGF

[433] Hans L. Bodlaender, Andreas Brandstadt,Dieter Kratsch, Michael Rao, andJeremy Spinrad. On algorithms for(P ,gem)-free graphs. Theoretical Com-puter Science, 349(1):2–21, December12, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Bodlaender:2005:ECB

[434] Hans L. Bodlaender and Fedor V.Fomin. Equitable colorings of boundedtreewidth graphs. Theoretical Com-puter Science, 349(1):22–30, December12, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Bulatov:2005:HCD

[435] Andrei A. Bulatov. H-coloring di-chotomy revisited. Theoretical Com-puter Science, 349(1):31–39, December12, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Diaz:2005:CCN

[436] Josep Dıaz, Vishal Sanwalani, MariaSerna, and Paul G. Spirakis. Thechromatic and clique numbers of ran-dom scaled sector graphs. Theoret-ical Computer Science, 349(1):40–51,December 12, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Feder:2005:LMP

[437] Tomas Feder, Pavol Hell, SulamitaKlein, Loana Tito Nogueira, and FabioProtti. List matrix partitions of chordalgraphs. Theoretical Computer Sci-ence, 349(1):52–66, December 12, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Fiala:2005:CCC

[438] Jirı Fiala and Daniel Paulusma. Acomplete complexity classification ofthe role assignment problem. Theo-retical Computer Science, 349(1):67–81, December 12, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kostochka:2005:ECG

[439] A. V. Kostochka and K. Nakprasit. Onequitable ∆-coloring of graphs with lowaverage degree. Theoretical ComputerScience, 349(1):82–91, December 12,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 85

Kohl:2005:LVL

[440] Anja Kohl, Jens Schreyer, Zsolt Tuza,and Margit Voigt. List version ofL(d, s)-labelings. Theoretical ComputerScience, 349(1):92–98, December 12,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kral:2005:GCC

[441] Daniel Kral’. Group coloring is Πp2-

complete. Theoretical Computer Sci-ence, 349(1):99–111, December 12,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Macajova:2005:FCC

[442] Edita Macajova and Martin Skoviera.Fano colourings of cubic graphs andthe Fulkerson Conjecture. Theoreti-cal Computer Science, 349(1):112–120,December 12, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2005:EBp

[443] Anonymous. Editorial board. The-oretical Computer Science, 349(1):v–ix, December 12, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

vandenHerik:2005:F

[444] H. Jaap van den Herik and HiroyukiIida. Foreword. Theoretical ComputerScience, 349(2):121–122, December 14,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hayward:2005:SHD

[445] Ryan Hayward, Yngvi Bjornsson,Michael Johanson, Morgan Kan,Nathan Po, and Jack van Rijswijck.

Solving 7×7 Hex with domination, fill-in, and virtual connections. Theo-retical Computer Science, 349(2):123–139, December 14, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bourzutschky:2005:CEM

[446] M. S. Bourzutschky, J. A. Tamplin, andG. McC. Haworth. Chess endgames:6-man data and strategy. Theoreti-cal Computer Science, 349(2):140–157,December 14, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Andrist:2005:DME

[447] R. B. Andrist and G. MC. Haworth.Deeper model endgame analysis. The-oretical Computer Science, 349(2):158–167, December 14, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

vanderWerf:2005:LSF

[448] Erik C. D. van der Werf, H. Jaapvan den Herik, and Jos W. H. M.Uiterwijk. Learning to score final po-sitions in the game of Go. Theo-retical Computer Science, 349(2):168–183, December 14, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Nakamura:2005:SAB

[449] Katsuhiko Nakamura. Static analy-sis based on formal models and incre-mental computation in Go program-ming. Theoretical Computer Science,349(2):184–201, December 14, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 86

Gomboc:2005:TEF

[450] D. Gomboc, M. Buro, and T. A. Mars-land. Tuning evaluation functions bymaximizing concordance. Theoreti-cal Computer Science, 349(2):202–229,December 14, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lieberum:2005:EFG

[451] Jens Lieberum. An evaluation func-tion for the game of amazons. Theo-retical Computer Science, 349(2):230–244, December 14, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Donkers:2005:SEF

[452] H. H. L. M. Donkers, H. J. van denHerik, and J. W. H. M. Uiter-wijk. Selecting evaluation functionsin Opponent-Model search. Theoreti-cal Computer Science, 349(2):245–267,December 14, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Sadikov:2005:BPM

[453] A. Sadikov, I. Bratko, and I. Kononenko.Bias and pathology in minimax search.Theoretical Computer Science, 349(2):268–281, December 14, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Okhotin:2005:USL

[454] Alexander Okhotin. Unresolved sys-tems of language equations: Expressivepower and decision problems. Theo-retical Computer Science, 349(3):283–308, December 16, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Aldred:2005:PMP

[455] R. E. L. Aldred, M. D. Atkinson, H. P.van Ditmarsch, C. C. Handley, D. A.Holton, and D. J. McCaughan. Per-muting machines and priority queues.Theoretical Computer Science, 349(3):309–317, December 16, 2005. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Blanchard:2005:SRA

[456] F. Blanchard, J. Cervelle, and E. For-menti. Some results about the chaoticbehavior of cellular automata. Theo-retical Computer Science, 349(3):318–336, December 16, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Epstein:2005:CVS

[457] Leah Epstein and Asaf Levin. Thechord version for SONET ADMs min-imization. Theoretical Computer Sci-ence, 349(3):337–346, December 16,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bjorklund:2005:CSR

[458] Henrik Bjorklund and Sergei Vorobyov.Combinatorial structure and random-ized subexponential algorithms for in-finite games. Theoretical ComputerScience, 349(3):347–360, December 16,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cieliebak:2005:PDH

[459] Mark Cieliebak, Stephan Eidenbenz,and Paolo Penna. Partial Digest is hardto solve for erroneous input data. The-oretical Computer Science, 349(3):361–381, December 16, 2005. CODEN TC-

REFERENCES 87


Hemaspaandra:2005:CKE

[460] Edith Hemaspaandra, Holger Spakowski,and Jorg Vogel. The complexity of Ke-meny elections. Theoretical ComputerScience, 349(3):382–391, December 16,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bourke:2005:ERF

[461] Chris Bourke, John M. Hitchcock, andN. V. Vinodchandran. Entropy ratesand finite-state dimension. Theoreti-cal Computer Science, 349(3):392–406,December 16, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Wu:2005:ALA

[462] Bang Ye Wu. An analysis of the LPTalgorithm for the max–min and themin–ratio partition problems. Theo-retical Computer Science, 349(3):407–419, December 16, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kitaev:2005:SPO

[463] Sergey Kitaev. Segmental partiallyordered generalized patterns. Theo-retical Computer Science, 349(3):420–428, December 16, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chuan:2005:LFI

[464] Wai-Fong Chuan and Hui-Ling Ho. Lo-cating factors of the infinite Fibonacciword. Theoretical Computer Science,349(3):429–442, December 16, 2005.


Kutz:2005:CAT

[465] Martin Kutz. Conway’s Angel in threedimensions. Theoretical Computer Sci-ence, 349(3):443–451, December 16,2005. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Yan:2005:GCP

[466] Weigen Yan, Yeong-Nan Yeh, and FujiZhang. Graphical condensation ofplane graphs: A combinatorial ap-proach. Theoretical Computer Science,349(3):452–461, December 16, 2005.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Demange:2005:CPL

[467] Marc Demange, Tınaz Ekim, and Do-minique de Werra. (p, k)-coloringproblems in line graphs. Theoreti-cal Computer Science, 349(3):462–474,December 16, 2005. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Nakata:2005:ETH

[468] Toshio Nakata. On the expectedtime for Herman’s probabilistic self-stabilizing algorithm. Theoretical Com-puter Science, 349(3):475–483, Decem-ber 16, 2005. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Cazals:2005:ARM

[469] F. Cazals and C. Karande. An algo-rithm for reporting maximal c-cliques.Theoretical Computer Science, 349(3):484–490, December 16, 2005. CODEN

REFERENCES 88


Cesa-Bianchi:2006:F

[470] Nicolo Cesa-Bianchi, Rudiger Reis-chuk, and Thomas Zeugmann. Fore-word. Theoretical Computer Science,350(1):1–2, January 18, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Amano:2006:LMB

[471] Kazuyuki Amano and Akira Maruoka.On learning monotone Boolean func-tions under the uniform distribution.Theoretical Computer Science, 350(1):3–12, January 18, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Servedio:2006:LEM

[472] Rocco A. Servedio. On learning em-bedded midbit functions. Theoreti-cal Computer Science, 350(1):13–23,January 18, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bshouty:2006:MAC

[473] Nader H. Bshouty and Lynn Bur-roughs. Maximizing agreements andcoagnostic learning. Theoretical Com-puter Science, 350(1):24–39, January18, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Forster:2006:SPD

[474] Jurgen Forster and Hans Ulrich Simon.On the smallest possible dimension andthe largest possible margin of lineararrangements representing given con-cept classes. Theoretical Computer Sci-

ence, 350(1):40–48, January 18, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Kobler:2006:CLC

[475] Johannes Kobler and Wolfgang Lind-ner. The complexity of learning con-cept classes with polynomial general di-mension. Theoretical Computer Sci-ence, 350(1):49–62, January 18, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Suzuki:2006:OTT

[476] Yusuke Suzuki, Takayoshi Shoudai, To-moyuki Uchida, and Tetsuhiro Miya-hara. Ordered term tree languageswhich are polynomial time inductivelyinferable from positive data. Theo-retical Computer Science, 350(1):63–90, January 18, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Reidenbach:2006:NLC

[477] Daniel Reidenbach. A non-learnableclass of E-pattern languages. Theo-retical Computer Science, 350(1):91–102, January 18, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Martin:2006:ULT

[478] Eric Martin, Arun Sharma, and FrankStephan. Unifying logic, topology andlearning in Parametric logic. Theo-retical Computer Science, 350(1):103–124, January 18, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 89

Hayashi:2006:MBI

[479] Susumu Hayashi. Mathematics basedon incremental learning—Excludedmiddle and inductive inference. The-oretical Computer Science, 350(1):125–139, January 18, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fronhofer:2006:HFP

[480] Bertram Fronhofer and Akihiro Ya-mamoto. Hypothesis finding withproof theoretical appropriateness cri-teria. Theoretical Computer Science,350(1):140–162, January 18, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Anonymous:2006:F

[481] Anonymous. Foreword. TheoreticalComputer Science, 350(1):v–ix, Jan-uary 18, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Sannella:2006:P

[482] Donald Sannella. Preface. The-oretical Computer Science, 350(2–3):163, February 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bojanczyk:2006:TWA

[483] Mikolaj Bojanczyk and Thomas Col-combet. Tree-walking automata cannotbe determinized. Theoretical ComputerScience, 350(2–3):164–173, February 7,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dawar:2006:BGI

[484] Anuj Dawar, Erich Gradel, andStephan Kreutzer. Backtracking gamesand inflationary fixed points. Theoret-ical Computer Science, 350(2–3):174–187, February 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Deng:2006:TAT

[485] Yuxin Deng and Davide Sangiorgi. To-wards an algebraic theory of typed mo-bile processes. Theoretical ComputerScience, 350(2–3):188–212, February 7,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Faggian:2006:IOL

[486] Claudia Faggian. Interactive observ-ability in Ludics: The geometry oftests. Theoretical Computer Science,350(2–3):213–233, February 7, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ghica:2006:SCC

[487] D. R. Ghica, A. S. Murawski, and C.-H. L. Ong. Syntactic control of concur-rency. Theoretical Computer Science,350(2–3):234–251, February 7, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Haghverdi:2006:CMG

[488] Esfandiar Haghverdi and Philip Scott.A categorical model for the geometryof interaction. Theoretical ComputerScience, 350(2–3):252–274, February 7,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 90

Laird:2006:CC

[489] J. Laird. A calculus of coroutines. The-oretical Computer Science, 350(2–3):275–291, February 7, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Martin:2006:EFP

[490] Keye Martin. Entropy as a fixed point.Theoretical Computer Science, 350(2–3):292–324, February 7, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Schweikardt:2006:EPM

[491] Nicole Schweikardt. On the expres-sive power of monadic least fixed pointlogic. Theoretical Computer Science,350(2–3):325–344, February 7, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Serre:2006:GWC

[492] Olivier Serre. Games with winning con-ditions of high Borel complexity. The-oretical Computer Science, 350(2–3):345–372, February 7, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Anonymous:2006:AIa

[493] Anonymous. Author index. The-oretical Computer Science, 350(2–3):373, February 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2006:MIa

[494] Anonymous. Master index. Theoret-ical Computer Science, 350(2–3):375–384, February 7, 2006. CODEN TC-


Daumas:2006:P

[495] Marc Daumas and Nathalie Revol.Preface. Theoretical Computer Science,351(1):1, February 14, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Parker:2006:TCD

[496] Matthew W. Parker. Three con-cepts of decidability for general sub-sets of uncountable spaces. Theo-retical Computer Science, 351(1):2–13,February 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ziegler:2006:SVS

[497] Martin Ziegler. Stability versus speedin a computable algebraic model. The-oretical Computer Science, 351(1):14–26, February 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zheng:2006:DBC

[498] Xizhong Zheng, Dianchen Lu, and Ke-jin Bao. Divergence bounded com-putable real numbers. Theoreti-cal Computer Science, 351(1):27–38,February 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ciaffaglione:2006:CCI

[499] Alberto Ciaffaglione and Pietro Di Gi-anantonio. A certified, corecursive im-plementation of exact real numbers.Theoretical Computer Science, 351(1):39–51, February 14, 2006. CODEN TC-

REFERENCES 91


vanderHoeven:2006:CER

[500] Joris van der Hoeven. Computationswith effective real numbers. Theo-retical Computer Science, 351(1):52–60, February 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hughes:2006:ADS

[501] Jesse Hughes and Milad Niqui. Admis-sible digit sets. Theoretical ComputerScience, 351(1):61–73, February 14,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Briggs:2006:IER

[502] Keith Briggs. Implementing exact realarithmetic in python, C++ and C.Theoretical Computer Science, 351(1):74–81, February 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hill:2006:QUB

[503] M. Hill and I. Robinson. Quadra-ture using 64-bit IEEE arithmetic forintegrands over [0, 1] with a singu-larity at 1. Theoretical ComputerScience, 351(1):82–100, February 14,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kornerup:2006:CSV

[504] Peter Kornerup and Jean-MichelMuller. Choosing starting values forcertain Newton–Raphson iterations.Theoretical Computer Science, 351(1):101–110, February 14, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Bronnimann:2006:DBI

[505] Herve Bronnimann, Guillaume Melquiond,and Sylvain Pion. The design of theBoost interval arithmetic library. The-oretical Computer Science, 351(1):111–118, February 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Delanoue:2006:UIA

[506] Nicolas Delanoue, Luc Jaulin, andBertrand Cottenceau. Using inter-val arithmetic to prove that a set ispath-connected. Theoretical ComputerScience, 351(1):119–128, February 14,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2006:Pa

[507] Anonymous. Preface. Theoretical Com-puter Science, 351(1):v–ix, February14, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Maharaj:2006:P

[508] Savi Maharaj, Carron Shankland, andCharles Rattray. Preface. Theoreti-cal Computer Science, 351(2):129–130,February 21, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Garavel:2006:SSR

[509] Hubert Garavel and Wendelin Serwe.State space reduction for process al-gebra specifications. Theoretical Com-puter Science, 351(2):131–145, Febru-ary 21, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

REFERENCES 92

Hill:2006:LCM

[510] Gillian Hill and Steven Vickers. A lan-guage for configuring multi-level spec-ifications. Theoretical Computer Sci-ence, 351(2):146–166, February 21,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Imine:2006:FDV

[511] Abdessamad Imine, Michael Rusinow-itch, Gerald Oster, and Pascal Molli.Formal design and verification of op-erational transformation algorithms forcopies convergence. Theoretical Com-puter Science, 351(2):167–183, Febru-ary 21, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Knapp:2006:SRM

[512] Alexander Knapp, Stephan Merz, Mar-tin Wirsing, and Julia Zappe. Speci-fication and refinement of mobile sys-tems in MTLA and mobile UML. The-oretical Computer Science, 351(2):184–202, February 21, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kuster-Filipe:2006:MCI

[513] Juliana Kuster-Filipe. Modelling con-current interactions. Theoretical Com-puter Science, 351(2):203–220, Febru-ary 21, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Moller:2006:AMO

[514] Bernhard Moller and Georg Struth. Al-gebras of modal operators and par-tial correctness. Theoretical ComputerScience, 351(2):221–239, February 21,


vanRiemsdijk:2006:SPR

[515] M. Birna van Riemsdijk, John-Jules Ch. Meyer, and Frank S. de Boer.Semantics of plan revision in intel-ligent agents. Theoretical ComputerScience, 351(2):240–257, February 21,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Sims:2006:ESL

[516] Elodie-Jane Sims. Extending separa-tion logic with fixpoints and postponedsubstitution. Theoretical ComputerScience, 351(2):258–275, February 21,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Meng:2006:CCR

[517] Sun Meng and Luıs S. Barbosa. Com-ponents as coalgebras: The refine-ment dimension. Theoretical ComputerScience, 351(2):276–294, February 21,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Downey:2006:E

[518] Rod Downey, Mike Langston, andRolf Niedermeier. Editorial. Theo-retical Computer Science, 351(3):295,February 28, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bryant:2006:CUP

[519] David Bryant and Jens Lagergren.Compatibility of unrooted phylogenetictrees is FPT. Theoretical ComputerScience, 351(3):296–302, February 28,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 93

Buss:2006:SWH

[520] Jonathan F. Buss and Tarique Islam.Simplifying the weft hierarchy. Theo-retical Computer Science, 351(3):303–313, February 28, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chen:2006:MPP

[521] Yijia Chen and Jorg Flum. Onminiaturized problems in parameter-ized complexity theory. Theoreti-cal Computer Science, 351(3):314–336,February 28, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Damaschke:2006:PET

[522] Peter Damaschke. Parameterized enu-meration, transversals, and imperfectphylogeny reconstruction. Theoreti-cal Computer Science, 351(3):337–350,February 28, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fellows:2006:FSR

[523] Michael R. Fellows, Stefan Szeider, andGraham Wrightson. On finding shortresolution refutations and small unsat-isfiable subsets. Theoretical ComputerScience, 351(3):351–359, February 28,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Haas:2006:CPT

[524] Robert Haas and Michael Hoffmann.Chordless paths through three vertices.Theoretical Computer Science, 351(3):360–371, February 28, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Hlineny:2006:TGM

[525] Petr Hlineny and Detlef Seese. Trees,grids, and MSO decidability: Fromgraphs to matroids. Theoretical Com-puter Science, 351(3):372–393, Febru-ary 28, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Marx:2006:PGS

[526] Daniel Marx. Parameterized graph sep-aration problems. Theoretical Com-puter Science, 351(3):394–406, Febru-ary 28, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Marx:2006:PCP

[527] Daniel Marx. Parameterized coloringproblems on chordal graphs. Theo-retical Computer Science, 351(3):407–424, February 28, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Muller-Hannemann:2006:MPC

[528] Matthias Muller-Hannemann andKarsten Weihe. Moving policies incyclic assembly line scheduling. The-oretical Computer Science, 351(3):425–436, February 28, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Prieto:2006:LS

[529] Elena Prieto and Christian Sloper.Looking at the stars. Theoretical Com-puter Science, 351(3):437–445, Febru-ary 28, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

REFERENCES 94

Raman:2006:PAF

[530] Venkatesh Raman and Saket Saurabh.Parameterized algorithms for feedbackset problems and their duals in tourna-ments. Theoretical Computer Science,351(3):446–458, February 28, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Wu:2006:MCD

[531] Weili Wu, Hongwei Du, Xiaohua Jia,Yingshu Li, and Scott C.-H. Huang.Minimum connected dominating setsand maximal independent sets in unitdisk graphs. Theoretical ComputerScience, 352(1–3):1–7, March 7, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Hitczenko:2006:DCD

[532] Pawe l Hitczenko, Jeremy R. Johnson,and Hung-Jen Huang. Distribution ofa class of divide and conquer recur-rences arising from the computation ofthe Walsh–Hadamard transform. The-oretical Computer Science, 352(1–3):8–30, March 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Glen:2006:OPC

[533] Amy Glen. Occurrences of palindromesin characteristic Sturmian words. The-oretical Computer Science, 352(1–3):31–46, March 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zverovich:2006:SID

[534] Igor Edm. Zverovich. Satgraphs andindependent domination. Part 1. The-oretical Computer Science, 352(1–3):

47–56, March 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Tanaka:2006:SMB

[535] Genjiro Tanaka. On syntactic monoidsof biunitary submonoids determinedby homomorphisms from free semi-groups onto completely simple semi-groups. Theoretical Computer Sci-ence, 352(1–3):57–70, March 7, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Xavier:2006:ASK

[536] E. C. Xavier and F. K. Miyazawa.Approximation schemes for knapsackproblems with shelf divisions. The-oretical Computer Science, 352(1–3):71–84, March 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Mubayi:2006:DEP

[537] Dhruv Mubayi, Gyorgy Turan, andYi Zhao. The DNF exception problem.Theoretical Computer Science, 352(1–3):85–96, March 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Terrier:2006:CPC

[538] Veronique Terrier. Closure propertiesof cellular automata. Theoretical Com-puter Science, 352(1–3):97–107, March7, 2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Palu:2006:SPA

[539] A. Dal Palu, E. Pontelli, and D. Ran-jan. Sequential and parallel algorithmsfor the NCA problem on pure pointer

REFERENCES 95

machines. Theoretical Computer Sci-ence, 352(1–3):108–135, March 7, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Poblete:2006:BTA

[540] Patricio V. Poblete, J. Ian Munro,and Thomas Papadakis. The binomialtransform and the analysis of skip lists.Theoretical Computer Science, 352(1–3):136–158, March 7, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Ferbus-Zanda:2006:KCC

[541] Marie Ferbus-Zanda and Serge Grig-orieff. Kolmogorov complexitiesKmax,Kmin on computable partially or-dered sets. Theoretical Computer Sci-ence, 352(1–3):159–180, March 7, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Papakonstantinou:2006:HCP

[542] Periklis A. Papakonstantinou. Hier-archies for classes of priority algo-rithms for Job Scheduling. Theoret-ical Computer Science, 352(1–3):181–189, March 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Colcombet:2006:PDE

[543] Thomas Colcombet and DamianNiwinski. On the positional determi-nacy of edge-labeled games. Theoret-ical Computer Science, 352(1–3):190–196, March 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bao:2006:RBP

[544] Xuewen Bao, Frank K. Hwang, andQiao Li. Rearrangeability of bit permu-tation networks. Theoretical ComputerScience, 352(1–3):197–214, March 7,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zverovich:2006:IDH

[545] Igor E. Zverovich and Olga I.Zverovich. Independent dominationin hereditary classes. TheoreticalComputer Science, 352(1–3):215–225,March 7, 2006. CODEN TCSCDI.ISSN 0304-3975 (print), 1879-2294(electronic).

Moothathu:2006:SPA

[546] T. K. Subrahmonian Moothathu. Set ofperiods of additive cellular automata.Theoretical Computer Science, 352(1–3):226–231, March 7, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Chang:2006:WSN

[547] F. H. Chang, J. Y. Guo, and F. K.Hwang. Wide-sense nonblocking formulti-logdN networks under vari-ous routing strategies. TheoreticalComputer Science, 352(1–3):232–239,March 7, 2006. CODEN TCSCDI.ISSN 0304-3975 (print), 1879-2294(electronic).

Huynh:2006:ASM

[548] Trinh N. D. Huynh, Wing-Kai Hon,Tak-Wah Lam, and Wing-Kin Sung.Approximate string matching usingcompressed suffix arrays. Theoreti-cal Computer Science, 352(1–3):240–249, March 7, 2006. CODEN TC-

REFERENCES 96


Frederickson:2006:EAR

[549] Greg N. Frederickson and RobertoSolis-Oba. Efficient algorithms forrobustness in resource allocation andscheduling problems. TheoreticalComputer Science, 352(1–3):250–265,March 7, 2006. CODEN TCSCDI.ISSN 0304-3975 (print), 1879-2294(electronic).

Navarro:2006:MIA

[550] Gonzalo Navarro and Edgar Chavez.A metric index for approximate stringmatching. Theoretical Computer Sci-ence, 352(1–3):266–279, March 7, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Zhao:2006:SAP

[551] Zhu Zhao, Zhongqi Dong, and YonggeWang. Security analysis of a password-based authentication protocol proposedto IEEE 1363. Theoretical ComputerScience, 352(1–3):280–287, March 7,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Youssef:2006:LCS

[552] A. M. Youssef and G. Gong. On linearcomplexity of sequences over GF. The-oretical Computer Science, 352(1–3):288–292, March 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ballet:2006:ICD

[553] S. Ballet. An improvement of the con-struction of the D. V. and G. V. Chud-novsky algorithm for multiplication in

finite fields. Theoretical Computer Sci-ence, 352(1–3):293–305, March 7, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Brlek:2006:CPS

[554] S. Brlek, S. Dulucq, A. Ladouceur, andL. Vuillon. Combinatorial propertiesof smooth infinite words. Theoreti-cal Computer Science, 352(1–3):306–317, March 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hajiaghayi:2006:MFM

[555] M. T. Hajiaghayi and Tom Leighton.On the max-flow min-cut ratio for di-rected multicommodity flows. Theoret-ical Computer Science, 352(1–3):318–321, March 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zhu:2006:CUT

[556] Daming Zhu and Lusheng Wang. Onthe complexity of unsigned transloca-tion distance. Theoretical ComputerScience, 352(1–3):322–328, March 7,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Tomescu:2006:CWO

[557] Ioan Tomescu. A characterization ofthe words occurring as factors in aminimum number of words. Theoret-ical Computer Science, 352(1–3):329–331, March 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Das:2006:RAE

[558] Gautam K. Das, Sandip Das, and Sub-has C. Nandy. Range assignment for

REFERENCES 97

energy efficient broadcasting in linearradio networks. Theoretical ComputerScience, 352(1–3):332–341, March 7,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ibarra:2006:SCD

[559] Oscar H. Ibarra and Zhe Dang. Onthe solvability of a class of diophantineequations and applications. Theoret-ical Computer Science, 352(1–3):342–346, March 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Krumke:2006:ENO

[560] Sven O. Krumke, Willem E. de Paepe,Diana Poensgen, and Leen Stougie. Er-ratum to “News from the online travel-ing repairman” [Theoret. Comput. Sci.295 (1–3) (2003) 279–294]. Theoret-ical Computer Science, 352(1–3):347–348, March 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). See [1].

Anonymous:2006:EBa


Schroder:2006:HPC

[562] Lutz Schroder. The HasCasl pro-logue: Categorical syntax and seman-tics of the partial λ-calculus. Theo-retical Computer Science, 353(1–3):1–25, March 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zhu:2006:SBP

[563] Zhaohui Zhu. Similarity between pref-erential models. Theoretical ComputerScience, 353(1–3):26–52, March 14,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hartmann:2006:PFC

[564] Sven Hartmann and Sebastian Link.On a problem of Fagin concerningmultivalued dependencies in relationaldatabases. Theoretical Computer Sci-ence, 353(1–3):53–62, March 14, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Zhang:2006:SPC

[565] Wenhui Zhang. Structure of proofs andthe complexity of cut elimination. The-oretical Computer Science, 353(1–3):63–70, March 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lu:2006:AWV

[566] Shiyong Lu, Arthur Bernstein, andPhilip Lewis. Automatic workflowverification and generation. Theoret-ical Computer Science, 353(1–3):71–92, March 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Goranko:2006:CAD

[567] Valentin Goranko and Govert vanDrimmelen. Complete axiomatizationand decidability of Alternating-timetemporal logic. Theoretical ComputerScience, 353(1–3):93–117, March 14,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 98

Mitchell:2006:PPT

[568] John C. Mitchell, Ajith Ramanathan,Andre Scedrov, and Vanessa Teague.A probabilistic polynomial-time pro-cess calculus for the analysis ofcryptographic protocols. Theoreti-cal Computer Science, 353(1–3):118–164, March 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kamide:2006:LAL

[569] Norihiro Kamide. Linear and affinelogics with temporal, spatial and epis-temic operators. Theoretical ComputerScience, 353(1–3):165–207, March 14,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Boucheneb:2006:C

[570] Hanifa Boucheneb and Rachid Had-jidj. CTL. Theoretical ComputerScience, 353(1–3):208–227, March 14,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lopez:2006:STI

[571] Natalia Lopez, Manuel Nunez, and Is-mael Rodrıguez. Specification, test-ing and implementation relations forsymbolic-probabilistic systems. The-oretical Computer Science, 353(1–3):228–248, March 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Laroussinie:2006:ETM

[572] F. Laroussinie, N. Markey, and Ph.Schnoebelen. Efficient timed modelchecking for discrete-time systems.Theoretical Computer Science, 353(1–3):249–271, March 14, 2006. CODEN


Kambites:2006:ASC

[573] Mark Kambites. Automatic semi-groups and categories. Theoreti-cal Computer Science, 353(1–3):272–290, March 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ipate:2006:TAN

[574] Florentin Ipate. Testing against a non-controllable stream X-machine usingstate counting. Theoretical ComputerScience, 353(1–3):291–316, March 14,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2006:EBb


Nijholt:2006:E

[576] A. Nijholt, G. Scollo, and U. Monnich.Editorial. Theoretical Computer Sci-ence, 354(1):1–3, March 21, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Berline:2006:EGM

[577] C. Berline and A. Salibra. Easinessin graph models. Theoretical Com-puter Science, 354(1):4–23, March 21,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Harrington:2006:UL

[578] Dana Harrington. Uniqueness logic.Theoretical Computer Science, 354(1):

REFERENCES 99


Roggenbach:2006:CCN

[579] Markus Roggenbach. CSP-CASL—A new integration of process alge-bra and algebraic specification. The-oretical Computer Science, 354(1):42–71, March 21, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Penn:2006:ETC

[580] Gerald Penn. Efficient transitive clo-sure of sparse matrices over closedsemirings. Theoretical Computer Sci-ence, 354(1):72–81, March 21, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Kepser:2006:CPL

[581] Stephan Kepser and Uwe Monnich.Closure properties of linear context-freetree languages with an application tooptimality theory. Theoretical Com-puter Science, 354(1):82–97, March 21,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gust:2006:MHD

[582] Helmar Gust, Kai-Uwe Kuhnberger,and Ute Schmid. Metaphors andheuristic-driven theory projection(HDTP). Theoretical Computer Sci-ence, 354(1):98–117, March 21, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Asveld:2006:GAP

[583] Peter R. J. Asveld. Generating all per-mutations by context-free grammars

in Chomsky normal form. Theo-retical Computer Science, 354(1):118–130, March 21, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kracht:2006:PAM

[584] Marcus Kracht. Partial algebras, mean-ing categories and algebraization. The-oretical Computer Science, 354(1):131–141, March 21, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gramatovici:2006:SDI

[585] Radu Gramatovici and Carlos Martın-Vide. Sorted dependency insertiongrammars. Theoretical Computer Sci-ence, 354(1):142–152, March 21, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Kundaji:2006:RCB

[586] Rohit N. Kundaji and R. K. Shyama-sundar. Refinement calculus: A ba-sis for translation validation, debuggingand certification. Theoretical ComputerScience, 354(1):153–168, March 21,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2006:E

[587] Anonymous. Editorial. TheoreticalComputer Science, 354(1):v–ix, March21, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Garavel:2006:TSI

[588] Hubert Garavel and John Hatcliff.TACAS 2003 Special Issue—Preface.Theoretical Computer Science, 354(2):

REFERENCES 100


Henzinger:2006:UEF

[589] Thomas A. Henzinger, Orna Kupfer-man, and Rupak Majumdar. On theuniversal and existential fragments ofthe µ-calculus. Theoretical ComputerScience, 354(2):173–186, March 28,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Conchon:2006:SCD

[590] Sylvain Conchon and Sava Krstic.Strategies for combining decision pro-cedures. Theoretical Computer Sci-ence, 354(2):187–210, March 28, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Basu:2006:CAV

[591] Samik Basu and C. R. Ramakrish-nan. Compositional analysis for verifi-cation of parameterized systems. The-oretical Computer Science, 354(2):211–229, March 28, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Alur:2006:MSR

[592] Rajeev Alur, Salvatore La Torre, andP. Madhusudan. Modular strategiesfor recursive game graphs. Theo-retical Computer Science, 354(2):230–249, March 28, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Alur:2006:CGP

[593] Rajeev Alur, Thao Dang, and FranjoIvancic. Counterexample-guided pred-icate abstraction of hybrid systems.

Theoretical Computer Science, 354(2):250–271, March 28, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Abdeddaim:2006:STA

[594] Yasmina Abdeddaı¨m, Eugene Asarin,and Oded Maler. Scheduling withtimed automata. Theoretical ComputerScience, 354(2):272–300, March 28,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fersman:2006:SAF

[595] Elena Fersman, Leonid Mokrushin,Paul Pettersson, and Wang Yi. Schedu-lability analysis of fixed-priority sys-tems using timed automata. Theo-retical Computer Science, 354(2):301–317, March 28, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lingas:2006:P

[596] Andrzej Lingas and Leszek Gasieniec.Preface. Theoretical Computer Science,354(3):319, April 4, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chlebik:2006:CAB

[597] Miroslav Chlebık and Janka Chlebıkova.Complexity of approximating boundedvariants of optimization problems.Theoretical Computer Science, 354(3):320–338, April 4, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Asano:2006:IAG

[598] Takao Asano. An improved analy-sis of Goemans and Williamson’s LP-relaxation for MAX SAT. Theo-

REFERENCES 101

retical Computer Science, 354(3):339–353, April 4, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Stachowiak:2006:FPC

[599] Grzegorz Stachowiak. Fast periodiccorrection networks. Theoretical Com-puter Science, 354(3):354–366, April 4,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hammar:2006:CER

[600] Mikael Hammar, Bengt J. Nilsson,and Mia Persson. Competitive explo-ration of rectilinear polygons. Theo-retical Computer Science, 354(3):367–378, April 4, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Reif:2006:BHV

[601] John H. Reif and Zheng Sun. Onboundaries of highly visible spaces andapplications. Theoretical ComputerScience, 354(3):379–390, April 4, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Antunes:2006:CDC

[602] Luis Antunes, Lance Fortnow, Dietervan Melkebeek, and N. V. Vinodchan-dran. Computational depth: Conceptand applications. Theoretical Com-puter Science, 354(3):391–404, April 4,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Berstel:2006:OPR

[603] Jean Berstel, Luc Boasson, Olivier Car-ton, Bruno Petazzoni, and Jean-EricPin. Operations preserving regular

languages. Theoretical Computer Sci-ence, 354(3):405–420, April 4, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Fokkink:2006:CHM

[604] Wan Fokkink, Rob van Glabbeek, andPaulien de Wind. Compositional-ity of Hennessy–Milner logic by struc-tural operational semantics. Theo-retical Computer Science, 354(3):421–440, April 4, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kumar:2006:P

[605] Ravi Kumar and Matthieu Latapy.Preface. Theoretical Computer Science,355(1):1–5, April 6, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

DallAsta:2006:ENT

[606] Luca Dall’Asta, Ignacio Alvarez-Hamelin, Alain Barrat, Alexei Vazquez,and Alessandro Vespignani. Exploringnetworks with traceroute-like probes:Theory and simulations. TheoreticalComputer Science, 355(1):6–24, April6, 2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Annexstein:2006:BUP

[607] Fred S. Annexstein, Kenneth A.Berman, and Mijhalo A. Jovanovic.Broadcasting in unstructured peer-to-peer overlay networks. TheoreticalComputer Science, 355(1):25–36, April6, 2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 102

Behrisch:2006:ECC

[608] Michael Behrisch and Anusch Taraz.Efficiently covering complex networkswith cliques of similar vertices. The-oretical Computer Science, 355(1):37–47, April 6, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Sarshar:2006:SPS

[609] Nima Sarshar, Oscar Boykin, andVwani Roychowdhury. Scalable per-colation search on complex networks.Theoretical Computer Science, 355(1):48–64, April 6, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fraigniaud:2006:DBB

[610] Pierre Fraigniaud and Philippe Gau-ron. D2B: A de Bruijn based content-addressable network. Theoretical Com-puter Science, 355(1):65–79, April 6,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Stauffer:2006:LHE

[611] Alexandre O. Stauffer and Valmir C.Barbosa. Local heuristics and theemergence of spanning subgraphs incomplex networks. Theoretical Com-puter Science, 355(1):80–95, April 6,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Duchon:2006:CGT

[612] Philippe Duchon, Nicolas Hanusse,Emmanuelle Lebhar, and Nicolas Sch-abanel. Could any graph be turnedinto a small-world? Theoretical Com-puter Science, 355(1):96–103, April 6,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2006:Pb

[613] Anonymous. Preface. Theoretical Com-puter Science, 355(1):v–ix, April 6,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

deQueiroz:2006:LLI

[614] Ruy de Queiroz and Dexter Kozen.Logic, Language, Information andComputation. Theoretical ComputerScience, 355(2):105–107, April 11,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Alessi:2006:ITL

[615] Fabio Alessi, Franco Barbanera, andMariangiola Dezani-Ciancaglini. Inter-section types and lambda models. The-oretical Computer Science, 355(2):108–126, April 11, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Allender:2006:NPS

[616] Eric Allender. NL-printable sets andnondeterministic Kolmogorov complex-ity. Theoretical Computer Science, 355(2):127–138, April 11, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Bechet:2006:K

[617] Denis Bechet and Annie Foret. k. The-oretical Computer Science, 355(2):139–152, April 11, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Finger:2006:UPA

[618] Marcelo Finger and Renata Wasser-mann. The universe of propositional

REFERENCES 103

approximations. Theoretical Com-puter Science, 355(2):153–166, April11, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Hartmann:2006:AFD

[619] Sven Hartmann, Sebastian Link, andKlaus-Dieter Schewe. Axiomatisationsof functional dependencies in the pres-ence of records, lists, sets and multisets.Theoretical Computer Science, 355(2):167–196, April 11, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). See erratum [?].

Hella:2006:CQH

[620] Lauri Hella and Jose Marıa Turull-Torres. Computing queries with higher-order logics. Theoretical Computer Sci-ence, 355(2):197–214, April 11, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Lamo:2006:QFL

[621] Yngve Lamo and Micha l Walicki.Quantifier-free logic for nondeterminis-tic theories. Theoretical Computer Sci-ence, 355(2):215–227, April 11, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Rott:2006:RCU

[622] Hans Rott. Revision by comparisonas a unifying framework: Severe with-drawal, irrevocable revision and ir-refutable revision. Theoretical Com-puter Science, 355(2):228–242, April11, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Zaionc:2006:PDS

[623] Marek Zaionc. Probability distribu-tion for simple tautologies. Theo-retical Computer Science, 355(2):243–260, April 11, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kolliopoulos:2006:AAM

[624] Stavros G. Kolliopoulos and GeorgeSteiner. Approximation algorithmsfor minimizing the total weighted tar-diness on a single machine. Theo-retical Computer Science, 355(3):261–273, April 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Malheiro:2006:FDT

[625] Antonio Malheiro. Finite derivationtype for Rees matrix semigroups. The-oretical Computer Science, 355(3):274–290, April 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Xu:2006:MHE

[626] Ke Xu and Wei Li. Many hard exam-ples in exact phase transitions. Theo-retical Computer Science, 355(3):291–302, April 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Wu:2006:LTA

[627] Ro-Yu Wu, Jou-Ming Chang, and Yue-Li Wang. A linear time algorithm forbinary tree sequences transformationusing left-arm and right-arm rotations.Theoretical Computer Science, 355(3):303–314, April 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 104

DeMarco:2006:ADR

[628] Gianluca De Marco, Luisa Gargano,Evangelos Kranakis, Danny Krizanc,Andrzej Pelc, and Ugo Vaccaro. Asyn-chronous deterministic rendezvous ingraphs. Theoretical Computer Sci-ence, 355(3):315–326, April 14, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Sanchez-Couso:2006:RBS

[629] Jose-Ramon Sanchez-Couso and Marıa-Ines Fernandez-Camacho. Reduc-tions in binary search trees. Theo-retical Computer Science, 355(3):327–353, April 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jin:2006:PCP

[630] Zemin Jin and Xueliang Li. On thek-path cover problem for cacti. Theo-retical Computer Science, 355(3):354–363, April 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

DeSimone:2006:ECJ

[631] Caterina De Simone and C. P. de Mello.Edge-colouring of join graphs. Theo-retical Computer Science, 355(3):364–370, April 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Flajolet:2006:SWR

[632] Philippe Flajolet, Markus Nebel, andHelmut Prodinger. The scientific worksof Rainer Kemp (1949–2004). Theo-retical Computer Science, 355(3):371–381, April 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hitchcock:2006:HDO

[633] John M. Hitchcock. Hausdorff dimen-sion and oracle constructions. Theo-retical Computer Science, 355(3):382–388, April 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bazgan:2006:DCD

[634] Cristina Bazgan, Zsolt Tuza, andDaniel Vanderpooten. Degree-constrained decompositions of graphs:Bounded treewidth and planarity. The-oretical Computer Science, 355(3):389–395, April 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bertoni:2006:P

[635] Alberto Bertoni, Zoltan Esik, andJuhani Karhumaki. Preface. The-oretical Computer Science, 356(1–2):1–5, May 5, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Beal:2006:CUA

[636] Marie-Pierre Beal and Dominique Per-rin. Codes, unambiguous automataand sofic systems. Theoretical Com-puter Science, 356(1–2):6–13, May 5,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bertoni:2006:SFT

[637] Alberto Bertoni, Carlo Mereghetti, andBeatrice Palano. Some formal toolsfor analyzing quantum automata. The-oretical Computer Science, 356(1–2):14–25, May 5, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 105

Brijder:2006:RGP

[638] Robert Brijder, Hendrik Jan Hooge-boom, and Grzegorz Rozenberg. Re-ducibility of gene patterns in ciliatesusing the breakpoint graph. The-oretical Computer Science, 356(1–2):26–45, May 5, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Brzozowski:2006:RCN

[639] Janusz. A. Brzozowski. Representa-tion of a class of nondeterministic semi-automata by canonical words. The-oretical Computer Science, 356(1–2):46–57, May 5, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Castiglione:2006:RAC

[640] Giusi Castiglione, Antonio Restivo,and Roberto Vaglica. A reconstructionalgorithm for L-convex polyominoes.Theoretical Computer Science, 356(1–2):58–72, May 5, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chaubard:2006:AWP

[641] Laura Chaubard, Jean-Eric Pin, andHoward Straubing. Actions, wreathproducts of C-varieties and concatena-tion product. Theoretical ComputerScience, 356(1–2):73–89, May 5, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Cherubini:2006:PLT

[642] Alessandra Cherubini, Stefano CrespiReghizzi, Matteo Pradella, and Pier-luigi San Pietro. Picture languages:Tiling systems versus tile rewriting

grammars. Theoretical Computer Sci-ence, 356(1–2):90–103, May 5, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

DAlessandro:2006:SCF

[643] Flavio D’Alessandro, Benedetto Intrig-ila, and Stefano Varricchio. On thestructure of the counting function ofsparse context-free languages. The-oretical Computer Science, 356(1–2):104–117, May 5, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

deLuca:2006:SCF

[644] Aldo de Luca and Alessandro De Luca.Some characterizations of finite Stur-mian words. Theoretical Computer Sci-ence, 356(1–2):118–125, May 5, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Diekert:2006:LGT

[645] Volker Diekert and Paul Gastin. Fromlocal to global temporal logics overMazurkiewicz traces. Theoretical Com-puter Science, 356(1–2):126–135, May5, 2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Esik:2006:CCL

[646] Zoltan Esik. Characterizing CTL-likelogics on finite trees. Theoretical Com-puter Science, 356(1–2):136–152, May5, 2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Goldwurm:2006:PSV

[647] Massimiliano Goldwurm and ViolettaLonati. Pattern statistics and Van-dermonde matrices. Theoretical Com-puter Science, 356(1–2):153–169, May

REFERENCES 106

5, 2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Grigorieff:2006:SBD

[648] Serge Grigorieff. Synchronization of abounded degree graph of cellular au-tomata with nonuniform delays in timeDblogmDc. Theoretical Computer Sci-ence, 356(1–2):170–185, May 5, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Harju:2006:UFP

[649] Tero Harju and Dirk Nowotka. Onunique factorizations of primitivewords. Theoretical Computer Sci-ence, 356(1–2):186–189, May 5, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ibarra:2006:PBM

[650] Oscar H. Ibarra and Bala Ravikumar.On partially blind multihead finite au-tomata. Theoretical Computer Sci-ence, 356(1–2):190–199, May 5, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Karhumaki:2006:CC

[651] Juhani Karhumaki, Michal Kunc, andAlexander Okhotin. Computing bycommuting. Theoretical Computer Sci-ence, 356(1–2):200–211, May 5, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Latteux:2006:IBL

[652] Michel Latteux, Aurelien Lemay, YvesRoos, and Alain Terlutte. Identifi-cation of biRFSA languages. The-oretical Computer Science, 356(1–2):212–223, May 5, 2006. CODEN TC-


Lombardy:2006:S

[653] Sylvain Lombardy and Jacques Sakarovitch.Sequential? Theoretical Computer Sci-ence, 356(1–2):224–244, May 5, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Neraud:2006:CPC

[654] Jean Neraud. Completing prefix codesin submonoids. Theoretical Com-puter Science, 356(1–2):245–254, May5, 2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zielonka:2006:TSM

[655] Wies law Zielonka. Time-stamps forMazurkiewicz traces. Theoretical Com-puter Science, 356(1–2):255–262, May5, 2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2006:PC

[656] Anonymous. Professor Choffrut. The-oretical Computer Science, 356(1–2):v–ix, May 5, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2006:Pd

[657] Anonymous. Preface. Theoretical Com-puter Science, 356(1–2):xiv, May 5,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Baeten:2006:P

[658] Jos Baeten and Flavio Corradini. Pref-ace. Theoretical Computer Science, 356(3):263–264, May 30, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 107

vanGlabbeek:2006:EHD

[659] R. J. van Glabbeek. On the expressive-ness of higher dimensional automata.Theoretical Computer Science, 356(3):265–290, May 30, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). See erratum [923].

Corradini:2006:FCS

[660] F. Corradini, M. R. Di Berardini,and W. Vogler. Fairness of compo-nents in system computations. Theo-retical Computer Science, 356(3):291–324, May 30, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Andova:2006:BBP

[661] Suzana Andova and Tim A. C.Willemse. Branching bisimulation forprobabilistic systems: Characteristicsand decidability. Theoretical ComputerScience, 356(3):325–355, May 30, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Beffara:2006:CNS

[662] Emmanuel Beffara and Francois Mau-rel. Concurrent nets: A study of prefix-ing in process calculi. Theoretical Com-puter Science, 356(3):356–373, May 30,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Finkel:2006:LEP

[663] A. Finkel, G. Geeraerts, J.-F. Raskin,and L. Van Begin. On the ω-language expressive power of extendedPetri nets. Theoretical Computer Sci-ence, 356(3):374–386, May 30, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

DeNicola:2006:EPK

[664] Rocco De Nicola, Daniele Gorla, andRosario Pugliese. On the expressivepower of KLAIM-based calculi. Theo-retical Computer Science, 356(3):387–421, May 30, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bundgaard:2006:CEN

[665] Mikkel Bundgaard, Thomas Hilde-brandt, and Jens Chr. Godskesen.A CPS encoding of name-passingin Higher-order mobile embedded re-sources. Theoretical Computer Sci-ence, 356(3):422–439, May 30, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Guan:2006:NPA

[666] Xudong Guan. Name-passing in anambient-like calculus and its proof us-ing spatial logic. Theoretical ComputerScience, 356(3):440–467, May 30, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Phillips:2006:LER

[667] Iain Phillips and Maria GraziaVigliotti. Leader election in rings ofambient processes. Theoretical Com-puter Science, 356(3):468–494, May 30,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Artemov:2006:P

[668] Sergei Artemov and Michael Mislove.Preface. Theoretical Computer Science,357(1–3):1–3, July 25, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 108

Artemov:2006:JCK

[669] Sergei Artemov. Justified commonknowledge. Theoretical Computer Sci-ence, 357(1–3):4–22, July 25, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Brezhnev:2006:MKE

[670] Vladimir Brezhnev and Roman Kuznets.Making knowledge explicit: How hardit is. Theoretical Computer Science,357(1–3):23–34, July 25, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Buss:2006:PSF

[671] Samuel R. Buss. Polynomial-size Fregeand resolution proofs of st. The-oretical Computer Science, 357(1–3):35–52, July 25, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dershowitz:2006:ACP

[672] Nachum Dershowitz and Claude Kirch-ner. Abstract canonical presentations.Theoretical Computer Science, 357(1–3):53–69, July 25, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hyland:2006:CES

[673] Martin Hyland, Gordon Plotkin, andJohn Power. Combining effects: Sumand tensor. Theoretical Computer Sci-ence, 357(1–3):70–99, July 25, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Japaridze:2006:TC

[674] Giorgi Japaridze. From truth to com-putability I. Theoretical Computer Sci-

ence, 357(1–3):100–135, July 25, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Krupski:2006:CRL

[675] Nikolai V. Krupski. On the complexityof the reflected logic of proofs. The-oretical Computer Science, 357(1–3):136–142, July 25, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Krupski:2006:RLP

[676] Vladimir N. Krupski. Referential logicof proofs. Theoretical Computer Sci-ence, 357(1–3):143–166, July 25, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Naumov:2006:LS

[677] Pavel Naumov. Logic of subtyping.Theoretical Computer Science, 357(1–3):167–185, July 25, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Pentus:2006:LCN

[678] Mati Pentus. Lambek calculus is NP-complete. Theoretical Computer Sci-ence, 357(1–3):186–201, July 25, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Schwichtenberg:2006:APT

[679] Helmut Schwichtenberg. An arithmeticfor polynomial-time computation. The-oretical Computer Science, 357(1–3):202–214, July 25, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 109

Slavnov:2006:GSL

[680] Sergey Slavnov. Geometrical seman-tics for linear logic (multiplicative frag-ment). Theoretical Computer Sci-ence, 357(1–3):215–229, July 25, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

DeJaeger:2006:CCL

[681] Frederic De Jaeger, Martın Escardo,and Gabriele Santini. On the compu-tational content of the Lawson topol-ogy. Theoretical Computer Science, 357(1–3):230–240, July 25, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Fajstrup:2006:ATC

[682] Lisbeth Fajstrup, Martin Raußen, andEric Goubault. Algebraic topologyand concurrency. Theoretical ComputerScience, 357(1–3):241–278, July 25,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2006:Pe

[683] Anonymous. Preface. Theoretical Com-puter Science, 357(1–3):v–ix, July 25,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Rozenberg:2006:Pa

[684] G. Rozenberg. Preface. TheoreticalComputer Science, 358(1):1–2, July 31,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Broadbent:2006:PNL

[685] Anne Broadbent and Andre AllanMethot. On the power of non-localboxes. Theoretical Computer Science,358(1):3–14, July 31, 2006. CODEN


Miakisz:2006:QGT

[686] Katarzyna Miakisz, Edward W. Pi-otrowski, and Jan S ladkowski. Quan-tization of games: Towards quantumartificial intelligence. Theoretical Com-puter Science, 358(1):15–22, July 31,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Potgieter:2006:ZMH

[687] Petrus H. Potgieter. Zeno machinesand hypercomputation. TheoreticalComputer Science, 358(1):23–33, July31, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Garcez:2006:CCI

[688] Artur S. d’Avila Garcez, Luıs C. Lamb,and Dov M. Gabbay. Connectionistcomputations of intuitionistic reason-ing. Theoretical Computer Science, 358(1):34–55, July 31, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Liao:2006:GRD

[689] Bo Liao and Kequan Ding. A 3D graph-ical representation of DNA sequencesand its application. Theoretical Com-puter Science, 358(1):56–64, July 31,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Li:2006:DEB

[690] Lvzhou Li and Daowen Qiu. Determi-nation of equivalence between quantumsequential machines. Theoretical Com-puter Science, 358(1):65–74, July 31,

REFERENCES 110


Loos:2006:ADS

[691] Remco Loos. An alternative defini-tion of splicing. Theoretical ComputerScience, 358(1):75–87, July 31, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ibarra:2006:CCS

[692] Oscar H. Ibarra and Gheorghe Paun.Characterizations of context-sensitivelanguages and other language classes interms of symport/antiport P systems.Theoretical Computer Science, 358(1):88–103, July 31, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kumar:2006:AME

[693] Rajeev Kumar and Nilanjan Banerjee.Analysis of a Multiobjective Evolution-ary Algorithm on the 0–1 knapsackproblem. Theoretical Computer Sci-ence, 358(1):104–120, July 31, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Rogers:2006:PTS

[694] Alex Rogers, Adam Prugel-Bennett,and Nicholas R. Jennings. Phase tran-sitions and symmetry breaking in ge-netic algorithms with crossover. Theo-retical Computer Science, 358(1):121–141, July 31, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Czeizler:2006:PPC

[695] Elena Czeizler and Eugen Czeizler. Onthe power of parallel communicating

Watson–Crick automata systems. The-oretical Computer Science, 358(1):142–147, July 31, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2006:Pf

[696] Anonymous. Preface. Theoretical Com-puter Science, 358(1):v–ix, July 31,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gardner:2006:E

[697] Philippa Gardner and Nobuko Yoshida.Editorial. Theoretical Computer Sci-ence, 358(2–3):149, August 7, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bollig:2006:MPA

[698] Benedikt Bollig and Martin Leucker.Message-passing automata are expres-sively equivalent to EMSO logic. The-oretical Computer Science, 358(2–3):150–172, August 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Varacca:2006:PES

[699] Daniele Varacca, Hagen Volzer, andGlynn Winskel. Probabilistic eventstructures and domains. Theoreti-cal Computer Science, 358(2–3):173–199, August 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Mellies:2006:AGT

[700] Paul-Andre Mellies. Asynchronousgames 2: The true concurrency of inno-cence. Theoretical Computer Science,358(2–3):200–228, August 7, 2006.

REFERENCES 111


Amadio:2006:RCS

[701] Roberto M. Amadio and Silvano DalZilio. Resource control for synchronouscooperative threads. Theoretical Com-puter Science, 358(2–3):229–254, Au-gust 7, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Bojanczyk:2006:CEE

[702] Mikolaj Bojanczyk and Igor Walukiewicz.Characterizing EF and EX tree logics.Theoretical Computer Science, 358(2–3):255–272, August 7, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Markey:2006:MCR

[703] Nicolas Markey and Jean-FrancoisRaskin. Model checking restricted setsof timed paths. Theoretical ComputerScience, 358(2–3):273–292, August 7,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Caires:2006:EQU

[704] Luıs Caires and Etienne Lozes. Elimi-nation of quantifiers and undecidabilityin spatial logics for concurrency. The-oretical Computer Science, 358(2–3):293–314, August 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kucera:2006:GAC

[705] Antonın Kucera and Philippe Schnoe-belen. A general approach to com-paring infinite-state systems with theirfinite-state specifications. Theoreti-cal Computer Science, 358(2–3):315–

333, August 7, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Homeister:2006:LBR

[706] Matthias Homeister. Lower bounds forrestricted read-once parity branchingprograms. Theoretical Computer Sci-ence, 359(1–3):1–14, August 14, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Kamae:2006:MPC

[707] Teturo Kamae, Hui Rao, and Yu-Mei Xue. Maximal pattern complex-ity of two-dimensional words. Theo-retical Computer Science, 359(1–3):15–27, August 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Wu:2006:CVD

[708] Yongcheng Wu and Klaus Weihrauch.A computable version of the Daniell–Stone theorem on integration and lin-ear functionals. Theoretical ComputerScience, 359(1–3):28–42, August 14,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Balogh:2006:EBG

[709] Jozsef Balogh, Dhruv Mubayi, andAndras Pluhar. On the edge-bandwidth of graph products. The-oretical Computer Science, 359(1–3):43–57, August 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Verhoeven:2006:LBC

[710] Yves F. Verhoeven. A lower bound onthe competitivity of memoryless algo-rithms for a generalization of the CNN

REFERENCES 112

problem. Theoretical Computer Sci-ence, 359(1–3):58–68, August 14, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Chen:2006:EAF

[711] Chiuyuan Chen, James K. Lan, andWen-Shiang Tang. An efficient algo-rithm to find a double-loop networkthat realizes a given L-shape. Theo-retical Computer Science, 359(1–3):69–76, August 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Tiplea:2006:PNR

[712] Ferucio Laurentiu Tiplea and AuroraTiplea. Petri net reactive modules.Theoretical Computer Science, 359(1–3):77–100, August 14, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Arnold:2006:SGA

[713] Fredrick Arnold and Benjamin Stein-berg. Synchronizing groups and au-tomata. Theoretical Computer Science,359(1–3):101–110, August 14, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Leykin:2006:NMD

[714] Anton Leykin, Jan Verschelde, and Ail-ing Zhao. Newton’s method with defla-tion for isolated singularities of poly-nomial systems. Theoretical ComputerScience, 359(1–3):111–122, August 14,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Doerr:2006:IBS

[715] Benjamin Doerr, Nils Hebbinghaus,and Soren Werth. Improved bounds

and schemes for the declustering prob-lem. Theoretical Computer Science,359(1–3):123–132, August 14, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Sadahiro:2006:MPT

[716] Taizo Sadahiro. Multiple points oftilings associated with Pisot numera-tion systems. Theoretical ComputerScience, 359(1–3):133–147, August 14,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

DiGiacomo:2006:K

[717] Emilio Di Giacomo, Walter Didimo,Giuseppe Liotta, and Matthew Su-derman. k. Theoretical ComputerScience, 359(1–3):148–175, August 14,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gu:2006:NDP

[718] Xiaoyang Gu. A note on dimensionsof polynomial size circuits. Theoret-ical Computer Science, 359(1–3):176–187, August 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gurski:2006:VDP

[719] Frank Gurski and Egon Wanke. Vertexdisjoint paths on clique-width boundedgraphs. Theoretical Computer Science,359(1–3):188–199, August 14, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Garg:2006:ACB

[720] Vijay K. Garg. Algorithmic combina-torics based on slicing posets. Theoret-ical Computer Science, 359(1–3):200–213, August 14, 2006. CODEN TC-

REFERENCES 113


Fici:2006:WAT

[721] Gabriele Fici, Filippo Mignosi, Anto-nio Restivo, and Marinella Sciortino.Word assembly through minimal for-bidden words. Theoretical ComputerScience, 359(1–3):214–230, August 14,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Higgins:2006:US

[722] Peter M. Higgins and Christopher J.Saker. Unavoidable sets. Theoreti-cal Computer Science, 359(1–3):231–238, August 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lavault:2006:AAL

[723] Christian Lavault and Guy Louchard.Asymptotic analysis of a leader elec-tion algorithm. Theoretical ComputerScience, 359(1–3):239–254, August 14,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Barbe:2006:AAS

[724] A. Barbe and F. von Haeseler. Aver-ages of automatic sequences. Theoret-ical Computer Science, 359(1–3):255–281, August 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bjorner:2006:RMF

[725] Anders Bjorner and Bruce E. Sagan.Rationality of the Mobius functionof a composition poset. Theoreti-cal Computer Science, 359(1–3):282–298, August 14, 2006. CODEN TC-


Xu:2006:PDB

[726] Guangjun Xu, Liying Kang, ErfangShan, and Min Zhao. Power dom-ination in block graphs. Theoreti-cal Computer Science, 359(1–3):299–305, August 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

McTague:2006:APD

[727] Carl S. McTague and James P. Crutch-field. Automated pattern detection—An algorithm for constructing opti-mally synchronizing multi-regular lan-guage filters. Theoretical ComputerScience, 359(1–3):306–328, August 14,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Nebel:2006:FSM

[728] Markus E. Nebel. Fast string matchingby using probabilities: On an optimalmismatch variant of Horspool’s algo-rithm. Theoretical Computer Science,359(1–3):329–343, August 14, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Perez-Diaz:2006:DBP

[729] Sonia Perez-Dıaz, Juana Sendra, andJ. Rafael Sendra. Distance bounds ofε-points on hypersurfaces. Theoreti-cal Computer Science, 359(1–3):344–368, August 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Escoffier:2006:CAC

[730] Bruno Escoffier and Vangelis Th.Paschos. Completeness in approxima-

REFERENCES 114

tion classes beyond APX. Theoret-ical Computer Science, 359(1–3):369–377, August 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gorecki:2006:DTM

[731] Pawe l Gorecki and Jerzy Tiuryn. DLS-trees: A model of evolutionary sce-narios. Theoretical Computer Science,359(1–3):378–399, August 14, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Efraimidis:2006:ASS

[732] Pavlos S. Efraimidis and Paul G. Spi-rakis. Approximation schemes forscheduling and covering on unrelatedmachines. Theoretical Computer Sci-ence, 359(1–3):400–417, August 14,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Epstein:2006:CCS

[733] Leah Epstein and Asaf Levin. Theconference call search problem in wire-less networks. Theoretical ComputerScience, 359(1–3):418–429, August 14,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chan:2006:NRA

[734] Wun-Tat Chan, Tak-Wah Lam, Kin-Shing Liu, and Prudence W. H. Wong.New resource augmentation analysis ofthe total stretch of SRPT and SJFin multiprocessor scheduling. Theoret-ical Computer Science, 359(1–3):430–439, August 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ryabko:2006:AKC

[735] Boris Ryabko, Jaakko Astola, andAlex Gammerman. Application ofKolmogorov complexity and universalcodes to identity testing and nonpara-metric testing of serial independencefor time series. Theoretical ComputerScience, 359(1–3):440–448, August 14,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Szabo:2006:CCR

[736] Sandor Szabo. Completing codes andthe Redei property of groups. Theoret-ical Computer Science, 359(1–3):449–454, August 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dinu:2006:EAR

[737] Liviu P. Dinu and Florin Manea. Anefficient approach for the rank aggre-gation problem. Theoretical ComputerScience, 359(1–3):455–461, August 14,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2006:EBc

[738] Anonymous. Editorial board. Theo-retical Computer Science, 359(1–3):v–ix, August 14, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Friggens:2006:MPT

[739] David Friggens and Robert Goldblatt.A modal proof theory for final polyno-mial coalgebras. Theoretical ComputerScience, 360(1–3):1–22, August 21,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 115

Binkley:2006:TFD

[740] Dave Binkley, Sebastian Danicic, TiborGyimothy, Mark Harman, Akos Kiss,and Bogdan Korel. Theoretical founda-tions of dynamic program slicing. The-oretical Computer Science, 360(1–3):23–41, August 21, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bruscoli:2006:SPS

[741] Paola Bruscoli and Alessio Guglielmi.On structuring proof search for first or-der linear logic. Theoretical ComputerScience, 360(1–3):42–76, August 21,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Manes:2006:BRC

[742] Ernie Manes. Boolean restriction cat-egories and taut monads. Theoret-ical Computer Science, 360(1–3):77–95, August 21, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Demri:2006:LIP

[743] Stephane Demri. LTL over inte-ger periodicity constraints. Theoret-ical Computer Science, 360(1–3):96–123, August 21, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Guiraud:2006:TPP

[744] Yves Guiraud. Two polygraphic pre-sentations of Petri nets. Theoreti-cal Computer Science, 360(1–3):124–146, August 21, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zhu:2006:CTI

[745] Zhaohui Zhu, Rong Zhang, and ShanLu. A characterization theorem for in-jective model classes axiomatized bygeneral rules. Theoretical ComputerScience, 360(1–3):147–171, August 21,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lasota:2006:DPE

[746] Slawomir Lasota. Decidability of per-formance equivalence for basic paral-lel processes. Theoretical ComputerScience, 360(1–3):172–192, August 21,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dowek:2006:EBD

[747] Gilles Dowek and Ying Jiang. Eigen-variables, bracketing and the decidabil-ity of positive minimal predicate logic.Theoretical Computer Science, 360(1–3):193–208, August 21, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Luttgen:2006:BSU

[748] Gerald Luttgen and Walter Vogler.Bisimulation on speed: A unified ap-proach. Theoretical Computer Science,360(1–3):209–227, August 21, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Dougherty:2006:NFB

[749] Daniel J. Dougherty and ClaudioGutierrez. Normal forms for binary re-lations. Theoretical Computer Science,360(1–3):228–246, August 21, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 116

Nguyen:2006:MLP

[750] Linh Anh Nguyen. Multimodal logicprogramming. Theoretical ComputerScience, 360(1–3):247–288, August 21,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Tzevelekos:2006:IDC

[751] Nikos Tzevelekos. Investigations on theDual Calculus. Theoretical ComputerScience, 360(1–3):289–326, August 21,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hosoya:2006:BOI

[752] Haruo Hosoya and Makoto Murata.Boolean operations and inclusion testfor attribute-element constraints. The-oretical Computer Science, 360(1–3):327–351, August 21, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Bozzelli:2006:MCP

[753] Laura Bozzelli. Model checking forprocess rewrite systems and a class ofaction-based regular properties. The-oretical Computer Science, 360(1–3):352–372, August 21, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

vanBreugel:2006:ACB

[754] Franck van Breugel and James Wor-rell. Approximating and comput-ing behavioural distances in proba-bilistic transition systems. Theoret-ical Computer Science, 360(1–3):373–385, August 21, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bruni:2006:SFG

[755] Roberto Bruni and Jose Meseguer.Semantic foundations for generalizedrewrite theories. Theoretical ComputerScience, 360(1–3):386–414, August 21,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Michelbrink:2006:IFP

[756] Markus Michelbrink. Interfaces asfunctors, programs as coalgebras-A fi-nal coalgebra theorem in intensionaltype theory. Theoretical ComputerScience, 360(1–3):415–439, August 21,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Boreale:2006:PFP

[757] Michele Boreale and Fabio Gadducci.Processes as formal power series: Acoinductive approach to denotationalsemantics. Theoretical Computer Sci-ence, 360(1–3):440–458, August 21,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hartmann:2006:EAF

[758] Sven Hartmann, Sebastian Link, andKlaus-Dieter Schewe. Erratum to “Ax-iomatisations of functional dependen-cies in the presence of records, lists,sets and multisets”. Theoretical Com-puter Science, 360(1–3):459, August21, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic). See [619].

Anonymous:2006:AIb

[759] Anonymous. Author index. The-oretical Computer Science, 360(1–3):461, August 21, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 117

Anonymous:2006:MI

[760] Anonymous. Master index. Theoret-ical Computer Science, 360(1–3):463–472, August 21, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2006:MIb

[761] Anonymous. Master index. Theoret-ical Computer Science, 360(1–3):463–472, August 21, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2006:EBd


Vose:2006:P

[763] Michael D. Vose. Preface. Theoret-ical Computer Science, 361(1):1, Au-gust 28, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Whitley:2006:SSL

[764] Darrell Whitley and Jonathan Rowe.Subthreshold-seeking local search.Theoretical Computer Science, 361(1):2–17, August 28, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Arnold:2006:WME

[765] Dirk V. Arnold. Weighted multire-combination evolution strategies. The-oretical Computer Science, 361(1):18–37, August 28, 2006. CODEN TC-


Jagerskupper:2006:HUI

[766] Jens Jagerskupper. How the (1+1)ES using isotropic mutations minimizespositive definite quadratic forms. The-oretical Computer Science, 361(1):38–56, August 28, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Toussaint:2006:CRS

[767] Marc Toussaint. Compact representa-tions as a search strategy: Compres-sion EDAs. Theoretical Computer Sci-ence, 361(1):57–71, August 28, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Mitavskiy:2006:SRA

[768] Boris Mitavskiy and Jonathan Rowe.Some results about the Markov chainsassociated to GPs and general EAs.Theoretical Computer Science, 361(1):72–110, August 28, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Rowe:2006:DCG

[769] Jonathan E. Rowe, Michael D. Vose,and Alden H. Wright. Differentiablecoarse graining. Theoretical ComputerScience, 361(1):111–129, August 28,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2006:EBe

[770] Anonymous. Editorial board. The-oretical Computer Science, 361(1):v–ix, August 28, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 118

Anonymous:2006:Pg

[771] Anonymous. Preface. Theoretical Com-puter Science, 361(1):v–ix, August 28,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jansen:2006:P

[772] Klaus Jansen and Roberto Solis-Oba.Preface. Theoretical Computer Science,361(2–3):131–132, September 1, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Marx:2006:MSM

[773] Daniel Marx. Minimum sum multicol-oring on the edges of trees. Theoret-ical Computer Science, 361(2–3):133–149, September 1, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Krysta:2006:EAA

[774] Piotr Krysta and Krzysztof Lorys. Ef-ficient approximation algorithms forthe achromatic number. TheoreticalComputer Science, 361(2–3):150–171,September 1, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Demaine:2006:CCG

[775] Erik D. Demaine, Dotan Emanuel,Amos Fiat, and Nicole Immorlica. Cor-relation clustering in general weightedgraphs. Theoretical Computer Science,361(2–3):172–187, September 1, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Gortz:2006:ACV

[776] Inge Li Gørtz and Anthony Wirth.Asymmetry in k-center variants. The-

oretical Computer Science, 361(2–3):188–199, September 1, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Awerbuch:2006:TWC

[777] Baruch Awerbuch, Yossi Azar, YossiRichter, and Dekel Tsur. Tradeoffsin worst-case equilibria. TheoreticalComputer Science, 361(2–3):200–209,September 1, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

deKlerk:2006:PMP

[778] Etienne de Klerk, Monique Laurent,and Pablo A. Parrilo. A PTAS for theminimization of polynomials of fixeddegree over the simplex. Theoreti-cal Computer Science, 361(2–3):210–225, September 1, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Decker:2006:AAS

[779] T. Decker, T. Lucking, and B. Monien.A 5/4-approximation algorithm forscheduling identical malleable tasks.Theoretical Computer Science, 361(2–3):226–240, September 1, 2006. CO-DEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Uma:2006:RBC

[780] R. N. Uma, Joel Wein, and David P.Williamson. On the relationshipbetween combinatorial and LP-basedlower bounds for NP-hard schedulingproblems. Theoretical Computer Sci-ence, 361(2–3):241–256, September 1,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 119

Ageev:2006:OBS

[781] A. A. Ageev, A. V. Fishkin, A. V.Kononov, and S. V. Sevastyanov. Openblock scheduling in optical communica-tion networks. Theoretical ComputerScience, 361(2–3):257–274, September1, 2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fotakis:2006:IAF

[782] Dimitris Fotakis. Incremental algo-rithms for Facility Location and k-median. Theoretical Computer Science,361(2–3):275–313, September 1, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Azar:2006:LBT

[783] Yossi Azar, Amir Epstein, and LeahEpstein. Load balancing of tempo-rary tasks in the `p norm. Theoret-ical Computer Science, 361(2–3):314–328, September 1, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gutierrez:2006:HWM

[784] Sandra Gutierrez, Sven O. Krumke,Nicole Megow, and Tjark Vredeveld.How to whack moles. TheoreticalComputer Science, 361(2–3):329–341,September 1, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Demaine:2006:OST

[785] Erik D. Demaine, Sandor P. Fekete,and Shmuel Gal. Online searching withturn cost. Theoretical Computer Sci-ence, 361(2–3):342–355, September 1,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2006:AIc

[786] Anonymous. Author index. Theoret-ical Computer Science, 361(2–3):356–357, August 21, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fates:2006:FAB

[787] Nazim Fates, Eric Thierry, Michel Mor-van, and Nicolas Schabanel. Fully asyn-chronous behavior of double-quiescentelementary cellular automata. Theo-retical Computer Science, 362(1–3):1–16, October 11, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

El-Fakih:2006:PSP

[788] Khaled El-Fakih, Nina Yevtushenko,Sergey Buffalov, and Gregor v. Bochmann.Progressive solutions to a parallel au-tomata equation. Theoretical Com-puter Science, 362(1–3):17–32, October11, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Rossello:2006:AVR

[789] Francesc Rossello and Gabriel Valiente.An algebraic view of the relation be-tween largest common subtrees andsmallest common supertrees. Theo-retical Computer Science, 362(1–3):33–53, October 11, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hemaspaandra:2006:IPN

[790] Lane A. Hemaspaandra, Kari Pasanen,and Jorg Rothe. If P 6= NP thensome strongly noninvertible functionsare invertible. Theoretical Computer

REFERENCES 120

Science, 362(1–3):54–62, October 11,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Yang:2006:CAM

[791] Guizhen Yang. Computational aspectsof mining maximal frequent patterns.Theoretical Computer Science, 362(1–3):63–85, October 11, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Bollig:2006:PGD

[792] Beate Bollig, Stephan Waack, andPhilipp Woelfel. Parity graph-drivenread-once branching programs and anexponential lower bound for integermultiplication. Theoretical ComputerScience, 362(1–3):86–99, October 11,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Garcia:2006:V

[793] Pedro Garcıa and Jose Ruiz. V. The-oretical Computer Science, 362(1–3):100–114, October 11, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Ji:2006:SLD

[794] Min Ji, Yong He, and T. C. E.Cheng. Scheduling linear deterioratingjobs with an availability constraint on asingle machine. Theoretical ComputerScience, 362(1–3):115–126, October 11,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Boyar:2006:MRP

[795] Joan Boyar, Leah Epstein, Lene M.Favrholdt, Jens S. Kohrt, Kim S.Larsen, Morten M. Pedersen, and

Sanne Wøhlk. The maximum re-source bin packing problem. Theoret-ical Computer Science, 362(1–3):127–139, October 11, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Malvestuto:2006:MIS

[796] Francesco M. Malvestuto, MauroMezzini, and Marina Moscarini. Mini-mal invariant sets in a vertex-weightedgraph. Theoretical Computer Science,362(1–3):140–161, October 11, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Cheng:2006:IAM

[797] Chih-Huai Cheng, Kuan-Yu Chen,Wen-Chin Tien, and Kun-Mao Chao.Improved algorithms for the k-maximum-sums problems. Theoreti-cal Computer Science, 362(1–3):162–170, October 11, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Neary:2006:SFU

[798] Turlough Neary and Damien Woods.Small fast universal Turing machines.Theoretical Computer Science, 362(1–3):171–195, October 11, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Gasieniec:2006:DMM

[799] Leszek Gasieniec, Evangelos Kranakis,Andrzej Pelc, and Qin Xin. Deter-ministic M2M multicast in radio net-works. Theoretical Computer Science,362(1–3):196–206, October 11, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 121

Picantin:2006:FTD

[800] Matthieu Picantin. Finite transduc-ers for divisibility monoids. Theoret-ical Computer Science, 362(1–3):207–221, October 11, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Salomaa:2006:ICQ

[801] Arto Salomaa. Independence of cer-tain quantities indicating subword oc-currences. Theoretical Computer Sci-ence, 362(1–3):222–231, October 11,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kambites:2006:WPR

[802] Mark Kambites. Word problems recog-nisable by deterministic blind monoidautomata. Theoretical Computer Sci-ence, 362(1–3):232–237, October 11,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hussein:2006:UNO

[803] Mohamed Eid Hussein and UweSchwiegelshohn. Utilization of non-clairvoyant online schedules. Theoret-ical Computer Science, 362(1–3):238–247, October 11, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Crochemore:2006:LRB

[804] Maxime Crochemore, Costas S. Il-iopoulos, Manal Mohamed, and Marie-France Sagot. Longest repeats witha block of k don’t cares. Theoret-ical Computer Science, 362(1–3):248–254, October 11, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bretto:2006:CTG

[805] Alain Bretto, Alain Faisant, andThierry Vallee. Compatible topologieson graphs: An application to graph iso-morphism problem complexity. The-oretical Computer Science, 362(1–3):255–272, October 11, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Cheng:2006:MAS

[806] T. C. E. Cheng, C. T. Ng, and J. J.Yuan. Multi-agent scheduling on a sin-gle machine to minimize total weightednumber of tardy jobs. TheoreticalComputer Science, 362(1–3):273–281,October 11, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

deLuca:2006:PCO

[807] Aldo de Luca and Alessandro De Luca.Pseudopalindrome closure operators infree monoids. Theoretical ComputerScience, 362(1–3):282–300, October 11,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2006:EBf


Chwa:2006:P

[809] Kyung-Yong Chwa and J. Ian Munro.Preface. Theoretical Computer Science,363(1):1, October 25, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 122

Ratsaby:2006:CH

[810] Joel Ratsaby. Complexity of hyper-concepts. Theoretical Computer Sci-ence, 363(1):2–10, October 25, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Adamy:2006:CO

[811] Udo Adamy, Michael Hoffmann, JozsefSolymosi, and Milos Stojakovic. Color-ing octrees. Theoretical Computer Sci-ence, 363(1):11–17, October 25, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Azar:2006:IAO

[812] Yossi Azar, Amos Fiat, Meital Levy,and N. S. Narayanaswamy. An im-proved algorithm for online coloringof intervals with bandwidth. Theo-retical Computer Science, 363(1):18–27, October 25, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Tomita:2006:WCT

[813] Etsuji Tomita, Akira Tanaka, andHaruhisa Takahashi. The worst-casetime complexity for generating all max-imal cliques and computational exper-iments. Theoretical Computer Sci-ence, 363(1):28–42, October 25, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Tsukiji:2006:CPR

[814] Tatsuie Tsukiji and Zhi-Zhong Chen.Computing phylogenetic roots withbounded degrees and errors is NP-complete. Theoretical Computer Sci-ence, 363(1):43–59, October 25, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Jansson:2006:ILP

[815] Jesper Jansson and Wing-Kin Sung.Inferring a level-1 phylogenetic networkfrom a dense set of rooted triplets. The-oretical Computer Science, 363(1):60–68, October 25, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Leung:2006:EAO

[816] H. F. Leung, Z. S. Peng, and H. F.Ting. An efficient algorithm for onlinesquare detection. Theoretical ComputerScience, 363(1):69–75, October 25,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Woelfel:2006:CMO

[817] Philipp Woelfel. A constructionmethod for optimally universal hashfamilies and its consequences for the ex-istence of RBIBDs. Theoretical Com-puter Science, 363(1):76–84, October25, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Lefmann:2006:LTD

[818] Hanno Lefmann. Large triangles inthe d-dimensional unit cube. Theo-retical Computer Science, 363(1):85–98, October 25, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zhang:2006:AMW

[819] Yong Zhang, Qi Ge, Rudolf Fleischer,Tao Jiang, and Hong Zhu. Approxi-mating the minimum weight weak ver-tex cover. Theoretical Computer Sci-ence, 363(1):99–105, October 25, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 123

Anonymous:2006:Ph

[820] Anonymous. Preface. Theoretical Com-puter Science, 363(1):v–ix, October 25,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Farre:2006:E

[821] Jacques Farre and Igor Litovsky. Ed-itorial. Theoretical Computer Science,363(2):107, October 28, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Bailly:2006:CCP

[822] Arnaud Bailly, Mireille Clerbout, andIsabelle Simplot-Ryl. Component com-position preserving behavioral con-tracts based on communication traces.Theoretical Computer Science, 363(2):108–123, October 28, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Bastien:2006:PNF

[823] Cedric Bastien, Jurek Czyzowicz, Wo-jciech Fraczak, and Wojciech Ryt-ter. Prime normal form and equiv-alence of simple grammars. Theo-retical Computer Science, 363(2):124–134, October 28, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Campeanu:2006:ICM

[824] Cezar Campeanu, Andrei Paun, andJason R. Smith. Incremental construc-tion of minimal deterministic finitecover automata. Theoretical ComputerScience, 363(2):135–148, October 28,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ibarra:2006:DCS

[825] Oscar H. Ibarra and Hsu-Chun Yen.Deterministic catalytic systems arenot universal. Theoretical ComputerScience, 363(2):149–161, October 28,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jurdzinski:2006:RAR

[826] Tomasz Jurdzinski and Friedrich Otto.Restarting automata with restrictedutilization of auxiliary symbols. The-oretical Computer Science, 363(2):162–181, October 28, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Klein:2006:EDA

[827] Joachim Klein and Christel Baier.Experiments with deterministic ω-automata for formulas of linear tem-poral logic. Theoretical ComputerScience, 363(2):182–195, October 28,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lohrey:2006:CTA

[828] Markus Lohrey and Sebastian Maneth.The complexity of tree automata andXPath on grammar-compressed trees.Theoretical Computer Science, 363(2):196–210, October 28, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Rytter:2006:SSG

[829] Wojciech Rytter. The structure of sub-word graphs and suffix trees of Fi-bonacci words. Theoretical ComputerScience, 363(2):211–223, October 28,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 124

Althoff:2006:ODB

[830] Christoph Schulte Althoff, WolfgangThomas, and Nico Wallmeier. Obser-vations on determinization of Buchi au-tomata. Theoretical Computer Science,363(2):224–233, October 28, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Tamm:2006:SRT

[831] Hellis Tamm, Matti Nykanen, andEsko Ukkonen. On size reduction tech-niques for multitape automata. Theo-retical Computer Science, 363(2):234–246, October 28, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Megiddo:2006:P

[832] Nimrod Megiddo, Yinfeng Xu, andBinhai Zhu. Preface. Theoretical Com-puter Science, 363(3):247, October 31,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cai:2006:CAF

[833] Mao cheng Cai, Xiaotie Deng, andZhongfei Li. Computation of arbi-trage in frictional bond markets. The-oretical Computer Science, 363(3):248–256, October 31, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

He:2006:IAT

[834] Yong He, Weiya Zhong, and HuikunGu. Improved algorithms for two sin-gle machine scheduling problems. The-oretical Computer Science, 363(3):257–265, October 31, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lin:2006:GBW

[835] Mingen Lin, Zhiyong Lin, and JinhuiXu. Graph bandwidth of weightedcaterpillars. Theoretical ComputerScience, 363(3):266–277, October 31,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chen:2006:PCT

[836] Jianer Chen and Fenghui Zhang. Onproduct covering in 3-tier supply chainmodels: Natural complete problemsfor W. Theoretical Computer Science,363(3):278–288, October 31, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Gabor:2006:AAF

[837] Adriana F. Gabor and Jan-Kees C. W.van Ommeren. Approximation algo-rithms for facility location problemswith a special class of subadditivecost functions. Theoretical ComputerScience, 363(3):289–300, October 31,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gavalda:2006:F

[838] Richard Gavalda and Eiji Takimoto.Foreword. Theoretical Computer Sci-ence, 364(1):1–2, November 2, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Nouretdinov:2006:CCT

[839] Ilia Nouretdinov and Vladimir Vovk.Criterion of calibration for transduc-tive confidence machine with limitedfeedback. Theoretical Computer Sci-ence, 364(1):3–9, November 2, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 125

Vovk:2006:WCP

[840] Vladimir Vovk. Well-calibrated predic-tions from on-line compression models.Theoretical Computer Science, 364(1):10–26, November 2, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hutter:2006:GCU

[841] Marcus Hutter. On generalized com-putable universal priors and their con-vergence. Theoretical Computer Sci-ence, 364(1):27–41, November 2, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Zilles:2006:AIC

[842] Sandra Zilles. An approach to intrinsiccomplexity of uniform learning. The-oretical Computer Science, 364(1):42–61, November 2, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Martin:2006:OVD

[843] Eric Martin, Arun Sharma, and FrankStephan. On ordinal VC-dimensionand some notions of complexity. The-oretical Computer Science, 364(1):62–76, November 2, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zeugmann:2006:LLS

[844] Thomas Zeugmann. From learning inthe limit to stochastic finite learning.Theoretical Computer Science, 364(1):77–97, November 2, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Uemura:2006:LEP

[845] Jin Uemura and Masako Sato. Learn-ing of erasing primitive formal sys-tems from positive examples. The-oretical Computer Science, 364(1):98–114, November 2, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Case:2006:LSR

[846] John Case, Sanjay Jain, Rudiger Reis-chuk, Frank Stephan, and ThomasZeugmann. Learning a subclass of reg-ular patterns in polynomial time. The-oretical Computer Science, 364(1):115–131, November 2, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kitagawa:2006:SEK

[847] Genshiro Kitagawa. Signal extrac-tion and knowledge discovery basedon statistical modeling. Theoreti-cal Computer Science, 364(1):132–142,November 2, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2006:EBg

[848] Anonymous. Editorial board. The-oretical Computer Science, 364(1):v–ix, November 2, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

deQueiroz:2006:P

[849] Ruy de Queiroz and Patrick Cegielski.Preface. Theoretical Computer Science,364(2):143–145, November 6, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 126

Bellin:2006:CPT

[850] Gianluigi Bellin, Martin Hyland, Ed-mund Robinson, and Christian Ur-ban. Categorical proof theory of clas-sical propositional calculus. Theo-retical Computer Science, 364(2):146–165, November 6, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ehrhard:2006:DIN

[851] T. Ehrhard and L. Regnier. Differentialinteraction nets. Theoretical ComputerScience, 364(2):166–195, November 6,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Finkel:2006:DPL

[852] Olivier Finkel. On decidability prop-erties of local sentences. Theoreti-cal Computer Science, 364(2):196–211,November 6, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hartmann:2006:DIF

[853] Sven Hartmann and Sebastian Link.Deciding implication for functional de-pendencies in complex-value databases.Theoretical Computer Science, 364(2):212–240, November 6, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Kaminski:2006:DTM

[854] Michael Kaminski and Julia Rubin-Mosin. Default theories over monadiclanguages. Theoretical Computer Sci-ence, 364(2):241–253, November 6,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Power:2006:GMC

[855] John Power. Generic models for com-putational effects. Theoretical Com-puter Science, 364(2):254–269, Novem-ber 6, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Hofmann:2006:P

[856] Martin Hofmann and Hans-WolfgangLoidl. Preface. Theoretical ComputerScience, 364(3):271–272, November 8,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Besson:2006:PCC

[857] Frederic Besson, Thomas Jensen, andDavid Pichardie. Proof-carrying codefrom certified abstract interpretationand fixpoint compression. Theoreti-cal Computer Science, 364(3):273–291,November 8, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Laud:2006:TSE

[858] Peeter Laud, Tarmo Uustalu, andVarmo Vene. Type systems equiva-lent to data-flow analyses for impera-tive languages. Theoretical ComputerScience, 364(3):292–310, November 8,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kennedy:2006:SNP

[859] Andrew Kennedy. Securing the .NETprogramming model. Theoretical Com-puter Science, 364(3):311–317, Novem-ber 8, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

REFERENCES 127

Cansell:2006:FIC

[860] Dominique Cansell and DominiqueMery. Formal and incremental con-struction of distributed algorithms: Onthe distributed reference counting algo-rithm. Theoretical Computer Science,364(3):318–337, November 8, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Niehren:2006:CLC

[861] J. Niehren, J. Schwinghammer, andG. Smolka. A concurrent lambda calcu-lus with futures. Theoretical ComputerScience, 364(3):338–356, November 8,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

deBoer:2006:P

[862] Frank de Boer and Marcello Bon-sangue. Preface. Theoretical Com-puter Science, 365(1–2):1, November10, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Barbosa:2006:TPC

[863] Luıs S. Barbosa and Jose N. Oliveira.Transposing partial components—Anexercise on coalgebraic refinement.Theoretical Computer Science, 365(1–2):2–22, November 10, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Johnsen:2006:CTS

[864] Einar Broch Johnsen, Olaf Owe, andIngrid Chieh Yu. Creol: A type-safe object-oriented model for dis-tributed concurrent systems. Theo-retical Computer Science, 365(1–2):23–66, November 10, 2006. CODEN TC-


Chatterjee:2006:GSE

[865] Krishnendu Chatterjee, Thomas A.Henzinger, and Marcin Jurdzinski.Games with secure equilibria. Theo-retical Computer Science, 365(1–2):67–82, November 10, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cheung:2006:SPP

[866] Ling Cheung, Nancy Lynch, RobertoSegala, and Frits Vaandrager. SwitchedPIOA: Parallel composition via dis-tributed scheduling. TheoreticalComputer Science, 365(1–2):83–108,November 10, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jifeng:2006:RRC

[867] He Jifeng, Xiaoshan Li, and Zhim-ing Liu. rCOS: A refinement cal-culus of object systems. TheoreticalComputer Science, 365(1–2):109–142,November 10, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Naumann:2006:TIM

[868] David A. Naumann and Mike Barnett.Towards imperative modules: Reason-ing about invariants and sharing of mu-table state. Theoretical Computer Sci-ence, 365(1–2):143–168, November 10,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2006:EBh

[869] Anonymous. Editorial board. Theo-retical Computer Science, 365(1–2):v–

REFERENCES 128

ix, November 10, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kopperman:2006:F

[870] Ralph Kopperman, Prakash Panan-gaden, Michael B. Smyth, DieterSpreen, and Julian Webster. Fore-word. Theoretical Computer Science,365(3):169–170, November 12, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Abbes:2006:PTB

[871] Samy Abbes and Klaus Keimel. Projec-tive topology on bifinite domains andapplications. Theoretical ComputerScience, 365(3):171–183, November 12,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Abe:2006:CTI

[872] K. Abe, J. Bisceglio, D. R. Fergu-son, T. J. Peters, A. C. Russell, andT. Sakkalis. Computational topol-ogy for isotopic surface reconstruction.Theoretical Computer Science, 365(3):184–198, November 12, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Fajstrup:2006:CLP

[873] Lisbeth Fajstrup. Cubical local par-tial orders on cubically subdividedspaces—Existence and construction.Theoretical Computer Science, 365(3):199–205, November 12, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Gratus:2006:SVI

[874] Jonathan Gratus and Timothy Porter.A spatial view of information. Theo-

retical Computer Science, 365(3):206–215, November 12, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hamrin:2006:TCE

[875] G. Hamrin and V. Stoltenberg-Hansen.Two categories of effective continuouscpos. Theoretical Computer Science,365(3):216–236, November 12, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Kunzi:2006:PQM

[876] H.-P. A. Kunzi, H. Pajoohesh, andM. P. Schellekens. Partial quasi-metrics. Theoretical Computer Science,365(3):237–246, November 12, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Raussen:2006:DDM

[877] Martin Raußen. Deadlocks and diho-motopy in mutual exclusion models.Theoretical Computer Science, 365(3):247–257, November 12, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Selivanov:2006:TDS

[878] Victor L. Selivanov. Towards a descrip-tive set theory for domain-like struc-tures. Theoretical Computer Science,365(3):258–282, November 12, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Fiadeiro:2006:P

[879] Jose Fiadeiro and Jan Rutten. Preface.Theoretical Computer Science, 366(1–2):1–2, November 16, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 129

Milius:2006:CTS

[880] Stefan Milius and Lawrence S. Moss.The category-theoretic solution of re-cursive program schemes. Theoreti-cal Computer Science, 366(1–2):3–59,November 16, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). See corrigendum[1708].

Aceto:2006:BFB

[881] Luca Aceto, Wan Fokkink, Anna In-golfsdottir, and Sumit Nain. Bisimi-larity is not finitely based over BPAwith interrupt. Theoretical ComputerScience, 366(1–2):60–81, November 16,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Adamek:2006:IAC

[882] J. Adamek. The intersection of algebraand coalgebra. Theoretical ComputerScience, 366(1–2):82–97, November 16,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bruni:2006:BAS

[883] Roberto Bruni, Ivan Lanese, and UgoMontanari. A basic algebra of statelessconnectors. Theoretical Computer Sci-ence, 366(1–2):98–120, November 16,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hausmann:2006:CAS

[884] Daniel Hausmann, Till Mossakowski,and Lutz Schroder. A coalgebraic ap-proach to the semantics of the ambi-ent calculus. Theoretical Computer Sci-ence, 366(1–2):121–143, November 16,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hyland:2006:DLT

[885] Martin Hyland and John Power. Dis-crete Lawvere theories and computa-tional effects. Theoretical ComputerScience, 366(1–2):144–162, November16, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Thati:2006:CSR

[886] Prasanna Thati and Jose Meseguer.Complete symbolic reachability anal-ysis using back-and-forth narrowing.Theoretical Computer Science, 366(1–2):163–179, November 16, 2006. CO-DEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Anonymous:2006:EBi


Esik:2006:P

[888] Zoltan Esik. Preface. Theoretical Com-puter Science, 366(3):181, November20, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Domaratzki:2006:CDM

[889] Michael Domaratzki and Kai Salomaa.Codes defined by multiple sets of tra-jectories. Theoretical Computer Sci-ence, 366(3):182–193, November 20,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 130

Domosi:2006:APL

[890] Pal Domosi and Geza Horvath.Alternative proof of the Lyndon–Schutzenberger Theorem. Theoreti-cal Computer Science, 366(3):194–198,November 20, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Droste:2006:SIF

[891] Manfred Droste and Dietrich Kuske.Skew and infinitary formal power se-ries. Theoretical Computer Science,366(3):199–227, November 20, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Droste:2006:WTA

[892] Manfred Droste and Heiko Vogler.Weighted tree automata and weightedlogics. Theoretical Computer Science,366(3):228–247, November 20, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Maletti:2006:CTS

[893] Andreas Maletti. Compositions oftree series transformations. Theoreti-cal Computer Science, 366(3):248–271,November 20, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Mraz:2006:MCG

[894] F. Mraz, F. Otto, M. Platek, and T. Ju-rdzinski. Marcus t-contextual gram-mars and cut hierarchies and mono-tonicity for restarting automata. The-oretical Computer Science, 366(3):272–296, November 20, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Truthe:2006:FST

[895] Bianca Truthe. The finiteness of syn-chronous, tabled picture languages isdecidable. Theoretical Computer Sci-ence, 366(3):297–315, November 20,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Degano:2006:P

[896] Pierpaolo Degano and Luca Vigano.Preface. Theoretical Computer Sci-ence, 367(1–2):1, November 24, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Abadi:2006:DKS

[897] Martın Abadi and Veronique Cortier.Deciding knowledge in security proto-cols under equational theories. Theo-retical Computer Science, 367(1–2):2–32, November 24, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Backes:2006:CAC

[898] Michael Backes, Anupam Datta, AnteDerek, John C. Mitchell, and Math-ieu Turuani. Compositional analysisof contract-signing protocols. Theo-retical Computer Science, 367(1–2):33–56, November 24, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Butler:2006:FAK

[899] Frederick Butler, Iliano Cervesato,Aaron D. Jaggard, Andre Scedrov, andChristopher Walstad. Formal analysisof Kerberos 5. Theoretical ComputerScience, 367(1–2):57–87, November 24,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 131

Caleiro:2006:SAS

[900] Carlos Caleiro, Luca Vigano, andDavid Basin. On the semantics of Al-ice&Bob specifications of security pro-tocols. Theoretical Computer Science,367(1–2):88–122, November 24, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Chatzikokolakis:2006:PIR

[901] Konstantinos Chatzikokolakis andCatuscia Palamidessi. Probable inno-cence revisited. Theoretical ComputerScience, 367(1–2):123–138, November24, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Cremers:2006:ISE

[902] C. J. F. Cremers, S. Mauw, and E. P.de Vink. Injective synchronisation: Anextension of the authentication hier-archy. Theoretical Computer Science,367(1–2):139–161, November 24, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Escobar:2006:RBI

[903] Santiago Escobar, Catherine Meadows,and Jose Meseguer. A rewriting-basedinference system for the NRL Proto-col Analyzer and its meta-logical prop-erties. Theoretical Computer Science,367(1–2):162–202, November 24, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Nanz:2006:FSA

[904] Sebastian Nanz and Chris Hankin. Aframework for security analysis of mo-bile wireless networks. TheoreticalComputer Science, 367(1–2):203–227,

November 24, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ramanujam:2006:RQE

[905] R. Ramanujam and S. P. Suresh. A (re-stricted) quantifier elimination for se-curity protocols. Theoretical ComputerScience, 367(1–2):228–256, November24, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Steel:2006:FAP

[906] Graham Steel. Formal analysis of PINblock attacks. Theoretical ComputerScience, 367(1–2):257–270, November24, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Anonymous:2006:EBj


Rozenberg:2006:Pb

[908] G. Rozenberg. Preface. Theoreti-cal Computer Science, 367(3):271–272,December 1, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Liu:2006:CFN

[909] Yiguang Liu, Zhisheng You, and Lip-ing Cao. A concise functional neuralnetwork computing the largest modu-lus eigenvalues and their correspondingeigenvectors of a real skew matrix. The-oretical Computer Science, 367(3):273–285, December 1, 2006. CODEN TC-

REFERENCES 132


Lv:2006:GCO

[910] Jian Cheng Lv, Zhang Yi, and K. K.Tan. Global convergence of Oja’s PCAlearning algorithm with a non-zero-approaching adaptive learning rate.Theoretical Computer Science, 367(3):286–307, December 1, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Izmerly:2006:CCA

[911] Oleg Izmerly and Tal Mor. Chosen ci-phertext attacks on lattice-based pub-lic key encryption and modern (non-quantum) cryptography in a quantumenvironment. Theoretical ComputerScience, 367(3):308–323, December 1,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Carpentieri:2006:GSB

[912] Marco Carpentieri. A genetic sys-tem based on simulated crossover ofsequences of two-bit genes. Theo-retical Computer Science, 367(3):324–335, December 1, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Khan:2006:SMQ

[913] Faisal Shah Khan and Marek Perkowski.Synthesis of multi-qudit hybrid and d-valued quantum logic circuits by de-composition. Theoretical ComputerScience, 367(3):336–346, December 1,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).See erratum [1691].

Anonymous:2006:EBk

[914] Anonymous. Editorial board. The-oretical Computer Science, 367(3):iii–vii, December 1, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Drossopoulou:2006:FMD

[915] Sophia Drossopoulou, Giovanni Lago-rio, and Susan Eisenbach. A flexi-ble model for dynamic linking in Javaand C#. Theoretical Computer Sci-ence, 368(1–2):1–29, December 5, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Krotzsch:2006:GUS

[916] Markus Krotzsch. Generalized ul-trametric spaces in quantitative do-main theory. Theoretical ComputerScience, 368(1–2):30–49, December 5,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kaminski:2006:IUS

[917] Michael Kaminski. Invariance understuttering in a temporal logic of ac-tions. Theoretical Computer Science,368(1–2):50–63, December 5, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Vasconcelos:2006:TCM

[918] Vasco T. Vasconcelos, Simon J. Gay,and Antonio Ravara. Type check-ing a multithreaded functional lan-guage with session types. Theoret-ical Computer Science, 368(1–2):64–87, December 5, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 133

Afrati:2006:RQU

[919] Foto Afrati, Chen Li, and PrasenjitMitra. Rewriting queries using viewsin the presence of arithmetic compar-isons. Theoretical Computer Science,368(1–2):88–123, December 5, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Chen:2006:LAS

[920] Yi-Xiang Chen and Achim Jung. A log-ical approach to stable domains. The-oretical Computer Science, 368(1–2):124–148, December 5, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Zhang:2006:FFR

[921] Zaiyue Zhang, Yuefei Sui, Cungen Cao,and Guohua Wu. A formal fuzzyreasoning system and reasoning mech-anism based on propositional modallogic. Theoretical Computer Science,368(1–2):149–160, December 5, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Delaune:2006:URA

[922] Stephanie Delaune. An undecidabilityresult for AGh. Theoretical ComputerScience, 368(1–2):161–167, December5, 2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

vanGlabbeek:2006:EEH

[923] R. J. van Glabbeek. Erratum to “Onthe expressiveness of higher dimen-sional automata”: [Theoret. Comput.Sci. 356 (2006) 265–290]. Theoreti-cal Computer Science, 368(1–2):168–194, December 5, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). See [659].

Anonymous:2006:EBl

[924] Anonymous. Editorial board. Theo-retical Computer Science, 368(1–2):v–ix, December 5, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Sahinalp:2006:P

[925] Suleyman Cenk Sahinalp, Ugur Dogru-soz, and S. Muthukrishnan. Preface.Theoretical Computer Science, 368(3):195, December 10, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Amir:2006:FTD

[926] Amihood Amir, Oren Kapah, andDekel Tsur. Faster two-dimensionalpattern matching with rotations. The-oretical Computer Science, 368(3):196–204, December 10, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Davydov:2006:CMR

[927] Eugene Davydov and Serafim Bat-zoglou. A computational model forRNA multiple structural alignment.Theoretical Computer Science, 368(3):205–216, December 10, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Lonardi:2006:FBR

[928] Stefano Lonardi, Wojciech Szpankowski,and Qiaofeng Yang. Finding biclus-ters by random projections. Theo-retical Computer Science, 368(3):217–230, December 10, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 134

Geary:2006:SOR

[929] Richard F. Geary, Naila Rahman,Rajeev Raman, and Venkatesh Ra-man. A simple optimal representa-tion for balanced parentheses. Theo-retical Computer Science, 368(3):231–246, December 10, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jurdzinski:2006:DNM

[930] T. Jurdzinski, F. Mraz, F. Otto,and M. Platek. Degrees of non-monotonicity for restarting automata.Theoretical Computer Science, 369(1–3):1–34, December 15, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Pikhurko:2006:EBG

[931] Oleg Pikhurko and Jerzy Woj-ciechowski. Edge-bandwidth of gridsand tori. Theoretical Computer Sci-ence, 369(1–3):35–43, December 15,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chen:2006:ESS

[932] Jing-Chao Chen. Efficient sample sortand the average case analysis of PE-sort. Theoretical Computer Science,369(1–3):44–66, December 15, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bordihn:2006:IST

[933] Henning Bordihn, Henning Fernau,Markus Holzer, Vincenzo Manca, andCarlos Martın-Vide. Iterated sequen-tial transducers as language generatingdevices. Theoretical Computer Science,369(1–3):67–81, December 15, 2006.


Eiter:2006:RUM

[934] Thomas Eiter and Georg Gottlob. Rea-soning under minimal upper bounds inpropositional logic. Theoretical Com-puter Science, 369(1–3):82–115, De-cember 15, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gairing:2006:PAP

[935] Martin Gairing, Thomas Lucking,Marios Mavronicolas, and BurkhardMonien. The price of anarchy forpolynomial social cost. TheoreticalComputer Science, 369(1–3):116–135,December 15, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Wu:2006:IDT

[936] Bang Ye Wu. On the interclusterdistance of a tree metric. Theoret-ical Computer Science, 369(1–3):136–141, December 15, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Terrier:2006:LCC

[937] Veronique Terrier. Low complexityclasses of multidimensional cellular au-tomata. Theoretical Computer Science,369(1–3):142–156, December 15, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Angel:2006:TAS

[938] Eric Angel, Evripidis Bampis, andFanny Pascual. Truthful algorithmsfor scheduling selfish tasks on parallel

REFERENCES 135

machines. Theoretical Computer Sci-ence, 369(1–3):157–168, December 15,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Blundo:2006:VCS

[939] Carlo Blundo, Stelvio Cimato, and Al-fredo De Santis. Visual cryptogra-phy schemes with optimal pixel expan-sion. Theoretical Computer Science,369(1–3):169–182, December 15, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Domaratzki:2006:APS

[940] Michael Domaratzki, Petr Sosık, andAlfonso Rodrıguez-Paton. Algebraicproperties of substitution on trajecto-ries. Theoretical Computer Science,369(1–3):183–196, December 15, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Rostamabadi:2006:LUA

[941] Farshad Rostamabadi and MohammadGhodsi. Label updating to avoid point-shaped obstacles in fixed model. The-oretical Computer Science, 369(1–3):197–210, December 15, 2006. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Travers:2006:CMP

[942] Stephen Travers. The complexity ofmembership problems for circuits oversets of integers. Theoretical ComputerScience, 369(1–3):211–229, December15, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Kellerer:2006:FPA

[943] Hans Kellerer and Vitaly A. Struse-vich. A fully polynomial approximationscheme for the single machine weightedtotal tardiness problem with a commondue date. Theoretical Computer Sci-ence, 369(1–3):230–238, December 15,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bebek:2006:DDG

[944] G. Bebek, P. Berenbrink, C. Cooper,T. Friedetzky, J. Nadeau, and S. C.Sahinalp. The degree distributionof the generalized duplication model.Theoretical Computer Science, 369(1–3):239–249, December 15, 2006. CO-DEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Hou:2006:LEL

[945] Jianfeng Hou, Guizhen Liu, and Jian-sheng Cai. List edge and list totalcolorings of planar graphs without 4-cycles. Theoretical Computer Science,369(1–3):250–255, December 15, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Yan:2006:EST

[946] Weigen Yan and Yeong-Nan Yeh. Enu-meration of subtrees of trees. Theoret-ical Computer Science, 369(1–3):256–268, December 15, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bilo:2006:SCM

[947] V. Bilo, M. Flammini, G. Melideo,L. Moscardelli, and A. Navarra. Shar-ing the cost of multicast transmis-sions in wireless networks. Theoret-

REFERENCES 136

ical Computer Science, 369(1–3):269–284, December 15, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Epstein:2006:RSP

[948] Leah Epstein and Alex Kesselman. Onthe remote server problem or moreabout TCP acknowledgments. Theoret-ical Computer Science, 369(1–3):285–299, December 15, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hoffmann:2006:GCA

[949] Michael Hoffmann and Richard M.Thomas. A geometric characteriza-tion of automatic semigroups. Theoret-ical Computer Science, 369(1–3):300–313, December 15, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Forys:2006:AAP

[950] Wit Forys and Tomasz Krawczyk. Analgorithmic approach to the problemof a semiretract base. TheoreticalComputer Science, 369(1–3):314–322,December 15, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Arora:2006:SRA

[951] Amrinder Arora, Fanchun Jin, andHyeong-Ah Choi. Scheduling resourceallocation with timeslot penalty forchangeover. Theoretical Computer Sci-ence, 369(1–3):323–337, December 15,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Koch:2006:CAS

[952] Ronald Koch and Ines Spenke. Com-plexity and approximability of k-splittable flows. Theoretical ComputerScience, 369(1–3):338–347, December15, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Dolev:2006:DLB

[953] Shlomi Dolev, Roberto Segala, andAlexander Shvartsman. Dynamic loadbalancing with group communication.Theoretical Computer Science, 369(1–3):348–360, December 15, 2006. CO-DEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Pion:2006:CRB

[954] Sylvain Pion and Chee K. Yap. Con-structive root bound for k-ary ra-tional input numbers. TheoreticalComputer Science, 369(1–3):361–376,December 15, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Azriel:2006:QLR

[955] D. Azriel and D. Berend. On a ques-tion of Leiss regarding the Hanoi Towerproblem. Theoretical Computer Sci-ence, 369(1–3):377–383, December 15,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Levin:2006:PMT

[956] Asaf Levin and Danny Segev. Par-tial multicuts in trees. TheoreticalComputer Science, 369(1–3):384–395,December 15, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 137

Acuna:2006:CVB

[957] Vicente Acuna, Gilles Didier, and Ale-jandro Maass. Coding with variableblock maps. Theoretical Computer Sci-ence, 369(1–3):396–405, December 15,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Branco:2006:TAA

[958] Mario J. J. Branco. Two algebraicapproaches to variants of the concate-nation product. Theoretical ComputerScience, 369(1–3):406–426, December15, 2006. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Gonzalez:2006:PED

[959] Teofilo F. Gonzalez and David Serena.Pairwise edge disjoint shortest paths inthe n-cube. Theoretical Computer Sci-ence, 369(1–3):427–435, December 15,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kuppusamy:2006:NAI

[960] Lakshmanan Kuppusamy. A note onambiguity of internal contextual gram-mars. Theoretical Computer Science,369(1–3):436–441, December 15, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Chen:2006:CDC

[961] Wei-Mei Chen. Cost distribution ofthe Chang–Roberts leader election al-gorithm and related problems. Theoret-ical Computer Science, 369(1–3):442–447, December 15, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dai:2006:ERS

[962] Wenqiang Dai, Yinfeng Xu, and Bin-hai Zhu. On the edge l∞ radiusof Saitou and Nei’s method for phy-logenetic reconstruction. TheoreticalComputer Science, 369(1–3):448–455,December 15, 2006. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zhao:2006:NFA

[963] Wenbo Zhao, Peng Zhang, and TaoJiang. A network flow approach to theMinimum Common Integer PartitionProblem. Theoretical Computer Sci-ence, 369(1–3):456–462, December 15,2006. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gajardo:2006:CIT

[964] A. Gajardo and E. Goles. Crossinginformation in two-dimensional Sand-piles. Theoretical Computer Science,369(1–3):463–469, December 15, 2006.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Anonymous:2006:EBm


Nicolas:2007:LCS

[966] Francois Nicolas and Eric Rivals.Longest common subsequence problemfor unoriented and cyclic strings. The-oretical Computer Science, 370(1–3):1–18, February 12, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 138

Kim:2007:EAA

[967] Jin Wook Kim and Kunsoo Park.An efficient alignment algorithm formasked sequences. Theoretical Com-puter Science, 370(1–3):19–33, Febru-ary 12, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Gajardo:2007:OHM

[968] A. Gajardo and J. Mazoyer. One HeadMachines from a symbolic approach.Theoretical Computer Science, 370(1–3):34–47, February 12, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Avigad:2007:QER

[969] Jeremy Avigad and Yimu Yin. Quan-tifier elimination for the reals with apredicate for the powers of two. Theo-retical Computer Science, 370(1–3):48–59, February 12, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Glasser:2007:CDN

[970] Christian Glaßer, Alan L. Selman, andLiyu Zhang. Canonical disjoint NP-pairs of propositional proof systems.Theoretical Computer Science, 370(1–3):60–73, February 12, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Giakoumakis:2007:AMP

[971] Vassilis Giakoumakis and StephanOlariu. All minimal prime extensionsof hereditary classes of graphs. Theo-retical Computer Science, 370(1–3):74–93, February 12, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Saunders:2007:SSP

[972] Shane Saunders and Tadao Takaoka.Solving shortest paths efficiently onnearly acyclic directed graphs. Theo-retical Computer Science, 370(1–3):94–109, February 12, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Han:2007:OSR

[973] Yo-Sub Han and Derick Wood. Obtain-ing shorter regular expressions fromfinite-state automata. TheoreticalComputer Science, 370(1–3):110–120,February 12, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Pan:2007:IPP

[974] Jun-Jie Pan and Gerard J. Chang.Induced-path partition on graphs withspecial blocks. Theoretical ComputerScience, 370(1–3):121–130, February12, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Almeida:2007:ATA

[975] Jorge Almeida and Marc Zeitoun. Anautomata-theoretic approach to theword problem for ω-terms over R. The-oretical Computer Science, 370(1–3):131–169, February 12, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Leupold:2007:LGI

[976] Peter Leupold. Languages generatedby iterated idempotency. Theoreti-cal Computer Science, 370(1–3):170–185, February 12, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 139

Catalano:2007:CDS

[977] Dario Catalano and Rosario Gennaro.Cramer-damgard signatures revisited:Efficient flat-tree signatures based onfactoring. Theoretical Computer Sci-ence, 370(1–3):186–200, February 12,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Frosini:2007:BMU

[978] Andrea Frosini and Maurice Nivat. Bi-nary matrices under the microscope:A tomographical problem. Theoret-ical Computer Science, 370(1–3):201–217, February 12, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chandran:2007:RBA

[979] L. Sunil Chandran and L. ShankarRam. On the relationship betweenATSP and the cycle cover prob-lem. Theoretical Computer Science,370(1–3):218–228, February 12, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Brandstadt:2007:NAC

[980] Andreas Brandstadt, Van Bang Le,and Suhail Mahfud. New applicationsof clique separator decomposition forthe Maximum Weight Stable Set prob-lem. Theoretical Computer Science,370(1–3):229–239, February 12, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Cheng:2007:STC

[981] Yongxi Cheng, Xi Chen, and Yiqun LisaYin. On searching a table consis-tent with division poset. Theoreti-cal Computer Science, 370(1–3):240–


Patt-Shamir:2007:NEA

[982] Boaz Patt-Shamir. A note on effi-cient aggregate queries in sensor net-works. Theoretical Computer Science,370(1–3):254–264, February 12, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Kuba:2007:LRI

[983] Markus Kuba and Alois Panholzer.The left-right-imbalance of binarysearch trees. Theoretical Computer Sci-ence, 370(1–3):265–278, February 12,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Pelc:2007:FCB

[984] Andrzej Pelc and David Peleg. Fea-sibility and complexity of broadcast-ing with random transmission fail-ures. Theoretical Computer Science,370(1–3):279–292, February 12, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Lu:2007:IHA

[985] Chi-Jen Lu, Shi-Chun Tsai, and Hsin-Lung Wu. Improved hardness ampli-fication in NP. Theoretical ComputerScience, 370(1–3):293–298, February12, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Hsieh:2007:FML

[986] Sun-Yuan Hsieh. Finding maximal leaf-agreement isomorphic descendent sub-trees from phylogenetic trees with dif-ferent species. Theoretical Computer

REFERENCES 140

Science, 370(1–3):299–308, February12, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Anonymous:2007:EBa


Back:2007:CNS

[988] Thomas Back and Benedikt Lowe.Computing and the natural sciences atCiE 2005. Theoretical Computer Sci-ence, 371(1–2):1–3, February 22, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Beggs:2007:CNS

[989] Edwin J. Beggs and John V. Tucker.Can Newtonian systems, bounded inspace, time, mass and energy computeall functions? Theoretical ComputerScience, 371(1–2):4–19, February 22,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bernardini:2007:QSP

[990] Francesco Bernardini, Marian Gheo-rghe, and Natalio Krasnogor. Quo-rum sensing P systems. Theoreti-cal Computer Science, 371(1–2):20–33,February 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Garcez:2007:CML

[991] Artur S. d’Avila Garcez, Luıs C. Lamb,and Dov M. Gabbay. Connection-ist modal logic: Representing modal-ities in neural networks. Theoret-

ical Computer Science, 371(1–2):34–53, February 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gutierrez-Naranjo:2007:USS

[992] Miguel A. Gutierrez-Naranjo, Mario J.Perez-Jimenez, and Francisco J.Romero-Campero. A uniform solutionto SAT using membrane creation. The-oretical Computer Science, 371(1–2):54–61, February 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Michalak:2007:IDD

[993] Krzysztof Michalak and Halina Kwasnicka.Influence of data dimensionality on thequality of forecasts given by a multi-layer perceptron. Theoretical ComputerScience, 371(1–2):62–71, February 22,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Manea:2007:ANS

[994] Florin Manea, Carlos Martın-Vide, andVictor Mitrana. Accepting networksof splicing processors: Complexity re-sults. Theoretical Computer Science,371(1–2):72–82, February 22, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic). See er-ratum [1136].

Krishna:2007:URP

[995] Shankara Narayanan Krishna. Uni-versality results for P systems basedon brane calculi operations. Theo-retical Computer Science, 371(1–2):83–105, February 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 141

Trautteur:2007:NDV

[996] Giuseppe Trautteur and GuglielmoTamburrini. A note on discreteness andvirtuality in analog computing. The-oretical Computer Science, 371(1–2):106–114, February 22, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Tucker:2007:CAN

[997] John V. Tucker and Jeffery I. Zucker.Computability of analog networks.Theoretical Computer Science, 371(1–2):115–146, February 22, 2007. CO-DEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Anonymous:2007:EBb


Eiter:2007:P

[999] Thomas Eiter and Leonid Libkin. Pref-ace. Theoretical Computer Science, 371(3):147, March 1, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Koltun:2007:ADR

[1000] Vladlen Koltun and Christos H. Pa-padimitriou. Approximately dominat-ing representatives. Theoretical Com-puter Science, 371(3):148–154, March1, 2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Atserias:2007:CQE

[1001] Albert Atserias. Conjunctive queryevaluation by search-tree revisited.

Theoretical Computer Science, 371(3):155–168, March 1, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Calvanese:2007:VBQ

[1002] Diego Calvanese, Giuseppe De Gi-acomo, Maurizio Lenzerini, andMoshe Y. Vardi. View-based query pro-cessing: On the relationship betweenrewriting, answering and losslessness.Theoretical Computer Science, 371(3):169–182, March 1, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

denBussche:2007:WDS

[1003] Jan Van den Bussche, Dirk VanGucht, and Stijn Vansummeren. Well-definedness and semantic type-checkingfor the nested relational calculus. The-oretical Computer Science, 371(3):183–199, March 1, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Deutsch:2007:RQU

[1004] Alin Deutsch, Bertram Ludascher, andAlan Nash. Rewriting queries usingviews with access patterns under in-tegrity constraints. Theoretical Com-puter Science, 371(3):200–226, March1, 2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Matias:2007:OWB

[1005] Yossi Matias and Daniel Urieli. Op-timal workload-based weighted waveletsynopses. Theoretical Computer Sci-ence, 371(3):227–246, March 1, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 142

Balcazar:2007:HAS

[1006] Jose L. Balcazar and Gemma C. Gar-riga. Horn axiomatizations for sequen-tial data. Theoretical Computer Sci-ence, 371(3):247–264, March 1, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Dolinka:2007:AIB

[1007] Igor Dolinka. Axiomatizing the iden-tities of binoid languages. TheoreticalComputer Science, 372(1):1–14, March6, 2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Leve:2007:QSW

[1008] F. Leve and G. Richomme. Quasiperi-odic Sturmian words and morphisms.Theoretical Computer Science, 372(1):15–25, March 6, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Berman:2007:OTM

[1009] Piotr Berman, Marek Karpinski, andYakov Nekrich. Optimal trade-off forMerkle tree traversal. Theoretical Com-puter Science, 372(1):26–36, March 6,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bell:2007:MID

[1010] Paul Bell and Igor Potapov. On themembership of invertible diagonal andscalar matrices. Theoretical ComputerScience, 372(1):37–45, March 6, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Pivato:2007:RCL

[1011] Marcus Pivato. Reallife: The contin-uum limit of Larger than Life cellu-

lar automata. Theoretical ComputerScience, 372(1):46–68, March 6, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Tan:2007:OSO

[1012] Zhiyi Tan and Yong Wu. Optimal semi-online algorithms for machine covering.Theoretical Computer Science, 372(1):69–80, March 6, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ishii:2007:MCS

[1013] Toshimasa Ishii, Hitoshi Fujita, andHiroshi Nagamochi. Minimum costsource location problem with local 3-vertex-connectivity requirements. The-oretical Computer Science, 372(1):81–93, March 6, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ye:2007:LSM

[1014] Deshi Ye and Guochuan Zhang. On-line scheduling mesh jobs with depen-dencies. Theoretical Computer Sci-ence, 372(1):94–102, March 6, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Dou:2007:RMT

[1015] Wenqing Dou and Enyu Yao. On re-arrangeable multirate three-stage Closnetworks. Theoretical Computer Sci-ence, 372(1):103–107, March 6, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Gurski:2007:CRG

[1016] Frank Gurski. Characterizations for re-stricted graphs of NLC-width 2. Theo-retical Computer Science, 372(1):108–

REFERENCES 143

114, March 6, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ferragina:2007:SSS

[1017] Paolo Ferragina and Rossano Ven-turini. A simple storage scheme forstrings achieving entropy bounds. The-oretical Computer Science, 372(1):115–121, March 6, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2007:EBc

[1018] Anonymous. Editorial board. The-oretical Computer Science, 372(1):v–ix, March 6, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Paun:2007:FBW

[1019] Gheorghe Paun and Mario J. Perez-Jimenez. Fourth Brainstorming Weekon Membrane Computing. Theoret-ical Computer Science, 372(2–3):123–124, March 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Busi:2007:UWS

[1020] Nadia Busi. Using well-structuredtransition systems to decide divergencefor catalytic P systems. Theoreti-cal Computer Science, 372(2–3):125–135, March 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cavaliere:2007:MRC

[1021] Matteo Cavaliere, Rudolf Freund, Mar-ion Oswald, and Dragos Sburlan.Multiset random context grammars,

checkers, and transducers. Theoret-ical Computer Science, 372(2–3):136–151, March 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Csuhaj-Varju:2007:SUA

[1022] Erzsebet Csuhaj-Varju, Maurice Mar-genstern, Gyorgy Vaszil, and SergeyVerlan. On small universal antiportP systems. Theoretical ComputerScience, 372(2–3):152–164, March 15,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fontana:2007:DSD

[1023] Federico Fontana and Vincenzo Manca.Discrete solutions to differential equa-tions by metabolic P systems. Theoret-ical Computer Science, 372(2–3):165–182, March 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gutierrez-Naranjo:2007:DPM

[1024] Miguel A. Gutierrez-Naranjo, Mario J.Perez-Jimenez, and Agustın Riscos-Nunez. On the degree of paral-lelism in membrane systems. Theoret-ical Computer Science, 372(2–3):183–195, March 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ibarra:2007:NFS

[1025] Oscar H. Ibarra, Andrei Paun, Gheo-rghe Paun, Alfonso Rodrıguez-Paton,Petr Sosık, and Sara Woodworth. Nor-mal forms for spiking neural P systems.Theoretical Computer Science, 372(2–3):196–217, March 15, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 144

Leporati:2007:TQA

[1026] Alberto Leporati and Sara Felloni.Three “quantum” algorithms to solve3-SAT. Theoretical Computer Science,372(2–3):218–241, March 15, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Muskulus:2007:CCC

[1027] Michael Muskulus, Daniela Besozzi,Robert Brijder, Paolo Cazzaniga,Sanne Houweling, Dario Pescini, andGrzegorz Rozenberg. Cycles and com-municating classes in membrane sys-tems and molecular dynamics. The-oretical Computer Science, 372(2–3):242–266, March 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2007:EBd

[1028] Anonymous. Editorial board. The-oretical Computer Science, 372(2–3):i–v, March 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Danicic:2007:ELF

[1029] Sebastian Danicic, Mark Harman,Rob Hierons, John Howroyd, andMichael R. Laurence. Equivalence oflinear, free, liberal, structured pro-gram schemas is decidable in polyno-mial time. Theoretical Computer Sci-ence, 373(1–2):1–18, March 22, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Luttgen:2007:CPF

[1030] Gerald Luttgen and Walter Vogler.Conjunction on processes: Full abstrac-tion via ready-tree semantics. Theo-

retical Computer Science, 373(1–2):19–40, March 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Barbanera:2007:SAA

[1031] Franco Barbanera, Michele Bugliesi,Mariangiola Dezani-Ciancaglini, andVladimiro Sassone. Space-aware ambi-ents and processes. Theoretical Com-puter Science, 373(1–2):41–69, March22, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Clavel:2007:RME

[1032] Manuel Clavel, Jose Meseguer, andMiguel Palomino. Reflection in mem-bership equational logic, many-sortedequational logic, Horn logic with equal-ity, and rewriting logic. Theoret-ical Computer Science, 373(1–2):70–91, March 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Deng:2007:APF

[1033] Yuxin Deng and Catuscia Palamidessi.Axiomatizations for probabilistic finite-state behaviors. Theoretical ComputerScience, 373(1–2):92–114, March 22,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lago:2007:CTA

[1034] Ugo Dal Lago, Angelo Montanari,and Gabriele Puppis. Compact andtractable automaton-based representa-tions of time granularities. Theoret-ical Computer Science, 373(1–2):115–141, March 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 145

Stubbe:2007:TDD

[1035] Isar Stubbe. Towards “dynamic do-mains”: Totally continuous cocompleteQ-categories. Theoretical ComputerScience, 373(1–2):142–160, March 22,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2007:EBe


Mosses:2007:P

[1037] Peter D. Mosses and Irek Ulidowski.Preface. Theoretical Computer Sci-ence, 373(3):161–162, April 5, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Andrei:2007:RLF

[1038] Oana Andrei, Gabriel Ciobanu, andDorel Lucanu. A rewriting logic frame-work for operational semantics of mem-brane systems. Theoretical ComputerScience, 373(3):163–181, April 5, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Hym:2007:ARD

[1039] Samuel Hym and Matthew Hennessy.Adding recursion to Dpi. Theoret-ical Computer Science, 373(3):182–212, April 5, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Meseguer:2007:RLS

[1040] Jose Meseguer and Grigore Rosu. Therewriting logic semantics project. The-

oretical Computer Science, 373(3):213–237, April 5, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Mousavi:2007:SFM

[1041] MohammadReza Mousavi, Michel A.Reniers, and Jan Friso Groote. SOSformats and meta-theory: 20 years af-ter. Theoretical Computer Science, 373(3):238–272, April 5, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Saabas:2007:CNS

[1042] Ando Saabas and Tarmo Uustalu. Acompositional natural semantics andHoare logic for low-level languages.Theoretical Computer Science, 373(3):273–302, April 5, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Murakami:2007:FAC

[1043] M. Murakami, M. Hara, M. Yamamoto,and S. Tani. Fast algorithms for com-puting Jones polynomials of certainlinks. Theoretical Computer Science,374(1–3):1–24, April 20, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Nicolay:2007:AFL

[1044] S. Nicolay and M. Rigo. About frequen-cies of letters in generalized automaticsequences. Theoretical Computer Sci-ence, 374(1–3):25–40, April 20, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Wu:2007:KPP

[1045] Biao Wu and Enyue Yao. k-partitioning problems with partition

REFERENCES 146

matroid constraint. Theoretical Com-puter Science, 374(1–3):41–48, April20, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Tian:2007:LSD

[1046] Ji Tian, Ruyan Fu, and Jinjiang Yuan.On-line scheduling with delivery timeon a single batch machine. Theoret-ical Computer Science, 374(1–3):49–57, April 20, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Simpson:2007:IPW

[1047] Jamie Simpson. Intersecting peri-odic words. Theoretical Computer Sci-ence, 374(1–3):58–65, April 20, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Cheng:2007:LGP

[1048] Yongxi Cheng. Lattice grids andprisms are antimagic. Theoretical Com-puter Science, 374(1–3):66–73, April20, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Csuhaj-Varju:2007:SAS

[1049] Erzsebet Csuhaj-Varju, Ion Petre, andGyorgy Vaszil. Self-assembly of stringsand languages. Theoretical Com-puter Science, 374(1–3):74–81, April20, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Chang:2007:AGC

[1050] Gerard J. Chang, Sen-Peng Eu, andChung-Heng Yeh. On the (n, t)-antipodal Gray codes. Theoreti-

cal Computer Science, 374(1–3):82–90, April 20, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Rodrigues:2007:MAF

[1051] Estela M. Rodrigues, Marie-FranceSagot, and Yoshiko Wakabayashi. Themaximum agreement forest problem:Approximation algorithms and compu-tational experiments. Theoretical Com-puter Science, 374(1–3):91–110, April20, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Eriksen:2007:RTM

[1052] Niklas Eriksen. Reversal and transpo-sition medians. Theoretical ComputerScience, 374(1–3):111–126, April 20,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kuske:2007:WAC

[1053] Dietrich Kuske. Weighted asyn-chronous cellular automata. Theoret-ical Computer Science, 374(1–3):127–148, April 20, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Alon:2007:AMC

[1054] Noga Alon, Andrzej Lingas, and Mar-tin Wahlen. Approximating the maxi-mum clique minor and some subgraphhomeomorphism problems. Theoret-ical Computer Science, 374(1–3):149–158, April 20, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 147

Liu:2007:SJA

[1055] L. L. Liu, C. T. Ng, and T. C. E.Cheng. Scheduling jobs with agreeableprocessing times and due dates on asingle batch processing machine. The-oretical Computer Science, 374(1–3):159–169, April 20, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Her:2007:EMD

[1056] Jun-Ho Her and R. S. Ramakrishna.An external-memory depth-first searchalgorithm for general grid graphs. The-oretical Computer Science, 374(1–3):170–180, April 20, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Yan:2007:CRL

[1057] Qiqi Yan. Classifying regular languagesby a split game. Theoretical ComputerScience, 374(1–3):181–190, April 20,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chen:2007:HAM

[1058] Wenbin Chen and Jiangtao Meng.Hardness of approximating the Mini-mum Solutions of Linear DiophantineEquations. Theoretical Computer Sci-ence, 374(1–3):191–195, April 20, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Fu:2007:OSP

[1059] Ruyan Fu, Tian Ji, Jinjiang Yuan, andYixun Lin. Online scheduling in a par-allel batch processing system to min-imize makespan using restarts. The-oretical Computer Science, 374(1–3):

196–202, April 20, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kralovic:2007:RGS

[1060] R. Kralovic and P. Ruzicka. Ranksof graphs: The size of acyclic orien-tation cover for deadlock-free packetrouting. Theoretical Computer Sci-ence, 374(1–3):203–213, April 20, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Maurer:2007:CRP

[1061] Ina Maurer. Characterizations of rec-ognizable picture series. Theoreti-cal Computer Science, 374(1–3):214–228, April 20, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Catalano:2007:HCT

[1062] Dario Catalano and Ivan Visconti. Hy-brid commitments and their applica-tions to zero-knowledge proof systems.Theoretical Computer Science, 374(1–3):229–260, April 20, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Cimato:2007:CVC

[1063] S. Cimato, R. De Prisco, and A. DeSantis. Colored visual cryptographywithout color darkening. Theoreti-cal Computer Science, 374(1–3):261–276, April 20, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Mycka:2007:NCF

[1064] Jerzy Mycka and Jose Felix Costa. Anew conceptual framework for analogcomputation. Theoretical Computer

REFERENCES 148

Science, 374(1–3):277–290, April 20,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2007:EBf

[1065] Anonymous. Editorial board. The-oretical Computer Science, 374(1–3):v–ix, April 20, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Danvy:2007:P

[1066] Olivier Danvy, Peter O’Hearn, andPhilip Wadler. Preface. TheoreticalComputer Science, 375(1–3):1–2, May1, 2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hermida:2007:FFP

[1067] C. Hermida and R. D. Tennent. A fi-brational framework for possible-worldsemantics of Algol. Theoretical Com-puter Science, 375(1–3):3–19, May 1,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hyland:2007:CAE

[1068] Martin Hyland, Paul Blain Levy, Gor-don Plotkin, and John Power. Combin-ing algebraic effects with continuations.Theoretical Computer Science, 375(1–3):20–40, May 1, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Filinski:2007:RBM

[1069] Andrzej Filinski. On the relationsbetween monadic semantics. The-oretical Computer Science, 375(1–3):41–75, May 1, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Biernacka:2007:SCB

[1070] Ma lgorzata Biernacka and OlivierDanvy. A syntactic correspondencebetween context-sensitive calculi andabstract machines. Theoretical Com-puter Science, 375(1–3):76–108, May 1,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jones:2007:SAS

[1071] C. B. Jones. Splitting atoms safely.Theoretical Computer Science, 375(1–3):109–119, May 1, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jones:2007:FAL

[1072] Neil D. Jones and Nils Andersen. Flowanalysis of lazy higher-order functionalprograms. Theoretical Computer Sci-ence, 375(1–3):120–136, May 1, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Might:2007:AES

[1073] Matthew Might and Olin Shivers. An-alyzing the environment structure ofhigher-order languages using framestrings. Theoretical Computer Sci-ence, 375(1–3):137–168, May 1, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Sumii:2007:BDS

[1074] Eijiro Sumii and Benjamin C. Pierce. Abisimulation for dynamic sealing. The-oretical Computer Science, 375(1–3):169–192, May 1, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 149

Freyd:2007:CAR

[1075] Peter Freyd. Core algebra revisited.Theoretical Computer Science, 375(1–3):193–200, May 1, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Wadler:2007:GRI

[1076] Philip Wadler. The Girard–Reynoldsisomorphism (second edition). The-oretical Computer Science, 375(1–3):201–226, May 1, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Brookes:2007:SCS

[1077] Stephen Brookes. A semantics forconcurrent separation logic. Theoret-ical Computer Science, 375(1–3):227–270, May 1, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

OHearn:2007:RCL

[1078] Peter W. O’Hearn. Resources, con-currency, and local reasoning. The-oretical Computer Science, 375(1–3):271–307, May 1, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Yang:2007:RSL

[1079] Hongseok Yang. Relational separa-tion logic. Theoretical Computer Sci-ence, 375(1–3):308–334, May 1, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Morris:2007:FET

[1080] F. Lockwood Morris. A few exercises intheorem processing. Theoretical Com-puter Science, 375(1–3):335–345, May


Oles:2007:BSJ

[1081] Frank J. Oles. On being a studentof John Reynolds. Theoretical Com-puter Science, 375(1–3):346–350, May1, 2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2007:EBg

[1082] Anonymous. Editorial board. The-oretical Computer Science, 375(1–3):v–ix, May 1, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ibarra:2007:DLT

[1083] Oscar H. Ibarra. Developments in lan-guage theory. Theoretical ComputerScience, 376(1–2):1–2, May 10, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ehrenfeucht:2007:EMR

[1084] A. Ehrenfeucht and G. Rozenberg.Events and modules in reaction sys-tems. Theoretical Computer Science,376(1–2):3–16, May 10, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Gurevich:2007:CAS

[1085] Yuri Gurevich, Margus Veanes, andCharles Wallace. Can abstract statemachines be useful in language theory?Theoretical Computer Science, 376(1–2):17–29, May 10, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 150

Ananichev:2007:SAL

[1086] D. S. Ananichev, M. V. Volkov, andYu. I. Zaks. Synchronizing automatawith a letter of deficiency 2. The-oretical Computer Science, 376(1–2):30–41, May 10, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bastien:2007:ESF

[1087] Cedric Bastien, Jurek Czyzowicz, Wo-jciech Fraczak, and Wojciech Rytter.Equivalence of simple functions. The-oretical Computer Science, 376(1–2):42–51, May 10, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Carton:2007:GRS

[1088] Olivier Carton. The growth ratioof synchronous rational relations isunique. Theoretical Computer Sci-ence, 376(1–2):52–59, May 10, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Han:2007:EPD

[1089] Yo-Sub Han, Arto Salomaa, Kai Salo-maa, Derick Wood, and Sheng Yu. Onthe existence of prime decompositions.Theoretical Computer Science, 376(1–2):60–69, May 10, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Krieger:2007:CEF

[1090] Dalia Krieger. On critical exponents infixed points of non-erasing morphisms.Theoretical Computer Science, 376(1–2):70–88, May 10, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kufleitner:2007:PFT

[1091] Manfred Kufleitner. Polynomials, frag-ments of temporal logic and the vari-ety DA over traces. Theoretical Com-puter Science, 376(1–2):89–100, May10, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Kutrib:2007:CDN

[1092] Martin Kutrib and Andreas Malcher.Context-dependent nondeterminismfor pushdown automata. Theoreti-cal Computer Science, 376(1–2):101–111, May 10, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Okhotin:2007:LEC

[1093] Alexander Okhotin and Oksana Yaki-mova. Language equations with com-plementation: Decision problems. The-oretical Computer Science, 376(1–2):112–126, May 10, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ravikumar:2007:SVT

[1094] Bala Ravikumar. On some variations oftwo-way probabilistic finite automatamodels. Theoretical Computer Sci-ence, 376(1–2):127–136, May 10, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Anonymous:2007:EBh


REFERENCES 151

Cerioli:2007:F

[1096] Maura Cerioli, Tiziana Margaria, andMichel Wermelinger. Foreword. Theo-retical Computer Science, 376(3):137–138, May 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

deLara:2007:AGT

[1097] Juan de Lara, Roswitha Bardohl,Hartmut Ehrig, Karsten Ehrig, Ul-rike Prange, and Gabriele Taentzer.Attributed graph transformation withnode type inheritance. Theoreti-cal Computer Science, 376(3):139–163,May 15, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Furia:2007:ACP

[1098] Carlo A. Furia, Matteo Rossi, DinoMandrioli, and Angelo Morzenti. Au-tomated compositional proofs for real-time systems. Theoretical ComputerScience, 376(3):164–184, May 15, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Roman:2007:MAB

[1099] Gruia-Catalin Roman, Christine Julien,and Jamie Payton. Modeling adaptivebehaviors in Context UNITY. Theo-retical Computer Science, 376(3):185–204, May 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Naumann:2007:OPE

[1100] David A. Naumann. Observationalpurity and encapsulation. Theoret-ical Computer Science, 376(3):205–224, May 15, 2007. CODEN TC-


Salehi:2007:TAV

[1101] Saeed Salehi and Magnus Steinby. Treealgebras and varieties of tree languages.Theoretical Computer Science, 377(1–3):1–24, May 31, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zhang:2007:ALP

[1102] Zhao Zhang and Hao Li. Algorithms forlong paths in graphs. Theoretical Com-puter Science, 377(1–3):25–34, May 31,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Avidor:2007:MMC

[1103] Adi Avidor and Michael Langberg. Themulti-multiway cut problem. The-oretical Computer Science, 377(1–3):35–42, May 31, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Uchida:2007:ABG

[1104] Jiro Uchida, Wei Chen, and KoichiWada. Acknowledged broadcasting andgossiping in ad hoc radio networks.Theoretical Computer Science, 377(1–3):43–54, May 31, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Epstein:2007:PCF

[1105] Leah Epstein, Yanir Kleiman, JirıSgall, and Rob van Stee. Paging withconnections: FIFO strikes again. The-oretical Computer Science, 377(1–3):55–64, May 31, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 152

Marco:2007:BBM

[1106] Ana Marco and Jose-Javier Martınez.Bernstein–Bezoutian matrices andcurve implicitization. Theoretical Com-puter Science, 377(1–3):65–72, May 31,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

DAlessandro:2007:WQO

[1107] Flavio D’Alessandro, Gwenael Ri-chomme, and Stefano Varricchio. Wellquasi-orders generated by a word-shuffle rewriting. Theoretical ComputerScience, 377(1–3):73–92, May 31, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Beyersdorff:2007:CRD

[1108] Olaf Beyersdorff. Classes of repre-sentable disjoint NP. Theoretical Com-puter Science, 377(1–3):93–109, May31, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Tan:2007:SOS

[1109] Zhiyi Tan and Yong He. Semi-onlinescheduling problems on two identicalmachines with inexact partial infor-mation. Theoretical Computer Sci-ence, 377(1–3):110–125, May 31, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Becher:2007:TUA

[1110] Veronica Becher, Santiago Figueira,and Rafael Picchi. Turing’s unpub-lished algorithm for normal numbers.Theoretical Computer Science, 377(1–3):126–138, May 31, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Nock:2007:SIG

[1111] Richard Nock and Frank Nielsen. Self-improved gaps almost everywhere forthe agnostic approximation of monomi-als. Theoretical Computer Science, 377(1–3):139–150, May 31, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Lin:2007:RAS

[1112] Tien-Ching Lin and D. T. Lee. Ran-domized algorithm for the sum selec-tion problem. Theoretical ComputerScience, 377(1–3):151–156, May 31,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Uscka-Wehlou:2007:DLI

[1113] Hanna Uscka-Wehlou. Digital lineswith irrational slopes. TheoreticalComputer Science, 377(1–3):157–169,May 31, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Park:2007:PPH

[1114] Jung-Heum Park, Hyeong-Seok Lim,and Hee-Chul Kim. Panconnectivityand pancyclicity of hypercube-like in-terconnection networks with faulty el-ements. Theoretical Computer Sci-ence, 377(1–3):170–180, May 31, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Diedrich:2007:FSA

[1115] Florian Diedrich and Klaus Jansen.Faster and simpler approximation algo-rithms for mixed packing and coveringproblems. Theoretical Computer Sci-ence, 377(1–3):181–204, May 31, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 153

Pivato:2007:DPK

[1116] Marcus Pivato. Defect particle kine-matics in one-dimensional cellular au-tomata. Theoretical Computer Sci-ence, 377(1–3):205–228, May 31, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bengtsson:2007:RMS

[1117] Fredrik Bengtsson and Jingsen Chen.Ranking k maximum sums. Theoret-ical Computer Science, 377(1–3):229–237, May 31, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lai:2007:EGG

[1118] Yung-Ling Lai and Chang-Sin Tian. Anextremal graph with given bandwidth.Theoretical Computer Science, 377(1–3):238–242, May 31, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Rogers:2007:CTP

[1119] A. Rogers, R. K. Dash, S. D. Ram-churn, P. Vytelingum, and N. R.Jennings. Coordinating team play-ers within a noisy Iterated Pris-oner’s Dilemma tournament. Theoret-ical Computer Science, 377(1–3):243–259, May 31, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Rao:2007:MPP

[1120] Michael Rao. MSOL partitioning prob-lems on graphs of bounded treewidthand clique-width. Theoretical Com-puter Science, 377(1–3):260–267, May31, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Rybalov:2007:SGU

[1121] Alexander Rybalov. On the stronglygeneric undecidability of the HaltingProblem. Theoretical Computer Sci-ence, 377(1–3):268–270, May 31, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Diaz:2007:MCM

[1122] Josep Dıaz and Marcin Kaminski.MAX-CUT and MAX-BISECTIONare NP-hard on unit disk graphs. The-oretical Computer Science, 377(1–3):271–276, May 31, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cleary:2007:RUB

[1123] Sean Cleary, Fabrizio Luccio, andLinda Pagli. Refined upper boundsfor right-arm rotation distances. The-oretical Computer Science, 377(1–3):277–281, May 31, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Yokomori:2007:EPT

[1124] Takashi Yokomori. Erratum to“Polynomial-time identification of verysimple grammars from positive data”[Theoret. Comput. Sci. 298 (2003)179–206]. Theoretical Computer Sci-ence, 377(1–3):282–283, May 31, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic). See [2].

Anonymous:2007:EBi


REFERENCES 154

Rozenberg:2007:Pa

[1126] G. Rozenberg. Preface. TheoreticalComputer Science, 378(1):1–2, June 3,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Daley:2007:CDB

[1127] Mark Daley and Michael Domaratzki.On codes defined by bio-operations.Theoretical Computer Science, 378(1):3–16, June 3, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Brun:2007:ACT

[1128] Yuriy Brun. Arithmetic computationin the tile assembly model: Additionand multiplication. Theoretical Com-puter Science, 378(1):17–31, June 3,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Neumann:2007:RLS

[1129] Frank Neumann and Ingo Wegener.Randomized local search, evolutionaryalgorithms, and the minimum span-ning tree problem. Theoretical Com-puter Science, 378(1):32–40, June 3,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ambainis:2007:IAQ

[1130] Andris Ambainis, Kazuo Iwama, Aki-nori Kawachi, Rudy Raymond, andShigeru Yamashita. Improved algo-rithms for quantum identification ofBoolean oracles. Theoretical ComputerScience, 378(1):41–53, June 3, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Verel:2007:FLC

[1131] S. Verel, P. Collard, M. Tomassini, andL. Vanneschi. Fitness landscape of thecellular automata majority problem:View from the “Olympus”. TheoreticalComputer Science, 378(1):54–77, June3, 2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Talbi:2007:BSS

[1132] El-Ghazali Talbi and Benjamin Wein-berg. Breaking the search space sym-metry in partitioning problems: An ap-plication to the graph coloring prob-lem. Theoretical Computer Science,378(1):78–86, June 3, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Peng:2007:CAO

[1133] Dezhong Peng and Zhang Yi. Conver-gence analysis of the OJAn MCA learn-ing algorithm by the deterministic dis-crete time method. Theoretical Com-puter Science, 378(1):87–100, June 3,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kashefi:2007:SZK

[1134] Elham Kashefi and Iordanis Kereni-dis. Statistical Zero Knowledge andquantum one-way functions. Theo-retical Computer Science, 378(1):101–116, June 3, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ciobanu:2007:PSM

[1135] Gabriel Ciobanu, Linqiang Pan, Ghe-orghe Paun, and Mario J. Perez-Jimenez. P systems with minimal par-allelism. Theoretical Computer Sci-ence, 378(1):117–130, June 3, 2007.

REFERENCES 155


Manea:2007:EAN

[1136] Florin Manea, Carlos Martın-Vide, andVictor Mitrana. Erratum to: “Ac-cepting networks of splicing processors:Complexity results” [Theoret. Comput.Sci. 371 (2007) 72–82]. TheoreticalComputer Science, 378(1):131, June 3,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).See [994].

Anonymous:2007:EBj


Deng:2007:P

[1138] Xiaotie Deng. Preface. TheoreticalComputer Science, 378(2):133, June 6,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ye:2007:EME

[1139] Yinyu Ye. Exchange market equilib-ria with Leontief’s utility: Freedomof pricing leads to rationality. Theo-retical Computer Science, 378(2):134–142, June 6, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Garg:2007:PDA

[1140] Dinesh Garg, Kamal Jain, Kunal Tal-war, and Vijay V. Vazirani. Aprimal-dual algorithm for computingFisher equilibrium in the absence ofgross substitutability property. Theo-retical Computer Science, 378(2):143–

152, June 6, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kapoor:2007:ABM

[1141] Sanjiv Kapoor, Aranyak Mehta, andVijay Vazirani. An auction-based mar-ket equilibrium algorithm for a pro-duction model. Theoretical ComputerScience, 378(2):153–164, June 6, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Fischer:2007:SCW

[1142] Simon Fischer and Berthold Vocking.On the structure and complexity ofworst-case equilibria. Theoretical Com-puter Science, 378(2):165–174, June 6,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Feigenbaum:2007:SCP

[1143] Joan Feigenbaum, David R. Karger,Vahab S. Mirrokni, and Rahul Sami.Subjective-cost policy routing. Theo-retical Computer Science, 378(2):175–189, June 6, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cheng:2007:NAB

[1144] Gang Cheng, Ping Li, and Peng Shi.A new algorithm based on copulas forVaR valuation with empirical calcula-tions. Theoretical Computer Science,378(2):190–197, June 6, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Zhu:2007:EIB

[1145] Robert W. Zhu, Guomin Yang, andDuncan S. Wong. An efficient identity-based key exchange protocol with KGS

REFERENCES 156

forward secrecy for low-power devices.Theoretical Computer Science, 378(2):198–207, June 6, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chen:2007:P

[1146] Zhi-Zhong Chen, Xiaotie Deng, andDing zhu Du. Preface. Theoret-ical Computer Science, 378(3):209–210, June 9, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ganguly:2007:CDI

[1147] Sumit Ganguly. Counting distinctitems over update streams. Theo-retical Computer Science, 378(3):211–222, June 9, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chen:2007:LIS

[1148] Erdong Chen, Linji Yang, and HaoYuan. Longest increasing subsequencesin windows based on canonical an-tichain partition. Theoretical ComputerScience, 378(3):223–236, June 9, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ben-Moshe:2007:EAC

[1149] Boaz Ben-Moshe, Binay Bhattacharya,Qiaosheng Shi, and Arie Tamir. Ef-ficient algorithms for center problemsin cactus networks. Theoretical Com-puter Science, 378(3):237–252, June 9,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ackermann:2007:DMB

[1150] Heiner Ackermann, Alantha Newman,Heiko Roglin, and Berthold Vocking.

Decision-making based on approximateand smoothed Pareto curves. Theo-retical Computer Science, 378(3):253–270, June 9, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kao:2007:ACA

[1151] Ming-Yang Kao, Xiang-Yang Li, andWeizhao Wang. Average case analy-sis for tree labelling schemes. Theo-retical Computer Science, 378(3):271–291, June 9, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Manthey:2007:SAB

[1152] Bodo Manthey and Rudiger Reischuk.Smoothed analysis of binary searchtrees. Theoretical Computer Science,378(3):292–315, June 9, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Liu:2007:CAM

[1153] Lan Liu, Chen Xi, Jing Xiao, andTao Jiang. Complexity and approx-imation of the minimum recombinanthaplotype configuration problem. The-oretical Computer Science, 378(3):316–330, June 9, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Groote:2007:OSP

[1154] Jan Friso Groote and Marc Voorho-eve. Operational semantics for Petrinet components. Theoretical ComputerScience, 379(1–2):1–19, June 12, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 157

Japaridze:2007:TCI

[1155] Giorgi Japaridze. From truth to com-putability II. Theoretical ComputerScience, 379(1–2):20–52, June 12, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Martins:2007:CPC

[1156] Manuel A. Martins. Closure proper-ties for the class of behavioral models.Theoretical Computer Science, 379(1–2):53–83, June 12, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kanovich:2007:SPU

[1157] Max Kanovich and Jacqueline Vau-zeilles. Strong planning under uncer-tainty in domains with numerous butidentical elements (a generic approach).Theoretical Computer Science, 379(1–2):84–119, June 12, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Marcial-Romero:2007:SSL

[1158] J. Raymundo Marcial-Romero andMartın H. Escardo. Semantics ofa sequential language for exact real-number computation. TheoreticalComputer Science, 379(1–2):120–141,June 12, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Chadha:2007:RAP

[1159] R. Chadha, L. Cruz-Filipe, P. Mateus,and A. Sernadas. Reasoning aboutprobabilistic sequential programs. The-oretical Computer Science, 379(1–2):142–165, June 12, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Vaux:2007:DC

[1160] Lionel Vaux. The differential λµ calcu-lus. Theoretical Computer Science, 379(1–2):166–209, June 12, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Diaconescu:2007:UPW

[1161] Razvan Diaconescu and Petros Ste-faneas. Ultraproducts and possibleworlds semantics in institutions. The-oretical Computer Science, 379(1–2):210–230, June 12, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Asarin:2007:AAP

[1162] Eugene Asarin, Gerardo Schneider, andSergio Yovine. Algorithmic analysisof polygonal hybrid systems, part I:Reachability. Theoretical ComputerScience, 379(1–2):231–265, June 12,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dawar:2007:GAM

[1163] Anuj Dawar and Stephan Kreutzer.Generalising automaticity to modalproperties of finite structures. The-oretical Computer Science, 379(1–2):266–285, June 12, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bozzelli:2007:CRB

[1164] Laura Bozzelli. Complexity resultson branching-time pushdown modelchecking. Theoretical Computer Sci-ence, 379(1–2):286–297, June 12, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 158

Vagvolgyi:2007:LR

[1165] Sandor Vagvolgyi. Losing recognizabil-ity. Theoretical Computer Science, 379(1–2):298–304, June 12, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Anonymous:2007:EBk


Baeten:2007:Pa

[1167] Jos C. M. Baeten, Jan Karel Lenstra,and Gerhard J. Woeginger. Preface.Theoretical Computer Science, 379(3):305, June 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Berger:2007:DDF

[1168] Noam Berger, Bela Bollobas, ChristianBorgs, Jennifer Chayes, and Oliver Ri-ordan. Degree distribution of the FKPnetwork model. Theoretical ComputerScience, 379(3):306–316, June 15, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bansal:2007:PTA

[1169] Vipul Bansal, Aseem Agrawal, andVarun S. Malhotra. Polynomial timealgorithm for an optimal stable assign-ment with multiple partners. Theo-retical Computer Science, 379(3):317–328, June 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jagerskupper:2007:AAB

[1170] Jens Jagerskupper. Algorithmic anal-ysis of a basic evolutionary algorithmfor continuous optimization. Theo-retical Computer Science, 379(3):329–347, June 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bleichenbacher:2007:DIR

[1171] Daniel Bleichenbacher, Aggelos Ki-ayias, and Moti Yung. Decoding inter-leaved Reed–Solomon codes over noisychannels. Theoretical Computer Sci-ence, 379(3):348–360, June 15, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Khachiyan:2007:DBG

[1172] Leonid Khachiyan, Endre Boros,Khaled Elbassioni, Vladimir Gurvich,and Kazuhisa Makino. Dual-boundedgenerating problems: Efficient and in-efficient points for discrete probabilitydistributions and sparse boxes for mul-tidimensional data. Theoretical Com-puter Science, 379(3):361–376, June 15,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bodirsky:2007:GLP

[1173] Manuel Bodirsky, Clemens Gropl, andMihyun Kang. Generating labeled pla-nar graphs uniformly at random. The-oretical Computer Science, 379(3):377–386, June 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hall:2007:MFT

[1174] Alex Hall, Steffen Hippler, and Mar-tin Skutella. Multicommodity flows

REFERENCES 159

over time: Efficient algorithms andcomplexity. Theoretical Computer Sci-ence, 379(3):387–404, June 15, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Gal:2007:CPC

[1175] Anna Gal and Peter Bro Miltersen. Thecell probe complexity of succinct datastructures. Theoretical Computer Sci-ence, 379(3):405–417, June 15, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Matias:2007:EPL

[1176] Yossi Matias and Ely Porat. Efficientpebbling for list traversal synopses withapplication to program rollback. Theo-retical Computer Science, 379(3):418–436, June 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Italiano:2007:P

[1177] Giuseppe F. Italiano and Catuscia Pal-amidessi. Preface. Theoretical Com-puter Science, 380(1–2):1, June 21,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Avin:2007:CTM

[1178] Chen Avin and Gunes Ercal. On thecover time and mixing time of randomgeometric graphs. Theoretical Com-puter Science, 380(1–2):2–22, June 21,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Czeizler:2007:TLB

[1179] Eugen Czeizler and Jarkko Kari. Atight linear bound on the synchroniza-tion delay of bijective automata. The-oretical Computer Science, 380(1–2):

23–36, June 21, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Czumaj:2007:FAF

[1180] Artur Czumaj, Miros law Kowaluk, andAndrzej Lingas. Faster algorithms forfinding lowest common ancestors in di-rected acyclic graphs. Theoretical Com-puter Science, 380(1–2):37–46, June 21,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dietzfelbinger:2007:BAD

[1181] Martin Dietzfelbinger and ChristophWeidling. Balanced allocation and dic-tionaries with tightly packed constantsize bins. Theoretical Computer Sci-ence, 380(1–2):47–68, June 21, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Droste:2007:WAW

[1182] Manfred Droste and Paul Gastin.Weighted automata and weighted log-ics. Theoretical Computer Science, 380(1–2):69–86, June 21, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Gairing:2007:FCA

[1183] Martin Gairing, Burkhard Monien, andAndreas Woclaw. A faster combi-natorial approximation algorithm forscheduling unrelated parallel machines.Theoretical Computer Science, 380(1–2):87–99, June 21, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hromkovic:2007:CSN

[1184] Juraj Hromkovic and Georg Schnit-ger. Comparing the size of NFAs with

REFERENCES 160

and without ε-transitions. Theoreti-cal Computer Science, 380(1–2):100–114, June 21, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Koiran:2007:QQC

[1185] Pascal Koiran, Vincent Nesme, andNatacha Portier. The quantum querycomplexity of the abelian hidden sub-group problem. Theoretical ComputerScience, 380(1–2):115–126, June 21,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Patrascu:2007:DBP

[1186] Mihai Patrascu and Corina E. Tarnita.On dynamic bit-probe complexity.Theoretical Computer Science, 380(1–2):127–142, June 21, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

vanBreugel:2007:RDM

[1187] Franck van Breugel, Claudio Hermida,Michael Makkai, and James Worrell.Recursively defined metric spaces with-out contraction. Theoretical ComputerScience, 380(1–2):143–163, June 21,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Pous:2007:NTW

[1188] Damien Pous. New up-to techniques forweak bisimulation. Theoretical Com-puter Science, 380(1–2):164–180, June21, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Mislove:2007:DRV

[1189] Michael Mislove. Discrete randomvariables over domains. Theoreti-

cal Computer Science, 380(1–2):181–198, June 21, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Grohe:2007:TLB

[1190] Martin Grohe, Christoph Koch, andNicole Schweikardt. Tight lowerbounds for query processing on stream-ing and external memory data. The-oretical Computer Science, 380(1–2):199–217, June 21, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2007:EBl


Brlek:2007:P

[1192] Srecko Brlek and Christophe Reutenauer.Preface. Theoretical Computer Science,380(3):219, June 28, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Adamczewski:2007:RPC

[1193] Boris Adamczewski and Jean-Paul Al-louche. Reversals and palindromes incontinued fractions. Theoretical Com-puter Science, 380(3):220–237, June 28,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ambroz:2007:AAE

[1194] Petr Ambroz and Christiane Frougny.On alpha-adic expansions in Pisotbases. Theoretical Computer Sci-ence, 380(3):238–250, June 28, 2007.

REFERENCES 161


Arnoux:2007:FSS

[1195] Pierre Arnoux, Valerie Berthe, ThomasFernique, and Damien Jamet. Func-tional stepped surfaces, flips, andgeneralized substitutions. Theoret-ical Computer Science, 380(3):251–265, June 28, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Balazi:2007:FVP

[1196] Peter Balazi, Zuzana Masakova, andEdita Pelantova. Factor versus palin-dromic complexity of uniformly recur-rent infinite words. Theoretical Com-puter Science, 380(3):266–275, June 28,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Berthe:2007:DRS

[1197] Valerie Berthe and Bertrand Nouvel.Discrete rotations and symbolic dy-namics. Theoretical Computer Sci-ence, 380(3):276–285, June 28, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Borel:2007:GCF

[1198] Jean-Pierre Borel. A geometrical char-acterization of factors of multidimen-sional Billiard words and some appli-cations. Theoretical Computer Sci-ence, 380(3):286–303, June 28, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Cassaigne:2007:ACS

[1199] J. Cassaigne and A. E. Frid. Onthe arithmetical complexity of Stur-mian words. Theoretical Computer Sci-

ence, 380(3):304–316, June 28, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Fernique:2007:LRS

[1200] Thomas Fernique. Local rule substi-tutions and stepped surfaces. Theo-retical Computer Science, 380(3):317–329, June 28, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Glen:2007:PCS

[1201] Amy Glen. Powers in a class of A-strictstandard episturmian words. Theo-retical Computer Science, 380(3):330–354, June 28, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Halava:2007:EDM

[1202] Vesa Halava, Tero Harju, JuhaniKarhumaki, and Michel Latteux. Ex-tension of the decidability of themarked PCP to instances with uniqueblocks. Theoretical Computer Sci-ence, 380(3):355–362, June 28, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Holub:2007:SWE

[1203] Stepan Holub and Juha Kortelainen.On systems of word equations with sim-ple loop sets. Theoretical ComputerScience, 380(3):363–372, June 28, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ilie:2007:NNS

[1204] Lucian Ilie. A note on the number ofsquares in a word. Theoretical Com-puter Science, 380(3):373–376, June 28,

REFERENCES 162


Lepisto:2007:TIW

[1205] Arto Lepisto, Francesco Pappalardi,and Kalle Saari. Transposition invari-ant words. Theoretical Computer Sci-ence, 380(3):377–387, June 28, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ochem:2007:LFI

[1206] Pascal Ochem. Letter frequency ininfinite repetition-free words. Theo-retical Computer Science, 380(3):388–392, June 28, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Richomme:2007:CML

[1207] G. Richomme. Conjugacy of mor-phisms and Lyndon decomposition ofstandard Sturmian words. Theoret-ical Computer Science, 380(3):393–400, June 28, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

terBeek:2007:IUS

[1208] Maurice H. ter Beek and Jetty Kleijn.Infinite unfair shuffles and associativ-ity. Theoretical Computer Science, 380(3):401–410, June 28, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Cervelle:2007:SSA

[1209] Julien Cervelle, Enrico Formenti, andBenoıt Masson. From sandpiles to sandautomata. Theoretical Computer Sci-ence, 381(1–3):1–28, August 22, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Wang:2007:NUP

[1210] Feng Wang, Hongwei David Du, Xi-aohua Jia, Ping Deng, Weili Wu, andDavid MacCallum. Non-unique probeselection and group testing. Theo-retical Computer Science, 381(1–3):29–32, August 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jurgensen:2007:FAE

[1211] Helmut Jurgensen, Ludwig Staiger,and Hideki Yamasaki. Finite automataencoding geometric figures. Theoret-ical Computer Science, 381(1–3):33–43, August 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Koukopoulos:2007:IIN

[1212] Dimitrios Koukopoulos, Marios Mavron-icolas, and Paul Spirakis. The increaseof the instability of networks due toQuasi-Static link capacities. Theoret-ical Computer Science, 381(1–3):44–56, August 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

deFigueiredo:2007:CSP

[1213] C. M. H. de Figueiredo, L. Faria,S. Klein, and R. Sritharan. On thecomplexity of the sandwich problemsfor strongly chordal graphs and chordalbipartite graphs. Theoretical ComputerScience, 381(1–3):57–67, August 22,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gomez:2007:ORD

[1214] Domingo Gomez, Jaime Gutierrez, andAlvar Ibeas. Optimal routing in double

REFERENCES 163

loop networks. Theoretical ComputerScience, 381(1–3):68–85, August 22,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bassino:2007:ERG

[1215] Frederique Bassino and Cyril Nicaud.Enumeration and random generationof accessible automata. Theoreti-cal Computer Science, 381(1–3):86–104, August 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Doty:2007:PD

[1216] David Doty and Jared Nichols. Push-down dimension. Theoretical ComputerScience, 381(1–3):105–123, August 22,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chen:2007:SAA

[1217] Mingxia Chen, Jianbo Li, JianpingLi, Weidong Li, and Lusheng Wang.Some approximation algorithms for theclique partition problem in weighted in-terval graphs. Theoretical ComputerScience, 381(1–3):124–133, August 22,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Amiraslani:2007:BFG

[1218] A. Amiraslani, D. A. Aruliah, andR. M. Corless. Block LU factors ofgeneralized companion matrix pencils.Theoretical Computer Science, 381(1–3):134–147, August 22, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Ko:2007:JCP

[1219] Ker-I Ko and Fuxiang Yu. Jordancurves with polynomial inverse mod-

uli of continuity. Theoretical ComputerScience, 381(1–3):148–161, August 22,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fleiner:2007:EAG

[1220] Tamas Fleiner, Robert W. Irving, andDavid F. Manlove. Efficient algo-rithms for generalized Stable Marriageand Roommates problems. Theoret-ical Computer Science, 381(1–3):162–176, August 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Krieger:2007:ERN

[1221] Dalia Krieger and Jeffrey Shallit. Ev-ery real number greater than 1 is a crit-ical exponent. Theoretical ComputerScience, 381(1–3):177–182, August 22,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Parnas:2007:AMV

[1222] Michal Parnas and Dana Ron. Ap-proximating the minimum vertex coverin sublinear time and a connectionto distributed algorithms. Theoreti-cal Computer Science, 381(1–3):183–196, August 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Alvarez:2007:CTP

[1223] Carme Alvarez, Rafel Cases, JosepDıaz, Jordi Petit, and Maria Serna.Communication tree problems. The-oretical Computer Science, 381(1–3):197–217, August 22, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 164

Lin:2007:SCS

[1224] Cheng-Kuan Lin, Jimmy J. M. Tan,D. Frank Hsu, and Lih-Hsing Hsu. Onthe spanning connectivity and span-ning laceability of hypercube-like net-works. Theoretical Computer Science,381(1–3):218–229, August 22, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Wu:2007:LAP

[1225] Jian-Liang Wu, Jian-Feng Hou, andGui-Zhen Liu. The linear arboricityof planar graphs with no short cycles.Theoretical Computer Science, 381(1–3):230–233, August 22, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

He:2007:BSB

[1226] Cheng He, Yixun Lin, and JinjiangYuan. Bicriteria scheduling on abatching machine to minimize maxi-mum lateness and makespan. Theoret-ical Computer Science, 381(1–3):234–240, August 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Shang:2007:AMC

[1227] Weiping Shang, Pengjun Wan, FrancesYao, and Xiaodong Hu. Algorithms forminimum m-connected k-tuple domi-nating set problem. Theoretical Com-puter Science, 381(1–3):241–247, Au-gust 22, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Asdre:2007:NCR

[1228] Katerina Asdre and Stavros D.Nikolopoulos. NP-completeness results

for some problems on subclasses of bi-partite and chordal graphs. Theoret-ical Computer Science, 381(1–3):248–259, August 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Brandstadt:2007:IMC

[1229] Andreas Brandstadt, Elaine M. Es-chen, and R. Sritharan. The inducedmatching and chain subgraph coverproblems for convex bipartite graphs.Theoretical Computer Science, 381(1–3):260–265, August 22, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Lavallee:2007:ZFA

[1230] Sylvain Lavallee and ChristopheReutenauer. On a zeta function associ-ated with automata and codes. The-oretical Computer Science, 381(1–3):266–273, August 22, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Choffrut:2007:SSC

[1231] Christian Choffrut, Flavio D’Alessandro,and Stefano Varricchio. On the separa-bility of sparse context-free languagesand of bounded rational relations. The-oretical Computer Science, 381(1–3):274–279, August 22, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Bonifaci:2007:AQM

[1232] Vincenzo Bonifaci. An adversarialqueueing model for online server rout-ing. Theoretical Computer Science,381(1–3):280–287, August 22, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 165

Hsieh:2007:ASI

[1233] Sun-Yuan Hsieh and Shih-Cheng Yang.Approximating the selected-internalSteiner tree. Theoretical ComputerScience, 381(1–3):288–291, August 22,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Wang:2007:MLN

[1234] Xinmao Wang and Yaokun Wu. Min-imum light number of lit-only σ-gameon a tree. Theoretical Computer Sci-ence, 381(1–3):292–300, August 22,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2007:EBm


DiPierro:2007:PQA

[1236] Alessandra Di Pierro and Herbert Wik-licky. Preface: Quantitative aspectsof programming languages. Theo-retical Computer Science, 382(1):1–2, August 28, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Aldini:2007:MLR

[1237] Alessandro Aldini and Marco Bernardo.Mixing logics and rewards for thecomponent-oriented specification ofperformance measures. TheoreticalComputer Science, 382(1):3–23, Au-gust 28, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Remke:2007:CMC

[1238] Anne Remke, Boudewijn R. Haverkort,and Lucia Cloth. CSL model check-ing algorithms for QBDs. Theo-retical Computer Science, 382(1):24–41, August 28, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

DeNicola:2007:MCM

[1239] Rocco De Nicola, Joost-Pieter Ka-toen, Diego Latella, Michele Loreti,and Mieke Massink. Model check-ing mobile stochastic logic. Theo-retical Computer Science, 382(1):42–70, August 28, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hasan:2007:FSU

[1240] Osman Hasan and Sofiene Tahar. For-malization of the Standard Uniformrandom variable. Theoretical Com-puter Science, 382(1):71–83, August28, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Anonymous:2007:PQA

[1241] Anonymous. Preface: Quantitative as-pects of programming languages. The-oretical Computer Science, 382(1):v–ix, August 28, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cryan:2007:P

[1242] Mary Cryan and Martin Farach-Colton. Preface. Theoretical ComputerScience, 382(2):85, August 31, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 166

Badoiu:2007:UAB

[1243] Mihai Badoiu, Richard Cole, Erik D.Demaine, and John Iacono. A unifiedaccess bound on comparison-based dy-namic dictionaries. Theoretical Com-puter Science, 382(2):86–96, August31, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Caminiti:2007:CLT

[1244] Saverio Caminiti, Irene Finocchi, andRossella Petreschi. On coding la-beled trees. Theoretical Computer Sci-ence, 382(2):97–108, August 31, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Carton:2007:CRS

[1245] Olivier Carton and Chloe Rispal. Com-plementation of rational sets on scat-tered linear orderings of finite rank.Theoretical Computer Science, 382(2):109–119, August 31, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Diaz:2007:BBW

[1246] J. Dıaz, M. J. Serna, and N. C.Wormald. Bounds on the bisectionwidth for random d-regular graphs.Theoretical Computer Science, 382(2):120–130, August 31, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Gutierrez:2007:CBM

[1247] Claudio Gutierrez, Flavio Gutierrez,and Maria-Cecilia Rivara. Complex-ity of the bisection method. Theo-retical Computer Science, 382(2):131–138, August 31, 2007. CODEN TC-


Khachiyan:2007:DHB

[1248] Leonid Khachiyan, Endre Boros,Khaled Elbassioni, and Vladimir Gur-vich. On the dualization of hypergraphswith bounded edge-intersections andother related classes of hypergraphs.Theoretical Computer Science, 382(2):139–150, August 31, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Pruhs:2007:ASC

[1249] Kirk Pruhs and Gerhard J. Woegin-ger. Approximation schemes for a classof subset selection problems. Theo-retical Computer Science, 382(2):151–156, August 31, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Yang:2007:IPN

[1250] Ke Yang. On the (im)possibility ofnon-interactive correlation distillation.Theoretical Computer Science, 382(2):157–166, August 31, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Ben-David:2007:F

[1251] Shai Ben-David, JohnCase, andThomas Zeugmann. Foreword. The-oretical Computer Science, 382(3):167–169, September 6, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Martin:2007:DCB

[1252] Eric Martin, Arun Sharma, and FrankStephan. On the data consumption

REFERENCES 167

benefits of accepting increased uncer-tainty. Theoretical Computer Science,382(3):170–182, September 6, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Besombes:2007:LTL

[1253] Jerome Besombes and Jean-Yves Mar-ion. Learning tree languages from posi-tive examples and membership queries.Theoretical Computer Science, 382(3):183–197, September 6, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Sloan:2007:RTF

[1254] Robert H. Sloan, Balazs Szorenyi, andGyorgy Turan. Revising thresholdfunctions. Theoretical Computer Sci-ence, 382(3):198–208, September 6,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bulatov:2007:LIC

[1255] Andrei Bulatov, Hubie Chen, andVıctor Dalmau. Learning intersection-closed classes with signatures. Theo-retical Computer Science, 382(3):209–220, September 6, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cesa-Bianchi:2007:ARL

[1256] Nicolo Cesa-Bianchi. Applications ofregularized least squares to patternclassification. Theoretical ComputerScience, 382(3):221–231, September 6,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ambroladze:2007:CPC

[1257] Amiran Ambroladze, Emilio Parrado-Hernandez, and John Shawe-Taylor.

Complexity of pattern classes and theLipschitz property. Theoretical Com-puter Science, 382(3):232–246, Septem-ber 6, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Hutter:2007:SPM

[1258] Marcus Hutter and Andrej Muchnik.On semimeasures predicting Martin–Lof random sequences. Theoreti-cal Computer Science, 382(3):247–261,September 6, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Simon:2007:CWS

[1259] Hans Ulrich Simon. On the complex-ity of working set selection. Theo-retical Computer Science, 382(3):262–279, September 6, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kralovic:2007:P

[1260] Rastislav Kralovic. Preface. The-oretical Computer Science, 383(1):1,September 12, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2007:D

[1261] Anonymous. Dedication. TheoreticalComputer Science, 383(1):3, Septem-ber 12, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Chlebus:2007:CAB

[1262] Bogdan S. Chlebus and Mariusz A.Rokicki. Centralized asynchronousbroadcast in radio networks. Theo-retical Computer Science, 383(1):5–22,

REFERENCES 168

September 12, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

DiSalvo:2007:SFE

[1263] Aleksej Di Salvo and Guido Proietti.Swapping a failing edge of a shortestpaths tree by minimizing the averagestretch factor. Theoretical ComputerScience, 383(1):23–33, September 12,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dourisboure:2007:SBT

[1264] Yon Dourisboure, Feodor F. Dragan,Cyril Gavoille, and Chenyu Yan. Span-ners for bounded tree-length graphs.Theoretical Computer Science, 383(1):34–44, September 12, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Gasieniec:2007:TEC

[1265] Leszek Gasieniec, Igor Potapov, andQin Xin. Time efficient centralizedgossiping in radio networks. Theoret-ical Computer Science, 383(1):45–58,September 12, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Georgiou:2007:LLR

[1266] Chryssis Georgiou, Peter M. Musial,and Alexander A. Shvartsman. Long-lived Rambo: Trading knowledge forcommunication. Theoretical ComputerScience, 383(1):59–85, September 12,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Luccio:2007:FVS

[1267] Flaminia L. Luccio and Jop F. Sibeyn.Feedback vertex sets in mesh-based

networks. Theoretical Computer Sci-ence, 383(1):86–101, September 12,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Matichin:2007:AAH

[1268] Rachel Matichin and David Peleg. Ap-proximation algorithm for hotlink as-signment in the greedy model. Theo-retical Computer Science, 383(1):102–110, September 12, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2007:Pa

[1269] Anonymous. Preface. Theoretical Com-puter Science, 383(1):v–ix, September12, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Burgin:2007:P

[1270] Mark Burgin and Cristian S. Calude.Preface. Theoretical Computer Science,383(2–3):111–114, September 18, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Pollett:2007:CPW

[1271] Chris Pollett and Norman Danner. Cir-cuit principles and weak pigeonholevariants. Theoretical Computer Sci-ence, 383(2–3):115–131, September 18,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Calvin:2007:LBC

[1272] James M. Calvin. A lower boundon complexity of optimization on theWiener space. Theoretical ComputerScience, 383(2–3):132–139, September18, 2007. CODEN TCSCDI. ISSN

REFERENCES 169


Salomaa:2007:SCC

[1273] Arto Salomaa, Kai Salomaa, and ShengYu. State complexity of combined op-erations. Theoretical Computer Sci-ence, 383(2–3):140–152, September 18,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hemaspaandra:2007:QMT

[1274] Lane A. Hemaspaandra and MayurThakur. Query-monotonic Turing re-ductions. Theoretical Computer Sci-ence, 383(2–3):153–186, September 18,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Staiger:2007:KCI

[1275] Ludwig Staiger. The Kolmogorov com-plexity of infinite words. TheoreticalComputer Science, 383(2–3):187–199,September 18, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Eberbach:2007:CPA

[1276] Eugene Eberbach. The $-calculus pro-cess algebra for problem solving: Aparadigmatic shift in handling hardcomputational problems. TheoreticalComputer Science, 383(2–3):200–243,September 18, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Burgin:2007:ACC

[1277] Mark Burgin. Algorithmic complexityas a criterion of unsolvability. Theoret-ical Computer Science, 383(2–3):244–259, September 18, 2007. CODEN TC-


Wiedermann:2007:AAC

[1278] Jirı Wiedermann. Autopoietic au-tomata: Complexity issues in offspring-producing evolving processes. Theoret-ical Computer Science, 383(2–3):260–269, September 18, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kelly:2007:ORE

[1279] Kevin T. Kelly. Ockham’s razor, empir-ical complexity, and truth-finding effi-ciency. Theoretical Computer Science,383(2–3):270–289, September 18, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Cooper:2007:PTA

[1280] Barry Cooper and Angsheng Li. Pref-ace: Theory and applications of mod-els of computation. Theoretical Com-puter Science, 384(1):1, September 24,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Arpe:2007:LJP

[1281] Jan Arpe and Rudiger Reischuk.Learning juntas in the presence ofnoise. Theoretical Computer Sci-ence, 384(1):2–21, September 24, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Cai:2007:VHT

[1282] Jin-Yi Cai and Vinay Choudhary.Valiant’s Holant Theorem and match-gate tensors. Theoretical ComputerScience, 384(1):22–32, September 24,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 170

Hutter:2007:UPB

[1283] Marcus Hutter. On universal predic-tion and Bayesian confirmation. The-oretical Computer Science, 384(1):33–48, September 24, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jain:2007:IC

[1284] Sanjay Jain, Jochen Nessel, and FrankStephan. Invertible classes. Theoret-ical Computer Science, 384(1):49–65,September 24, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hellerstein:2007:PLA

[1285] Lisa Hellerstein and Rocco A. Serve-dio. On PAC learning algorithms forrich Boolean function classes. The-oretical Computer Science, 384(1):66–76, September 24, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Muchnik:2007:NRD

[1286] Andrej Muchnik, Alexander Shen,Mikhail Ustinov, Nikolai Vereshchagin,and Michael Vyugin. Non-reducible de-scriptions for conditional Kolmogorovcomplexity. Theoretical ComputerScience, 384(1):77–86, September 24,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Sun:2007:BSW

[1287] Xiaoming Sun. Block sensitivity ofweakly symmetric functions. Theoret-ical Computer Science, 384(1):87–91,September 24, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Tan:2007:LTA

[1288] Xuehou Tan. A linear-time 2-approximation algorithm for the watch-man route problem for simple polygons.Theoretical Computer Science, 384(1):92–103, September 24, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Urquhart:2007:WVS

[1289] Alasdair Urquhart. Width versussize in resolution proofs. Theoreti-cal Computer Science, 384(1):104–110,September 24, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Xia:2007:CCC

[1290] Mingji Xia, Peng Zhang, and WenboZhao. Computational complexity ofcounting problems on 3-regular planargraphs. Theoretical Computer Science,384(1):111–125, September 24, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Zhang:2007:NAA

[1291] Peng Zhang. A new approximation al-gorithm for the k-facility location prob-lem. Theoretical Computer Science,384(1):126–135, September 24, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Anonymous:2007:PTA

[1292] Anonymous. Preface: Theory and ap-plications of models of computation.Theoretical Computer Science, 384(1):v–ix, September 24, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 171

Pelc:2007:P

[1293] Andrzej Pelc, David Peleg, and MichelRaynal. Preface. Theoretical ComputerScience, 384(2–3):137–138, October 1,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bermond:2007:TGP

[1294] Jean-Claude Bermond, Laurent Braud,and David Coudert. Traffic groom-ing on the path. Theoretical ComputerScience, 384(2–3):139–151, October 1,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Caragiannis:2007:TBO

[1295] Ioannis Caragiannis, Aleksei V.Fishkin, Christos Kaklamanis, and EviPapaioannou. A tight bound for on-line colouring of disk graphs. Theoret-ical Computer Science, 384(2–3):152–160, October 1, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Clementi:2007:BHM

[1296] Andrea E. F. Clementi, Miriam DiIanni, Massimo Lauria, Angelo Monti,Gianluca Rossi, and Riccardo Silvestri.On the bounded-hop MST problem onrandom Euclidean instances. Theoret-ical Computer Science, 384(2–3):161–167, October 1, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dinitz:2007:TAB

[1297] Yefim Dinitz and Noam Solomon. Twoabsolute bounds for distributed bitcomplexity. Theoretical Computer Sci-ence, 384(2–3):168–183, October 1,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hinkelmann:2007:CUN

[1298] Markus Hinkelmann and AndreasJakoby. Communications in unknownnetworks: Preserving the secret oftopology. Theoretical Computer Sci-ence, 384(2–3):184–200, October 1,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Klasing:2007:HAR

[1299] Ralf Klasing, Euripides Markou,Tomasz Radzik, and Fabiano Sarracco.Hardness and approximation results forBlack Hole Search in arbitrary net-works. Theoretical Computer Science,384(2–3):201–221, October 1, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Prencipe:2007:IGS

[1300] Giuseppe Prencipe. Impossibility ofgathering by a set of autonomous mo-bile robots. Theoretical ComputerScience, 384(2–3):222–231, October 1,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Santoro:2007:ASN

[1301] Nicola Santoro and Peter Widmayer.Agreement in synchronous networkswith ubiquitous faults. Theoreti-cal Computer Science, 384(2–3):232–249, October 1, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Shalom:2007:MNA

[1302] Mordechai Shalom and Shmuel Zaks.Minimization of the number of ADMsin SONET rings with maximumthroughput with implications to the

REFERENCES 172

traffic grooming problem. Theoreti-cal Computer Science, 384(2–3):250–262, October 1, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Wang:2007:OGS

[1303] Rui Wang and Francis C. M. Lau. Op-timal gossiping in square 2D meshes.Theoretical Computer Science, 384(2–3):263–286, October 1, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Li:2007:MMM

[1304] Xueliang Li and Xiaoyan Zhang. Onthe minimum monochromatic or mul-ticolored subgraph partition problems.Theoretical Computer Science, 385(1–3):1–10, October 15, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Andre:2007:PCS

[1305] Y. Andre, A. C. Caron, D. Debarbi-eux, Y. Roos, and S. Tison. Path con-straints in semistructured data. Theo-retical Computer Science, 385(1–3):11–33, October 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Das:2007:MCU

[1306] Shantanu Das, Paola Flocchini, ShayKutten, Amiya Nayak, and Nicola San-toro. Map construction of unknowngraphs by multiple agents. Theoret-ical Computer Science, 385(1–3):34–48, October 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Thai:2007:AAC

[1307] My T. Thai, Ning Zhang, Ravi Ti-wari, and Xiaochun Xu. On approx-imation algorithms of k-connected m-dominating sets in disk graphs. Theo-retical Computer Science, 385(1–3):49–59, October 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Broersma:2007:CDS

[1308] Hajo Broersma and Xueliang Li. Onthe complexity of dominating set prob-lems related to the minimum all-ones problem. Theoretical ComputerScience, 385(1–3):60–70, October 15,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Wang:2007:SCP

[1309] Weifan Wang and Yongzhu Chen. Asufficient condition for a planar graphto be class 1. Theoretical ComputerScience, 385(1–3):71–77, October 15,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Galbiati:2007:AAM

[1310] Giulia Galbiati and Francesco Maffi-oli. Approximation algorithms for max-imum cut with limited unbalance. The-oretical Computer Science, 385(1–3):78–87, October 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hsieh:2007:FCG

[1311] Ming Yu Hsieh and Shi-Chun Tsai.On the fairness and complexity of gen-eralized k-in-a-row games. Theoret-ical Computer Science, 385(1–3):88–100, October 15, 2007. CODEN TC-

REFERENCES 173


Khan:2007:SRS

[1312] Maleq Khan, Gopal Pandurangan, andV. S. Anil Kumar. A simple random-ized scheme for constructing low-weightk-connected spanning subgraphs withapplications to distributed algorithms.Theoretical Computer Science, 385(1–3):101–114, October 15, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Popov:2007:MGR

[1313] V. Yu. Popov. Multiple genome rear-rangement by swaps and by elementduplications. Theoretical ComputerScience, 385(1–3):115–126, October 15,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Na:2007:AIL

[1314] Joong Chae Na and Kunsoo Park.Alphabet-independent linear-time con-struction of compressed suffix ar-rays using o(n logn)-bit working space.Theoretical Computer Science, 385(1–3):127–136, October 15, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Carpi:2007:DCL

[1315] Arturo Carpi. On Dejean’s conjec-ture over large alphabets. Theoret-ical Computer Science, 385(1–3):137–151, October 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Epifanio:2007:LM

[1316] C. Epifanio, A. Gabriele, F. Mignosi,A. Restivo, and M. Sciortino. Lan-

guages with mismatches. Theoreti-cal Computer Science, 385(1–3):152–166, October 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Pavan:2007:PRI

[1317] A. Pavan, Alan L. Selman, SamikSengupta, and N. V. Vinodchan-dran. Polylogarithmic-round interac-tive proofs for coNP collapse the ex-ponential hierarchy. Theoretical Com-puter Science, 385(1–3):167–178, Octo-ber 15, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Blanchet-Sadri:2007:PWC

[1318] F. Blanchet-Sadri and Nathan D. Wet-zler. Partial words and the critical fac-torization theorem revisited. Theoret-ical Computer Science, 385(1–3):179–192, October 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Becher:2007:RRC

[1319] Veronica Becher and Serge Grigori-eff. Random reals a la Chaitin withor without prefix-freeness. Theoret-ical Computer Science, 385(1–3):193–201, October 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Berger:2007:ACE

[1320] Andre Berger, Takuro Fukunaga, Hi-roshi Nagamochi, and Ojas Parekh.Approximability of the capacitated b-edge dominating set problem. Theoret-ical Computer Science, 385(1–3):202–213, October 15, 2007. CODEN TC-

REFERENCES 174


Bedaride:2007:CRT

[1321] Nicolas Bedaride. Classification of ro-tations on the torus T ∈. Theoreti-cal Computer Science, 385(1–3):214–225, October 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kratsch:2007:EAM

[1322] Dieter Kratsch and Mathieu Liedloff.An exact algorithm for the minimumdominating clique problem. Theoret-ical Computer Science, 385(1–3):226–240, October 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Blin:2007:ECI

[1323] Guillaume Blin, Guillaume Fertin, andStephane Vialette. Extracting con-strained 2-interval subsets in 2-intervalsets. Theoretical Computer Science,385(1–3):241–263, October 15, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Malvestuto:2007:AAI

[1324] Francesco M. Malvestuto, MauroMezzini, and Marina Moscarini. Ananalytical approach to the inference ofsummary data of additive type. The-oretical Computer Science, 385(1–3):264–285, October 15, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Fang:2007:BPF

[1325] Jywe-Fei Fang. The bipanconnectiv-ity andm-panconnectivity of the folded

hypercube. Theoretical Computer Sci-ence, 385(1–3):286–300, October 15,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2007:EBn


Rozenberg:2007:Pb

[1327] G. Rozenberg. Preface. Theoret-ical Computer Science, 386(1–2):1–2,October 28, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Barrett:2007:PEP

[1328] Chris Barrett, Harry B. Hunt III, Mad-hav V. Marathe, S. S. Ravi, Daniel J.Rosenkrantz, Richard E. Stearns, andMayur Thakur. Predecessor existenceproblems for finite discrete dynamicalsystems. Theoretical Computer Sci-ence, 386(1–2):3–37, October 28, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic). See er-ratum [1530].

Qiu:2007:ATB

[1329] Daowen Qiu. Automata theory basedon quantum logic: Reversibilities andpushdown automata. Theoretical Com-puter Science, 386(1–2):38–56, October28, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Carnell:2007:PCS

[1330] Andrew Carnell and Daniel Richard-son. Parallel computation in spik-

REFERENCES 175

ing neural nets. Theoretical ComputerScience, 386(1–2):57–72, October 28,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jansen:2007:CSA

[1331] Thomas Jansen and Ingo Wegener.A comparison of simulated anneal-ing with a simple evolutionary al-gorithm on pseudo-boolean functionsof unitation. Theoretical ComputerScience, 386(1–2):73–93, October 28,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Benfold:2007:OPS

[1332] W. Benfold, J. Hallam, and A. Prugel-Bennett. Optimal parameters forsearch using a barrier tree Markovmodel. Theoretical Computer Science,386(1–2):94–113, October 28, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Storch:2007:FLC

[1333] Tobias Storch. Finding large cliques insparse semi-random graphs by simplerandomized search heuristics. Theoret-ical Computer Science, 386(1–2):114–131, October 28, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Loos:2007:CTS

[1334] Remco Loos and Mitsunori Ogihara.Complexity theory for splicing systems.Theoretical Computer Science, 386(1–2):132–150, October 28, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Feng:2007:PRC

[1335] Yuan Feng, Runyao Duan, ZhengfengJi, and Mingsheng Ying. Proof rulesfor the correctness of quantum pro-grams. Theoretical Computer Science,386(1–2):151–166, October 28, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Anonymous:2007:Pb

[1336] Anonymous. Preface. Theoretical Com-puter Science, 386(1–2):v–ix, October28, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Baeten:2007:Pb

[1337] Jos C. M. Baeten and Iain C. C.Phillips. Preface. Theoretical ComputerScience, 386(3):167–168, November 1,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Froschle:2007:CVT

[1338] Sibylle Froschle and S lawomir Lasota.Causality versus true-concurrency.Theoretical Computer Science, 386(3):169–187, November 1, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

deAlfaro:2007:CRG

[1339] Luca de Alfaro, Thomas A. Hen-zinger, and Orna Kupferman. Con-current reachability games. Theoreti-cal Computer Science, 386(3):188–217,November 1, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 176

Cacciagrano:2007:SSA

[1340] D. Cacciagrano, F. Corradini, andC. Palamidessi. Separation of syn-chronous and asynchronous communi-cation via testing. Theoretical Com-puter Science, 386(3):218–235, Novem-ber 1, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Briais:2007:OBR

[1341] Sebastien Briais and Uwe Nestmann.Open bisimulation, revisited. Theo-retical Computer Science, 386(3):236–271, November 1, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Simon:2007:GEF

[1342] Hans Ulrich Simon and Etsuji Tomita.Guest editors’ foreword. TheoreticalComputer Science, 387(1):1–3, Novem-ber 6, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Watanabe:2007:SCM

[1343] Kazuho Watanabe and Sumio Watan-abe. Stochastic complexity for mixtureof exponential families in generalizedvariational Bayes. Theoretical Com-puter Science, 387(1):4–17, November6, 2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Palmer:2007:PLP

[1344] Nick Palmer and Paul W. Goldberg.PAC-learnability of probabilistic deter-ministic finite state automata in termsof variation distance. Theoretical Com-puter Science, 387(1):18–31, November6, 2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bennet:2007:LAE

[1345] Rotem Bennet and Nader H. Bshouty.Learning attribute-efficiently with cor-rupt oracles. Theoretical Computer Sci-ence, 387(1):32–50, November 6, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Jain:2007:GCL

[1346] Sanjay Jain, Steffen Lange, and San-dra Zilles. A general comparison of lan-guage learning from examples and fromqueries. Theoretical Computer Sci-ence, 387(1):51–66, November 6, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Jain:2007:LML

[1347] Sanjay Jain and Efim Kinber. Learn-ing multiple languages in groups. The-oretical Computer Science, 387(1):67–76, November 6, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Vovk:2007:NAC

[1348] Vladimir Vovk. Non-asymptotic cal-ibration and resolution. Theoreti-cal Computer Science, 387(1):77–89,November 6, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2007:EBo

[1349] Anonymous. Editorial board. The-oretical Computer Science, 387(1):v–ix, November 6, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 177

Leung:2007:P

[1350] Hing Leung and Giovanni Pighizzini.Preface. Theoretical Computer Sci-ence, 387(2):91–92, November 12, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Almeida:2007:EGS

[1351] Marco Almeida, Nelma Moreira, andRogerio Reis. Enumeration and gener-ation with a string automata represen-tation. Theoretical Computer Science,387(2):93–102, November 12, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Biegler:2007:RRR

[1352] Franziska Biegler, Michael J. Burrell,and Mark Daley. Regulated RNArewriting: Modelling RNA editing withguided insertion. Theoretical ComputerScience, 387(2):103–112, November 12,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Biegler:2007:IHI

[1353] Franziska Biegler, Ian McQuillan, andKai Salomaa. An infinite hierarchy in-duced by depth synchronization. The-oretical Computer Science, 387(2):113–124, November 12, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cordy:2007:ERA

[1354] Brendan Cordy and Kai Salomaa. Onthe existence of regular approxima-tions. Theoretical Computer Science,387(2):125–135, November 12, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Dassow:2007:NCS

[1355] Jurgen Dassow and Bianca Truthe. Onthe number of components for someparallel communicating grammar sys-tems. Theoretical Computer Science,387(2):136–146, November 12, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Domaratzki:2007:TCL

[1356] Michael Domaratzki and Kai Salomaa.Transition complexity of language op-erations. Theoretical Computer Sci-ence, 387(2):147–154, November 12,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gruber:2007:AST

[1357] Hermann Gruber and Markus Holzer.On the average state and transitioncomplexity of finite languages. Theo-retical Computer Science, 387(2):155–166, November 12, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gruber:2007:SHH

[1358] Hermann Gruber, Markus Holzer, andMartin Kutrib. The size of Higman–Haines sets. Theoretical Computer Sci-ence, 387(2):167–176, November 12,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Mereghetti:2007:QAS

[1359] Carlo Mereghetti and Beatrice Palano.Quantum automata for some multiperi-odic languages. Theoretical ComputerScience, 387(2):177–186, November 12,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 178

Niessner:2007:CCD

[1360] Frank Nießner and Ulrich Ultes-Nitsche. A complete characterizationof deterministic regular liveness prop-erties. Theoretical Computer Science,387(2):187–195, November 12, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ferragina:2007:F

[1361] Paolo Ferragina, Giovanni Manzini,and S. Muthukrishnan. Foreword. The-oretical Computer Science, 387(3):197–199, November 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fenwick:2007:BWC

[1362] Peter Fenwick. Burrows–Wheeler com-pression: Principles and reflections.Theoretical Computer Science, 387(3):200–219, November 22, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Kaplan:2007:SAB

[1363] Haim Kaplan, Shir Landau, and EladVerbin. A simpler analysis of Burrows–Wheeler-based compression. Theoreti-cal Computer Science, 387(3):220–235,November 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Giancarlo:2007:FPB

[1364] R. Giancarlo, A. Restivo, andM. Sciortino. From first principles tothe Burrows and Wheeler transformand beyond, via combinatorial opti-mization. Theoretical Computer Sci-ence, 387(3):236–248, November 22,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Karkkainen:2007:FBS

[1365] Juha Karkkainen. Fast BWT in smallspace by blockwise suffix sorting. The-oretical Computer Science, 387(3):249–257, November 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Larsson:2007:FSS

[1366] N. Jesper Larsson and KunihikoSadakane. Faster suffix sorting. Theo-retical Computer Science, 387(3):258–272, November 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Vo:2007:CTD

[1367] Binh Dao Vo and Kiem-Phong Vo.Compressing table data with columndependency. Theoretical Computer Sci-ence, 387(3):273–283, November 22,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Barbay:2007:ASS

[1368] Jeremy Barbay, Alexander Golyn-ski, J. Ian Munro, and S. SrinivasaRao. Adaptive searching in suc-cinctly encoded binary relations andtree-structured documents. Theoreti-cal Computer Science, 387(3):284–297,November 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Mantaci:2007:EBW

[1369] S. Mantaci, A. Restivo, G. Rosone,and M. Sciortino. An extension ofthe Burrows–Wheeler Transform. The-oretical Computer Science, 387(3):298–312, November 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 179

Gupta:2007:CDS

[1370] Ankur Gupta, Wing-Kai Hon, RahulShah, and Jeffrey Scott Vitter. Com-pressed data structures: Dictionariesand data-aware measures. Theoreti-cal Computer Science, 387(3):313–331,November 22, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Makinen:2007:RSR

[1371] Veli Makinen and Gonzalo Navarro.Rank and select revisited and ex-tended. Theoretical Computer Science,387(3):332–347, November 22, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Golynski:2007:OLB

[1372] Alexander Golynski. Optimal lowerbounds for rank and select indexes.Theoretical Computer Science, 387(3):348–359, November 22, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Lai:2007:CDC

[1373] Hongliang Lai and Dexue Zhang.Complete and directed complete Ω-categories. Theoretical Computer Sci-ence, 388(1–3):1–25, December 5, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Geniet:2007:WFT

[1374] Dominique Geniet and Gaelle Largeteau.WCET free time analysis of hard real-time systems on multiprocessors: Aregular language-based model. Theo-retical Computer Science, 388(1–3):26–52, December 5, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Spoto:2007:OCI

[1375] Fausto Spoto. Optimality and con-densing of information flow through lin-ear refinement. Theoretical ComputerScience, 388(1–3):53–82, December 5,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cirstea:2007:MCC

[1376] Corina Cırstea and Dirk Pattinson.Modular construction of complete coal-gebraic logics. Theoretical ComputerScience, 388(1–3):83–108, December 5,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Johnson:2007:FUV

[1377] Michael Johnson and Robert Rose-brugh. Fibrations and universal viewupdatability. Theoretical ComputerScience, 388(1–3):109–129, December5, 2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Adamek:2007:API

[1378] Jirı Adamek, Stefan Milius, and JirıVelebil. Algebras with parametrizediterativity. Theoretical Computer Sci-ence, 388(1–3):130–151, December 5,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Birkedal:2007:DTM

[1379] L. Birkedal, R. E. Møgelberg, and R. L.Petersen. Domain-theoretical modelsof parametric polymorphism. Theoret-ical Computer Science, 388(1–3):152–172, December 5, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 180

Plummer:2007:SEM

[1380] Andrew R. Plummer. S4 enrichedmultimodal categorial grammars arecontext-free. Theoretical ComputerScience, 388(1–3):173–180, December5, 2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chatterjee:2007:CGT

[1381] Krishnendu Chatterjee. Concurrentgames with tail objectives. Theoret-ical Computer Science, 388(1–3):181–198, December 5, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Komenda:2007:CDE

[1382] Jan Komenda and Jan H. van Schup-pen. Control of discrete-event systemswith modular or distributed struc-ture. Theoretical Computer Science,388(1–3):199–226, December 5, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Cook:2007:VBP

[1383] Byron Cook, Daniel Kroening, andNatasha Sharygina. Verification ofBoolean programs with unboundedthread creation. Theoretical ComputerScience, 388(1–3):227–242, December5, 2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Schaefer:2007:CRC

[1384] Mark Schaefer and Walter Vogler.Component refinement and CSC-solving for STG decomposition. The-oretical Computer Science, 388(1–3):243–266, December 5, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Vigliotti:2007:TSR

[1385] Maria Grazia Vigliotti, Iain Phillips,and Catuscia Palamidessi. Tutorialon separation results in process calculivia leader election problems. Theoret-ical Computer Science, 388(1–3):267–289, December 5, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Voigtlander:2007:SSP

[1386] Janis Voigtlander and Patricia Johann.Selective strictness and parametricityin structural operational semantics, in-equationally. Theoretical ComputerScience, 388(1–3):290–318, December5, 2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ponse:2007:BLC

[1387] Alban Ponse and Mark B. van derZwaag. Belnap’s logic and conditionalcomposition. Theoretical ComputerScience, 388(1–3):319–336, December5, 2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2007:EBp


Khosravi:2007:QPV

[1389] Ramtin Khosravi and Mohammad Gh-odsi. Query-point visibility constrainedshortest paths in simple polygons. The-oretical Computer Science, 389(1–2):1–11, December 10, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 181

Bernat:2007:CIW

[1390] Julien Bernat, Zuzana Masakova, andEdita Pelantova. On a class of in-finite words with affine factor com-plexity. Theoretical Computer Science,389(1–2):12–25, December 10, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Aspnes:2007:TTD

[1391] James Aspnes, Joan Feigenbaum, Alek-sandr Yampolskiy, and Sheng Zhong.Towards a theory of data entangle-ment. Theoretical Computer Science,389(1–2):26–43, December 10, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Gronau:2007:HIP

[1392] Ilan Gronau and Shlomo Moran. Onthe hardness of inferring phylogeniesfrom triplet-dissimilarities. Theoreti-cal Computer Science, 389(1–2):44–55,December 10, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jurdzinski:2007:CGR

[1393] Tomasz Jurdzinski. On complexity ofgrammars related to the safety prob-lem. Theoretical Computer Science,389(1–2):56–72, December 10, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Meduna:2007:CSC

[1394] Alexander Meduna and Jirı Techet.Canonical scattered context generatorsof sentences with their parses. Theo-retical Computer Science, 389(1–2):73–81, December 10, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Le:2007:SPD

[1395] Minh Ha Le and Thi Ha Duong Phan.Strict partitions and discrete dynam-ical systems. Theoretical ComputerScience, 389(1–2):82–90, December 10,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

DeSimone:2007:ECR

[1396] Caterina De Simone and Anna Galluc-cio. Edge-colouring of regular graphsof large degree. Theoretical ComputerScience, 389(1–2):91–99, December 10,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Herranz:2007:IBR

[1397] Javier Herranz. Identity-based ringsignatures from RSA. TheoreticalComputer Science, 389(1–2):100–117,December 10, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Tan:2007:MSP

[1398] Bo Tan. Mirror substitutions andpalindromic sequences. TheoreticalComputer Science, 389(1–2):118–124,December 10, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Michail:2007:RRM

[1399] Dimitrios Michail. Reducing rank-maximal to maximum weight match-ing. Theoretical Computer Science,389(1–2):125–132, December 10, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 182

Martinez:2007:ATS

[1400] Fabio Viduani Martinez, Jose Coelhode Pina, and Jose Soares. Algorithmsfor terminal Steiner trees. Theoret-ical Computer Science, 389(1–2):133–142, December 10, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Xu:2007:TCP

[1401] Yinfeng Xu, Wenqiang Dai, Naoki Ka-toh, and Makoto Ohsaki. Triangulat-ing a convex polygon with fewer num-ber of non-standard bars. Theoret-ical Computer Science, 389(1–2):143–151, December 10, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kloster:2007:SAP

[1402] Oddvar Kloster. A solution to theAngel Problem. Theoretical ComputerScience, 389(1–2):152–161, December10, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Harkins:2007:USW

[1403] Ryan C. Harkins and John M. Hitch-cock. Upward separations and weakerhypotheses in resource-bounded mea-sure. Theoretical Computer Science,389(1–2):162–171, December 10, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Koiran:2007:CTP

[1404] Pascal Koiran and Sylvain Perifel. Thecomplexity of two problems on arith-metic circuits. Theoretical ComputerScience, 389(1–2):172–181, December10, 2007. CODEN TCSCDI. ISSN


Liu:2007:TAK

[1405] Hsiao-Fei Liu and Kun-Mao Chao.A tight analysis of the Katriel–Bodlaender algorithm for online topo-logical ordering. Theoretical ComputerScience, 389(1–2):182–189, December10, 2007. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Jain:2007:LLP

[1406] Sanjay Jain and Efim Kinber. Learn-ing languages from positive data anda limited number of short counterex-amples. Theoretical Computer Science,389(1–2):190–218, December 10, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Alekseev:2007:NHG

[1407] V. E. Alekseev, R. Boliac, D. V. Ko-robitsyn, and V. V. Lozin. NP-hardgraph problems and boundary classesof graphs. Theoretical Computer Sci-ence, 389(1–2):219–236, December 10,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Halava:2007:RCW

[1408] Vesa Halava, Tero Harju, and TomiKarki. Relational codes of words. The-oretical Computer Science, 389(1–2):237–249, December 10, 2007. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Wang:2007:HMS

[1409] Rui Wang, Francis C. M. Lau, andYan Yan Liu. On the hardness ofminimizing space for all-shortest-path

REFERENCES 183

interval routing schemes. Theoreti-cal Computer Science, 389(1–2):250–264, December 10, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Manea:2007:FPW

[1410] Florin Manea and Robert Mercas. Free-ness of partial words. TheoreticalComputer Science, 389(1–2):265–277,December 10, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Strothmann:2007:AAD

[1411] Dirk Strothmann. The affix array datastructure and its applications to RNAsecondary structure analysis. Theoret-ical Computer Science, 389(1–2):278–294, December 10, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Brandstadt:2007:CSN

[1412] Andreas Brandstadt and Chınh T.Hoang. On clique separators, nearlychordal graphs, and the MaximumWeight Stable Set Problem. Theoret-ical Computer Science, 389(1–2):295–306, December 10, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Han:2007:PFR

[1413] Yo-Sub Han, Yajun Wang, and De-rick Wood. Prefix-free regular lan-guages and pattern matching. Theoret-ical Computer Science, 389(1–2):307–317, December 10, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Moshe:2007:SCT

[1414] Yossi Moshe. On the subword com-plexity of Thue–Morse polynomial ex-tractions. Theoretical Computer Sci-ence, 389(1–2):318–329, December 10,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Le:2007:CCG

[1415] Van Bang Le, Bert Randerath, andIngo Schiermeyer. On the complexity of4-coloring graphs without long inducedpaths. Theoretical Computer Science,389(1–2):330–335, December 10, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Anonymous:2007:EBq


Sannella:2007:SLF

[1417] Donald Sannella and Vladimiro Sas-sone. Semantic and logical foundationsof global computing: Papers from theEU-FET global computing initiative(2001–2005). Theoretical ComputerScience, 389(3):337–340, December 15,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ahern:2007:FJR

[1418] Alexander Ahern and Nobuko Yoshida.Formalising Java RMI with explicitcode mobility. Theoretical ComputerScience, 389(3):341–410, December 15,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 184

Aspinall:2007:PLR

[1419] David Aspinall, Lennart Beringer,Martin Hofmann, Hans-WolfgangLoidl, and Alberto Momigliano. Aprogram logic for resources. Theo-retical Computer Science, 389(3):411–445, December 15, 2007. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Baldan:2007:SFO

[1420] P. Baldan, A. Bracciali, and R. Bruni.A semantic framework for open pro-cesses. Theoretical Computer Science,389(3):446–483, December 15, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Briais:2007:FSP

[1421] Sebastien Briais and Uwe Nestmann.A formal semantics for protocol narra-tions. Theoretical Computer Science,389(3):484–511, December 15, 2007.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Chatzikokolakis:2007:FAP

[1422] Konstantinos Chatzikokolakis andCatuscia Palamidessi. A frameworkfor analyzing probabilistic protocolsand its application to the Partial Se-crets Exchange. Theoretical ComputerScience, 389(3):512–527, December 15,2007. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Krukow:2007:CFP

[1423] Karl Krukow and Andrew Twigg. Thecomplexity of fixed point models oftrust in distributed networks. Theo-retical Computer Science, 389(3):528–549, December 15, 2007. CODEN TC-


Asarinp:2008:AAP

[1424] Eugene Asarinp, Gordon Pace, Ger-ardo Schneider, and Sergio Yovine.Algorithmic analysis of polygonal hy-brid systems, part II: Phase portraitand tools. Theoretical Computer Sci-ence, 390(1):1–26, January 22, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Klasing:2008:GAO

[1425] Ralf Klasing, Euripides Markou, andAndrzej Pelc. Gathering asynchronousoblivious mobile robots in a ring. The-oretical Computer Science, 390(1):27–39, January 22, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Apostolico:2008:MP

[1426] Alberto Apostolico, Laxmi Parida, andSimona E. Rombo. Motif patterns in2D. Theoretical Computer Science, 390(1):40–55, January 22, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Chepoi:2008:RAA

[1427] Victor Chepoi, Karim Nouioua, andYann Vaxes. A rounding algorithm forapproximating minimum Manhattannetworks. Theoretical Computer Sci-ence, 390(1):56–69, January 22, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Park:2008:PEP

[1428] Jung-Heum Park. Panconnectivity andedge-pancyclicity of faulty recursive

REFERENCES 185

circulant G. Theoretical Computer Sci-ence, 390(1):70–80, January 22, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Morsy:2008:IAA

[1429] Ehab Morsy and Hiroshi Nagamochi.An improved approximation algorithmfor capacitated multicast routings innetworks. Theoretical Computer Sci-ence, 390(1):81–91, January 22, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

DeMol:2008:TSC

[1430] Liesbeth De Mol. Tag systems andCollatz-like functions. TheoreticalComputer Science, 390(1):92–101, Jan-uary 22, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Atanasiu:2008:PMA

[1431] Adrian Atanasiu, Radu Atanasiu, andIon Petre. Parikh matrices and ami-able words. Theoretical ComputerScience, 390(1):102–109, January 22,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Shi:2008:OPA

[1432] Yongqiang Shi and Deshi Ye. On-line bin packing with arbitrary re-lease times. Theoretical ComputerScience, 390(1):110–119, January 22,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cheng:2008:CNU

[1433] Yongxi Cheng, Ker-I Ko, and WeiliWu. On the complexity of non-uniqueprobe selection. Theoretical ComputerScience, 390(1):120–125, January 22,


Anonymous:2008:EBa


Sassone:2008:FSS

[1435] Vladimiro Sassone. Foundations ofSoftware Science and ComputationalStructures: Selected papers from FOS-SACS 2005. Theoretical Computer Sci-ence, 390(2–3):127–128, January 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Abbes:2008:TCP

[1436] Samy Abbes and Albert Benveniste.True-concurrency probabilistic models:Markov nets and a law of large num-bers. Theoretical Computer Science,390(2–3):129–170, January 28, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Jeffrey:2008:FAP

[1437] Alan Jeffrey and Julian Rathke. Fullabstraction for polymorphic π-calculus.Theoretical Computer Science, 390(2–3):171–196, January 28, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Larsen:2008:ORM

[1438] Kim Guldstrand Larsen and Jacob Il-lum Rasmussen. Optimal reachabil-ity for multi-priced timed automata.Theoretical Computer Science, 390(2–3):197–213, January 28, 2008. CODEN

REFERENCES 186


Murawski:2008:TOI

[1439] Andrzej S. Murawski and IgorWalukiewicz. Third-order Idealized Al-gol with iteration is decidable. Theoret-ical Computer Science, 390(2–3):214–229, January 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Schroder:2008:ECM

[1440] Lutz Schroder. Expressivity of coalge-braic modal logic: The limits and be-yond. Theoretical Computer Science,390(2–3):230–247, January 28, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Stark:2008:FAM

[1441] Ian Stark. Free-algebra models forthe π-calculus. Theoretical ComputerScience, 390(2–3):248–270, January 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Berthe:2008:PSI

[1442] Valerie Berthe, Pierre Lecomte, andMichel Rigo. Preface to the specialissue dedicated to combinatorics, au-tomata and number theory. Theo-retical Computer Science, 391(1–2):1–2, February 4, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bell:2008:UBM

[1443] Paul Bell and Igor Potapov. On un-decidability bounds for matrix decisionproblems. Theoretical Computer Sci-ence, 391(1–2):3–13, February 4, 2008.


Czeizler:2008:MCT

[1444] Elena Czeizler. Multiple constraintson three and four words. Theoret-ical Computer Science, 391(1–2):14–19, February 4, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Durand:2008:CST

[1445] F. Durand. Cobham–Semenov the-orem and Nd -subshifts. Theoret-ical Computer Science, 391(1–2):20–38, February 4, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Frettloh:2008:SDT

[1446] D. Frettloh. Self-dual tilings with re-spect to star-duality. Theoretical Com-puter Science, 391(1–2):39–50, Febru-ary 4, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Glen:2008:CFW

[1447] Amy Glen. A characterization of finewords over a finite alphabet. Theo-retical Computer Science, 391(1–2):51–60, February 4, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Honkala:2008:CPP

[1448] Juha Honkala. Cancellation and pe-riodicity properties of iterated mor-phisms. Theoretical Computer Science,391(1–2):61–64, February 4, 2008. CO-DEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 187

Koutschan:2008:RLT

[1449] Christoph Koutschan. Regular lan-guages and their generating functions:The inverse problem. Theoretical Com-puter Science, 391(1–2):65–74, Febru-ary 4, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Brlek:2008:SOD

[1450] S. Brlek, G. Labelle, and A. Lacasse.Shuffle operations on discrete paths.Theoretical Computer Science, 391(1–2):75–89, February 4, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Neraud:2008:CCC

[1451] Jean Neraud. Completing circularcodes in regular submonoids. Theo-retical Computer Science, 391(1–2):90–98, February 4, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Petrov:2008:ARC

[1452] I. V. Petrov. An algorithm for recog-nition of n-collapsing words. Theo-retical Computer Science, 391(1–2):99–108, February 4, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Louchard:2008:GAC

[1453] Guy Louchard and Helmut Prodinger.Generalized approximate counting re-visited. Theoretical Computer Science,391(1–2):109–125, February 4, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Kao:2008:WAR

[1454] Jui-Yi Kao, Narad Rampersad, JeffreyShallit, and Manuel Silva. Words avoid-ing repetitions in arithmetic progres-sions. Theoretical Computer Science,391(1–2):126–137, February 4, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Schratzberger:2008:CAB

[1455] B. Schratzberger. A conversion algo-rithm based on the technique of singu-larization. Theoretical Computer Sci-ence, 391(1–2):138–149, February 4,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Brignall:2008:SPD

[1456] Robert Brignall, Nik Ruskuc, and Vin-cent Vatter. Simple permutations: De-cidability and unavoidable substruc-tures. Theoretical Computer Science,391(1–2):150–163, February 4, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bernat:2008:SI

[1457] Julien Bernat. Symmetrized β-integers.Theoretical Computer Science, 391(1–2):164–177, February 4, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Puzynina:2008:PTD

[1458] S. A. Puzynina and S. V. Av-gustinovich. On periodicity oftwo-dimensional words. TheoreticalComputer Science, 391(1–2):178–187,February 4, 2008. CODEN TCSCDI.ISSN 0304-3975 (print), 1879-2294(electronic).

REFERENCES 188

Anonymous:2008:EBb


Priami:2008:P

[1460] Corrado Priami. Preface. Theo-retical Computer Science, 391(3):189,February 14, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cardelli:2008:PRS

[1461] Luca Cardelli. On process rate seman-tics. Theoretical Computer Science,391(3):190–215, February 14, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Cavaliere:2008:MBM

[1462] Matteo Cavaliere, Radu Mardare, andSean Sedwards. A multiset-basedmodel of synchronizing agents: Com-putability and robustness. Theoreti-cal Computer Science, 391(3):216–238,February 14, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Heath:2008:PMC

[1463] John Heath, Marta Kwiatkowska,Gethin Norman, David Parker, andOksana Tymchyshyn. Probabilisticmodel checking of complex biologi-cal pathways. Theoretical ComputerScience, 391(3):239–257, February 14,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Siebert:2008:TCL

[1464] Heike Siebert and Alexander Bock-mayr. Temporal constraints in thelogical analysis of regulatory networks.Theoretical Computer Science, 391(3):258–275, February 14, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Amir-Kroll:2008:GGP

[1465] Hila Amir-Kroll, Avital Sadot, Irun R.Cohen, and David Harel. GemCell: Ageneric platform for modeling multi-cellular biological systems. Theoreti-cal Computer Science, 391(3):276–290,February 14, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2008:Pa

[1466] Anonymous. Preface. Theoretical Com-puter Science, 391(3):i–v, February 14,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Buse:2008:E

[1467] Laurent Buse, Mohamed Elkadi, andBernard Mourrain. Editorial. Theo-retical Computer Science, 392(1–3):1–2, February 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Galligo:2008:P

[1468] Andre Galligo. Preface. Theoret-ical Computer Science, 392(1–3):3–4,February 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 189

Biasotti:2008:RGS

[1469] S. Biasotti, D. Giorgi, M. Spagnuolo,and B. Falcidieno. Reeb graphs forshape analysis and applications. The-oretical Computer Science, 392(1–3):5–22, February 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cox:2008:MCI

[1470] David A. Cox. The moving curveideal and the Rees algebra. Theo-retical Computer Science, 392(1–3):23–36, February 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dahan:2008:COR

[1471] Xavier Dahan, Xin Jin, Marc MorenoMaza, and Eric Schost. Change of orderfor regular chains in positive dimension.Theoretical Computer Science, 392(1–3):37–65, February 28, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Damon:2008:SRS

[1472] James Damon. Swept regions and sur-faces: Modeling and volumetric prop-erties. Theoretical Computer Science,392(1–3):66–91, February 28, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Haviv:2008:UAN

[1473] D. Haviv and Y. Yomdin. Uniform ap-proximation of near-singular surfaces.Theoretical Computer Science, 392(1–3):92–100, February 28, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Kostov:2008:MS

[1474] Vladimir Petrov Kostov. On multipliersequences. Theoretical Computer Sci-ence, 392(1–3):101–112, February 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lombardi:2008:SRF

[1475] Henri Lombardi and Claude Quitte.Seminormal rings (following ThierryCoquand). Theoretical Computer Sci-ence, 392(1–3):113–127, February 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Simpson:2008:ACC

[1476] Carlos Simpson. Algebraic cycles froma computational point of view. Theoret-ical Computer Science, 392(1–3):128–140, February 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Sir:2008:CSR

[1477] Zbynek Sır, Jens Gravesen, and BertJuttler. Curves and surfaces repre-sented by polynomial support func-tions. Theoretical Computer Science,392(1–3):141–157, February 28, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Tsigaridas:2008:CRR

[1478] Elias P. Tsigaridas and Ioannis Z.Emiris. On the complexity of realroot isolation using continued frac-tions. Theoretical Computer Science,392(1–3):158–173, February 28, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 190

Yengui:2008:MUM

[1479] Ihsen Yengui. Making the use ofmaximal ideals constructive. Theoret-ical Computer Science, 392(1–3):174–178, February 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2008:E

[1480] Anonymous. Editorial. Theoreti-cal Computer Science, 392(1–3):v–ix,February 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bu:2008:UCA

[1481] Tian-Ming Bu, Qi Qi, and Aries WeiSun. Unconditional competitive auc-tions with copy and budget constraints.Theoretical Computer Science, 393(1–3):1–13, March 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bein:2008:FAA

[1482] Wolfgang Bein, Jose R. Correa, andXin Han. A fast asymptotic approx-imation scheme for bin packing withrejection. Theoretical Computer Sci-ence, 393(1–3):14–22, March 20, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bucci:2008:DGE

[1483] Michelangelo Bucci, Aldo de Luca,Alessandro De Luca, and Luca Q.Zamboni. On different generaliza-tions of episturmian words. Theoret-ical Computer Science, 393(1–3):23–36, March 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ferrante:2008:MNE

[1484] Alessandro Ferrante and Mimmo Par-ente. Mixed Nash equilibria in self-ish routing problems with dynamic con-straints. Theoretical Computer Sci-ence, 393(1–3):37–53, March 20, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Berman:2008:AOS

[1485] Piotr Berman and Bhaskar DasGupta.Approximating the online set multi-cover problems via randomized win-nowing. Theoretical Computer Sci-ence, 393(1–3):54–71, March 20, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bui-Xuan:2008:CGS

[1486] Binh-Minh Bui-Xuan, Michel Habib,and Christophe Paul. Competitivegraph searches. Theoretical ComputerScience, 393(1–3):72–80, March 20,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Li:2008:ECW

[1487] Hao Li, Huifang Miao, Li Liu, LianLi, and Heping Zhang. Energy con-servation in wireless sensor networksand connectivity of graphs. Theoret-ical Computer Science, 393(1–3):81–89, March 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Suzuki:2008:MOG

[1488] Tomoko Suzuki, Taisuke Izumi,Fukuhito Ooshita, Hirotsugu Kaku-gawa, and Toshimitsu Masuzawa.Move-optimal gossiping among mobile

REFERENCES 191

agents. Theoretical Computer Sci-ence, 393(1–3):90–101, March 20, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Lu:2008:SMS

[1489] Lingfa Lu, Jinjiang Yuan, and LiqiZhang. Single machine schedulingwith release dates and job deliveryto minimize the makespan. Theoret-ical Computer Science, 393(1–3):102–108, March 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Buchholz:2008:BRW

[1490] Peter Buchholz. Bisimulation rela-tions for weighted automata. Theoret-ical Computer Science, 393(1–3):109–123, March 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Nedev:2008:MDG

[1491] Z. Nedev and S. Muthukrishnan.The Magnus–Derek game. Theoret-ical Computer Science, 393(1–3):124–132, March 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Nagamochi:2008:AVS

[1492] Hiroshi Nagamochi and TakaharuOhnishi. Approximating a vehiclescheduling problem with time win-dows and handling times. Theoreti-cal Computer Science, 393(1–3):133–146, March 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bozapalidis:2008:GA

[1493] Symeon Bozapalidis and AntoniosKalampakas. Graph automata. The-oretical Computer Science, 393(1–3):147–165, March 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Brlek:2008:SWL

[1494] S. Brlek, D. Jamet, and G. Paquin.Smooth words on 2-letter alphabetshaving same parity. TheoreticalComputer Science, 393(1–3):166–181,March 20, 2008. CODEN TCSCDI.ISSN 0304-3975 (print), 1879-2294(electronic).

Broersma:2008:CCP

[1495] Hajo Broersma, Matthew Johnson,Daniel Paulusma, and Iain A. Stewart.The computational complexity of theparallel knock-out problem. Theoret-ical Computer Science, 393(1–3):182–195, March 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Berstel:2008:APS

[1496] Jean Berstel and Christophe Reutenauer.Another proof of Soittola’s theorem.Theoretical Computer Science, 393(1–3):196–203, March 20, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Kuo:2008:PMS

[1497] Wen-Hung Kuo and Dar-Li Yang.Parallel-machine scheduling with timedependent processing times. Theoret-ical Computer Science, 393(1–3):204–210, March 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 192

Angelelli:2008:SOS

[1498] Enrico Angelelli, Maria Grazia Sper-anza, and Zsolt Tuza. Semi-onlinescheduling on two uniform processors.Theoretical Computer Science, 393(1–3):211–219, March 20, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Ferrante:2008:HOP

[1499] Alessandro Ferrante, Gopal Panduran-gan, and Kihong Park. On the hardnessof optimization in power-law graphs.Theoretical Computer Science, 393(1–3):220–230, March 20, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Kujala:2008:COB

[1500] Jussi Kujala and Tapio Elomaa. Thecost of offline binary search tree algo-rithms and the complexity of the re-quest sequence. Theoretical ComputerScience, 393(1–3):231–239, March 20,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Xavier:2008:CCP

[1501] E. C. Xavier and F. K. Miyazawa. Theclass constrained bin packing problemwith applications to video-on-demand.Theoretical Computer Science, 393(1–3):240–259, March 20, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Daude:2008:PSA

[1502] Herve Daude, Marc Mezard, ThierryMora, and Riccardo Zecchina. Pairsof SAT-assignments in random Booleanformulæ. Theoretical Computer Sci-ence, 393(1–3):260–279, March 20,


Huang:2008:ANW

[1503] Y. B. Huang. About the number ofC∞-words of form w × w. Theoret-ical Computer Science, 393(1–3):280–286, March 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Tian:2008:BLA

[1504] Ji Tian, Ruyan Fu, and Jinjiang Yuan.A best on-line algorithm for singlemachine scheduling with small de-livery times. Theoretical ComputerScience, 393(1–3):287–293, March 20,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Segal:2008:CCF

[1505] Michael Segal and Eli Zeitlin. Com-puting closest and farthest points for aquery segment. Theoretical ComputerScience, 393(1–3):294–300, March 20,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2008:EBc


Courcelle:2008:MDC

[1507] Bruno Courcelle and Christian Del-homme. The modular decomposi-tion of countable graphs. definitionand construction in monadic second-order logic. Theoretical Computer Sci-ence, 394(1–2):1–38, March 31, 2008.

REFERENCES 193


Zhang:2008:CLR

[1508] Yu Zhang. Cryptographic logical re-lations. Theoretical Computer Sci-ence, 394(1–2):39–63, March 31, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Laird:2008:DSC

[1509] J. Laird. Decidability and syntac-tic control of interference. Theoret-ical Computer Science, 394(1–2):64–83, March 31, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Calders:2008:IFS

[1510] Toon Calders. Itemset frequency sat-isfiability: Complexity and axioma-tization. Theoretical Computer Sci-ence, 394(1–2):84–111, March 31, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Garcia:2008:SCC

[1511] Flavio D. Garcia and Peter vanRossum. Sound and complete com-putational interpretation of symbolichashes in the standard model. Theoret-ical Computer Science, 394(1–2):112–133, March 31, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kretinsky:2008:PNL

[1512] Mojmır Kretınsky, Vojtech Rehak, andJan Strejcek. Petri nets are less expres-sive than state-extended PA. Theoret-ical Computer Science, 394(1–2):134–140, March 31, 2008. CODEN TC-


Anonymous:2008:EBd


Beckmann:2008:GEC

[1514] Arnold Beckmann, Edwin Beggs, andBenedikt Lowe. From Godel to Ein-stein: Computability between logic andphysics at CiE 2006. Theoretical Com-puter Science, 394(3):141–143, April 8,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Avron:2008:CDV

[1515] Arnon Avron. Constructibility and de-cidability versus domain independenceand absoluteness. Theoretical Com-puter Science, 394(3):144–158, April 8,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cockshott:2008:PCH

[1516] Paul Cockshott, Lewis Mackenzie,and Greg Michaelson. Physical con-straints on hypercomputation. Theo-retical Computer Science, 394(3):159–174, April 8, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fouche:2008:DGB

[1517] Willem L. Fouche. Dynamics of ageneric Brownian motion: Recursiveaspects. Theoretical Computer Sci-ence, 394(3):175–186, April 8, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 194

Kendon:2008:OCN

[1518] Viv Kendon and Olivier Maloyer. Op-timal computation with non-unitaryquantum walks. Theoretical ComputerScience, 394(3):187–196, April 8, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Koepke:2008:MCO

[1519] Peter Koepke and Ryan Siders. Mini-mality considerations for ordinal com-puters modeling constructibility. Theo-retical Computer Science, 394(3):197–207, April 8, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Nagy:2008:IVC

[1520] Benedek Nagy and Sandor Valyi.Interval-valued computations and theirconnection with PSPACE. Theo-retical Computer Science, 394(3):208–222, April 8, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Welch:2008:BLN

[1521] Philip D. Welch. Bounding lemmatafor non-deterministic halting times oftransfinite Turing machines. Theo-retical Computer Science, 394(3):223–228, April 8, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Rozenberg:2008:Pa

[1522] G. Rozenberg. Preface. TheoreticalComputer Science, 395(1):1–2, April17, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Brun:2008:NPT

[1523] Yuriy Brun. Nondeterministic poly-nomial time factoring in the tile as-sembly model. Theoretical ComputerScience, 395(1):3–23, April 17, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Langille:2008:SVP

[1524] Miika Langille and Ion Petre. Sequen-tial vs. parallel complexity in simplegene assembly. Theoretical ComputerScience, 395(1):24–30, April 17, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Brun:2008:SNC

[1525] Yuriy Brun. Solving NP-completeproblems in the tile assembly model.Theoretical Computer Science, 395(1):31–46, April 17, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gao:2008:GCP

[1526] Shile Gao and Kequan Ding. A graph-ical criterion of planarity for RNA sec-ondary structures with pseudoknots inRivas–Eddy class. Theoretical Com-puter Science, 395(1):47–56, April 17,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zaharakis:2008:MSN

[1527] Ioannis D. Zaharakis and Achilles D.Kameas. Modeling spiking neural net-works. Theoretical Computer Science,395(1):57–76, April 17, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 195

Barbuti:2008:CSB

[1528] Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo Milazzo, and SimoneTini. Compositional semantics and be-havioral equivalences for P Systems.Theoretical Computer Science, 395(1):77–100, April 17, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Morita:2008:RCC

[1529] Kenichi Morita. Reversible comput-ing and cellular automata—A survey.Theoretical Computer Science, 395(1):101–131, April 17, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Barrett:2008:EPP

[1530] Chris Barrett, Harry B. Hunt III, Mad-hav V. Marathe, S. S. Ravi, Daniel J.Rosenkrantz, Richard E. Stearns, andMayur Thakur. Errata for the paper“Predecessor existence problems for fi-nite discrete dynamical systems” [The-oret. Comput. Sci. 386 (1–2) (2007) 3–37]. Theoretical Computer Science, 395(1):132–133, April 17, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic). See [1328].

Anonymous:2008:Pb

[1531] Anonymous. Preface. Theoretical Com-puter Science, 395(1):v–ix, April 17,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Giancarlo:2008:FSI

[1532] Raffaele Giancarlo and Stefano Lonardi.Foreword: Special issue in honor ofthe 60th birthday of Professor AlbertoApostolico: Work is for people who do

not know how to: SAIL — String Al-gorithms, Information and Learning.Theoretical Computer Science, 395(2–3):135–136, May 1, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Pizzi:2008:FPM

[1533] Cinzia Pizzi and Esko Ukkonen. Fastprofile matching algorithms — A sur-vey. Theoretical Computer Science, 395(2–3):137–157, May 1, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Comin:2008:DSV

[1534] Matteo Comin and Laxmi Parida. De-tection of subtle variations as consen-sus motifs. Theoretical Computer Sci-ence, 395(2–3):158–170, May 1, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Lemaitre:2008:STU

[1535] Claire Lemaitre and Marie-FranceSagot. A small trip in the untran-quil world of genomes: A survey onthe detection and analysis of genomerearrangement breakpoints. Theoret-ical Computer Science, 395(2–3):171–192, May 1, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Alekseyev:2008:MBR

[1536] Max A. Alekseyev and Pavel A.Pevzner. Multi-break rearrangementsand chromosomal evolution. Theoret-ical Computer Science, 395(2–3):193–202, May 1, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 196

Jacquet:2008:EHM

[1537] Philippe Jacquet, Gadiel Seroussi, andWojciech Szpankowski. On the en-tropy of a hidden Markov process. The-oretical Computer Science, 395(2–3):203–219, May 1, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Schurmann:2008:CSA

[1538] Klaus-Bernd Schurmann and JensStoye. Counting suffix arrays andstrings. Theoretical Computer Sci-ence, 395(2–3):220–234, May 1, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Nederhof:2008:CDR

[1539] Mark-Jan Nederhof and Giorgio Satta.Computation of distances for regu-lar and context-free probabilistic lan-guages. Theoretical Computer Sci-ence, 395(2–3):235–254, May 1, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Iliopoulos:2008:ACV

[1540] Costas S. Iliopoulos and M. Sohel Rah-man. Algorithms for computing vari-ants of the longest common subse-quence problem. Theoretical Com-puter Science, 395(2–3):255–267, May1, 2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kim:2008:CSR

[1541] Jin Wook Kim, Amihood Amir,Gad M. Landau, and Kunsoo Park.Computing similarity of run-length en-coded strings with affine gap penalty.Theoretical Computer Science, 395(2–3):268–282, May 1, 2008. CODEN TC-


Crochemore:2008:AIP

[1542] Maxime Crochemore, Danny Hermelin,Gad M. Landau, Dror Rawitz, andStephane Vialette. Approximating the2-interval pattern problem. Theoret-ical Computer Science, 395(2–3):283–297, May 1, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Amir:2008:PMW

[1543] Amihood Amir, Eran Chencinski,Costas Iliopoulos, Tsvi Kopelowitz,and Hui Zhang. Property matching andweighted matching. Theoretical Com-puter Science, 395(2–3):298–310, May1, 2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chen:2008:ILB

[1544] WenBin Chen, Jiangtao Meng, andDengpan Yin. An improved lowerbound for approximating minimumGCD multiplier in `∞ norm (GCDM∞).Theoretical Computer Science, 396(1–3):1–9, May 10, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Salinas:2008:CS

[1545] L. Salinas and E. Goles. Coveringby squares. Theoretical Computer Sci-ence, 396(1–3):10–27, May 10, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Liu:2008:IMM

[1546] Longcheng Liu and Enyu Yao. Inversemin–max spanning tree problem un-der the Weighted sum-type Hamming

REFERENCES 197

distance. Theoretical Computer Sci-ence, 396(1–3):28–34, May 10, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Dukes:2008:CGC

[1547] W. M. B. Dukes, M. F. Flanagan,T. Mansour, and V. Vajnovszki. Com-binatorial Gray codes for classes ofpattern avoiding permutations. The-oretical Computer Science, 396(1–3):35–49, May 10, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Shieh:2008:JMA

[1548] Min-Zheng Shieh and Shi-Chun Tsai.Jug measuring: Algorithms and com-plexity. Theoretical Computer Sci-ence, 396(1–3):50–62, May 10, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Escoffier:2008:BDA

[1549] Bruno Escoffier and Jerome Monnot. Abetter differential approximation ratiofor symmetric TSP. Theoretical Com-puter Science, 396(1–3):63–70, May 10,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Couceiro:2008:QOB

[1550] Miguel Couceiro and Maurice Pouzet.On a quasi-ordering on Boolean func-tions. Theoretical Computer Sci-ence, 396(1–3):71–87, May 10, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Fenner:2008:MNP

[1551] Trevor Fenner, Mark Levene, andGeorge Loizou. Modelling the navi-gation potential of a web page. The-

oretical Computer Science, 396(1–3):88–96, May 10, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Defago:2008:NUC

[1552] Xavier Defago and Samia Souissi. Non-uniform circle formation algorithm foroblivious mobile robots with conver-gence toward uniformity. Theoret-ical Computer Science, 396(1–3):97–112, May 10, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dunne:2008:CDR

[1553] Paul E. Dunne and Yann Chevaleyre.The complexity of deciding reachabil-ity properties of distributed negotiationschemes. Theoretical Computer Sci-ence, 396(1–3):113–144, May 10, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Yuster:2008:APD

[1554] Raphael Yuster. All-pairs disjointpaths from a common ancestor inO(nω) time. Theoretical Computer Sci-ence, 396(1–3):145–150, May 10, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Li:2008:OCC

[1555] Xueliang Li and Wenli Zhou. The 2nd-order conditional 3-coloring of claw-free graphs. Theoretical Computer Sci-ence, 396(1–3):151–157, May 10, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Irani:2008:PAS

[1556] Sandy Irani and Vitus Leung. Prob-abilistic analysis for scheduling with

REFERENCES 198

conflicts. Theoretical Computer Sci-ence, 396(1–3):158–179, May 10, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Wang:2008:AOD

[1557] Chen Wang, Myung-Ah Park, JamesWillson, Yongxi Cheng, AndrasFarago, and Weili Wu. On approximateoptimal dual power assignment for bi-connectivity and edge-biconnectivity.Theoretical Computer Science, 396(1–3):180–190, May 10, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Chen:2008:WVP

[1558] Ying-You Chen, Dyi-Rong Duh,Tai-Ling Ye, and Jung-Sheng Fu.Weak-vertex-pancyclicity of (n, k)-stargraphs. Theoretical Computer Sci-ence, 396(1–3):191–199, May 10, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Hung:2008:CAM

[1559] Regant Y. S. Hung and H. F. Ting.Competitive analysis of most-request-first for scheduling broadcasts withstart-up delay. Theoretical ComputerScience, 396(1–3):200–211, May 10,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chandler:2008:PPC

[1560] David B. Chandler, Maw-ShangChang, Ton Kloks, Jiping Liu, andSheng-Lung Peng. Partitioned probecomparability graphs. TheoreticalComputer Science, 396(1–3):212–222,May 10, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Boyar:2008:TBM

[1561] Joan Boyar and Rene Peralta. Tightbounds for the multiplicative complex-ity of symmetric functions. Theoret-ical Computer Science, 396(1–3):223–246, May 10, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Goles:2008:CBP

[1562] E. Goles and L. Salinas. Compar-ison between parallel and serial dy-namics of Boolean networks. Theoret-ical Computer Science, 396(1–3):247–253, May 10, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Currie:2008:PPT

[1563] James D. Currie. Palindrome posi-tions in ternary square-free words. The-oretical Computer Science, 396(1–3):254–257, May 10, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Liu:2008:PCG

[1564] Guizhen Liu and Ping Li. Paths incircuit graphs of matroids. Theoret-ical Computer Science, 396(1–3):258–263, May 10, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kari:2008:WUI

[1565] Lila Kari and Petr Sosık. On the weightof universal insertion grammars. The-oretical Computer Science, 396(1–3):264–270, May 10, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 199

Buss:2008:NHF

[1566] Samuel R. Buss and Jan Hoffmann.The NP-hardness of finding a directedacyclic graph for regular resolution.Theoretical Computer Science, 396(1–3):271–276, May 10, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Neven:2008:STS

[1567] Gregory Neven. A simple transitive sig-nature scheme for directed trees. The-oretical Computer Science, 396(1–3):277–282, May 10, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lu:2008:UPB

[1568] Lingfa Lu, Liqi Zhang, and JinjiangYuan. The unbounded parallel batchmachine scheduling with release datesand rejection to minimize makespan.Theoretical Computer Science, 396(1–3):283–289, May 10, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Myung:2008:CPP

[1569] Young-Soo Myung. On the clique par-titioning problem in weighted inter-val graphs. Theoretical Computer Sci-ence, 396(1–3):290–293, May 10, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Verbitsky:2008:OCP

[1570] Oleg Verbitsky. On the obfuscationcomplexity of planar graphs. Theoret-ical Computer Science, 396(1–3):294–300, May 10, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2008:EBe


Case:2008:F

[1572] John Case, Takeshi Shinohara, ThomasZeugmann, and Sandra Zilles. Fore-word. Theoretical Computer Science,397(1–3):1–3, May 20, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Zeugmann:2008:LRF

[1573] Thomas Zeugmann and Sandra Zilles.Learning recursive functions: A survey.Theoretical Computer Science, 397(1–3):4–56, May 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Grieser:2008:RII

[1574] Gunter Grieser. Reflective inductiveinference of recursive functions. The-oretical Computer Science, 397(1–3):57–69, May 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Freivalds:2008:QII

[1575] R. Freivalds and R. F. Bonner. Quan-tum inductive inference by finite au-tomata. Theoretical Computer Sci-ence, 397(1–3):70–76, May 20, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Poland:2008:NBC

[1576] Jan Poland. Nonstochastic bandits:Countable decision set, unbounded

REFERENCES 200

costs and reactive environments. The-oretical Computer Science, 397(1–3):77–93, May 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Balbach:2008:MTU

[1577] Frank J. Balbach. Measuring teach-ability using variants of the teachingdimension. Theoretical Computer Sci-ence, 397(1–3):94–113, May 20, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Jain:2008:AVP

[1578] Sanjay Jain, Eric Martin, and FrankStephan. Absolute versus probabilisticclassification in a logical setting. The-oretical Computer Science, 397(1–3):114–128, May 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Rao:2008:SCT

[1579] M. R. K. Krishna Rao. Some classes ofterm rewriting systems inferable frompositive data. Theoretical ComputerScience, 397(1–3):129–149, May 20,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ng:2008:DEL

[1580] Yen Kaow Ng and Takeshi Shino-hara. Developments from enquiriesinto the learnability of the pattern lan-guages from positive data. Theoret-ical Computer Science, 397(1–3):150–165, May 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Reidenbach:2008:DPI

[1581] Daniel Reidenbach. Discontinuities inpattern inference. Theoretical Com-puter Science, 397(1–3):166–193, May20, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Lange:2008:LIF

[1582] Steffen Lange, Thomas Zeugmann, andSandra Zilles. Learning indexed fami-lies of recursive languages from positivedata: A survey. Theoretical ComputerScience, 397(1–3):194–232, May 20,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jain:2008:LES

[1583] Sanjay Jain and Efim Kinber. Learn-ing and extending sublanguages. The-oretical Computer Science, 397(1–3):233–246, May 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2008:Fb

[1584] Anonymous. Foreword. TheoreticalComputer Science, 397(1–3):v–ix, May20, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Berardi:2008:CTA

[1585] Stefano Berardi and Ugo de’Liguoro.Calculi, types and applications: Essaysin honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi Della Rocca.Theoretical Computer Science, 398(1–3):1–11, May 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 201

Barendregt:2008:TRP

[1586] Henk Barendregt. Towards the rangeproperty for the lambda theoryH. The-oretical Computer Science, 398(1–3):12–15, May 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Klop:2008:LCP

[1587] Jan Willem Klop, Vincent van Oost-rom, and Roel de Vrijer. Lambda cal-culus with patterns. Theoretical Com-puter Science, 398(1–3):16–31, May 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lago:2008:WLC

[1588] Ugo Dal Lago and Simone Martini. Theweak lambda calculus as a reasonablemachine. Theoretical Computer Sci-ence, 398(1–3):32–50, May 28, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Paolini:2008:PE

[1589] Luca Paolini. Parametric λ-theories.Theoretical Computer Science, 398(1–3):51–62, May 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Boudol:2008:SNT

[1590] Gerard Boudol. On strong normaliza-tion and type inference in the intersec-tion type discipline. Theoretical Com-puter Science, 398(1–3):63–81, May 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

vanBakel:2008:HIT

[1591] Steffen van Bakel. The heart of in-tersection type assignment: Normalisa-

tion proofs revisited. Theoretical Com-puter Science, 398(1–3):82–94, May 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bono:2008:TLC

[1592] Viviana Bono, Betti Venneri, andLorenzo Bettini. A typed lambda cal-culus with intersection types. The-oretical Computer Science, 398(1–3):95–113, May 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dougherty:2008:CSN

[1593] Daniel J. Dougherty, Silvia Ghilezan,and Pierre Lescanne. Characterizingstrong normalization in the Curien–Herbelin symmetric lambda calculus:Extending the Coppo–Dezani heritage.Theoretical Computer Science, 398(1–3):114–128, May 28, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Alessi:2008:IFM

[1594] Fabio Alessi. An irregular filter model.Theoretical Computer Science, 398(1–3):129–149, May 28, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

DiGianantonio:2008:TAS

[1595] Pietro Di Gianantonio, Furio Honsell,and Marina Lenisa. A type assign-ment system for game semantics. The-oretical Computer Science, 398(1–3):150–169, May 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 202

Hoyrup:2008:CMC

[1596] Mathieu Hoyrup, Arda Kolcak, andGiuseppe Longo. Computability andthe morphological complexity of somedynamics on continuous domains. The-oretical Computer Science, 398(1–3):170–182, May 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Margaria:2008:ACM

[1597] Ines Margaria and Maddalena Zacchi.Access control in mobile ambient cal-culi: A comparative view. Theoret-ical Computer Science, 398(1–3):183–202, May 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Compagnoni:2008:RBA

[1598] Adriana Compagnoni, Elsa L. Gunter,and Philippe Bidinger. Role-based ac-cess control for boxed ambients. The-oretical Computer Science, 398(1–3):203–216, May 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Castagna:2008:SSP

[1599] Giuseppe Castagna, Rocco De Nicola,and Daniele Varacca. Semantic sub-typing for the pi-calculus. Theoret-ical Computer Science, 398(1–3):217–242, May 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Liquori:2008:EFJ

[1600] Luigi Liquori and Arnaud Spiwack.Extending FeatherTrait Java with In-terfaces. Theoretical Computer Sci-ence, 398(1–3):243–260, May 28, 2008.


Anonymous:2008:EBf


Flocchini:2008:P

[1602] Paola Flocchini and Leszek A. Gasie-niec. Preface. Theoretical ComputerScience, 399(1–2):1–2, June 3, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bar-Noy:2008:ODM

[1603] Amotz Bar-Noy, Richard E. Ladner,and Tami Tamir. Optimal delay formedia-on-demand with pre-loading andpre-buffering. Theoretical ComputerScience, 399(1–2):3–11, June 3, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Blin:2008:DCN

[1604] Lelia Blin, Pierre Fraigniaud, NicolasNisse, and Sandrine Vial. Distributedchasing of network intruders. The-oretical Computer Science, 399(1–2):12–37, June 3, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Calamoneri:2008:MEB

[1605] Tiziana Calamoneri, Andrea E. F.Clementi, Miriam Di Ianni, MassimoLauria, Angelo Monti, and RiccardoSilvestri. Minimum-Energy Broadcastand disk cover in grid wireless net-works. Theoretical Computer Science,399(1–2):38–53, June 3, 2008. CODEN

REFERENCES 203


Chalopin:2008:ERI

[1606] Jeremie Chalopin. Election and ren-dezvous with incomparable labels. The-oretical Computer Science, 399(1–2):54–70, June 3, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cohen:2008:LSA

[1607] Reuven Cohen and David Peleg. Localspreading algorithms for autonomousrobot systems. Theoretical ComputerScience, 399(1–2):71–82, June 3, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Derbel:2008:FDD

[1608] Bilel Derbel and Cyril Gavoille. Fastdeterministic distributed algorithmsfor sparse spanners. Theoretical Com-puter Science, 399(1–2):83–100, June 3,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dobrev:2008:FDF

[1609] Stefan Dobrev, Rastislav Kralovic,Richard Kralovic, and Nicola San-toro. On fractional dynamic faults withthresholds. Theoretical Computer Sci-ence, 399(1–2):101–117, June 3, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Goddard:2008:DKS

[1610] Wayne Goddard, Stephen T. Hedet-niemi, David P. Jacobs, and VilmarTrevisan. Distance-k knowledge inself-stabilizing algorithms. Theoreti-cal Computer Science, 399(1–2):118–127, June 3, 2008. CODEN TC-


Kosowski:2008:MED

[1611] Adrian Kosowski. The maximum edge-disjoint paths problem in completegraphs. Theoretical Computer Sci-ence, 399(1–2):128–140, June 3, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Kowalski:2008:HMA

[1612] Dariusz R. Kowalski and Adam Mali-nowski. How to meet in anonymousnetwork. Theoretical Computer Sci-ence, 399(1–2):141–156, June 3, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Anonymous:2008:Pc

[1613] Anonymous. Preface. Theoretical Com-puter Science, 399(1–2):v–ix, June 3,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fomin:2008:FSI

[1614] Fedor V. Fomin, Pierre Fraigniaud, andDimitrios M. Thilikos. Forewords: Spe-cial issue on graph searching. Theoreti-cal Computer Science, 399(3):157, June6, 2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Alspach:2008:TCG

[1615] Brian Alspach, Danny Dyer, DenisHanson, and Boting Yang. Timeconstrained graph searching. Theo-retical Computer Science, 399(3):158–168, June 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 204

Mazoit:2008:MND

[1616] Frederic Mazoit and Nicolas Nisse.Monotonicity of non-deterministicgraph searching. Theoretical ComputerScience, 399(3):169–178, June 6, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Isler:2008:RIC

[1617] Volkan Isler and Nikhil Karnad. Therole of information in the cop-robbergame. Theoretical Computer Science,399(3):179–190, June 6, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Messinger:2008:CNB

[1618] M. E. Messinger, R. J. Nowakowski,and P. Pra lat. Cleaning a networkwith brushes. Theoretical ComputerScience, 399(3):191–205, June 6, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Hunter:2008:DMK

[1619] Paul Hunter and Stephan Kreutzer.Digraph measures: Kelly decomposi-tions, games, and orderings. Theo-retical Computer Science, 399(3):206–219, June 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dumitrescu:2008:OVL

[1620] Adrian Dumitrescu, Ichiro Suzuki, andPawe l Zylinski. Offline variants ofthe “lion and man” problem: —Someproblems and techniques for measur-ing crowdedness and for safe pathplanning—. Theoretical Computer Sci-ence, 399(3):220–235, June 6, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Fomin:2008:ABG

[1621] Fedor V. Fomin and Dimitrios M. Thi-likos. An annotated bibliography onguaranteed graph searching. Theo-retical Computer Science, 399(3):236–245, June 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Sablik:2008:DDC

[1622] Mathieu Sablik. Directional dynam-ics for cellular automata: A sensitiv-ity to initial condition approach. The-oretical Computer Science, 400(1–3):1–18, June 9, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Blumensath:2008:SGC

[1623] Achim Blumensath. On the structureof graphs in the Caucal hierarchy. The-oretical Computer Science, 400(1–3):19–45, June 9, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). See erratum [2399].

Moser:2008:MFD

[1624] Philippe Moser. Martingale familiesand dimension in P. Theoretical Com-puter Science, 400(1–3):46–61, June 9,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Moshe:2008:SQR

[1625] Yossi Moshe. On some questions re-garding k-regular and k-context-free se-quences. Theoretical Computer Sci-ence, 400(1–3):62–69, June 9, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 205

Pina:2008:RWM

[1626] Claribet Pina and Carlos Uzcategui.Reconstruction of a word from a mul-tiset of its factors. Theoretical Com-puter Science, 400(1–3):70–83, June 9,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cheng:2008:UAF

[1627] Christine Cheng, Eric McDermid, andIchiro Suzuki. A unified approachto finding good stable matchings inthe hospitals/residents setting. The-oretical Computer Science, 400(1–3):84–99, June 9, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kirillovs:2008:PCC

[1628] Jurijs Kirillovs. Polyomino color-ing and complex numbers. Theoret-ical Computer Science, 400(1–3):100–112, June 9, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ambroz:2008:MIP

[1629] P. Ambroz, Z. Masakova, and E. Pelan-tova. Matrices of 3-iet preserving mor-phisms. Theoretical Computer Sci-ence, 400(1–3):113–136, June 9, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Jing:2008:HAT

[1630] Caixia Jing, Guochun Tang, andXingsan Qian. Heuristic algorithmsfor two machine re-entrant flow shop.Theoretical Computer Science, 400(1–3):137–143, June 9, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Berstel:2008:EBD

[1631] Jean Berstel and Christophe Reutenauer.Extension of Brzozowski’s derivationcalculus of rational expressions to se-ries over the free partially commutativemonoids. Theoretical Computer Sci-ence, 400(1–3):144–158, June 9, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Parekh:2008:AAP

[1632] Ojas Parekh. Approximation al-gorithms for partially covering withedges. Theoretical Computer Sci-ence, 400(1–3):159–168, June 9, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Krieger:2008:SIW

[1633] Dalia Krieger. On stabilizers of infi-nite words. Theoretical Computer Sci-ence, 400(1–3):169–181, June 9, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Rhodes:2008:TMB

[1634] John Rhodes and Pedro V. Silva. Tur-ing machines and bimachines. The-oretical Computer Science, 400(1–3):182–224, June 9, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ceccherini-Silberstein:2008:GCH

[1635] Tullio Ceccherini-Silberstein and MichelCoornaert. A generalization of theCurtis–Hedlund theorem. Theoreti-cal Computer Science, 400(1–3):225–229, June 9, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 206

Shao:2008:IUB

[1636] Zhendong Shao and David Zhang. Im-proved upper bounds on the L(2, 1)-labeling of the skew and converse skewproduct graphs. Theoretical Com-puter Science, 400(1–3):230–233, June9, 2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2008:EBg


Karagiorgos:2008:CDM

[1638] Gregory Karagiorgos and Nikolaos M.Missirlis. Convergence of the diffusionmethod for weighted torus graphs us-ing Fourier analysis. Theoretical Com-puter Science, 401(1–3):1–16, July 23,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Michel:2008:RBT

[1639] Christian J. Michel, Giuseppe Pirillo,and Mario A. Pirillo. A relation be-tween trinucleotide comma-free codesand trinucleotide circular codes. The-oretical Computer Science, 401(1–3):17–26, July 23, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hemaspaandra:2008:EDA

[1640] Lane A. Hemaspaandra, Jorg Rothe,and Amitabh Saxena. Enforcing anddefying associativity, commutativity,totality, and strong noninvertibility forworst-case one-way functions. The-oretical Computer Science, 401(1–3):

27–35, July 23, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cohen:2008:GSH

[1641] David A. Cohen, Martin C. Cooper,and Peter G. Jeavons. Generalis-ing submodularity and horn clauses:Tractable optimization problems de-fined by tournament pair multimor-phisms. Theoretical Computer Sci-ence, 401(1–3):36–51, July 23, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Chen:2008:ODC

[1642] Zhi-Zhong Chen, Ze Feng, MinmingLi, and Frances Yao. Optimizing dele-tion cost for secure multicast key man-agement. Theoretical Computer Sci-ence, 401(1–3):52–61, July 23, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Marx:2008:CUL

[1643] Daniel Marx. Complexity of uniquelist colorability. Theoretical ComputerScience, 401(1–3):62–76, July 23, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ting:2008:NOS

[1644] Hing-Fung Ting. A near optimal sched-uler for on-demand data broadcasts.Theoretical Computer Science, 401(1–3):77–84, July 23, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Huo:2008:OSE

[1645] Yumei Huo, Joseph Y.-T. Leung, andXin Wang. Online scheduling of equal-processing-time task systems. The-

REFERENCES 207

oretical Computer Science, 401(1–3):85–95, July 23, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Brenner:2008:GSC

[1646] Janina Brenner and Guido Schafer.Group-strategyproof cost sharingmechanisms for makespan and otherscheduling problems. Theoretical Com-puter Science, 401(1–3):96–106, July23, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Giroudeau:2008:CAP

[1647] Rodolphe Giroudeau, Jean-ClaudeKonig, Farida Kamila Moulai, andJerome Palaysi. Complexity and ap-proximation for precedence constrainedscheduling problems with large commu-nication delays. Theoretical ComputerScience, 401(1–3):107–119, July 23,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Laber:2008:RCA

[1648] Eduardo Sany Laber. A random-ized competitive algorithm for evalu-ating priced AND/OR trees. Theoret-ical Computer Science, 401(1–3):120–130, July 23, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chepoi:2008:AAF

[1649] Victor Chepoi, Bertrand Estellon, andYann Vaxes. Approximation algo-rithms for forests augmentation en-suring two disjoint paths of boundedlength. Theoretical Computer Sci-ence, 401(1–3):131–143, July 23, 2008.


Bonifaci:2008:CUN

[1650] Vincenzo Bonifaci, Ugo Di Iorio, andLuigi Laura. The complexity of uni-form Nash equilibria and related reg-ular subgraph problems. Theoreti-cal Computer Science, 401(1–3):144–152, July 23, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kanj:2008:STT

[1651] Iyad A. Kanj, Luay Nakhleh, CuongThan, and Ge Xia. Seeing the trees andtheir branches in the network is hard.Theoretical Computer Science, 401(1–3):153–164, July 23, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Puglisi:2008:HMR

[1652] Simon J. Puglisi, Jamie Simpson, andW. F. Smyth. How many runs can astring contain? Theoretical ComputerScience, 401(1–3):165–171, July 23,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bachmat:2008:AST

[1653] Eitan Bachmat, Tao Kai Lam, andAvner Magen. Analysis of set-up timemodels: A metric perspective. The-oretical Computer Science, 401(1–3):172–180, July 23, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Tsai:2008:EMM

[1654] Chang-Hsiung Tsai. Embedding ofmeshes in Mobius cubes. Theoreti-cal Computer Science, 401(1–3):181–

REFERENCES 208

190, July 23, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hernich:2008:RCR

[1655] Andre Hernich and Nicole Schweikardt.Reversal complexity revisited. The-oretical Computer Science, 401(1–3):191–205, July 23, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Costa:2008:BIV

[1656] Jose Carlos Costa and ConceicaoNogueira. On bases of identities for theω-variety generated by locally testablesemigroups. Theoretical Computer Sci-ence, 401(1–3):206–216, July 23, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Kauers:2008:SDE

[1657] Manuel Kauers. Solving differenceequations whose coefficients are nottranscendental. Theoretical ComputerScience, 401(1–3):217–227, July 23,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chang:2008:CTF

[1658] Ching-Lueh Chang, Yuh-Dauh Lyuu,and Yen-Wu Ti. The complexity ofTarski’s fixed point theorem. The-oretical Computer Science, 401(1–3):228–235, July 23, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ilcinkas:2008:SPN

[1659] David Ilcinkas. Setting port numbersfor fast graph exploration. Theoret-ical Computer Science, 401(1–3):236–242, July 23, 2008. CODEN TC-


Kuske:2008:STF

[1660] Dietrich Kuske. Schutzenberger’s the-orem on formal power series followsfrom Kleene’s theorem. Theoreti-cal Computer Science, 401(1–3):243–248, July 23, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2008:EBh

[1661] Anonymous. Editorial board. The-oretical Computer Science, 401(1–3):v–ix, July 23, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Nikoletseas:2008:P

[1662] Sotiris Nikoletseas and Jose Rolim.Preface. Theoretical Computer Science,402(1):1, July 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bertossi:2008:ECT

[1663] Alan A. Bertossi, Stephan Olariu, andCristina M. Pinotti. Efficient coronatraining protocols for sensor networks.Theoretical Computer Science, 402(1):2–15, July 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cichon:2008:AIA

[1664] J. Cichon, M. Kuty lowski, and M. Za-wada. Adaptive initialization algo-rithm for ad hoc radio networks withcarrier sensing. Theoretical ComputerScience, 402(1):16–28, July 28, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 209

Halldorsson:2008:MIW

[1665] Magnus M. Halldorsson and TakeshiTokuyama. Minimizing interference ofa wireless ad-hoc network in a plane.Theoretical Computer Science, 402(1):29–42, July 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bilo:2008:CMI

[1666] Davide Bilo and Guido Proietti. Onthe complexity of minimizing interfer-ence in ad-hoc and sensor networks.Theoretical Computer Science, 402(1):43–55, July 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Nikoletseas:2008:ESN

[1667] Sotiris Nikoletseas and Paul Spirakis.Efficient sensor network design for con-tinuous monitoring of moving objects.Theoretical Computer Science, 402(1):56–66, July 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Flocchini:2008:SDM

[1668] Paola Flocchini, Giuseppe Prencipe,and Nicola Santoro. Self-deploymentof mobile sensors on a ring. Theo-retical Computer Science, 402(1):67–80, July 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2008:Pd

[1669] Anonymous. Preface. Theoretical Com-puter Science, 402(1):v–ix, July 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Montanari:2008:P

[1670] Ugo Montanari and Donald Sannella.Preface. Theoretical Computer Science,402(2–3):81, August 8, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Askarov:2008:CMF

[1671] Aslan Askarov, Daniel Hedin, andAndrei Sabelfeld. Cryptographically-masked flows. Theoretical ComputerScience, 402(2–3):82–101, August 8,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bruni:2008:PSM

[1672] Roberto Bruni and Ivan Lanese. Para-metric synchronizations in mobile nom-inal calculi. Theoretical ComputerScience, 402(2–3):102–119, August 8,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Caires:2008:SBT

[1673] Luıs Caires. Spatial-behavioral typesfor concurrency and resource controlin distributed systems. Theoreti-cal Computer Science, 402(2–3):120–141, August 8, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Caragiannis:2008:SMP

[1674] Ioannis Caragiannis, Christos Kakla-manis, Panagiotis Kanellopoulos, andEvi Papaioannou. Scheduling to max-imize participation. Theoretical Com-puter Science, 402(2–3):142–155, Au-gust 8, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

REFERENCES 210

Dezani-Ciancaglini:2008:STD

[1675] Mariangiola Dezani-Ciancaglini, Sil-via Ghilezan, Jovanka Pantovic, andDaniele Varacca. Security types for dy-namic web data. Theoretical ComputerScience, 402(2–3):156–171, August 8,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hahnle:2008:IST

[1676] Reiner Hahnle, Jing Pan, PhilippRummer, and Dennis Walter. Integra-tion of a security type system into aprogram logic. Theoretical ComputerScience, 402(2–3):172–189, August 8,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hanusse:2008:MSA

[1677] Nicolas Hanusse, Dimitris Kavvadias,Evangelos Kranakis, and Danny Kri-zanc. Memoryless search algorithms ina network with faulty advice. Theoret-ical Computer Science, 402(2–3):190–198, August 8, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Pous:2008:UBP

[1678] Damien Pous. Using bisimulationproof techniques for the analysis of dis-tributed abstract machines. Theoret-ical Computer Science, 402(2–3):199–220, August 8, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Silvestri:2008:LCO

[1679] Francesco Silvestri. On the limits ofcache-oblivious rational permutations.Theoretical Computer Science, 402(2–3):221–233, August 8, 2008. CODEN


Wehrman:2008:TSO

[1680] Ian Wehrman, David Kitchin, William R.Cook, and Jayadev Misra. A timed se-mantics of Orc. Theoretical ComputerScience, 402(2–3):234–248, August 8,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Rozenberg:2008:Pb

[1681] G. Rozenberg. Preface. TheoreticalComputer Science, 403(1):1–2, August20, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Yang:2008:GDN

[1682] Zhiguo Yang and Daoyi Xu. Global dy-namics for non-autonomous reaction-diffusion neural networks with time-varying delays. Theoretical ComputerScience, 403(1):3–10, August 20, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Timmis:2008:TAA

[1683] J. Timmis, A. Hone, T. Stibor, andE. Clark. Theoretical advances inartificial immune systems. Theo-retical Computer Science, 403(1):11–32, August 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Borisovsky:2008:CEA

[1684] P. A. Borisovsky and A. V. Ere-meev. Comparing evolutionary algo-rithms to the (1 + 1)-EA. Theo-retical Computer Science, 403(1):33–41, August 20, 2008. CODEN TC-

REFERENCES 211


Li:2008:DEO

[1685] Lvzhou Li and Daowen Qiu. De-termining the equivalence for one-way quantum finite automata. The-oretical Computer Science, 403(1):42–51, August 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fages:2008:AIT

[1686] Francois Fages and Sylvain Soliman.Abstract interpretation and types forsystems biology. Theoretical Com-puter Science, 403(1):52–70, August20, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Toffoli:2008:WHC

[1687] Tommaso Toffoli, Silvio Capobianco,and Patrizia Mentrasti. When–andhow–can a cellular automaton berewritten as a lattice gas? Theo-retical Computer Science, 403(1):71–88, August 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Rao:2008:IA

[1688] M. V. Panduranga Rao. Interferenceautomata. Theoretical Computer Sci-ence, 403(1):89–103, August 20, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Witt:2008:PSV

[1689] Carsten Witt. Population size versusruntime of a simple evolutionary al-gorithm. Theoretical Computer Sci-ence, 403(1):104–120, August 20, 2008.


Fouche:2008:UPQ

[1690] Willem Fouche, Johannes Heidema,Glyn Jones, and Petrus H. Potgi-eter. Universality and programma-bility of quantum computers. Theo-retical Computer Science, 403(1):121–129, August 20, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Khan:2008:ESM

[1691] Faisal Shah Khan and Marek Perkowski.Erratum to: “Synthesis of multi-qudithybrid and d-valued quantum logiccircuits by decomposition” [Theoret.Comput. Sci. 367 (3) (2006) 336–346].Theoretical Computer Science, 403(1):130–131, August 20, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic). See [913].

Anonymous:2008:Pe

[1692] Anonymous. Preface. Theoretical Com-puter Science, 403(1):v–ix, August 20,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dufourd:2008:PGT

[1693] Jean-Francois Dufourd. Polyhedragenus theorem and Euler formula:A hypermap-formalized intuitionisticproof. Theoretical Computer Science,403(2–3):133–159, August 28, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Baaz:2008:CAF

[1694] Matthias Baaz, Stefan Hetzl, Alexan-der Leitsch, Clemens Richter, and Hen-drik Spohr. CERES: An analysis of

REFERENCES 212

Furstenberg’s proof of the infinity ofprimes. Theoretical Computer Science,403(2–3):160–175, August 28, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ipate:2008:TDP

[1695] Florentin Ipate and Mike Holcombe.Testing data processing-oriented sys-tems from stream X-machine models.Theoretical Computer Science, 403(2–3):176–191, August 28, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Li:2008:SCA

[1696] Sanjiang Li and Mingsheng Ying. Softconstraint abstraction based on semir-ing homomorphism. Theoretical Com-puter Science, 403(2–3):192–201, Au-gust 28, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Berard:2008:WTA

[1697] B. Berard, F. Cassez, S. Haddad,D. Lime, and O. H. Roux. When areTimed Automata weakly timed bisim-ilar to Time Petri Nets? Theoret-ical Computer Science, 403(2–3):202–220, August 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Stuber:2008:WMD

[1698] Torsten Stuber and Heiko Vogler.Weighted monadic datalog. Theoret-ical Computer Science, 403(2–3):221–238, August 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Meseguer:2008:EA

[1699] Jose Meseguer, Miguel Palomino, andNarciso Martı-Oliet. Equational ab-stractions. Theoretical Computer Sci-ence, 403(2–3):239–264, August 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Olteanu:2008:WSD

[1700] Dan Olteanu, Christoph Koch, andLyublena Antova. World-set decompo-sitions: Expressiveness and efficient al-gorithms. Theoretical Computer Sci-ence, 403(2–3):265–284, August 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Calves:2008:PNU

[1701] Christophe Calves and Maribel Fernandez.A polynomial nominal unification algo-rithm. Theoretical Computer Science,403(2–3):285–306, August 28, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Payet:2008:LDT

[1702] Etienne Payet. Loop detection in termrewriting using the eliminating unfold-ings. Theoretical Computer Science,403(2–3):307–327, August 28, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ciabattoni:2008:DE

[1703] Agata Ciabattoni and George Met-calfe. Density elimination. Theoret-ical Computer Science, 403(2–3):328–346, August 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 213

Ehrhard:2008:UTE

[1704] Thomas Ehrhard and Laurent Regnier.Uniformity and the Taylor expansionof ordinary lambda-terms. Theoret-ical Computer Science, 403(2–3):347–372, August 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Rabinovich:2008:AHT

[1705] Alexander Rabinovich. Arity hierar-chy for temporal logics. Theoreti-cal Computer Science, 403(2–3):373–381, August 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bozzelli:2008:VWF

[1706] Laura Bozzelli, Salvatore La Torre,and Adriano Peron. Verification ofwell-formed communicating recursivestate machines. Theoretical ComputerScience, 403(2–3):382–405, August 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Plummer:2008:SEM

[1707] Andrew R. Plummer. S4 enrichedmultimodal categorial grammars arecontext-free: Corrigendum. Theoret-ical Computer Science, 403(2–3):406–408, August 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Milius:2008:CCT

[1708] Stefan Milius and Lawrence S. Moss.Corrigendum to: “The category the-oretic solution of recursive programschemes” [Theoret. Comput. Sci. 366(2006) 3–59]. Theoretical ComputerScience, 403(2–3):409–415, August 28,

2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).See [880].

Rozenberg:2008:Pc

[1709] G. Rozenberg. Preface. Theoret-ical Computer Science, 404(1–2):1–2,September 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Busi:2008:F

[1710] Nadia Busi and Claudio Zandron. Fore-word. Theoretical Computer Sci-ence, 404(1–2):3–4, September 6, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Cardelli:2008:BMS

[1711] Luca Cardelli. Bitonal membrane sys-tems: Interactions of biological mem-branes. Theoretical Computer Science,404(1–2):5–18, September 6, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Paun:2008:MCB

[1712] Gheorghe Paun. Membrane comput-ing and brane calculi. Old, new, andfuture bridges. Theoretical ComputerScience, 404(1–2):19–25, September 6,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Brijder:2008:MSP

[1713] Robert Brijder, Matteo Cavaliere,Agustın Riscos-Nunez, Grzegorz Rozen-berg, and Dragos Sburlan. Mem-brane systems with proteins embeddedin membranes. Theoretical ComputerScience, 404(1–2):26–39, September 6,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 214

Cavaliere:2008:DPM

[1714] Matteo Cavaliere and Sean Sedwards.Decision problems in membrane sys-tems with peripheral proteins, trans-port and evolution. Theoretical Com-puter Science, 404(1–2):40–51, Septem-ber 6, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Csuhaj-Varju:2008:MBA

[1715] Erzsebet Csuhaj-Varju and GyorgyVaszil. (mem)brane automata. Theo-retical Computer Science, 404(1–2):52–60, September 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Curien:2008:CSA

[1716] Pierre-Louis Curien, Vincent Danos,Jean Krivine, and Min Zhang. Com-putational self-assembly. Theoreti-cal Computer Science, 404(1–2):61–75,September 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Diaz-Pernil:2008:UFT

[1717] Daniel Dıaz-Pernil, Miguel A. Gutierrez-Naranjo, Mario J. Perez-Jimenez, andAgustın Riscos-Nunez. A uniform fam-ily of tissue P systems with cell divisionsolving 3-COL in a linear time. Theo-retical Computer Science, 404(1–2):76–87, September 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Franco:2008:DCI

[1718] Giuditta Franco and Maurice Mar-genstern. A DNA computing in-spired computational model. Theo-

retical Computer Science, 404(1–2):88–96, September 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Geisweiller:2008:RCD

[1719] Nil Geisweiller, Jane Hillston, andMarco Stenico. Relating continuousand discrete PEPA models of signallingpathways. Theoretical Computer Sci-ence, 404(1–2):97–111, September 6,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kleijn:2008:PMS

[1720] Jetty Kleijn and Maciej Koutny. Pro-cesses of membrane systems with pro-moters and inhibitors. TheoreticalComputer Science, 404(1–2):112–126,September 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Laneve:2008:SCP

[1721] Cosimo Laneve and Fabien Tarissan.A simple calculus for proteins andcells. Theoretical Computer Science,404(1–2):127–141, September 6, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Manca:2008:MAP

[1722] Vincenzo Manca. The metabolic algo-rithm for P systems: Principles and ap-plications. Theoretical Computer Sci-ence, 404(1–2):142–155, September 6,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Romanel:2008:DCS

[1723] A. Romanel and C. Priami. On the de-cidability and complexity of the struc-tural congruence for beta-binders. The-

REFERENCES 215

oretical Computer Science, 404(1–2):156–169, September 6, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Verlan:2008:GCP

[1724] Sergey Verlan, Francesco Bernardini,Marian Gheorghe, and Maurice Mar-genstern. Generalized communicatingP systems. Theoretical Computer Sci-ence, 404(1–2):170–184, September 6,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2008:Pf

[1725] Anonymous. Preface. Theoretical Com-puter Science, 404(1–2):v–ix, Septem-ber 6, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Margaria:2008:P

[1726] Tiziana Margaria and Bernhard Stef-fen. Preface. Theoretical Computer Sci-ence, 404(3):185, September 28, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Hussain:2008:MCM

[1727] Altaf Hussain and Michael Huth. Onmodel checking multiple hybrid views.Theoretical Computer Science, 404(3):186–201, September 28, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Ben-David:2008:EFA

[1728] Shoham Ben-David, Dana Fisman,and Sitvanit Ruah. Embedding fi-nite automata within regular expres-sions. Theoretical Computer Science,404(3):202–218, September 28, 2008.


Copty:2008:PAR

[1729] Shady Copty, Shai Fine, Shmuel Ur,Elad Yom-Tov, and Avi Ziv. A proba-bilistic alternative to regression suites.Theoretical Computer Science, 404(3):219–234, September 28, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Calder:2008:AAT

[1730] M. Calder and A. Miller. An automaticabstraction technique for verifying fea-tured, parameterised systems. Theo-retical Computer Science, 404(3):235–255, September 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ivancic:2008:ESB

[1731] Franjo Ivancic, Zijiang Yang, Malay K.Ganai, Aarti Gupta, and PranavAshar. Efficient SAT-based boundedmodel checking for software verifica-tion. Theoretical Computer Science,404(3):256–274, September 28, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bensalem:2008:AGP

[1732] Saddek Bensalem, Doron Peled,Hongyang Qu, and Stavros Tripakis.Automatic generation of path condi-tions for concurrent timed systems.Theoretical Computer Science, 404(3):275–292, September 28, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 216

Schonherr:2008:SFV

[1733] Jens Schonherr, Martin Freibothe,Bernd Straube, and Jorg Bormann.Semi-formal verification of the steadystate behavior of mixed-signal circuitsby SAT-based property checking. The-oretical Computer Science, 404(3):293–307, September 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kopperman:2008:F

[1734] Ralph Kopperman, Prakash Panan-gaden, Michael B. Smyth, and DieterSpreen. Foreword. Theoretical Com-puter Science, 405(1–2):1–2, October 6,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bridges:2008:ACN

[1735] Douglas Bridges, Hajime Ishihara, Pe-ter M. Schuster, and Luminita Vıta.Apartness, compactness and nearness.Theoretical Computer Science, 405(1–2):3–10, October 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ciraulo:2008:FFT

[1736] Francesco Ciraulo and Giovanni Sam-bin. Finitary formal topologies andStone’s representation theorem. Theo-retical Computer Science, 405(1–2):11–23, October 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hardie:2008:FRS

[1737] K. A. Hardie and P. J. Witbooi. Finiterelational structure models of topologi-cal spaces and maps. Theoretical Com-puter Science, 405(1–2):24–34, October


Huang:2008:CET

[1738] Fangping Huang and Jihua Liang. Oncomputational environments of topo-logical spaces. Theoretical ComputerScience, 405(1–2):35–40, October 6,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jordan:2008:MTT

[1739] K. E. Jordan, Lance E. Miller, E. L. F.Moore, T. J. Peters, and AlexanderRussell. Modeling time and topol-ogy for animation and visualizationwith examples on parametric geometry.Theoretical Computer Science, 405(1–2):41–49, October 6, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Kreinovich:2008:CCD

[1740] Vladik Kreinovich and Olga Koshel-eva. Computational complexity ofdetermining which statements aboutcausality hold in different space–timemodels. Theoretical Computer Sci-ence, 405(1–2):50–63, October 6, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Kunzi:2008:SST

[1741] Hans-Peter A. Kunzi and VladikKreinovich. Static space–times natu-rally lead to quasi-pseudometrics. The-oretical Computer Science, 405(1–2):64–72, October 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 217

Lawson:2008:MSD

[1742] Jimmie D. Lawson. Metric spacesand FS-domains. Theoretical Com-puter Science, 405(1–2):73–74, October6, 2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Martin:2008:TIT

[1743] Keye Martin. Topology in informationtheory in topology. Theoretical Com-puter Science, 405(1–2):75–87, October6, 2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Porter:2008:ECM

[1744] Timothy Porter. Enriched categoriesand models for spaces of evolvingstates. Theoretical Computer Science,405(1–2):88–100, October 6, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Schuster:2008:ZSF

[1745] Peter Schuster. The Zariski spec-trum as a formal geometry. Theoret-ical Computer Science, 405(1–2):101–115, October 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Selivanov:2008:FHR

[1746] Victor L. Selivanov. Fine hierarchiesand m-reducibilities in theoretical com-puter science. Theoretical ComputerScience, 405(1–2):116–163, October 6,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Slapal:2008:QUD

[1747] Josef Slapal. A quotient-universal dig-ital topology. Theoretical ComputerScience, 405(1–2):164–175, October 6,


Spreen:2008:ISR

[1748] Dieter Spreen, Luoshan Xu, and XuxinMao. Information systems revisited —the general continuous case. Theoret-ical Computer Science, 405(1–2):176–187, October 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Surya:2008:CST

[1749] Sumati Surya. Causal set topology.Theoretical Computer Science, 405(1–2):188–197, October 6, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Tsuiki:2008:LTS

[1750] Hideki Tsuiki and Yasunao Hattori.Lawson topology of the space of for-mal balls and the hyperbolic topology.Theoretical Computer Science, 405(1–2):198–205, October 6, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Anonymous:2008:F

[1751] Anonymous. Foreword. Theoret-ical Computer Science, 405(1–2):v–ix, October 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Long:2008:P

[1752] Philip M. Long and Frank Stephan.Preface. Theoretical Computer Science,405(3):207–208, October 17, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 218

Atici:2008:LUD

[1753] Alp Atıcı and Rocco A. Servedio.Learning unions of ω(1)-dimensionalrectangles. Theoretical Computer Sci-ence, 405(3):209–222, October 17,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kontorovich:2008:KML

[1754] Leonid (Aryeh) Kontorovich, CorinnaCortes, and Mehryar Mohri. Kernelmethods for learning languages. The-oretical Computer Science, 405(3):223–236, October 17, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Maurer:2008:USS

[1755] Andreas Maurer. Unsupervised slowsubspace-learning from stationary pro-cesses. Theoretical Computer Science,405(3):237–255, October 17, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Poland:2008:CDB

[1756] Jan Poland. Consistency of discreteBayesian learning. Theoretical Com-puter Science, 405(3):256–273, October17, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Ryabko:2008:PLR

[1757] Daniil Ryabko and Marcus Hutter. Onthe possibility of learning in reactiveenvironments with arbitrary depen-dence. Theoretical Computer Science,405(3):274–284, October 17, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Vovk:2008:LSC

[1758] Vladimir Vovk. Leading strategies incompetitive on-line prediction. Theo-retical Computer Science, 405(3):285–296, October 17, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Batenburg:2008:P

[1759] Kees Joost Batenburg, Antal Nagy,and Maurice Nivat. Preface. The-oretical Computer Science, 406(1–2):1, October 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Batenburg:2008:MAK

[1760] Kees Joost Batenburg, Antal Nagy,and Maurice Nivat. In memoriam:Attila Kuba (1953–2006). Theoret-ical Computer Science, 406(1–2):2–7,October 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Andres:2008:SFD

[1761] Eric Andres. The supercover of an m-flat is a discrete analytical object. The-oretical Computer Science, 406(1–2):8–14, October 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Balazs:2008:FGS

[1762] Peter Balazs. A framework for gen-erating some discrete sets with dis-joint components by using uniformdistributions. Theoretical ComputerScience, 406(1–2):15–23, October 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 219

Brimkov:2008:PCI

[1763] Valentin E. Brimkov and Reneta P.Barneva. On the polyhedral complex-ity of the integer points in a hyperball.Theoretical Computer Science, 406(1–2):24–30, October 28, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Brlek:2008:DSM

[1764] S. Brlek, G. Labelle, and A. La-casse. Discrete sets with minimal mo-ment of inertia. Theoretical ComputerScience, 406(1–2):31–42, October 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Brocchi:2008:RBM

[1765] S. Brocchi, A. Frosini, and C. Pi-couleau. Reconstruction of binary ma-trices under fixed size neighborhoodconstraints. Theoretical ComputerScience, 406(1–2):43–54, October 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Brunetti:2008:RCL

[1766] Sara Brunetti and Alain Daurat. Re-construction of convex lattice setsfrom tomographic projections in quar-tic time. Theoretical Computer Science,406(1–2):55–62, October 28, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Brunetti:2008:RBP

[1767] S. Brunetti, A. Del Lungo, P. Gritz-mann, and S. de Vries. On the re-construction of binary and permutationmatrices under (binary) tomographicconstraints. Theoretical ComputerScience, 406(1–2):63–71, October 28,


Coeurjolly:2008:FMM

[1768] David Coeurjolly, Jerome Hulin, andIsabelle Sivignon. Finding a mini-mum medial axis of a discrete shapeis NP-hard. Theoretical ComputerScience, 406(1–2):72–79, October 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dulio:2008:CDP

[1769] Paolo Dulio. Convex decompositionof U -polygons. Theoretical ComputerScience, 406(1–2):80–89, October 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Frosini:2008:SIM

[1770] Andrea Frosini, Maurice Nivat, andSimone Rinaldi. Scanning integermatrices by means of two rectangu-lar windows. Theoretical ComputerScience, 406(1–2):90–96, October 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kong:2008:MND

[1771] T. Yung Kong. Minimal non-deletablesets and minimal non-codeletable setsin binary images. Theoretical ComputerScience, 406(1–2):97–118, October 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Palagyi:2008:FPS

[1772] Kalman Palagyi. A 3D fully parallelsurface-thinning algorithm. Theoret-ical Computer Science, 406(1–2):119–135, October 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 220

Santoyo:2008:AOI

[1773] Miguel Santoyo and Ernesto Vallejo.Additivity obstructions for integral ma-trices and pyramids. Theoretical Com-puter Science, 406(1–2):136–145, Octo-ber 28, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Vainsencher:2008:IOP

[1774] Daniel Vainsencher and Alfred M.Bruckstein. On isoperimetrically opti-mal polyforms. Theoretical ComputerScience, 406(1–2):146–159, October 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zdunek:2008:IRA

[1775] Rafal Zdunek. On image reconstructionalgorithms for binary electromagneticgeotomography. Theoretical ComputerScience, 406(1–2):160–170, October 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2008:Pg

[1776] Anonymous. Preface. Theoretical Com-puter Science, 406(1–2):v–ix, October28, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Kaklamanis:2008:P

[1777] Christos Kaklamanis. Preface. Theo-retical Computer Science, 406(3):171–172, October 31, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ambrosio:2008:DMA

[1778] Pasquale Ambrosio and VincenzoAuletta. Deterministic monotone al-

gorithms for scheduling on related ma-chines. Theoretical Computer Science,406(3):173–186, October 31, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Lucking:2008:NMS

[1779] Thomas Lucking, Marios Mavronico-las, Burkhard Monien, and ManuelRode. A new model for selfish routing.Theoretical Computer Science, 406(3):187–206, October 31, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Chlebik:2008:STP

[1780] Miroslav Chlebık and Janka Chlebıkova.The Steiner tree problem on graphs:Inapproximability results. Theoret-ical Computer Science, 406(3):207–214, October 31, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Nikoletseas:2008:LIS

[1781] S. Nikoletseas, C. Raptopoulos, andP. Spirakis. Large independent setsin general random intersection graphs.Theoretical Computer Science, 406(3):215–224, October 31, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Klasing:2008:CBA

[1782] Ralf Klasing, Nelson Morales, andStephane Perennes. On the com-plexity of bandwidth allocation in ra-dio networks. Theoretical ComputerScience, 406(3):225–239, October 31,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 221

Alvarez:2008:HLC

[1783] Carme Alvarez, Josep Dıaz, Jordi Pe-tit, Jose Rolim, and Maria Serna.High level communication functionali-ties for wireless sensor networks. The-oretical Computer Science, 406(3):240–247, October 31, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cooper:2008:RAJ

[1784] Colin Cooper, Ralf Klasing, andTomasz Radzik. A randomized algo-rithm for the joining protocol in dy-namic distributed networks. Theo-retical Computer Science, 406(3):248–262, October 31, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Eckhardt:2008:CNA

[1785] Stefan Eckhardt, Sven Kosub, Moritz G.Maaß, Hanjo Taubig, and SebastianWernicke. Combinatorial network ab-straction by trees and distances. The-oretical Computer Science, 407(1–3):1–20, November 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zhu:2008:ELC

[1786] Junlei Zhu and Yuehua Bu. Equitablelist colorings of planar graphs with-out short cycles. Theoretical ComputerScience, 407(1–3):21–28, November 6,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Margenstern:2008:DPH

[1787] Maurice Margenstern. The dominoproblem of the hyperbolic plane isundecidable. Theoretical Computer

Science, 407(1–3):29–84, November 6,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Epstein:2008:OUC

[1788] Leah Epstein, Asaf Levin, and Rob vanStee. Online unit clustering: Varia-tions on a theme. Theoretical ComputerScience, 407(1–3):85–96, November 6,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fournier:2008:URP

[1789] Herve Fournier and Guillaume Malod.Universal relations and #p-completeness.Theoretical Computer Science, 407(1–3):97–109, November 6, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Ma:2008:FTE

[1790] Meijie Ma, Guizhen Liu, and Jun-MingXu. Fault-tolerant embedding of pathsin crossed cubes. Theoretical ComputerScience, 407(1–3):110–116, November6, 2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gonidec:2008:CFI

[1791] Marion Le Gonidec. On complexityfunctions of infinite words associatedwith generalized Dyck languages. The-oretical Computer Science, 407(1–3):117–133, November 6, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Efthymiou:2008:RSC

[1792] Charilaos Efthymiou and Paul G. Spi-rakis. Random sampling of colour-ings of sparse random graphs with aconstant number of colours. Theoret-ical Computer Science, 407(1–3):134–

REFERENCES 222


Bostan:2008:SSL

[1793] Alin Bostan, Claude-Pierre Jeannerod,and Eric Schost. Solving structuredlinear systems with large displacementrank. Theoretical Computer Science,407(1–3):155–181, November 6, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bu:2008:AOA

[1794] Tian-Ming Bu, Xiaotie Deng, andQi Qi. Arbitrage opportunities acrosssponsored search markets. Theoret-ical Computer Science, 407(1–3):182–191, November 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Garcia:2008:UAN

[1795] Pedro Garcıa, Manuel Vazquez de Parga,Gloria I. Alvarez, and Jose Ruiz.Universal automata and NFA learn-ing. Theoretical Computer Science,407(1–3):192–202, November 6, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Epstein:2008:OIC

[1796] Leah Epstein and Meital Levy. On-line interval coloring with packing con-straints. Theoretical Computer Science,407(1–3):203–212, November 6, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

DeSantis:2008:NCP

[1797] Alfredo De Santis, Anna Lisa Ferrara,and Barbara Masucci. New construc-tions for provably-secure time-bound

hierarchical key assignment schemes.Theoretical Computer Science, 407(1–3):213–230, November 6, 2008. CO-DEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Krumke:2008:B

[1798] Sven O. Krumke, Willem E. de Paepe,Jorg Rambau, and Leen Stougie. Bin-coloring. Theoretical Computer Sci-ence, 407(1–3):231–241, November 6,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Beveridge:2008:GCI

[1799] Andrew Beveridge, Tom Bohman, AlanFrieze, and Oleg Pikhurko. Gamechromatic index of graphs with givenrestrictions on degrees. TheoreticalComputer Science, 407(1–3):242–249,November 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Salomaa:2008:SHA

[1800] Arto Salomaa. Subword historiesand associated matrices. Theoreti-cal Computer Science, 407(1–3):250–257, November 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lee:2008:ARA

[1801] Jonathan K. Lee, Jens Palsberg,and Fernando Magno Quintao Pereira.Aliased register allocation for straight-line programs is NP-complete. Theoret-ical Computer Science, 407(1–3):258–273, November 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 223

Chiarandini:2008:HAH

[1802] M. Chiarandini, I. S. Kotsireas,C. Koukouvinos, and L. Paquete.Heuristic algorithms for Hadamard ma-trices with two circulant cores. Theoret-ical Computer Science, 407(1–3):274–277, November 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Klima:2008:VMA

[1803] Ondrej Klıma and Libor Polak. Onvarieties of meet automata. Theoret-ical Computer Science, 407(1–3):278–289, November 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Prieur:2008:LCC

[1804] Elise Prieur and Thierry Lecroq. On-line construction of compact suffix vec-tors and maximal repeats. Theoret-ical Computer Science, 407(1–3):290–301, November 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Buchsbaum:2008:NRF

[1805] A. L. Buchsbaum, R. Giancarlo, andB. Racz. New results for finding com-mon neighborhoods in massive graphsin the data stream model. Theoret-ical Computer Science, 407(1–3):302–309, November 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chen:2008:DDS

[1806] Jiang Chen and Ke Yi. A dynamic datastructure for top-k queries on uncer-tain data. Theoretical Computer Sci-ence, 407(1–3):310–317, November 6,


Fu:2008:FFH

[1807] Jung-Sheng Fu. Fault-free Hamiltoniancycles in twisted cubes with conditionallink faults. Theoretical Computer Sci-ence, 407(1–3):318–329, November 6,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kozik:2008:FSF

[1808] Marcin Kozik. A finite set of functionswith an EXPTIME-complete composi-tion problem. Theoretical ComputerScience, 407(1–3):330–341, November6, 2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Sanches:2008:PTS

[1809] C. A. A. Sanches, N. Y. Soma, andH. H. Yanasse. Parallel time and spaceupper-bounds for the subset-sum prob-lem. Theoretical Computer Science,407(1–3):342–348, November 6, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Liu:2008:AFW

[1810] Hsiao-Fei Liu and Kun-Mao Chao.Algorithms for finding the weight-constrained k-longest paths in atree and the length-constrained kmaximum-sum segments of a sequence.Theoretical Computer Science, 407(1–3):349–358, November 6, 2008. CO-DEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Maneva:2008:STC

[1811] Elitza Maneva and Alistair Sinclair. Onthe satisfiability threshold and cluster-ing of solutions of random 3-SAT for-

REFERENCES 224

mulas. Theoretical Computer Science,407(1–3):359–369, November 6, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Yang:2008:NFD

[1812] Guomin Yang, Jing Chen, Duncan S.Wong, Xiaotie Deng, and DongshengWang. A new framework for the designand analysis of identity-based identifi-cation schemes. Theoretical ComputerScience, 407(1–3):370–388, November6, 2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chen:2008:DOS

[1813] Rongjun Chen, Wanzhen Huang, andGuochun Tang. Dense open-shopschedules with release times. Theoret-ical Computer Science, 407(1–3):389–399, November 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Benedetto:2008:TPA

[1814] Katherine P. Benedetto and Nicholas A.Loehr. Tiling problems, automata, andtiling graphs. Theoretical ComputerScience, 407(1–3):400–411, November6, 2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Flocchini:2008:APF

[1815] Paola Flocchini, Giuseppe Prencipe,Nicola Santoro, and Peter Widmayer.Arbitrary pattern formation by asyn-chronous, anonymous, oblivious robots.Theoretical Computer Science, 407(1–3):412–447, November 6, 2008. CO-DEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Buning:2008:CCQ

[1816] Hans Kleine Buning and Xishun Zhao.Computational complexity of quanti-fied Boolean formulas with fixed maxi-mal deficiency. Theoretical ComputerScience, 407(1–3):448–457, November6, 2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Latapy:2008:MMT

[1817] Matthieu Latapy. Main-memory tri-angle computations for very large(sparse (power-law)) graphs. Theoret-ical Computer Science, 407(1–3):458–473, November 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Uchizawa:2008:ELB

[1818] Kei Uchizawa and Eiji Takimoto. Ex-ponential lower bounds on the size ofconstant-depth threshold circuits withsmall energy complexity. Theoreti-cal Computer Science, 407(1–3):474–487, November 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Balogh:2008:BDH

[1819] J. Balogh, S. L. Bezrukov, L. H.Harper, and A. Seress. On thebandwidth of 3-dimensional Hamminggraphs. Theoretical Computer Science,407(1–3):488–495, November 6, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Zhao:2008:TSC

[1820] Qianchuan Zhao, Jianfeng Mao, andTao Ye. Time separations of cyclicevent rule systems with min–max tim-ing constraints. Theoretical Computer

REFERENCES 225

Science, 407(1–3):496–510, November6, 2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Huang:2008:LBN

[1821] Scott C.-H. Huang, Frances Yao, Min-ming Li, and Weili Wu. Lower boundsand new constructions on secure groupcommunication schemes. TheoreticalComputer Science, 407(1–3):511–523,November 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Wang:2008:RRP

[1822] Hung-Lung Wang and Kun-Mao Chao.The 2-radius and 2-radiian problemson trees. Theoretical Computer Sci-ence, 407(1–3):524–531, November 6,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Yang:2008:MDS

[1823] Boting Yang and Yi Cao. Monotonicityin digraph search problems. Theoret-ical Computer Science, 407(1–3):532–544, November 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lin:2008:TWD

[1824] Hong-Yiu Lin, Yuh-Dauh Lyuu, Tak-Man Ma, and Yen-Wu Ti. Test-ing whether a digraph contains H-free k-induced subgraphs. Theoreti-cal Computer Science, 407(1–3):545–553, November 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hong:2008:ELR

[1825] Jin-Ju Hong and Gen-Huey Chen. Effi-cient on-line repetition detection. The-

oretical Computer Science, 407(1–3):554–563, November 6, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Cazals:2008:NPR

[1826] F. Cazals and C. Karande. A noteon the problem of reporting maximalcliques. Theoretical Computer Science,407(1–3):564–568, November 6, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

deLuca:2008:RST

[1827] Aldo de Luca, Amy Glen, and Luca Q.Zamboni. Rich, Sturmian, and trape-zoidal words. Theoretical ComputerScience, 407(1–3):569–573, November6, 2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Borowiecki:2008:MCG

[1828] Mieczys law Borowiecki and KatarzynaJesse-Jozefczyk. Matching cutsets ingraphs of diameter 2. TheoreticalComputer Science, 407(1–3):574–582,November 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Du:2008:CDB

[1829] Ye Du. On the complexity of decid-ing bimatrix games similarity. Theoret-ical Computer Science, 407(1–3):583–586, November 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Porat:2008:PMP

[1830] Benny Porat, Ely Porat, and Asaf Zur.Pattern matching with pair correlationdistance. Theoretical Computer Sci-ence, 407(1–3):587–590, November 6,

REFERENCES 226


Horvath:2008:ACF

[1831] Gabor Horvath, Chrystopher L. Ne-haniv, and Csaba Szabo. An assertionconcerning functionally complete alge-bras and NP-completeness. Theoret-ical Computer Science, 407(1–3):591–595, November 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lehtonen:2008:TUV

[1832] Eero Lehtonen. Two undecidable vari-ants of Collatz’s problems. Theoret-ical Computer Science, 407(1–3):596–600, November 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2008:EBi


Rozenberg:2008:Pd

[1834] G. Rozenberg. Preface. TheoreticalComputer Science, 408(1):1–2, Novem-ber 17, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Calder:2008:P

[1835] Muffy Calder and Stephen Gilmore.Preface. Theoretical Computer Sci-ence, 408(1):3, November 17, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Girolami:2008:BID

[1836] Mark Girolami. Bayesian inferencefor differential equations. Theoret-ical Computer Science, 408(1):4–16,November 17, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Credi:2008:NCM

[1837] A. Credi, M. Garavelli, C. Laneve,S. Pradalier, S. Silvi, and G. Zavattaro.nanoκ: A calculus for the modelingand simulation of nano devices. The-oretical Computer Science, 408(1):17–30, November 17, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Khanin:2008:CME

[1838] Raya Khanin and Desmond J.Higham. Chemical Master Equationand Langevin regimes for a gene tran-scription model. Theoretical ComputerScience, 408(1):31–40, November 17,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ciocchetta:2008:MCT

[1839] Federica Ciocchetta, Jane Hillston,Martin Kos, and David Tollervey. Mod-elling co-transcriptional cleavage in thesynthesis of yeast pre-rRNA. Theo-retical Computer Science, 408(1):41–54, November 17, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fages:2008:TLC

[1840] Francois Fages and Aurelien Rizk. Ontemporal logic constraint solving foranalyzing numerical data time series.Theoretical Computer Science, 408(1):

REFERENCES 227

55–65, November 17, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Bracciali:2008:SSC

[1841] Andrea Bracciali, Marcello Brunelli,Enrico Cataldo, and Pierpaolo Degano.Synapses as stochastic concurrent sys-tems. Theoretical Computer Sci-ence, 408(1):66–82, November 17, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Dematte:2008:EBP

[1842] L. Dematte, C. Priami, A. Romanel,and O. Soyer. Evolving BlenX pro-grams to simulate the evolution of bio-logical networks. Theoretical ComputerScience, 408(1):83–96, November 17,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2008:Ph


Amato:2008:P

[1844] Nancy M. Amato, Der-Tsai Lee,Andrea Pietracaprina, and RobertoTamassia. Preface. Theoretical Com-puter Science, 408(2–3):97–98, Novem-ber 28, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Preparata:2008:UDM

[1845] Franco P. Preparata. The unpre-dictable deviousness of models. Theo-retical Computer Science, 408(2–3):99–105, November 28, 2008. CODEN TC-


Apostolico:2008:IDI

[1846] Alberto Apostolico and Claudia Taglia-collo. Incremental discovery of the irre-dundant motif bases for all suffixes of astring in O. Theoretical Computer Sci-ence, 408(2–3):106–115, November 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Allulli:2008:PLL

[1847] Luca Allulli, Giorgio Ausiello, Vin-cenzo Bonifaci, and Luigi Laura. Onthe power of lookahead in on-lineserver routing problems. TheoreticalComputer Science, 408(2–3):116–128,November 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Badent:2008:DCG

[1848] Melanie Badent, Emilio Di Giacomo,and Giuseppe Liotta. Drawing col-ored graphs on colored points. Theoret-ical Computer Science, 408(2–3):129–142, November 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bhatt:2008:ATT

[1849] Sandeep N. Bhatt, Gianfranco Bilardi,and Geppino Pucci. Area-time trade-offs for universal VLSI circuits. The-oretical Computer Science, 408(2–3):143–150, November 28, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Bock:2008:CDM

[1850] Mary Ellen Bock, Claudio Garutti, andConcettina Guerra. Cavity detection

REFERENCES 228

and matching for binding site recog-nition. Theoretical Computer Science,408(2–3):151–162, November 28, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Boissonnat:2008:ADL

[1851] Jean-Daniel Boissonnat, Camille Wormser,and Mariette Yvinec. Anisotropic di-agrams: Labelle Shewchuk approachrevisited. Theoretical Computer Sci-ence, 408(2–3):163–173, November 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Aleardi:2008:SRP

[1852] L. Castelli Aleardi, O. Devillers, andG. Schaeffer. Succinct representa-tions of planar maps. TheoreticalComputer Science, 408(2–3):174–187,November 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Codenotti:2008:CEH

[1853] Bruno Codenotti, Amin Saberi, Kas-turi Varadarajan, and Yinyu Ye. Thecomplexity of equilibria: Hardnessresults for economies via a corre-spondence with games. TheoreticalComputer Science, 408(2–3):188–198,November 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Goodrich:2008:PAD

[1854] Michael T. Goodrich. Pipelined al-gorithms to detect cheating in long-term grid computations. TheoreticalComputer Science, 408(2–3):199–207,November 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Iwama:2008:RMB

[1855] Kazuo Iwama, Hiroki Morizumi, andJun Tarui. Reductions for mono-tone Boolean circuits. TheoreticalComputer Science, 408(2–3):208–212,November 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Katriel:2008:CUU

[1856] Irit Katriel, Claire Kenyon-Mathieu,and Eli Upfal. Commitment un-der uncertainty: Two-stage stochas-tic matching problems. TheoreticalComputer Science, 408(2–3):213–223,November 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Papamanthou:2008:ACP

[1857] Charalampos Papamanthou and Ioan-nis G. Tollis. Algorithms for com-puting a parameterized st. Theoret-ical Computer Science, 408(2–3):224–240, November 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Rachlin:2008:NAR

[1858] Eric Rachlin and John E. Sav-age. Nanowire addressing withrandomized-contact decoders. Theoret-ical Computer Science, 408(2–3):241–261, November 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hines:2008:MS

[1859] Peter Hines. Machine semantics. The-oretical Computer Science, 409(1):1–23, December 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 229

Demri:2008:VQC

[1860] Stephane Demri and Regis Gascon.Verification of qualitative Z con-straints. Theoretical Computer Sci-ence, 409(1):24–40, December 6, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Avellone:2008:OTP

[1861] Alessandro Avellone, Guido Fiorino,and Ugo Moscato. Optimization tech-niques for propositional intuitionisticlogic and their implementation. The-oretical Computer Science, 409(1):41–58, December 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Acciai:2008:RPC

[1862] Lucia Acciai and Michele Boreale. Re-sponsiveness in process calculi. The-oretical Computer Science, 409(1):59–93, December 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gambino:2008:ITW

[1863] Nicola Gambino and Richard Garner.The identity type weak factorisationsystem. Theoretical Computer Sci-ence, 409(1):94–109, December 6, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Liu:2008:CST

[1864] Xiaojun Liu and Edward A. Lee.CPO semantics of timed interactive ac-tor networks. Theoretical ComputerScience, 409(1):110–125, December 6,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Reisig:2008:CKA

[1865] W. Reisig. The computable kernelof Abstract State Machines. Theo-retical Computer Science, 409(1):126–136, December 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cohen:2008:EPV

[1866] David A. Cohen, Peter G. Jeavons, andStanislav Zivny. The expressive powerof valued constraints: Hierarchies andcollapses. Theoretical Computer Sci-ence, 409(1):137–153, December 6,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2008:EBj

[1867] Anonymous. Editorial board. The-oretical Computer Science, 409(1):v–ix, December 6, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bini:2008:P

[1868] Dario Andrea Bini, Victor Y. Pan,and Jan Verschelde. Preface. Theo-retical Computer Science, 409(2):155–157, December 17, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bella:2008:CQP

[1869] T. Bella, Y. Eidelman, I. Gohberg, andV. Olshevsky. Computations with qua-siseparable polynomials and matrices.Theoretical Computer Science, 409(2):158–179, December 17, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 230

Cuyt:2008:NAS

[1870] Annie Cuyt and Wen shin Lee. Anew algorithm for sparse interpolationof multivariate polynomials. Theoreti-cal Computer Science, 409(2):180–185,December 17, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Emiris:2008:RAN

[1871] Ioannis Z. Emiris and Elias P. Tsigari-das. Real algebraic numbers and poly-nomial systems of small degree. The-oretical Computer Science, 409(2):186–199, December 17, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Li:2008:AGP

[1872] Bin Li, Jiawang Nie, and Lihong Zhi.Approximate GCDs of polynomials andsparse SOS relaxations. Theoreti-cal Computer Science, 409(2):200–210,December 17, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Leibon:2008:FHT

[1873] Gregory Leibon, Daniel N. Rockmore,Wooram Park, Robert Taintor, andGregory S. Chirikjian. A fast Her-mite transform. Theoretical ComputerScience, 409(2):211–228, December 17,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Mourrain:2008:SNF

[1874] Bernard Mourrain and PhilippeTrebuchet. Stable normal forms forpolynomial system solving. Theoreti-cal Computer Science, 409(2):229–240,

December 17, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Normandin:2008:GWS

[1875] Marc Eric Normandin, Adam Vajda,and Sree Ram Valluri. Gravitationalwave signal templates, pattern recog-nition, and reciprocal Eulerian gammafunctions. Theoretical Computer Sci-ence, 409(2):241–254, December 17,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Pan:2008:SAL

[1876] V. Y. Pan, D. Grady, B. Murphy,G. Qian, R. E. Rosholt, and A. D.Ruslanov. Schur aggregation for lin-ear systems and determinants. Theo-retical Computer Science, 409(2):255–268, December 17, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Peyrl:2008:CSS

[1877] Helfried Peyrl and Pablo A. Parrilo.Computing sum of squares decomposi-tions with rational coefficients. Theo-retical Computer Science, 409(2):269–281, December 17, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Sekigawa:2008:NPZ

[1878] Hiroshi Sekigawa. The nearest poly-nomial with a zero in a given domain.Theoretical Computer Science, 409(2):282–291, December 17, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 231

Sharma:2008:CRR

[1879] Vikram Sharma. Complexity of realroot isolation using continued fractions.Theoretical Computer Science, 409(2):292–310, December 17, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Shirayanagi:2008:NGB

[1880] Kiyoshi Shirayanagi and Hiroshi Seki-gawa. A new Grobner basis conversionmethod based on stabilization tech-niques. Theoretical Computer Science,409(2):311–317, December 17, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Zeng:2008:NEM

[1881] Zhonggang Zeng. A numerical elimina-tion method for polynomial computa-tions. Theoretical Computer Science,409(2):318–331, December 17, 2008.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Fisher:2008:RPS

[1882] Edgar Fisher and Nandor Sieben. Rect-angular polyomino set weak (1, 2)-achievement games. Theoretical Com-puter Science, 409(3):333–340, Decem-ber 28, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Ganchev:2008:GIS

[1883] Antoniy Ganchev, Lata Narayanan,and Sunil Shende. Games to in-duce specified equilibria. Theoreti-cal Computer Science, 409(3):341–350,December 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cieliebak:2008:SVP

[1884] Mark Cieliebak, Alexander Hall, RikoJacob, and Marc Nunkesser. Sequentialvector packing. Theoretical ComputerScience, 409(3):351–363, December 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Abbasi:2008:CQA

[1885] Sarmad Abbasi and Numan Sheikh.Complexity of question/answer games.Theoretical Computer Science, 409(3):364–381, December 28, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Baril:2008:PGL

[1886] J. L. Baril and J. M. Pallo. Thepruning-grafting lattice of binary trees.Theoretical Computer Science, 409(3):382–393, December 28, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Elzinga:2008:ASC

[1887] Cees Elzinga, Sven Rahmann, and HuiWang. Algorithms for subsequencecombinatorics. Theoretical ComputerScience, 409(3):394–404, December 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Yan:2008:QIN

[1888] Weigen Yan and Fuji Zhang. Aquadratic identity for the number ofperfect matchings of plane graphs. The-oretical Computer Science, 409(3):405–410, December 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 232

Deckelbaum:2008:SOR

[1889] Alan Deckelbaum. Simulating one-reversal multicounter machines by par-tially blind multihead finite automata.Theoretical Computer Science, 409(3):411–416, December 28, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Gerede:2008:MCD

[1890] Cagdas E. Gerede, Oscar H. Ibarra,Bala Ravikumar, and Jianwen Su.Minimum-cost delegation in servicecomposition. Theoretical ComputerScience, 409(3):417–431, December 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Currie:2008:LBP

[1891] James D. Currie and Terry I. Visentin.Long binary patterns are Abelian 2-avoidable. Theoretical Computer Sci-ence, 409(3):432–437, December 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Amir:2008:GL

[1892] Amihood Amir, Tzvika Hartman, OrenKapah, B. Riva Shalom, and DekelTsur. Generalized LCS. Theoreti-cal Computer Science, 409(3):438–449,December 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Tsai:2008:EFT

[1893] Ping-Ying Tsai, Jung-Sheng Fu, andGen-Huey Chen. Edge-fault-tolerantHamiltonicity of pancake graphs un-der the conditional fault model. The-oretical Computer Science, 409(3):450–460, December 28, 2008. CODEN TC-


Kassel:2008:PMF

[1894] Christian Kassel and ChristopheReutenauer. A palindromization mapfor the free group. Theoretical Com-puter Science, 409(3):461–470, Decem-ber 28, 2008. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Jukna:2008:ETR

[1895] Stasys Jukna. Expanders and time-restricted branching programs. Theo-retical Computer Science, 409(3):471–476, December 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Shen:2008:DGP

[1896] Xiaojun Shen, Jianyu Lou, WeifaLiang, and Junzhou Luo. Deadlineguaranteed packet scheduling for over-loaded traffic in input-queued switches.Theoretical Computer Science, 409(3):477–485, December 28, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Bille:2008:FCR

[1897] Philip Bille and Martin Farach-Colton.Fast and compact regular expressionmatching. Theoretical Computer Sci-ence, 409(3):486–496, December 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Abouelaoualim:2008:PTE

[1898] A. Abouelaoualim, K. Ch. Das,L. Faria, Y. Manoussakis, C. Mar-tinhon, and R. Saad. Paths and

REFERENCES 233

trails in edge-colored graphs. Theo-retical Computer Science, 409(3):497–510, December 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Berenbrink:2008:WBB

[1899] Petra Berenbrink, Tom Friedetzky,Zengjian Hu, and Russell Martin. Onweighted balls-into-bins games. Theo-retical Computer Science, 409(3):511–520, December 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chan:2008:DPU

[1900] Joseph Wun-Tat Chan, Tak-Wah Lam,and Prudence W. H. Wong. Dynamicbin packing of unit fractions items.Theoretical Computer Science, 409(3):521–529, December 28, 2008. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Fuster-Sabater:2008:SAS

[1901] A. Fuster-Sabater and P. Caballero-Gil. Strategic attack on the shrink-ing generator. Theoretical ComputerScience, 409(3):530–536, December 28,2008. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Silva:2008:RSP

[1902] Pedro V. Silva. Rational subsets ofpartially reversible monoids. Theo-retical Computer Science, 409(3):537–548, December 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Leroux:2008:SPD

[1903] Jerome Leroux. Structural Pres-burger digit vector automata. Theo-

retical Computer Science, 409(3):549–556, December 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jeandel:2008:PCP

[1904] Emmanuel Jeandel and Nicolas Ollinger.Playing with Conway’s problem. The-oretical Computer Science, 409(3):557–564, December 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Asveld:2008:GAP

[1905] Peter R. J. Asveld. Generating all per-mutations by context-free grammarsin Greibach normal form. Theoreti-cal Computer Science, 409(3):565–577,December 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Glen:2008:QLE

[1906] Amy Glen, Florence Leve, andGwenael Richomme. Quasiperiodic andLyndon episturmian words. Theoreti-cal Computer Science, 409(3):578–600,December 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Berry:2008:SPT

[1907] Anne Berry, Elias Dahlhaus, PinarHeggernes, and Genevieve Simonet. Se-quential and parallel triangulating al-gorithms for Elimination Game andnew insights on Minimum Degree. The-oretical Computer Science, 409(3):601–616, December 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 234

Jansen:2008:NLB

[1908] Maurice J. Jansen and Kenneth W.Regan. A nonlinear lower bound forconstant depth arithmetical circuits viathe discrete uncertainty principle. The-oretical Computer Science, 409(3):617–622, December 28, 2008. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Heggernes:2009:SEM

[1909] Pinar Heggernes and Charis Pa-padopoulos. Single-edge monotonic se-quences of graphs and linear-time al-gorithms for minimal completions anddeletions. Theoretical Computer Sci-ence, 410(1):1–15, January 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Choffrut:2009:FTA

[1910] Christian Choffrut and Serge Grigori-eff. Finite n-tape automata over pos-sibly infinite alphabets: Extending atheorem of Eilenberg et al. Theo-retical Computer Science, 410(1):16–34, January 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Suchan:2009:MIC

[1911] Karol Suchan and Ioan Todinca. Mini-mal interval completion through graphexploration. Theoretical Computer Sci-ence, 410(1):35–43, January 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Currie:2009:CBM

[1912] James D. Currie and Ali Aberkane.A cyclic binary morphism avoidingAbelian fourth powers. Theoretical

Computer Science, 410(1):44–52, Jan-uary 28, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Fellows:2009:PCM

[1913] Michael R. Fellows, Danny Hermelin,Frances Rosamond, and StephaneVialette. On the parameterized com-plexity of multiple-interval graph prob-lems. Theoretical Computer Sci-ence, 410(1):53–61, January 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Shoaran:2009:FTC

[1914] Maryam Shoaran and Alex Thomo.Fault-tolerant computation of dis-tributed regular path queries. Theo-retical Computer Science, 410(1):62–77, January 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Liu:2009:MLS

[1915] Ruifang Liu, Zhonghua Lu, and JinlongShu. The minimal Laplacian spectralradius of trees with a given diameter.Theoretical Computer Science, 410(1):78–83, January 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Baswana:2009:APN

[1916] Surender Baswana, Vishrut Goyal,and Sandeep Sen. All-pairs nearly2-approximate shortest paths inØ(n2polylogn) time. Theoretical Com-puter Science, 410(1):84–93, January28, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

REFERENCES 235

Ikeda:2009:HCT

[1917] Satoshi Ikeda, Izumi Kubo, and Masa-fumi Yamashita. The hitting and covertimes of random walks on finite graphsusing local degree information. The-oretical Computer Science, 410(1):94–100, January 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Faliszewski:2009:CPI

[1918] Piotr Faliszewski and Lane Hemas-paandra. The complexity of power-index comparison. Theoretical Com-puter Science, 410(1):101–107, January28, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Masopust:2009:DCS

[1919] Tomas Masopust. On the descrip-tional complexity of scattered con-text grammars. Theoretical ComputerScience, 410(1):108–112, January 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2009:EBa


Bonsangue:2009:P

[1921] Marcello Bonsangue, Einar BrochJohnsen, Amy Murphy, and Jan Vitek.Preface. Theoretical Computer Sci-ence, 410(2–3):113, February 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bidinger:2009:PCR

[1922] Philippe Bidinger and Adriana Com-pagnoni. Pict correctness revisited.Theoretical Computer Science, 410(2–3):114–127, February 6, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

deBoer:2009:SVC

[1923] F. S. de Boer. A shared-variableconcurrency analysis of multi-threadedobject-oriented programs. Theoreti-cal Computer Science, 410(2–3):128–141, February 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Capecchi:2009:ASM

[1924] Sara Capecchi, Mario Coppo, Mar-iangiola Dezani-Ciancaglini, SophiaDrossopoulou, and Elena Giachino.Amalgamating sessions and methods inobject-oriented languages with gener-ics. Theoretical Computer Science,410(2–3):142–167, February 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Field:2009:RDO

[1925] John Field, Maria-Cristina Marinescu,and Christian Stefansen. Reac-tors: A data-oriented synchronous/asynchronous programming model fordistributed applications. Theoreti-cal Computer Science, 410(2–3):168–201, February 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Haller:2009:SAU

[1926] Philipp Haller and Martin Odersky.Scala Actors: Unifying thread-based

REFERENCES 236

and event-based programming. The-oretical Computer Science, 410(2–3):202–220, February 6, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Jacquet:2009:FAM

[1927] Jean-Marie Jacquet and Isabelle Lin-den. Fully abstract models and refine-ments as tools to compare agents intimed coordination languages. Theoret-ical Computer Science, 410(2–3):221–253, February 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Olveczky:2009:FMP

[1928] Peter Csaba Olveczky and Stian Thor-valdsen. Formal modeling, performanceestimation, and model checking of wire-less sensor network algorithms in Real-Time Maude. Theoretical ComputerScience, 410(2–3):254–280, February 6,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Rozenberg:2009:Pa

[1929] G. Rozenberg. Preface. Theoreti-cal Computer Science, 410(4–5):281–282, February 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bonizzoni:2009:F

[1930] Paola Bonizzoni, S. Barry Cooper,Benedikt Lowe, and Andrea Sorbi.Foreword. Theoretical Computer Sci-ence, 410(4–5):283–284, February 17,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zandron:2009:NB

[1931] Claudio Zandron. Nadia Busi (1968–2007). Theoretical Computer Sci-ence, 410(4–5):285, February 17, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Busi:2009:CEG

[1932] Nadia Busi and Claudio Zandron.Computational expressiveness of Ge-netic Systems. Theoretical ComputerScience, 410(4–5):286–293, February17, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Condon:2009:CPN

[1933] Anne Condon and Hosna Jabbari.Computational prediction of nucleicacid secondary structure: Methods, ap-plications, and challenges. Theoret-ical Computer Science, 410(4–5):294–301, February 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

DHondt:2009:QAG

[1934] Ellie D’Hondt. Quantum approaches tograph colouring. Theoretical ComputerScience, 410(4–5):302–309, February17, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Ehrenfeucht:2009:ITR

[1935] A. Ehrenfeucht and G. Rozenberg. In-troducing time in reaction systems.Theoretical Computer Science, 410(4–5):310–322, February 17, 2009. CO-DEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 237

Garzillo:2009:CVB

[1936] Carmine Garzillo and Giuseppe Traut-teur. Computational virtuality in bio-logical systems. Theoretical ComputerScience, 410(4–5):323–331, February17, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Jonoska:2009:CCS

[1937] Natasa Jonoska and Gregory L. Mc-Colm. Complexity classes for self-assembling flexible tiles. Theoreti-cal Computer Science, 410(4–5):332–346, February 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kjos-Hanssen:2009:EDP

[1938] Bjørn Kjos-Hanssen and Anil Nerode.Effective dimension of points visitedby Brownian motion. TheoreticalComputer Science, 410(4–5):347–354,February 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Krishna:2009:MCT

[1939] Shankara Narayanan Krishna. Mem-brane computing with transport andembedded proteins. TheoreticalComputer Science, 410(4–5):355–375,February 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ladyman:2009:WDI

[1940] James Ladyman. What does it meanto say that a physical system imple-ments a computation? Theoreti-cal Computer Science, 410(4–5):376–383, February 17, 2009. CODEN TC-


Lathrop:2009:SSA

[1941] James I. Lathrop, Jack H. Lutz, andScott M. Summers. Strict self-assemblyof discrete Sierpinski triangles. The-oretical Computer Science, 410(4–5):384–405, February 17, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Loos:2009:SRF

[1942] Remco Loos, Florin Manea, and VictorMitrana. On small, reduced, and fastuniversal accepting networks of splicingprocessors. Theoretical Computer Sci-ence, 410(4–5):406–416, February 17,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Manea:2009:TCO

[1943] Florin Manea, Victor Mitrana, andTakashi Yokomori. Two complemen-tary operations inspired by the DNAhairpin formation: Completion and re-duction. Theoretical Computer Science,410(4–5):417–425, February 17, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Welch:2009:CDT

[1944] P. D. Welch. Characteristics of discretetransfinite time Turing machine mod-els: Halting times, stabilization times,and Normal Form theorems. Theoret-ical Computer Science, 410(4–5):426–442, February 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 238

Woods:2009:CSU

[1945] Damien Woods and Turlough Neary.The complexity of small universal Tur-ing machines: A survey. Theoreti-cal Computer Science, 410(4–5):443–450, February 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2009:Pa

[1946] Anonymous. Preface. Theoretical Com-puter Science, 410(4–5):i–vi, February17, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Lavallee:2009:EP

[1947] Ivan Lavallee and Alexander A.Shvartsman. Editors’ preface. Theoret-ical Computer Science, 410(6–7):451–452, February 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Awerbuch:2009:RRN

[1948] Baruch Awerbuch and Christian Schei-deler. Robust random number genera-tion for peer-to-peer systems. Theoret-ical Computer Science, 410(6–7):453–466, February 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bazzi:2009:HCS

[1949] Rida A. Bazzi, Young ri Choi, and Mo-hamed G. Gouda. Hop chains: Securerouting and the establishment of dis-tinct identities. Theoretical ComputerScience, 410(6–7):467–480, February28, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Czyzowicz:2009:GFF

[1950] Jurek Czyzowicz, Leszek Gasieniec,and Andrzej Pelc. Gathering few fatmobile robots in the plane. Theoret-ical Computer Science, 410(6–7):481–499, February 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Demirbas:2009:GLQ

[1951] Murat Demirbas, Anish Arora, andVinodkrishnan Kulathumani. Glance

: A lightweight querying service forwireless sensor networks. Theoreti-cal Computer Science, 410(6–7):500–513, February 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dolev:2009:ECS

[1952] Shlomi Dolev and Nir Tzachar. Empireof colonies: Self-stabilizing and self-organizing distributed algorithm. The-oretical Computer Science, 410(6–7):514–532, February 28, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Englert:2009:CUP

[1953] Burkhard Englert. On the cost ofuniform protocols whose memory con-sumption is adaptive to interval con-tention. Theoretical Computer Science,410(6–7):533–545, February 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Gilbert:2009:MMS

[1954] Seth Gilbert, Rachid Guerraoui, andCalvin Newport. Of malicious motesand suspicious sensors: On the effi-ciency of malicious interference in wire-less networks. Theoretical Computer

REFERENCES 239

Science, 410(6–7):546–569, February28, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Guerraoui:2009:TTE

[1955] Rachid Guerraoui, Maurice Herlihy,and Bastian Pochon. A topologi-cal treatment of early-deciding set-agreement. Theoretical Computer Sci-ence, 410(6–7):570–580, February 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Johnen:2009:RSS

[1956] Colette Johnen and Le Huy Nguyen.Robust self-stabilizing weight-basedclustering algorithm. TheoreticalComputer Science, 410(6–7):581–594,February 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Mavronicolas:2009:CPE

[1957] Marios Mavronicolas, Loizos Michael,and Paul Spirakis. Computing on apartially eponymous ring. Theoreti-cal Computer Science, 410(6–7):595–613, February 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Mittal:2009:STD

[1958] Neeraj Mittal, Kuppahalli L. Pha-neesh, and Felix C. Freiling. Safetermination detection in an asyn-chronous distributed system when pro-cesses may crash and recover. Theoret-ical Computer Science, 410(6–7):614–628, February 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Moser:2009:TRT

[1959] Heinrich Moser. Towards a real-timedistributed computing model. Theoret-ical Computer Science, 410(6–7):629–659, February 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Li:2009:CSC

[1960] Deying Li, Hongwei Du, Peng-JunWan, Xiaofeng Gao, Zhao Zhang, andWeili Wu. Construction of stronglyconnected dominating sets in asymmet-ric multihop wireless networks. The-oretical Computer Science, 410(8–10):661–669, March 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kiwi:2009:AQT

[1961] M. Kiwi, M. Soto, and C. Thraves. Ad-versarial queuing theory with setups.Theoretical Computer Science, 410(8–10):670–687, March 1, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Gao:2009:DDR

[1962] Yong Gao. The degree distribution ofrandom k-trees. Theoretical ComputerScience, 410(8–10):688–695, March 1,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Djelloul:2009:TLD

[1963] Selma Djelloul. Treewidth and logicaldefinability of graph products. The-oretical Computer Science, 410(8–10):696–710, March 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 240

Bein:2009:QTA

[1964] Wolfgang W. Bein, Lawrence L. Lar-more, Linda Morales, and I. HalSudborough. A quadratic time 2-approximation algorithm for blocksorting. Theoretical Computer Science,410(8–10):711–717, March 1, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Guo:2009:MEL

[1965] Jiong Guo. A more effective linearkernelization for cluster editing. The-oretical Computer Science, 410(8–10):718–726, March 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zhang:2009:ACP

[1966] Yuchen Zhang and Xiaoming Sun. Theantimagicness of the Cartesian prod-uct of graphs. Theoretical ComputerScience, 410(8–10):727–735, March 1,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Susilo:2009:SFS

[1967] Willy Susilo. Short fail-stop signaturescheme based on factorization and dis-crete logarithm assumptions. Theoreti-cal Computer Science, 410(8–10):736–744, March 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kaporis:2009:POS

[1968] A. C. Kaporis and P. G. Spirakis.The price of optimum in Stackelberggames on arbitrary single commoditynetworks and latency functions. The-oretical Computer Science, 410(8–10):


Dai:2009:AAM

[1969] Decheng Dai and Changyuan Yu. A5 + ε-approximation algorithm for min-imum weighted dominating set in unitdisk. Theoretical Computer Science,410(8–10):756–765, March 1, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Tsai:2009:FFL

[1970] Ping-Ying Tsai, Jung-Sheng Fu, andGen-Huey Chen. Fault-free longestpaths in star networks with condi-tional link faults. Theoretical ComputerScience, 410(8–10):766–775, March 1,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ng:2009:TSO

[1971] C. T. Ng, Zhiyi Tan, Yong He, andT. C. E. Cheng. Two semi-onlinescheduling problems on two uniformmachines. Theoretical Computer Sci-ence, 410(8–10):776–792, March 1,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Blanchet-Sadri:2009:GTF

[1972] F. Blanchet-Sadri, Robert Mercas, andGeoffrey Scott. A generalization ofThue freeness for partial words. The-oretical Computer Science, 410(8–10):793–800, March 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kung:2009:BBH

[1973] Tzu-Liang Kung, Cheng-Kuan Lin,Tyne Liang, Lih-Hsing Hsu, and Jimmy

REFERENCES 241

J. M. Tan. On the bipanpositionable bi-panconnectedness of hypercubes. The-oretical Computer Science, 410(8–10):801–811, March 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zhang:2009:ACS

[1974] Zhao Zhang, Xiaofeng Gao, and WeiliWu. Algorithms for connected setcover problem and fault-tolerant con-nected set cover problem. Theoreti-cal Computer Science, 410(8–10):812–817, March 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). See note [2398].

Chen:2009:PAN

[1975] Jianer Chen, Iyad A. Kanj, Jie Meng,Ge Xia, and Fenghui Zhang. On thepseudo-achromatic number problem.Theoretical Computer Science, 410(8–10):818–829, March 1, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Qi:2009:SMP

[1976] Xianglai Qi, Shiguo Zhou, and Jin-jiang Yuan. Single machine parallel-batch scheduling with deterioratingjobs. Theoretical Computer Science,410(8–10):830–836, March 1, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ouangraoua:2009:CED

[1977] Aıda Ouangraoua and Pascal Ferraro.A constrained edit distance algorithmbetween semi-ordered trees. Theoreti-cal Computer Science, 410(8–10):837–846, March 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bouvel:2009:VTD

[1978] Mathilde Bouvel and DominiqueRossin. A variant of the tandem dupli-cation — random loss model of genomerearrangement. Theoretical ComputerScience, 410(8–10):847–858, March 1,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Asodi:2009:CMG

[1979] Vera Asodi and Christopher Umans.The complexity of the matroid–greedoid partition problem. Theoret-ical Computer Science, 410(8–10):859–866, March 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chan:2009:EAT

[1980] Chi-Yuan Chan, Shan-Chyun Ku, Chi-Jen Lu, and Biing-Feng Wang. Effi-cient algorithms for two generalized 2-median problems and the group me-dian problem on trees. Theoreti-cal Computer Science, 410(8–10):867–876, March 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Li:2009:SCM

[1981] Jianping Li, Weidong Li, TongquanZhang, and Zhongxu Zhang. Thesubdivision-constrained minimum span-ning tree problem. TheoreticalComputer Science, 410(8–10):877–885,March 1, 2009. CODEN TCSCDI.ISSN 0304-3975 (print), 1879-2294(electronic).

Ferrante:2009:FPS

[1982] Alessandro Ferrante, Gennaro Parlato,Francesco Sorrentino, and Carmine

REFERENCES 242

Ventre. Fast payment schemes fortruthful mechanisms with verification.Theoretical Computer Science, 410(8–10):886–899, March 1, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Matsubara:2009:EAC

[1983] Wataru Matsubara, Shunsuke In-enaga, Akira Ishino, Ayumi Shino-hara, Tomoyuki Nakamura, and KazuoHashimoto. Efficient algorithms tocompute compressed longest com-mon substrings and compressed palin-dromes. Theoretical Computer Science,410(8–10):900–913, March 1, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Koga:2009:DTA

[1984] Hisashi Koga. Dynamic TCP acknowl-edgment with sliding window. The-oretical Computer Science, 410(8–10):914–925, March 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hsieh:2009:CED

[1985] Sun-Yuan Hsieh and Chang-Jen Tu.Constructing edge-disjoint spanningtrees in locally twisted cubes. The-oretical Computer Science, 410(8–10):926–932, March 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kontogiannis:2009:SSS

[1986] Spyros C. Kontogiannis and Paul G.Spirakis. On the support size of sta-ble strategies in random games. The-oretical Computer Science, 410(8–10):933–942, March 1, 2009. CODEN TC-


Halava:2009:OFI

[1987] Vesa Halava, Tero Harju, Tomi Karki,and Patrice Seebold. Overlap-freenessin infinite partial words. Theoreti-cal Computer Science, 410(8–10):943–948, March 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cardinal:2009:IAB

[1988] Jean Cardinal, Stefan Langerman, andEythan Levy. Improved approxima-tion bounds for edge dominating setin dense graphs. Theoretical ComputerScience, 410(8–10):949–957, March 1,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gagie:2009:CDS

[1989] Travis Gagie. Compressed depth se-quences. Theoretical Computer Sci-ence, 410(8–10):958–962, March 1,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hong:2009:ABC

[1990] Sung-Pil Hong, Myoung-Ju Park, andSoo Y. Chang. Approximation of thek-batch consolidation problem. The-oretical Computer Science, 410(8–10):963–967, March 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Blanchet-Sadri:2009:TAS

[1991] F. Blanchet-Sadri, Raphael M. Jungers,and Justin Palumbo. Testing avoidabil-ity on sets of partial words is hard. The-oretical Computer Science, 410(8–10):

REFERENCES 243


Saez:2009:QAC

[1992] Pablo Saez. A quadratic algorithm forthe 2-cyclic robotic scheduling prob-lem. Theoretical Computer Science,410(8–10):973–976, March 1, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Orlovich:2009:IID

[1993] Yury L. Orlovich, Valery S. Gordon,and Dominique de Werra. On the in-approximability of independent domi-nation in 2 P. Theoretical ComputerScience, 410(8–10):977–982, March 1,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Pizzi:2009:K

[1994] Cinzia Pizzi. k. Theoretical ComputerScience, 410(8–10):983–987, March 1,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Tsai:2009:ECI

[1995] Tsung-Hsi Tsai. Efficient computationof the iteration of functions. Theoreti-cal Computer Science, 410(8–10):988–993, March 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Wahlen:2009:CAH

[1996] Martin Wahlen. On the complexity ofapproximating the Hadwiger number.Theoretical Computer Science, 410(8–10):994–996, March 1, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Honkala:2009:SIM

[1997] Juha Honkala. On the simplificationof infinite morphic words. Theoreti-cal Computer Science, 410(8–10):997–1000, March 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cooper:2009:PAC

[1998] S. Barry Cooper and Hong Zhu.Preface: Algorithms, complexity andmodels of computation. Theoreti-cal Computer Science, 410(11):1001–1002, March 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Danos:2009:HLB

[1999] Vincent Danos and Linus J. Schu-macher. How liquid is biologicalsignalling? Theoretical ComputerScience, 410(11):1003–1012, March 6,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Li:2009:AOT

[2000] Minming Li, Ze Feng, Nan Zang,Ronald L. Graham, and Frances F.Yao. Approximately optimal trees forgroup key management with batch up-dates. Theoretical Computer Science,410(11):1013–1021, March 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Feng:2009:AAM

[2001] Wangsen Feng, Li’ang Zhang, and Han-pin Wang. Approximation algorithmfor maximum edge coloring. Theoret-ical Computer Science, 410(11):1022–1029, March 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 244

Jakoby:2009:IAD

[2002] Andreas Jakoby, Maciej Liskiewicz,Rudiger Reischuk, and Christian Schin-delhauer. Improving the average de-lay of sorting. Theoretical ComputerScience, 410(11):1030–1041, March 6,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Li:2009:EDA

[2003] Angsheng Li. Elementary differ-ences among jump classes. Theoret-ical Computer Science, 410(11):1042–1053, March 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Morizumi:2009:LSL

[2004] Hiroki Morizumi and Jun Tarui.Linear-size log-depth negation-limitedinverter for k-tonic binary sequences.Theoretical Computer Science, 410(11):1054–1060, March 6, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Kawaguchi:2009:DSG

[2005] Akifumi Kawaguchi and Hiroshi Nag-amochi. Drawing slicing graphs withface areas. Theoretical ComputerScience, 410(11):1061–1072, March 6,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Sun:2009:TIR

[2006] He Sun and Chung Keung Poon. Twoimproved range-efficient algorithms forF0-estimation. Theoretical ComputerScience, 410(11):1073–1080, March 6,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zhao:2009:CSA

[2007] Yingchao Zhao and Shang hua Teng.Combinatorial and spectral aspectsof nearest neighbor graphs in dou-bling dimensional and nearly-Euclideanspaces. Theoretical Computer Science,410(11):1081–1092, March 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Zhang:2009:AAS

[2008] Peng Zhang and Mingji Xia. An ap-proximation algorithm to the k-SteinerForest problem. Theoretical ComputerScience, 410(11):1093–1098, March 6,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Yao:2009:NUC

[2009] Andrew C. C. Yao, Frances F. Yao,and Yunlei Zhao. A note on universalcomposable zero-knowledge in the com-mon reference string model. Theoret-ical Computer Science, 410(11):1099–1108, March 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Popescu:2009:SAI

[2010] Andrei Popescu, Traian Florin Serbanuta,and Grigore Rosu. A semantic ap-proach to interpolation. TheoreticalComputer Science, 410(12–13):1109–1128, March 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gumm:2009:CF

[2011] H. Peter Gumm. Copower func-tors. Theoretical Computer Science,410(12–13):1129–1142, March 17, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 245

Bova:2009:CRL

[2012] Simone Bova and Franco Montagna.The consequence relation in the logicof commutative GBL. TheoreticalComputer Science, 410(12–13):1143–1158, March 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gabbay:2009:SSU

[2013] Murdoch J. Gabbay. A study of substi-tution, using nominal techniques andFraenkel–Mostowksi sets. TheoreticalComputer Science, 410(12–13):1159–1189, March 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lorenz:2009:ESP

[2014] Robert Lorenz, Gabriel Juhas, RobinBergenthum, Jorg Desel, and SebastianMauser. Executability of scenarios inPetri nets. Theoretical Computer Sci-ence, 410(12–13):1190–1216, March 17,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Schroder:2009:HIH

[2015] Lutz Schroder and Till Mossakowski.HasCasl: Integrated higher-orderspecification and program develop-ment. Theoretical Computer Science,410(12–13):1217–1260, March 17, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bergstra:2009:MES

[2016] J. A. Bergstra, Y. Hirshfeld, and J. V.Tucker. Meadows and the equationalspecification of division. TheoreticalComputer Science, 410(12–13):1261–1271, March 17, 2009. CODEN TC-


Kwiatkowska:2009:PMA

[2017] Marta Kwiatkowska, Gethin Norman,David Parker, and Maria GraziaVigliotti. Probabilistic Mobile Ambi-ents. Theoretical Computer Science,410(12–13):1272–1303, March 17, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Prencipe:2009:P

[2018] Giuseppe Prencipe and Shmuel Zaks.Preface. Theoretical Computer Science,410(14):1305–1306, March 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Nisse:2009:GSA

[2019] Nicolas Nisse and David Soguet. Graphsearching with advice. Theoreti-cal Computer Science, 410(14):1307–1318, March 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Broersma:2009:UBA

[2020] Hajo Broersma, Matthew Johnson, andDaniel Paulusma. Upper bounds andalgorithms for parallel knock-out num-bers. Theoretical Computer Science,410(14):1319–1327, March 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Gafni:2009:ARS

[2021] Eli Gafni, Achour Mostefaoui, MichelRaynal, and Corentin Travers. Fromadaptive renaming to set agreement.Theoretical Computer Science, 410(14):1328–1335, March 28, 2009. CODEN

REFERENCES 246


Manne:2009:NSS

[2022] Fredrik Manne, Morten Mjelde, Lau-rence Pilard, and Sebastien Tixeuil.A new self-stabilizing maximal match-ing algorithm. Theoretical ComputerScience, 410(14):1336–1345, March 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Korteweg:2009:DAS

[2023] Peter Korteweg, Alberto Marchetti-Spaccamela, Leen Stougie, and AndreaVitaletti. Data aggregation in sensornetworks: Balancing communicationand delay costs. Theoretical ComputerScience, 410(14):1346–1354, March 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Efrima:2009:DAP

[2024] Asaf Efrima and David Peleg. Dis-tributed algorithms for partitioning aswarm of autonomous mobile robots.Theoretical Computer Science, 410(14):1355–1368, March 28, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Even:2009:OCS

[2025] Guy Even, Tamir Levi, and AmiLitman. Optimal conclusive setsfor comparator networks. Theoreti-cal Computer Science, 410(14):1369–1376, March 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kralovic:2009:RAC

[2026] Rastislav Kralovic and Richard Kralovic.Rapid almost-complete broadcasting in

faulty networks. Theoretical ComputerScience, 410(14):1377–1387, March 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Czyzowicz:2009:LEC

[2027] J. Czyzowicz, S. Dobrev, E. Kranakis,J. Opatrny, and J. Urrutia. Local edgecolouring of Yao-like subgraphs of UnitDisk Graphs. Theoretical ComputerScience, 410(14):1388–1400, March 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Korman:2009:NMG

[2028] Amos Korman and Shay Kutten. Anote on models for graph representa-tions. Theoretical Computer Science,410(14):1401–1412, March 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Rozenberg:2009:Pb

[2029] G. Rozenberg. Preface. Theoreti-cal Computer Science, 410(15):1413–1414, April 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jonoska:2009:Pa

[2030] Natasa Jonoska and Jarkko Kari. Pref-ace. Theoretical Computer Science, 410(15):1415–1416, April 1, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Greenberg:2009:CRM

[2031] Sam Greenberg and Dana Randall.Convergence rates of Markov chains forsome self-assembly and non-saturatedIsing models. Theoretical ComputerScience, 410(15):1417–1427, April 1,

REFERENCES 247


Reif:2009:APD

[2032] John H. Reif and Sudheer Sahu.Autonomous programmable DNAnanorobotic devices using DNAzymes.Theoretical Computer Science, 410(15):1428–1439, April 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Grayson:2009:DDC

[2033] N. E. Grayson, A. Taormina, andR. Twarock. DNA duplex cage struc-tures with icosahedral symmetry. The-oretical Computer Science, 410(15):1440–1447, April 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jonoska:2009:ERS

[2034] Natasa Jonoska, Nadrian C. Seeman,and Gang Wu. On existence of re-porter strands in DNA-based graphstructures. Theoretical Computer Sci-ence, 410(15):1448–1460, April 1, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Brun:2009:PFT

[2035] Yuriy Brun and Dustin Reishus. Pathfinding in the tile assembly model.Theoretical Computer Science, 410(15):1461–1472, April 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Rozenberg:2009:Pc

[2036] G. Rozenberg. Preface. Theoreti-cal Computer Science, 410(16):1473–1474, April 2, 2009. CODEN TC-


Jonoska:2009:Pb

[2037] Natasa Jonoska and Jarkko Kari. Pref-ace. Theoretical Computer Science, 410(16):1475–1476, April 2, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Anselmo:2009:DUT

[2038] Marcella Anselmo and Maria Madonia.Deterministic and unambiguous two-dimensional languages over one-letteralphabet. Theoretical Computer Sci-ence, 410(16):1477–1485, April 2, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Brijder:2009:PQR

[2039] Robert Brijder and Hendrik JanHoogeboom. Perfectly quilted rect-angular snake tilings. TheoreticalComputer Science, 410(16):1486–1494,April 2, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Becker:2009:PWT

[2040] Florent Becker. Pictures worth a thou-sand tiles, a geometrical programminglanguage for self-assembly. Theoret-ical Computer Science, 410(16):1495–1515, April 2, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lukkarila:2009:WDT

[2041] Ville Lukkarila. The 4-way deter-ministic tiling problem is undecidable.Theoretical Computer Science, 410(16):1516–1533, April 2, 2009. CODEN TC-

REFERENCES 248


Goodman-Strauss:2009:RPS

[2042] Chaim Goodman-Strauss. Regular pro-duction systems and triangle tilings.Theoretical Computer Science, 410(16):1534–1549, April 2, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2009:Pb

[2043] Anonymous. Preface. Theoretical Com-puter Science, 410(16):i–vi, April 2,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Spirakis:2009:P

[2044] Paul G. Spirakis, Marios Mavronico-las, and Spyros C. Kontogiannis. Pref-ace. Theoretical Computer Science, 410(17):1551, April 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ackermann:2009:PNE

[2045] Heiner Ackermann, Heiko Roglin, andBerthold Vocking. Pure Nash equilibriain player-specific and weighted conges-tion games. Theoretical Computer Sci-ence, 410(17):1552–1563, April 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bilo:2009:DMD

[2046] Davide Bilo, Luciano Guala, and GuidoProietti. Dynamic mechanism design.Theoretical Computer Science, 410(17):1564–1572, April 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chen:2009:MEH

[2047] Xi Chen, Li-Sha Huang, and Shang-Hua Teng. Market equilibria with hy-brid linear-Leontief utilities. Theoret-ical Computer Science, 410(17):1573–1580, April 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Daskalakis:2009:NAN

[2048] Constantinos Daskalakis, AranyakMehta, and Christos Papadimitriou. Anote on approximate Nash equilibria.Theoretical Computer Science, 410(17):1581–1588, April 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Immorlica:2009:CMS

[2049] Nicole Immorlica, Li (Erran) Li, Va-hab S. Mirrokni, and Andreas S.Schulz. Coordination mechanismsfor selfish scheduling. TheoreticalComputer Science, 410(17):1589–1598,April 6, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Kontogiannis:2009:PAA

[2050] Spyros C. Kontogiannis, Panagiota N.Panagopoulou, and Paul G. Spirakis.Polynomial algorithms for approximat-ing Nash equilibria of bimatrix games.Theoretical Computer Science, 410(17):1599–1606, April 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Penna:2009:SPT

[2051] Paolo Penna, Guido Proietti, and Pe-ter Widmayer. Strongly polynomial-time truthful mechanisms in one shot.

REFERENCES 249

Theoretical Computer Science, 410(17):1607–1615, April 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Arge:2009:P

[2052] Lars Arge, Christian Cachin, and An-drzej Tarlecki. Preface. TheoreticalComputer Science, 410(18):1617, April17, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Cai:2009:HAP

[2053] Jin-Yi Cai and Pinyan Lu. Holographicalgorithms: The power of dimension-ality resolved. Theoretical ComputerScience, 410(18):1618–1628, April 17,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Larose:2009:UAH

[2054] Benoıt Larose and Pascal Tesson. Uni-versal algebra and hardness results forconstraint satisfaction problems. The-oretical Computer Science, 410(18):1629–1647, April 17, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Blomer:2009:SMS

[2055] Johannes Blomer and Stefanie Naewe.Sampling methods for shortest vectors,closest vectors and successive minima.Theoretical Computer Science, 410(18):1648–1665, April 17, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Atserias:2009:ASE

[2056] Albert Atserias, Andrei Bulatov, andAnuj Dawar. Affine systems of equa-tions and counting infinitary logic.

Theoretical Computer Science, 410(18):1666–1683, April 17, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Bodirsky:2009:MIV

[2057] Manuel Bodirsky, Hubie Chen, JanKara, and Timo von Oertzen. Maximalinfinite-valued constraint languages.Theoretical Computer Science, 410(18):1684–1693, April 17, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Boigelot:2009:GCT

[2058] Bernard Boigelot and Julien Brusten.A generalization of Cobham’s theo-rem to automata over real numbers.Theoretical Computer Science, 410(18):1694–1703, April 17, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Fiore:2009:CFA

[2059] Marcelo Fiore and Chung-Kil Hur.On the construction of free algebrasfor equational systems. Theoreti-cal Computer Science, 410(18):1704–1729, April 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ishai:2009:PMS

[2060] Yuval Ishai, Tal Malkin, Martin J.Strauss, and Rebecca N. Wright. Pri-vate multiparty sampling and approx-imation of vector combinations. The-oretical Computer Science, 410(18):1730–1745, April 17, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 250

Hutter:2009:P

[2061] Marcus Hutter and Rocco A. Serve-dio. Preface. Theoretical ComputerScience, 410(19):1747–1748, April 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Maier:2009:OCN

[2062] Markus Maier, Matthias Hein, and Ul-rike von Luxburg. Optimal construc-tion of k-nearest-neighbor graphs foridentifying noisy clusters. Theoreti-cal Computer Science, 410(19):1749–1764, April 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chang:2009:MPS

[2063] Kevin L. Chang. Multiple pass stream-ing algorithms for learning mixturesof distributions in Rd. Theoreti-cal Computer Science, 410(19):1765–1780, April 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Vyugin:2009:CER

[2064] Vladimir V. V’yugin. On calibrationerror of randomized forecasting algo-rithms. Theoretical Computer Science,410(19):1781–1795, April 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Jain:2009:PLR

[2065] Sanjay Jain, Frank Stephan, and NanYe. Prescribed learning of r.e. classes.Theoretical Computer Science, 410(19):1796–1806, April 28, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Yoshinaka:2009:LEV

[2066] Ryo Yoshinaka. Learning efficiency ofvery simple grammars from positivedata. Theoretical Computer Science,410(19):1807–1825, April 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Mahmud:2009:UTL

[2067] M. M. Hassan Mahmud. On uni-versal transfer learning. Theoreti-cal Computer Science, 410(19):1826–1846, April 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Shin:2009:PSP

[2068] Kilho Shin and Tetsuji Kuboyama.Polynomial summaries of positivesemidefinite kernels. TheoreticalComputer Science, 410(19):1847–1862,April 28, 2009. CODEN TCSCDI.ISSN 0304-3975 (print), 1879-2294(electronic).

Case:2009:PII

[2069] John Case and Samuel E. MoeliusIII. Parallelism increases iterativelearning power. Theoretical ComputerScience, 410(19):1863–1875, April 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Audibert:2009:EET

[2070] Jean-Yves Audibert, Remi Munos,and Csaba Szepesvari. Exploration–exploitation tradeoff using variance es-timates in multi-armed bandits. The-oretical Computer Science, 410(19):1876–1902, April 28, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 251

Feldman:2009:SML

[2071] Vitaly Feldman and Shrenik Shah.Separating models of learning withfaulty teachers. Theoretical ComputerScience, 410(19):1903–1912, April 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Rozenberg:2009:Pd

[2072] G. Rozenberg. Preface. Theoreti-cal Computer Science, 410(20):1913–1914, May 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hirvensalo:2009:P

[2073] Mika Hirvensalo. Preface. TheoreticalComputer Science, 410(20):1915, May1, 2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ambainis:2009:ICQ

[2074] Andris Ambainis and Nikolajs Nahi-movs. Improved constructions of quan-tum automata. Theoretical ComputerScience, 410(20):1916–1922, May 1,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Freivalds:2009:ICM

[2075] Rusins Freivalds, Maris Ozols, andLaura Mancinska. Improved construc-tions of mixed state quantum au-tomata. Theoretical Computer Sci-ence, 410(20):1923–1931, May 1, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Yakaryilmaz:2009:EPA

[2076] Abuzer Yakaryılmaz and A. C. CemSay. Efficient probability amplificationin two-way quantum finite automata.

Theoretical Computer Science, 410(20):1932–1941, May 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Golovkins:2009:CLR

[2077] Marats Golovkins, Maksim Kravtsev,and Vasilijs Kravcevs. On a classof languages recognizable by proba-bilistic reversible decide-and-halt au-tomata. Theoretical Computer Sci-ence, 410(20):1942–1951, May 1, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Dzelme-Berzina:2009:MLQ

[2078] Ilze Dzelme-Berzina. Mathematicallogic and quantum finite state au-tomata. Theoretical Computer Sci-ence, 410(20):1952–1959, May 1, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Anonymous:2009:Pc

[2079] Anonymous. Preface. Theoretical Com-puter Science, 410(20):i–vi, May 1,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Meduna:2009:IHL

[2080] Alexander Meduna and Jirı Techet. Aninfinite hierarchy of language familiesgenerated by scattered context gram-mars with n-limited derivations. The-oretical Computer Science, 410(21–23):1961–1969, May 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fraigniaud:2009:UAS

[2081] Pierre Fraigniaud, Cyril Gavoille,Adrian Kosowski, Emmanuelle Leb-har, and Zvi Lotker. Universal aug-

REFERENCES 252

mentation schemes for network naviga-bility. Theoretical Computer Science,410(21–23):1970–1981, May 17, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Wang:2009:PCC

[2082] Guanghui Wang and Guizhen Liu.Paths, cycles and circular colorings indigraphs. Theoretical Computer Sci-ence, 410(21–23):1982–1985, May 17,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Oswald:2009:SCO

[2083] Marcus Oswald and Gerhard Reinelt.The simultaneous consecutive onesproblem. Theoretical Computer Sci-ence, 410(21–23):1986–1992, May 17,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Elias:2009:FNJ

[2084] Isaac Elias and Jens Lagergren. Fastneighbor joining. Theoretical Com-puter Science, 410(21–23):1993–2000,May 17, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Yang:2009:IST

[2085] Jinn-Shyong Yang, Jou-Ming Chang,Shyue-Ming Tang, and Yue-Li Wang.On the independent spanning trees ofrecursive circulant graphs G. Theo-retical Computer Science, 410(21–23):2001–2010, May 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Glasser:2009:NMS

[2086] Christian Glaßer, Alan L. Selman,Stephen Travers, and Liyu Zhang. Non-

mitotic sets. Theoretical Computer Sci-ence, 410(21–23):2011–2023, May 17,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chen:2009:PCM

[2087] Wenbin Chen, Matthew C. Schmidt,and Nagiza F. Samatova. On param-eterized complexity of the Multi-MCSproblem. Theoretical Computer Sci-ence, 410(21–23):2024–2032, May 17,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Guignard:2009:CNK

[2088] Adrien Guignard and Eric Sopena.Compound Node–Kayles on paths.Theoretical Computer Science, 410(21–23):2033–2044, May 17, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Fleischner:2009:CGF

[2089] Herbert Fleischner, Egbert Mujuni,Daniel Paulusma, and Stefan Szei-der. Covering graphs with few com-plete bipartite subgraphs. TheoreticalComputer Science, 410(21–23):2045–2053, May 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dantchev:2009:TRL

[2090] Stefan Dantchev, Barnaby Martin, andMark Rhodes. Tight rank lower boundsfor the Sherali–Adams proof system.Theoretical Computer Science, 410(21–23):2054–2063, May 17, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 253

Nagoya:2009:CCC

[2091] Takayuki Nagoya and Seinosuke Toda.Computational complexity of comput-ing a partial solution for the GraphAutomorphism problems. TheoreticalComputer Science, 410(21–23):2064–2071, May 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Alcon:2009:CCG

[2092] Liliana Alcon, Luerbio Faria, CelinaM. H. de Figueiredo, and MarisaGutierrez. The complexity of cliquegraph recognition. Theoretical Com-puter Science, 410(21–23):2072–2083,May 17, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Goldstein:2009:ASC

[2093] Ilya Goldstein. Asymptotic subwordcomplexity of fixed points of group sub-stitutions. Theoretical Computer Sci-ence, 410(21–23):2084–2098, May 17,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Liu:2009:OST

[2094] Ming Liu, Yinfeng Xu, Chengbin Chu,and Feifeng Zheng. Online schedul-ing on two uniform machines to min-imize the makespan. Theoretical Com-puter Science, 410(21–23):2099–2109,May 17, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Baldoni:2009:IER

[2095] Roberto Baldoni, Silvia Bonomi,Leonardo Querzoni, and Sara Tucci

Piergiovanni. Investigating the ex-istence and the regularity of Loga-rithmic Harary Graphs. TheoreticalComputer Science, 410(21–23):2110–2121, May 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lando:2009:ISN

[2096] Yuval Lando and Zeev Nutov. Inap-proximability of survivable networks.Theoretical Computer Science, 410(21–23):2122–2125, May 17, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Col:2009:QLT

[2097] M.-A. Jacob-Da Col and P. Tellier.Quasi-linear transformations and dis-crete tilings. Theoretical Computer Sci-ence, 410(21–23):2126–2134, May 17,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cherubini:2009:CWP

[2098] A. Cherubini and A. Kisielewicz. Col-lapsing words, permutation conditionsand coherent colorings of trees. The-oretical Computer Science, 410(21–23):2135–2147, May 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Reidenbach:2009:MPW

[2099] Daniel Reidenbach and Johannes C.Schneider. Morphically primitivewords. Theoretical Computer Science,410(21–23):2148–2161, May 17, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 254

Liu:2009:CRT

[2100] Xingwu Liu, Zhiwei Xu, and JianzhongPan. Classifying rendezvous tasksof arbitrary dimension. TheoreticalComputer Science, 410(21–23):2162–2173, May 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Beimel:2009:MCA

[2101] Amos Beimel, Boaz Ben-Moshe,Yehuda Ben-Shimol, Paz Carmi, El-dad Chai, Itzik Kitroser, and EranOmri. Matrix columns allocation prob-lems. Theoretical Computer Science,410(21–23):2174–2183, May 17, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bourgeois:2009:EAM

[2102] N. Bourgeois, B. Escoffier, and V. Th.Paschos. Efficient approximation ofmin set cover. Theoretical ComputerScience, 410(21–23):2184–2195, May17, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Yu:2009:TMT

[2103] Changyuan Yu. Truthful mechanismsfor two-range-values variant of unre-lated scheduling. Theoretical Com-puter Science, 410(21–23):2196–2206,May 17, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Galatolo:2009:CBC

[2104] Stefano Galatolo, Mathieu Hoyrup,and Cristobal Rojas. A construc-tive Borel–Cantelli lemma. Construct-ing orbits with required statistical

properties. Theoretical Computer Sci-ence, 410(21–23):2207–2222, May 17,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Yi:2009:MSS

[2105] Chih-Wei Yi. Maximum scan statisticsand channel assignment problems inhomogeneous wireless networks. The-oretical Computer Science, 410(21–23):2223–2233, May 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Leveque:2009:CAG

[2106] Benjamin Leveque, Frederic Maffray,Bruce Reed, and Nicolas Trotignon.Coloring Artemis graphs. TheoreticalComputer Science, 410(21–23):2234–2240, May 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bockenhauer:2009:AHD

[2107] Hans-Joachim Bockenhauer, JoachimKneis, and Joachim Kupke. Approxi-mation hardness of deadline-TSP reop-timization. Theoretical Computer Sci-ence, 410(21–23):2241–2249, May 17,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Vagvolgyi:2009:DBT

[2108] Sandor Vagvolgyi. Deterministicbottom-up tree transducers and groundterm rewrite systems. TheoreticalComputer Science, 410(21–23):2250–2278, May 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 255

Martinez:2009:MDP

[2109] Conrado Martınez and Helmut Prodinger.Moves and displacements of particu-lar elements in Quicksort. TheoreticalComputer Science, 410(21–23):2279–2284, May 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zhao:2009:MAA

[2110] Shang-Wei Zhao and Xiao-Shan Gao.Minimal achievable approximation ra-tio for MAX-MQ in finite fields. The-oretical Computer Science, 410(21–23):2285–2290, May 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Tian:2009:BOA

[2111] Ji Tian, Ruyan Fu, and Jinjiang Yuan.A best online algorithm for schedulingon two parallel batch machines. The-oretical Computer Science, 410(21–23):2291–2294, May 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hoffmann:2009:FTS

[2112] Jan Hoffmann. Finding a tree structurein a resolution proof is NP-complete.Theoretical Computer Science, 410(21–23):2295–2300, May 17, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Anonymous:2009:Pd

[2113] Anonymous. Preface. TheoreticalComputer Science, 410(24–25):2301–2307, May 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Alhazov:2009:PCS

[2114] Artiom Alhazov, Ion Petre, andVladimir Rogojin. The parallel com-plexity of signed graphs: Decidabil-ity results and an improved algorithm.Theoretical Computer Science, 410(24–25):2308–2315, May 28, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Cai:2009:BSO

[2115] Ying Cai and Cunsheng Ding. Bi-nary sequences with optimal autocor-relation. Theoretical Computer Sci-ence, 410(24–25):2316–2322, May 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Calude:2009:TW

[2116] Cristian S. Calude, Helmut Jurgensen,and Ludwig Staiger. Topology onwords. Theoretical Computer Science,410(24–25):2323–2335, May 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Campeanu:2009:IRL

[2117] Cezar Campeanu and Nicolae San-tean. On the intersection of regex lan-guages with regular languages. Theo-retical Computer Science, 410(24–25):2336–2344, May 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cassaigne:2009:CFB

[2118] Julien Cassaigne, Juhani Karhumaki,and Petri Salmela. Conjugacy of fi-nite biprefix codes. Theoretical Com-puter Science, 410(24–25):2345–2351,May 28, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

REFERENCES 256

Cavaliere:2009:ASN

[2119] Matteo Cavaliere, Oscar H. Ibarra,Gheorghe Paun, Omer Egecioglu, Mi-hai Ionescu, and Sara Woodworth.Asynchronous spiking neural P sys-tems. Theoretical Computer Science,410(24–25):2352–2364, May 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Chen:2009:SMD

[2120] Shihyen Chen, Bin Ma, and KaizhongZhang. On the similarity metricand the distance metric. TheoreticalComputer Science, 410(24–25):2365–2376, May 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Domaratzki:2009:SCP

[2121] Michael Domaratzki and AlexanderOkhotin. State complexity of power.Theoretical Computer Science, 410(24–25):2377–2392, May 28, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Kari:2009:TRW

[2122] Lila Kari, Kalpana Mahalingam, andShinnosuke Seki. Twin-roots of wordsand their properties. Theoretical Com-puter Science, 410(24–25):2393–2400,May 28, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Krieger:2009:DLS

[2123] Dalia Krieger, Avery Miller, NaradRampersad, Bala Ravikumar, and Jef-frey Shallit. Decimations of lan-guages and state complexity. Theo-retical Computer Science, 410(24–25):

2401–2409, May 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Li:2009:TOP

[2124] Shuai Cheng Li and Ming Li. Ontwo open problems of 2-interval pat-terns. Theoretical Computer Science,410(24–25):2410–2423, May 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Paun:2009:HMT

[2125] Andrei Paun, Mihaela Paun, andAlfonso Rodrıguez-Paton. On theHopcroft’s minimization technique forDFA and DFCA. Theoretical Com-puter Science, 410(24–25):2424–2430,May 28, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Rampersad:2009:SCU

[2126] Narad Rampersad, Nicolae Santean,Jeffrey Shallit, and Bala Ravikumar.State complexity of unique rational op-erations. Theoretical Computer Sci-ence, 410(24–25):2431–2441, May 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Yen:2009:MEU

[2127] Hsu-Chun Yen and Chien-Liang Chen.On minimal elements of upward-closedsets. Theoretical Computer Science,410(24–25):2442–2452, May 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Rozenberg:2009:Pe

[2128] G. Rozenberg. Preface. Theoreti-cal Computer Science, 410(26):2453–2454, June 6, 2009. CODEN TC-

REFERENCES 257


Friedrich:2009:CSD

[2129] Tobias Friedrich, Nils Hebbinghaus,and Frank Neumann. Comparison ofsimple diversity mechanisms on plateaufunctions. Theoretical Computer Sci-ence, 410(26):2455–2462, June 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Jain:2009:NBC

[2130] Rahul Jain and Shengyu Zhang. Newbounds on classical and quantum one-way communication complexity. The-oretical Computer Science, 410(26):2463–2477, June 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zhang:2009:LGA

[2131] Xingyi Zhang, Xiangxiang Zeng, andLinqiang Pan. On languages gener-ated by asynchronous spiking neuralP systems. Theoretical Computer Sci-ence, 410(26):2478–2488, June 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Broadbent:2009:PQC

[2132] Anne Broadbent and Elham Kashefi.Parallelizing quantum circuits. The-oretical Computer Science, 410(26):2489–2510, June 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Sudholt:2009:IPM

[2133] Dirk Sudholt. The impact ofparametrization in memetic evolution-ary algorithms. Theoretical ComputerScience, 410(26):2511–2528, June 6,


Li:2009:NQS

[2134] Lvzhou Li and Daowen Qiu. A note onquantum sequential machines. Theoret-ical Computer Science, 410(26):2529–2535, June 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2009:Pe

[2135] Anonymous. Preface. Theoretical Com-puter Science, 410(26):i–vi, June 6,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Han:2009:SCB

[2136] Yo-Sub Han and Kai Salomaa. Statecomplexity of basic operations onsuffix-free regular languages. Theo-retical Computer Science, 410(27–29):2537–2548, June 28, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Berenbrink:2009:EER

[2137] Petra Berenbrink, Colin Cooper, andZengjian Hu. Energy efficient ran-domised communication in unknownAdHoc networks. Theoretical Com-puter Science, 410(27–29):2549–2561,June 28, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Jain:2009:OSL

[2138] Sanjay Jain and Efim Kinber. One-shot learners using negative counterex-amples and nearest positive examples.Theoretical Computer Science, 410(27–29):2562–2580, June 28, 2009. CODEN

REFERENCES 258


Su:2009:NHA

[2139] Chi-Shiang Su, Jason Chao-Hsien Pan,and Tsung-Shin Hsu. A new heuris-tic algorithm for the machine schedul-ing problem with job delivery coordi-nation. Theoretical Computer Science,410(27–29):2581–2591, June 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Thakur:2009:LCP

[2140] Mayur Thakur and Rahul Tripathi.Linear connectivity problems in di-rected hypergraphs. Theoretical Com-puter Science, 410(27–29):2592–2618,June 28, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Wu:2009:OTS

[2141] Weiwei Wu, Minming Li, and EnhongChen. Optimal tree structures forgroup key tree management consider-ing insertion and deletion cost. Theo-retical Computer Science, 410(27–29):2619–2631, June 28, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Park:2009:CMP

[2142] Jung-Heum Park and Sang HyukSon. Conditional matching preclusionfor hypercube-like interconnection net-works. Theoretical Computer Science,410(27–29):2632–2640, June 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Chen:2009:PET

[2143] Jianer Chen, Iyad A. Kanj, and Ge Xia.On parameterized exponential timecomplexity. Theoretical Computer Sci-ence, 410(27–29):2641–2648, June 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Harvey:2009:CFT

[2144] David Harvey. A cache-friendly trun-cated FFT. Theoretical Computer Sci-ence, 410(27–29):2649–2658, June 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Garg:2009:IPG

[2145] Sanchit Garg and Eric Schost. In-terpolation of polynomials given bystraight-line programs. TheoreticalComputer Science, 410(27–29):2659–2662, June 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fu:2009:EIF

[2146] Bin Fu, Yumei Huo, and Hairong Zhao.Exponential inapproximability and FP-TAS for scheduling with availabilityconstraints. Theoretical Computer Sci-ence, 410(27–29):2663–2674, June 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hong:2009:CRS

[2147] Soonjo Hong and Sujin Shin. Cyclic re-newal systems. Theoretical ComputerScience, 410(27–29):2675–2684, June28, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

REFERENCES 259

Lasserre:2009:PPA

[2148] Jean B. Lasserre, Monique Laurent,and Philipp Rostalski. A prolongation–projection algorithm for computing thefinite real variety of an ideal. Theo-retical Computer Science, 410(27–29):2685–2700, June 28, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

DeCarli:2009:LLT

[2149] F. De Carli, A. Frosini, S. Rinaldi,and A. Sorbi. Lattices of local two-dimensional languages. TheoreticalComputer Science, 410(27–29):2701–2713, June 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chang:2009:SM

[2150] Ching-Lueh Chang and Yuh-DauhLyuu. Spreading messages. Theo-retical Computer Science, 410(27–29):2714–2724, June 28, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Diaz:2009:BCA

[2151] Josep Diaz, Fabrizio Grandoni, and Al-berto Marchetti Spaccamela. Balancedcut approximation in random geomet-ric graphs. Theoretical Computer Sci-ence, 410(27–29):2725–2731, June 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cao:2009:PPB

[2152] Zhigang Cao and Xiaoguang Yang.A PTAS for parallel batch schedul-ing with rejection and dynamic job ar-rivals. Theoretical Computer Science,410(27–29):2732–2745, June 28, 2009.


Liu:2009:PCC

[2153] Hong Liu, Haodi Feng, Daming Zhu,and Junfeng Luan. Parameterized com-putational complexity of control prob-lems in voting systems. TheoreticalComputer Science, 410(27–29):2746–2753, June 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kashan:2009:NMM

[2154] Ali Husseinzadeh Kashan, BehroozKarimi, and S. M. T. Fatemi Ghomi.A note on minimizing makespan on asingle batch processing machine withnonidentical job sizes. TheoreticalComputer Science, 410(27–29):2754–2758, June 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Sakai:2009:CLT

[2155] Yoshifumi Sakai. Computing thelongest topological common subse-quence of a symbol-wise totally or-dered directed acyclic graph and a se-quence. Theoretical Computer Science,410(27–29):2759–2766, June 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ollinger:2009:APV

[2156] N. Ollinger and G. Richard. Automataon the plane vs particles and colli-sions. Theoretical Computer Science,410(27–29):2767–2773, June 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 260

Rhodes:2009:CRP

[2157] Mark Rhodes. On the Chvatal rankof the Pigeonhole Principle. Theo-retical Computer Science, 410(27–29):2774–2778, June 28, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Balkova:2009:NSR

[2158] L’ubomıra Balkova and Edita Pelan-tova. A note on symmetries in theRauzy graph and factor frequencies.Theoretical Computer Science, 410(27–29):2779–2783, June 28, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Anonymous:2009:EBb

[2159] Anonymous. Editorial board. Theo-retical Computer Science, 410(27–29):i–vi, June 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2009:Pf

[2160] Anonymous. Preface. TheoreticalComputer Science, 410(30–32):2785–2794, August 20, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Allouche:2009:PRO

[2161] Jean-Paul Allouche, Narad Ramper-sad, and Jeffrey Shallit. Periodic-ity, repetitions, and orbits of an au-tomatic sequence. Theoretical Com-puter Science, 410(30–32):2795–2803,August 20, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Baturo:2009:CSM

[2162] Pawe l Baturo and Wojciech Rytter.Compressed string-matching in stan-dard Sturmian words. TheoreticalComputer Science, 410(30–32):2804–2810, August 20, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Berstel:2009:CPW

[2163] Jean Berstel, Luc Boasson, and OlivierCarton. Continuant polynomials andworst-case behavior of Hopcroft’s min-imization algorithm. Theoretical Com-puter Science, 410(30–32):2811–2822,August 20, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Blondel:2009:NPF

[2164] Vincent D. Blondel, Julien Cassaigne,and Raphael M. Jungers. On thenumber of α-power-free binary wordsfor 2 < α ≤ 7/3. TheoreticalComputer Science, 410(30–32):2823–2833, August 20, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bu:2009:FCS

[2165] Dongbo Bu, Ming Li, Shuai Cheng Li,Jianbo Qian, and Jinbo Xu. Find-ing compact structural motifs. Theo-retical Computer Science, 410(30–32):2834–2839, August 20, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Bucci:2009:CMG

[2166] Michelangelo Bucci, Aldo de Luca,and Alessandro De Luca. Character-istic morphisms of generalized epistur-

REFERENCES 261

mian words. Theoretical Computer Sci-ence, 410(30–32):2840–2859, August20, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Bucci:2009:NCP

[2167] Michelangelo Bucci, Alessandro DeLuca, Amy Glen, and Luca Q. Zam-boni. A new characteristic prop-erty of rich words. Theoretical Com-puter Science, 410(30–32):2860–2863,August 20, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bugeaud:2009:SSR

[2168] Yann Bugeaud, Christophe Reutenauer,and Samir Siksek. A Sturmian se-quence related to the uniqueness con-jecture for Markoff numbers. Theo-retical Computer Science, 410(30–32):2864–2869, August 20, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Choffrut:2009:ELL

[2169] Christian Choffrut and Serge Grigori-eff. The “equal last letter” predicatefor words on infinite alphabets andclasses of multitape automata. Theo-retical Computer Science, 410(30–32):2870–2884, August 20, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Currie:2009:DCH

[2170] James Currie and Narad Rampersad.Dejean’s conjecture holds for n ≥30. Theoretical Computer Science, 410(30–32):2885–2888, August 20, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Czeizler:2009:SWE

[2171] Elena Czeizler and Wojciech Plandowski.On systems of word equations overthree unknowns with at most six occur-rences of one of the unknowns. Theo-retical Computer Science, 410(30–32):2889–2909, August 20, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Dassow:2009:SOP

[2172] Jurgen Dassow, Gema M. Martın, andFrancisco J. Vico. Some operationspreserving primitivity of words. The-oretical Computer Science, 410(30–32):2910–2919, August 20, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Diaz:2009:STF

[2173] J. Dıaz, L. Kirousis, D. Mitsche, andX. Perez-Gimenez. On the satis-fiability threshold of formulas withthree literals per clause. TheoreticalComputer Science, 410(30–32):2920–2934, August 20, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Diekert:2009:SRA

[2174] Volker Diekert and Dalia Krieger. Someremarks about stabilizers. TheoreticalComputer Science, 410(30–32):2935–2946, August 20, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Frid:2009:SEB

[2175] A. E. Frid. Simple equations on bi-nary factorial languages. TheoreticalComputer Science, 410(30–32):2947–2956, August 20, 2009. CODEN TC-

REFERENCES 262


Halava:2009:PCP

[2176] Vesa Halava, Jarkko Kari, and YuriMatiyasevich. On post correspon-dence problem for letter monotoniclanguages. Theoretical Computer Sci-ence, 410(30–32):2957–2960, August20, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Han:2009:NSC

[2177] Yo-Sub Han and Kai Salomaa. Nonde-terministic state complexity of nestedword automata. Theoretical Com-puter Science, 410(30–32):2961–2971,August 20, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hromkovic:2009:LCC

[2178] Juraj Hromkovic, Holger Petersen, andGeorg Schnitger. On the limits ofthe communication complexity tech-nique for proving lower bounds on thesize of minimal NFA’s. TheoreticalComputer Science, 410(30–32):2972–2981, August 20, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ibarra:2009:SSS

[2179] Oscar H. Ibarra, Andrei Paun, andAlfonso Rodrıguez-Paton. SequentialSNP systems based on min/max spikenumber. Theoretical Computer Sci-ence, 410(30–32):2982–2991, August20, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Mikhailova:2009:PAP

[2180] I. A. Mikhailova and M. V. Volkov.Pattern avoidance by palindromes.Theoretical Computer Science, 410(30–32):2992–2998, August 20, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Nicolas:2009:ECM

[2181] Francois Nicolas, Veli Makinen, andEsko Ukkonen. Efficient constructionof maximal and minimal representa-tions of motifs of a string. TheoreticalComputer Science, 410(30–32):2999–3005, August 20, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Qiu:2009:HEM

[2182] Daowen Qiu and Sheng Yu. Hier-archy and equivalence of multi-letterquantum finite automata. TheoreticalComputer Science, 410(30–32):3006–3017, August 20, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Restivo:2009:BWT

[2183] Antonio Restivo and Giovanna Rosone.Burrows–Wheeler transform and palin-dromic richness. Theoretical Com-puter Science, 410(30–32):3018–3026,August 20, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Tijdeman:2009:FWW

[2184] R. Tijdeman and L. Q. Zamboni. Fineand Wilf words for any periods II. The-oretical Computer Science, 410(30–32):3027–3034, August 20, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 263

Anonymous:2009:EBc

[2185] Anonymous. Editorial board. Theo-retical Computer Science, 410(30–32):i–vi, August 20, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Anonymous:2009:JKC

[2186] Anonymous. Juhani Karhumaki with acapercaillie. Theoretical Computer Sci-ence, 410(30–32):xi, August 20, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Rozenberg:2009:Pf

[2187] G. Rozenberg. Preface. TheoreticalComputer Science, 410(33–34):3035–3036, August 21, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cannata:2009:P

[2188] Nicola Cannata and Emanuela Merelli.Preface. Theoretical Computer Sci-ence, 410(33–34):3037–3038, August21, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Versari:2009:SBM

[2189] Cristian Versari and Nadia Busi.Stochastic biological modelling in thepresence of multiple compartments.Theoretical Computer Science, 410(33–34):3039–3064, August 21, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ciocchetta:2009:BPF

[2190] Federica Ciocchetta and Jane Hill-ston. Bio-PEPA: A framework for

the modelling and analysis of biologi-cal systems. Theoretical Computer Sci-ence, 410(33–34):3065–3084, August21, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Barbuti:2009:ILS

[2191] Roberto Barbuti, Giulio Caravagna,Andrea Maggiolo-Schettini, and PaoloMilazzo. An intermediate languagefor the stochastic simulation of bi-ological systems. Theoretical Com-puter Science, 410(33–34):3085–3109,August 21, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bodei:2009:CFA

[2192] Chiara Bodei. A Control Flow Anal-ysis for Beta-binders with and with-out static compartments. TheoreticalComputer Science, 410(33–34):3110–3127, August 21, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Barnat:2009:AAT

[2193] J. Barnat, L. Brim, I. Cerna, S. Drazan,J. Fabrikova, and D. Safranek. On algo-rithmic analysis of transcriptional reg-ulation by LTL model checking. The-oretical Computer Science, 410(33–34):3128–3148, August 21, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Bartocci:2009:MSC

[2194] E. Bartocci, F. Corradini, M. R. DiBerardini, E. Entcheva, S. A. Smolka,and R. Grosu. Modeling and sim-ulation of cardiac tissue using hy-brid I/O automata. Theoretical Com-

REFERENCES 264

puter Science, 410(33–34):3149–3165,August 21, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Cardelli:2009:PMR

[2195] Luca Cardelli, Emmanuelle Caron,Philippa Gardner, Ozan Kahra-manogulları, and Andrew Phillips. Aprocess model of Rho GTP-bindingproteins. Theoretical Computer Sci-ence, 410(33–34):3166–3185, August21, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Anonymous:2009:Pg

[2196] Anonymous. Preface. Theoretical Com-puter Science, 410(33–34):i–vi, August21, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Campeanu:2009:P

[2197] Cezar Campeanu and Giovanni Pighizzini.Preface. Theoretical Computer Sci-ence, 410(35):3187, August 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Alhazov:2009:SCC

[2198] Artiom Alhazov, Erzsebet Csuhaj-Varju, Carlos Martın-Vide, and YuriiRogozhin. On the size of compu-tationally complete hybrid networksof evolutionary processors. Theoret-ical Computer Science, 410(35):3188–3197, August 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Biegler:2009:SDD

[2199] Franziska Biegler and Kai Salomaa.On the synchronized derivation depthof context-free grammars. Theoreti-cal Computer Science, 410(35):3198–3208, August 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bordihn:2009:DFA

[2200] Henning Bordihn, Markus Holzer, andMartin Kutrib. Determination of fi-nite automata accepting subregularlanguages. Theoretical Computer Sci-ence, 410(35):3209–3222, August 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Brzozowski:2009:SCH

[2201] Janusz Brzozowski and Stavros Kon-stantinidis. State-complexity hierar-chies of uniform languages of alphabet-size length. Theoretical Computer Sci-ence, 410(35):3223–3235, August 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Brzozowski:2009:PS

[2202] Janusz Brzozowski and Nicolae San-tean. Predictable semiautomata. The-oretical Computer Science, 410(35):3236–3249, August 28, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Czeizler:2009:DCW

[2203] Elena Czeizler, Eugen Czeizler, LilaKari, and Kai Salomaa. On the de-scriptional complexity of Watson–Crickautomata. Theoretical Computer Sci-ence, 410(35):3250–3260, August 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 265

Dassow:2009:TCH

[2204] Jurgen Dassow, Ralf Stiebe, andBianca Truthe. Two collapsing hier-archies of subregularly tree controlledlanguages. Theoretical Computer Sci-ence, 410(35):3261–3271, August 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Esik:2009:ESC

[2205] Zoltan Esik, Yuan Gao, Guangwu Liu,and Sheng Yu. Estimation of state com-plexity of combined operations. The-oretical Computer Science, 410(35):3272–3280, August 28, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Gruber:2009:LOR

[2206] Hermann Gruber and Markus Holzer.Language operations with regular ex-pressions of polynomial size. Theoret-ical Computer Science, 410(35):3281–3289, August 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Piao:2009:OSC

[2207] Xiaoxue Piao and Kai Salomaa. Opera-tional state complexity of nested wordautomata. Theoretical Computer Sci-ence, 410(35):3290–3302, August 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Mavronicolas:2009:P

[2208] Marios Mavronicolas. Preface. Theoret-ical Computer Science, 410(36):3303–3304, August 31, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fotakis:2009:SCN

[2209] Dimitris Fotakis, Spyros Kontogiannis,Elias Koutsoupias, Marios Mavronico-las, and Paul Spirakis. The struc-ture and complexity of Nash equilib-ria for a selfish routing game. Theoret-ical Computer Science, 410(36):3305–3326, August 31, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Christodoulou:2009:CM

[2210] George Christodoulou, Elias Koutsou-pias, and Akash Nanavati. Coordi-nation mechanisms. Theoretical Com-puter Science, 410(36):3327–3336, Au-gust 31, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Busch:2009:ARG

[2211] Costas Busch and Malik Magdon-Ismail. Atomic routing games on max-imum congestion. Theoretical Com-puter Science, 410(36):3337–3347, Au-gust 31, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Auletta:2009:DTM

[2212] Vincenzo Auletta, Roberto De Prisco,Paolo Penna, and Giuseppe Persiano.On designing truthful mechanisms foronline scheduling. Theoretical Com-puter Science, 410(36):3348–3356, Au-gust 31, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Fischer:2009:ARS

[2213] Simon Fischer and Berthold Vocking.Adaptive routing with stale informa-tion. Theoretical Computer Science,

REFERENCES 266

410(36):3357–3371, August 31, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Chitturi:2009:UBS

[2214] B. Chitturi, W. Fahle, Z. Meng,L. Morales, C. O. Shields, I. H. Sud-borough, and W. Voit. An (18/11)nupper bound for sorting by prefix re-versals. Theoretical Computer Science,410(36):3372–3390, August 31, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Kutylowski:2009:OSM

[2215] Jaros law Kuty lowski and Fried-helm Meyer auf der Heide. Optimalstrategies for maintaining a chain ofrelays between an explorer and a basecamp. Theoretical Computer Science,410(36):3391–3405, August 31, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ausiello:2009:SSS

[2216] Giorgio Ausiello, Paolo G. Franciosa,and Giuseppe F. Italiano. Small stretch(α, β)-spanners in the streaming model.Theoretical Computer Science, 410(36):3406–3413, August 31, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Elsasser:2009:RRR

[2217] R. Elsasser and T. Sauerwald. Onthe runtime and robustness of random-ized broadcasting. Theoretical Com-puter Science, 410(36):3414–3427, Au-gust 31, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Bockenhauer:2009:RST

[2218] Hans-Joachim Bockenhauer, JurajHromkovic, Richard Kralovic, TobiasMomke, and Peter Rossmanith. Re-optimization of Steiner trees: Chang-ing the terminal set. Theoretical Com-puter Science, 410(36):3428–3435, Au-gust 31, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Holub:2009:P

[2219] Jan Holub. Preface. Theoretical Com-puter Science, 410(37):3437, Septem-ber 1, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Salomaa:2009:DDC

[2220] Kai Salomaa, Sheng Yu, and JinfengZan. Deciding determinism of caterpil-lar expressions. Theoretical ComputerScience, 410(37):3438–3446, September1, 2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kutrib:2009:RNP

[2221] Martin Kutrib, Andreas Malcher, andLarissa Werlein. Regulated nondeter-minism in pushdown automata. The-oretical Computer Science, 410(37):3447–3460, September 1, 2009. CO-DEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ackerman:2009:EEW

[2222] Margareta Ackerman and Jeffrey Shal-lit. Efficient enumeration of wordsin regular languages. TheoreticalComputer Science, 410(37):3461–3470,September 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 267

Crochemore:2009:NCS

[2223] M. Crochemore, C. Epifanio, A. Gabriele,and F. Mignosi. From Nerode’s con-gruence to suffix automata with mis-matches. Theoretical Computer Sci-ence, 410(37):3471–3480, September 1,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Droste:2009:WAW

[2224] Manfred Droste and George Raho-nis. Weighted automata and weightedlogics with discounting. TheoreticalComputer Science, 410(37):3481–3494,September 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Steinby:2009:DSD

[2225] Magnus Steinby and Catalin IonutTırnauca. Defining syntax-directedtranslations by tree bimorphisms. The-oretical Computer Science, 410(37):3495–3503, September 1, 2009. CO-DEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Jonoska:2009:FSA

[2226] Natasa Jonoska and Joni B. Pirnot. Fi-nite state automata representing two-dimensional subshifts. TheoreticalComputer Science, 410(37):3504–3512,September 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Volkov:2009:SAP

[2227] M. V. Volkov. Synchronizing au-tomata preserving a chain of partialorders. Theoretical Computer Science,410(37):3513–3519, September 1, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Anselmo:2009:CMT

[2228] Marcella Anselmo, Dora Giammarresi,and Maria Madonia. A computa-tional model for tiling recognizabletwo-dimensional languages. Theoret-ical Computer Science, 410(37):3520–3529, September 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Mraz:2009:DWE

[2229] F. Mraz, F. Otto, and M. Platek. Thedegree of word-expansion of lexical-ized RRWW-automata — A new mea-sure for the degree of nondeterminismof (context-free) languages. Theoret-ical Computer Science, 410(37):3530–3538, September 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hogberg:2009:BFB

[2230] Johanna Hogberg, Andreas Maletti,and Jonathan May. Backward and for-ward bisimulation minimization of treeautomata. Theoretical Computer Sci-ence, 410(37):3539–3552, September 1,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Mohri:2009:GSA

[2231] Mehryar Mohri, Pedro Moreno, andEugene Weinstein. General suffix au-tomaton construction algorithm andspace bounds. Theoretical ComputerScience, 410(37):3553–3562, September1, 2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Klein:2009:ABM

[2232] Shmuel T. Klein and Miri Kopel Ben-Nissan. Accelerating Boyer–Moore

REFERENCES 268

searches on binary texts. Theoreti-cal Computer Science, 410(37):3563–3571, September 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Moshe:2009:JSC

[2233] Yossi Moshe. On the joint subwordcomplexity of automatic sequences.Theoretical Computer Science, 410(38–40):3573–3588, September 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Masakova:2009:RBP

[2234] Z. Masakova and E. Pelantova. Re-lation between powers of factors andthe recurrence function characterizingSturmian words. Theoretical Com-puter Science, 410(38–40):3589–3596,September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zhang:2009:OPM

[2235] An Zhang, Yiwei Jiang, and ZhiyiTan. Online parallel machines schedul-ing with two hierarchies. TheoreticalComputer Science, 410(38–40):3597–3605, September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Muller:2009:CHL

[2236] Johannes Muller and ChristophSpandl. A Curtis–Hedlund–Lyndontheorem for Besicovitch and Weylspaces. Theoretical Computer Science,410(38–40):3606–3615, September 6,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Mishna:2009:TNH

[2237] Marni Mishna and Andrew Rechnitzer.Two non-holonomic lattice walks inthe quarter plane. Theoretical Com-puter Science, 410(38–40):3616–3630,September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bein:2009:OCL

[2238] Wolfgang Bein, Leah Epstein, Lawrence L.Larmore, and John Noga. Optimallycompetitive list batching. TheoreticalComputer Science, 410(38–40):3631–3639, September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Komusiewicz:2009:ICE

[2239] Christian Komusiewicz, Falk Huffner,Hannes Moser, and Rolf Niedermeier.Isolation concepts for efficiently enu-merating dense subgraphs. TheoreticalComputer Science, 410(38–40):3640–3654, September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Uscka-Wehlou:2009:TER

[2240] Hanna Uscka-Wehlou. Two equivalencerelations on digital lines with irrationalslopes. A continued fraction approachto upper mechanical words. TheoreticalComputer Science, 410(38–40):3655–3669, September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jungers:2009:OFW

[2241] Raphael M. Jungers, Vladimir Y.Protasov, and Vincent D. Blondel.

REFERENCES 269

Overlap-free words and spectra of ma-trices. Theoretical Computer Science,410(38–40):3670–3684, September 6,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Acerbi:2009:CSD

[2242] Luigi Acerbi, Alberto Dennunzio, andEnrico Formenti. Conservation of somedynamical properties for operations oncellular automata. Theoretical Com-puter Science, 410(38–40):3685–3693,September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dorrigiv:2009:RDP

[2243] Reza Dorrigiv, Alejandro Lopez-Ortiz,and J. Ian Munro. On the rela-tive dominance of paging algorithms.Theoretical Computer Science, 410(38–40):3694–3701, September 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Hasunuma:2009:LT

[2244] Toru Hasunuma, Toshimasa Ishii, Hiro-taka Ono, and Yushi Uno. An O(n1.75)L(2, 1)-labeling of trees. TheoreticalComputer Science, 410(38–40):3702–3710, September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Biegler:2009:USW

[2245] Franziska Biegler, Mark Daley, MarkusHolzer, and Ian McQuillan. On theuniqueness of shuffle on words andfinite languages. Theoretical Com-puter Science, 410(38–40):3711–3724,September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Levi:2009:ACO

[2246] Tamir Levi and Ami Litman. Acceler-ating certain outputs of merging andsorting networks. Theoretical Com-puter Science, 410(38–40):3725–3732,September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kowalik:2009:IEC

[2247] Lukasz Kowalik. Improved edge-coloring with three colors. TheoreticalComputer Science, 410(38–40):3733–3742, September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Foata:2009:NPC

[2248] Dominique Foata and Guo-Niu Han.New permutation coding and equidis-tribution of set-valued statistics. The-oretical Computer Science, 410(38–40):3743–3750, September 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Amini:2009:HAT

[2249] Omid Amini, Stephane Perennes, andIgnasi Sau. Hardness and approxima-tion of traffic grooming. TheoreticalComputer Science, 410(38–40):3751–3760, September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ji:2009:PMS

[2250] Min Ji and T. C. E. Cheng. Parallel-machine scheduling of simple lineardeteriorating jobs. Theoretical Com-puter Science, 410(38–40):3761–3768,September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 270

Jiang:2009:SNT

[2251] Tao Jiang, Zevi Miller, and Dan Pri-tikin. Separation numbers of trees.Theoretical Computer Science, 410(38–40):3769–3781, September 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Paquin:2009:GCW

[2252] Genevieve Paquin. On a generaliza-tion of Christoffel words: epichristoffelwords. Theoretical Computer Science,410(38–40):3782–3791, September 6,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Augustine:2009:SPP

[2253] John Augustine, Sudarshan Banerjee,and Sandy Irani. Strip packing withprecedence constraints and strip pack-ing with release times. TheoreticalComputer Science, 410(38–40):3792–3803, September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Liu:2009:PAU

[2254] Zi-Long Liu, Fang Tian, and Jun-Ming Xu. Probabilistic analysis of up-per bounds for 2-connected distance k-dominating sets in graphs. TheoreticalComputer Science, 410(38–40):3804–3813, September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hermann:2009:CCO

[2255] Miki Hermann and Reinhard Pichler.Complexity of counting the optimal so-lutions. Theoretical Computer Science,410(38–40):3814–3825, September 6,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Wittmann:2009:RGB

[2256] Dominik M. Wittmann, Daniel Schmidl,Florian Blochl, and Fabian J. Theis.Reconstruction of graphs based on ran-dom walks. Theoretical Computer Sci-ence, 410(38–40):3826–3838, Septem-ber 6, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Beyersdorff:2009:NFE

[2257] Olaf Beyersdorff, Johannes Kobler, andJochen Messner. Nondeterministicfunctions and the existence of opti-mal proof systems. Theoretical Com-puter Science, 410(38–40):3839–3855,September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Jonsson:2009:HCS

[2258] Peter Jonsson, Andrei Krokhin, andFredrik Kuivinen. Hard constraint sat-isfaction problems have hard gaps atlocation 1. Theoretical Computer Sci-ence, 410(38–40):3856–3874, Septem-ber 6, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Liu:2009:OSU

[2259] Ming Liu, Chengbin Chu, Yinfeng Xu,and Feifeng Zheng. Online schedul-ing on m uniform machines to mini-mize total (weighted) completion time.Theoretical Computer Science, 410(38–40):3875–3881, September 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Hua:2009:SMC

[2260] Qiang-Sheng Hua, Yuexuan Wang,Dongxiao Yu, and Francis C. M.

REFERENCES 271

Lau. Set multi-covering via inclusion–exclusion. Theoretical Computer Sci-ence, 410(38–40):3882–3892, Septem-ber 6, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Keranen:2009:PAS

[2261] Veikko Keranen. A powerful abeliansquare-free substitution over 4 letters.Theoretical Computer Science, 410(38–40):3893–3900, September 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Greco:2009:CCN

[2262] Gianluigi Greco and Francesco Scar-cello. On the complexity of con-strained Nash equilibria in graphicalgames. Theoretical Computer Science,410(38–40):3901–3924, September 6,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Biskup:2009:SSS

[2263] Marek Tomasz Biskup and WojciechPlandowski. Shortest synchronizingstrings for Huffman codes. TheoreticalComputer Science, 410(38–40):3925–3941, September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Liu:2009:FAF

[2264] J. J. Liu, G. S. Huang, and Y. L.Wang. A fast algorithm for find-ing the positions of all squares in arun-length encoded string. TheoreticalComputer Science, 410(38–40):3942–3948, September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bulatov:2009:CWB

[2265] Andrei Bulatov, Martin Dyer, Leslie AnnGoldberg, Markus Jalsenius, and DavidRicherby. The complexity of weightedBoolean #CSP with mixed signs. The-oretical Computer Science, 410(38–40):3949–3961, September 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Dennunzio:2009:SAC

[2266] Alberto Dennunzio, Pierre Guillon, andBenoıt Masson. Sand automata ascellular automata. Theoretical Com-puter Science, 410(38–40):3962–3974,September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lee:2009:OST

[2267] Kangbok Lee, Joseph Y.-T. Leung, andMichael L. Pinedo. Online schedulingon two uniform machines subject to el-igibility constraints. Theoretical Com-puter Science, 410(38–40):3975–3981,September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Mathissen:2009:EMT

[2268] Christian Mathissen. Existential MSOover two successors is strictly weakerthan over linear orders. TheoreticalComputer Science, 410(38–40):3982–3987, September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Morizumi:2009:LNN

[2269] Hiroki Morizumi. Limiting negations innon-deterministic circuits. Theoretical

REFERENCES 272

Computer Science, 410(38–40):3988–3994, September 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Erdelyi:2009:GJN

[2270] Gabor Erdelyi, Lane A. Hemas-paandra, Jorg Rothe, and HolgerSpakowski. Generalized juntas and NP-hard sets. Theoretical Computer Sci-ence, 410(38–40):3995–4000, Septem-ber 6, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Carbone:2009:FFM

[2271] Marco Carbone, Pawe l Sobocinski,and Frank D. Valencia. Foreword:Festschrift for Mogens Nielsen’s 60thbirthday. Theoretical Computer Sci-ence, 410(41):4001–4005, September15, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Beauxis:2009:PNA

[2272] Romain Beauxis and Catuscia Palami-dessi. Probabilistic and nondetermin-istic aspects of anonymity. TheoreticalComputer Science, 410(41):4006–4025,September 15, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Benes:2009:DMT

[2273] N. Benes, J. Kretınsky, K. G. Larsen,and J. Srba. On determinism inmodal transition systems. TheoreticalComputer Science, 410(41):4026–4043,September 15, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bonchi:2009:RSS

[2274] Filippo Bonchi and Ugo Montanari.Reactive systems, (semi-)saturated se-mantics and coalgebras on presheaves.Theoretical Computer Science, 410(41):4044–4066, September 15, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

ElSalamouny:2009:AED

[2275] Ehab ElSalamouny, Karl TikjøbKrukow, and Vladimiro Sassone. Ananalysis of the exponential decay prin-ciple in probabilistic trust models.Theoretical Computer Science, 410(41):4067–4084, September 15, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Frandsen:2009:DMR

[2276] Gudmund Skovbjerg Frandsen and Pe-ter Frands Frandsen. Dynamic ma-trix rank. Theoretical Computer Sci-ence, 410(41):4085–4093, September15, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Gazagnaire:2009:CMS

[2277] Thomas Gazagnaire, Blaise Genest,Loıc Helouet, P. S. Thiagarajan, andShaofa Yang. Causal Message Se-quence Charts. Theoretical ComputerScience, 410(41):4094–4110, September15, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

vanGlabbeek:2009:CSE

[2278] R. J. van Glabbeek and G. D. Plotkin.Configuration structures, event struc-tures and Petri nets. Theoretical

REFERENCES 273

Computer Science, 410(41):4111–4159,September 15, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Winskel:2009:PA

[2279] Glynn Winskel. Prime algebraic-ity. Theoretical Computer Science, 410(41):4160–4168, September 15, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Chadha:2009:DBT

[2280] Rohit Chadha and Mahesh Viswanathan.Deciding branching time properties forasynchronous programs. TheoreticalComputer Science, 410(42):4169–4179,September 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Niebert:2009:EMC

[2281] Peter Niebert and Doron Peled. Ef-ficient model checking for LTL withpartial order snapshots. TheoreticalComputer Science, 410(42):4180–4189,September 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Colson:2009:PSO

[2282] Loıc Colson and David Michel. Peda-gogical second-order λ-calculus. The-oretical Computer Science, 410(42):4190–4203, September 28, 2009. CO-DEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

David:2009:DPC

[2283] Rene David. A direct proof of theconfluence of combinatory strong re-duction. Theoretical Computer Sci-ence, 410(42):4204–4215, September

28, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Preoteasa:2009:FRM

[2284] Viorel Preoteasa. Frame rule for mu-tually recursive procedures manipulat-ing pointers. Theoretical ComputerScience, 410(42):4216–4233, September28, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Mao:2009:MCP

[2285] Xuxin Mao and Luoshan Xu. Meet con-tinuity properties of posets. TheoreticalComputer Science, 410(42):4234–4240,September 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hadjidj:2009:FTM

[2286] Rachid Hadjidj and Hanifa Bouch-eneb. On-the-fly TCTL model check-ing for time Petri nets. TheoreticalComputer Science, 410(42):4241–4261,September 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Fainekos:2009:RTL

[2287] Georgios E. Fainekos and George J.Pappas. Robustness of temporallogic specifications for continuous-timesignals. Theoretical Computer Sci-ence, 410(42):4262–4291, September28, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Iliopoulos:2009:FSI

[2288] Costas Iliopoulos and Wojciech Ryt-ter. Foreword: Special issue in honor

REFERENCES 274

of the 60th birthday of Prof. MaximeCrochemore. Theoretical ComputerScience, 410(43):4293–4294, October 6,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Smyth:2009:NAP

[2289] W. F. Smyth and Shu Wang. A newapproach to the periodicity lemma onstrings with holes. Theoretical Com-puter Science, 410(43):4295–4302, Oc-tober 6, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Mozes:2009:FAC

[2290] Shay Mozes, Dekel Tsur, OrenWeimann, and Michal Ziv-Ukelson.Fast algorithms for computing treeLCS. Theoretical Computer Science,410(43):4303–4314, October 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Kapah:2009:IRE

[2291] Oren Kapah, Gad M. Landau, AvivitLevy, and Nitsan Oz. Interchange re-arrangement: The element-cost model.Theoretical Computer Science, 410(43):4315–4326, October 6, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Battaglia:2009:MPS

[2292] Giovanni Battaglia, Davide Cangelosi,Roberto Grossi, and Nadia Pisanti.Masking patterns in sequences: A newclass of motif discovery with don’tcares. Theoretical Computer Science,410(43):4327–4340, October 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ukkonen:2009:MMR

[2293] Esko Ukkonen. Maximal and mini-mal representations of gapped and non-gapped motifs of a string. Theoret-ical Computer Science, 410(43):4341–4349, October 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Salson:2009:FSA

[2294] M. Salson, T. Lecroq, M. Leonard, andL. Mouchard. A four-stage algorithmfor updating a Burrows–Wheeler trans-form. Theoretical Computer Science,410(43):4350–4359, October 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Apostolico:2009:SCS

[2295] Alberto Apostolico and Fabio Cunial.The subsequence composition of astring. Theoretical Computer Science,410(43):4360–4371, October 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Castiglione:2009:CSW

[2296] G. Castiglione, A. Restivo, andM. Sciortino. Circular Sturmian wordsand Hopcroft’s algorithm. Theoreti-cal Computer Science, 410(43):4372–4381, October 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Amir:2009:ECR

[2297] Amihood Amir, Yonatan Aumann, Pi-otr Indyk, Avivit Levy, and Ely Po-rat. Efficient computations of `1 and`∞ rearrangement distances. Theoret-ical Computer Science, 410(43):4382–4390, October 6, 2009. CODEN TC-

REFERENCES 275


Federico:2009:STC

[2298] Maria Federico and Nadia Pisanti. Suf-fix tree characterization of maximalmotifs in biological sequences. Theoret-ical Computer Science, 410(43):4391–4401, October 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Lee:2009:DRS

[2299] Sunho Lee and Kunsoo Park. Dy-namic rank/select structures with ap-plications to run-length encoded texts.Theoretical Computer Science, 410(43):4402–4413, October 6, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Gonzalez:2009:RSD

[2300] Rodrigo Gonzalez and Gonzalo Navarro.Rank/select on dynamic compressedsequences and applications. Theoret-ical Computer Science, 410(43):4414–4422, October 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Beal:2009:CCS

[2301] Marie-Pierre Beal and Dominique Per-rin. Completing codes in a sofic shift.Theoretical Computer Science, 410(43):4423–4431, October 6, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Baeza-Yates:2009:SBM

[2302] Ricardo Baeza-Yates, Veronique Bruyere,Olivier Delgrange, and Rodrigo Schei-hing. On the size of Boyer–Moore au-tomata. Theoretical Computer Science,

410(43):4432–4443, October 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Gal:2009:PSI

[2303] Anna Gal. Preface: Special issueof ICALP 2006 — dedicated to thememory of Ingo Wegener. Theoret-ical Computer Science, 410(44):4445,October 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dietzfelbinger:2009:MPD

[2304] Martin Dietzfelbinger. In memoriam:Prof. Dr. math. Ingo Wegener, 1950–2008. Theoretical Computer Science,410(44):4446–4447, October 17, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Chen:2009:CDF

[2305] Xi Chen and Xiaotie Deng. On thecomplexity of 2D discrete fixed pointproblem. Theoretical Computer Sci-ence, 410(44):4448–4456, October 17,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Finocchi:2009:ORS

[2306] Irene Finocchi, Fabrizio Grandoni, andGiuseppe F. Italiano. Optimal re-silient sorting and searching in thepresence of memory faults. Theoret-ical Computer Science, 410(44):4457–4470, October 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Marx:2009:PVM

[2307] Daniel Marx. A parameterized view onmatroid optimization problems. The-oretical Computer Science, 410(44):

REFERENCES 276

4471–4479, October 17, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Sankowski:2009:MWB

[2308] Piotr Sankowski. Maximum weight bi-partite matching in matrix multiplica-tion time. Theoretical Computer Sci-ence, 410(44):4480–4488, October 17,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chaudhuri:2009:PRA

[2309] Kamalika Chaudhuri, Satish Rao,Samantha Riesenfeld, and Kunal Tal-war. A push–relabel approxima-tion algorithm for approximating theminimum-degree MST problem and itsgeneralization to matroids. Theoret-ical Computer Science, 410(44):4489–4503, October 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Harren:2009:AAO

[2310] Rolf Harren. Approximation algo-rithms for orthogonal packing problemsfor hypercubes. Theoretical ComputerScience, 410(44):4504–4532, October17, 2009. CODEN TCSCDI. ISSN0304-3975 (print), 1879-2294 (elec-tronic).

Fleischer:2009:F

[2311] Rudolf Fleischer and Jinhui Xu. Fore-word. Theoretical Computer Sci-ence, 410(45):4533, October 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Angel:2009:MHS

[2312] Eric Angel, Evripidis Bampis, and Lau-rent Gourves. On the minimum hit-

ting set of bundles problem. Theoret-ical Computer Science, 410(45):4534–4542, October 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chen:2009:AME

[2313] Zhi-Zhong Chen and Ruka Tana-hashi. Approximating maximum edge2-coloring in simple graphs via local im-provement. Theoretical Computer Sci-ence, 410(45):4543–4553, October 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Betzler:2009:FPA

[2314] Nadja Betzler, Michael R. Fellows,Jiong Guo, Rolf Niedermeier, andFrances A. Rosamond. Fixed-parameter algorithms for Kemenyrankings. Theoretical Computer Sci-ence, 410(45):4554–4570, October 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gutin:2009:MLB

[2315] Gregory Gutin, Igor Razgon, andEun Jung Kim. Minimum leaf out-branching and related problems. The-oretical Computer Science, 410(45):4571–4579, October 28, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Bansal:2009:SSS

[2316] Nikhil Bansal, Ho-Leung Chan, andKirk Pruhs. Speed scaling with a so-lar cell. Theoretical Computer Science,410(45):4580–4587, October 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 277

Miyoshi:2009:SFI

[2317] Naoto Miyoshi, Takeya Shigezumi,Ryuhei Uehara, and Osamu Watanabe.Scale free interval graphs. Theoret-ical Computer Science, 410(45):4588–4600, October 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Falaschi:2009:F

[2318] Moreno Falaschi, Maurizio Gabbrielli,and Catuscia Palamidessi. Foreword.Theoretical Computer Science, 410(46):4601–4602, November 1, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Barbuti:2009:GLP

[2319] Roberto Barbuti. Giorgio Levi in Pisa.Theoretical Computer Science, 410(46):4603–4604, November 1, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Guglielmi:2009:PPG

[2320] Alessio Guglielmi. Personal portraitof Giorgio Levi. Theoretical ComputerScience, 410(46):4605–4607, November1, 2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Alpuente:2009:TNR

[2321] Marıa Alpuente, Santiago Escobar, andJose Iborra. Termination of narrowingrevisited. Theoretical Computer Sci-ence, 410(46):4608–4625, November 1,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Amato:2009:ASD

[2322] Gianluca Amato, James Lipton, andRobert McGrail. On the algebraic

structure of declarative programminglanguages. Theoretical Computer Sci-ence, 410(46):4626–4671, November 1,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bagnara:2009:APC

[2323] Roberto Bagnara, Patricia M. Hill, andEnea Zaffanella. Applications of poly-hedral computations to the analysisand verification of hardware and soft-ware systems. Theoretical ComputerScience, 410(46):4672–4691, November1, 2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bossi:2009:SLP

[2324] Annalisa Bossi. S-semantics for logicprogramming: A retrospective look.Theoretical Computer Science, 410(46):4692–4703, November 1, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Gras:2009:NSI

[2325] Daniel Cabeza Gras and Manuel V.Hermenegildo. Non-strict independence-based program parallelization usingsharing and freeness information. The-oretical Computer Science, 410(46):4704–4723, November 1, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Cousot:2009:AIR

[2326] Patrick Cousot, Radhia Cousot, andRoberto Giacobazzi. Abstract inter-pretation of resolution-based seman-tics. Theoretical Computer Science,410(46):4724–4746, November 1, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

REFERENCES 278

Liang:2009:FPL

[2327] Chuck Liang and Dale Miller. Focus-ing and polarization in linear, intu-itionistic, and classical logics. Theoret-ical Computer Science, 410(46):4747–4768, November 1, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Maher:2009:LCE

[2328] Michael J. Maher. Local consistency forextended CSPs. Theoretical ComputerScience, 410(46):4769–4783, November1, 2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ueda:2009:LHL

[2329] Kazunori Ueda. LMNtal as a hier-archical logic programming language.Theoretical Computer Science, 410(46):4784–4800, November 1, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Civril:2009:SMV

[2330] Ali Civril and Malik Magdon-Ismail.On selecting a maximum volume sub-matrix of a matrix and related prob-lems. Theoretical Computer Science,410(47–49):4801–4811, November 6,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bayer:2009:PTP

[2331] Daniel Bayer, Van Bang Le, and H. N.de Ridder. Probe threshold and probetrivially perfect graphs. TheoreticalComputer Science, 410(47–49):4812–4822, November 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dennunzio:2009:DDA

[2332] A. Dennunzio, P. Di Lena, E. For-menti, and L. Margara. On the di-rectional dynamics of additive cellularautomata. Theoretical Computer Sci-ence, 410(47–49):4823–4833, November6, 2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hof:2009:PGC

[2333] Pim van ’t Hof, Daniel Paulusma, andGerhard J. Woeginger. Partitioninggraphs into connected parts. Theo-retical Computer Science, 410(47–49):4834–4843, November 6, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Regnault:2009:PAS

[2334] Damien Regnault, Nicolas Schabanel,and Eric Thierry. Progresses in theanalysis of stochastic 2D cellular au-tomata: A study of asynchronous 2Dminority. Theoretical Computer Sci-ence, 410(47–49):4844–4855, November6, 2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Li:2009:SFJ

[2335] Shisheng Li and Jinjiang Yuan.Scheduling with families of jobs and de-livery coordination under job availabil-ity. Theoretical Computer Science, 410(47–49):4856–4863, November 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Kis:2009:SMU

[2336] Tamas Kis. Scheduling multiproces-sor UET tasks of two sizes. Theo-retical Computer Science, 410(47–49):4864–4873, November 6, 2009. CODEN

REFERENCES 279


Domosi:2009:SYT

[2337] Pal Domosi, Geza Horvath, and Lau-rent Vuillon. On the Shyr–Yu the-orem. Theoretical Computer Sci-ence, 410(47–49):4874–4877, November6, 2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Simonsen:2009:CCL

[2338] Jakob Grue Simonsen. On the com-putational complexity of the languagesof general symbolic dynamical sys-tems and beta-shifts. Theoretical Com-puter Science, 410(47–49):4878–4891,November 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Huang:2009:CWF

[2339] Yunbao Huang. The complexity ofCbω-words of the form w × w. The-oretical Computer Science, 410(47–49):4892–4904, November 6, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Zhao:2009:IGG

[2340] Yingchao Zhao, Wei Chen, and Shanghua Teng. The isolation game: A gameof distances. Theoretical Computer Sci-ence, 410(47–49):4905–4919, November6, 2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Alon:2009:HEM

[2341] Noga Alon and Uri Stav. Hardnessof edge-modification problems. Theo-retical Computer Science, 410(47–49):4920–4927, November 6, 2009. CODEN


Arvind:2009:PLJ

[2342] V. Arvind, Johannes Kobler, and Wolf-gang Lindner. Parameterized learnabil-ity of juntas. Theoretical Computer Sci-ence, 410(47–49):4928–4936, November6, 2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

DeFelice:2009:CRC

[2343] Clelia De Felice, Gabriele Fici, andRosalba Zizza. A characterization ofregular circular languages generated bymarked splicing systems. TheoreticalComputer Science, 410(47–49):4937–4960, November 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Garcia:2009:LRL

[2344] Pedro Garcıa, Manuel Vazquez de Parga,Antonio Cano, and Damian Lopez.On locally reversible languages. The-oretical Computer Science, 410(47–49):4961–4974, November 6, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Cordasco:2009:NSW

[2345] Gennaro Cordasco and Luisa Gargano.Navigable Small-World networks withfew random bits. Theoretical Com-puter Science, 410(47–49):4975–4988,November 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Gassner:2009:HHI

[2346] Elisabeth Gassner, Johannes Hatzl,Sven O. Krumke, Heike Sperber, andGerhard J. Woeginger. How hard is

REFERENCES 280

it to find extreme Nash equilibria innetwork congestion games? Theo-retical Computer Science, 410(47–49):4989–4999, November 6, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Kowalik:2009:DAM

[2347] Lukasz Kowalik and Marcin Mucha.Deterministic 7/8-approximation forthe metric maximum TSP. TheoreticalComputer Science, 410(47–49):5000–5009, November 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kao:2009:NWA

[2348] Jui-Yi Kao, Narad Rampersad, andJeffrey Shallit. On NFAs where allstates are final, initial, or both. The-oretical Computer Science, 410(47–49):5010–5021, November 6, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Cain:2009:AS

[2349] Alan J. Cain. Automaton semi-groups. Theoretical Computer Sci-ence, 410(47–49):5022–5038, November6, 2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Liu:2009:OSM

[2350] Ming Liu, Yinfeng Xu, Chengbin Chu,and Feifeng Zheng. Online schedulingto minimize modified total tardinesswith an availability constraint. Theo-retical Computer Science, 410(47–49):5039–5046, November 6, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Chen:2009:SOM

[2351] Xingyu Chen, Leah Epstein, and ZhiyiTan. Semi-online machine coveringfor two uniform machines. TheoreticalComputer Science, 410(47–49):5047–5062, November 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Chen:2009:HRA

[2352] Lei Chen, Changhong Lu, and Zhen-bing Zeng. Hardness results and ap-proximation algorithms for (weighted)paired-domination in graphs. Theo-retical Computer Science, 410(47–49):5063–5071, November 6, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Chen:2009:DPD

[2353] Lei Chen, Changhong Lu, and Zhen-bing Zeng. Distance paired-dominationproblems on subclasses of chordalgraphs. Theoretical Computer Sci-ence, 410(47–49):5072–5081, November6, 2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Batu:2009:STA

[2354] Tugkan Batu, Petra Berenbrink, andChristian Sohler. A sublinear-timeapproximation scheme for bin pack-ing. Theoretical Computer Science, 410(47–49):5082–5092, November 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Kiltz:2009:DCC

[2355] Eike Kiltz and David Galindo. Di-rect chosen-ciphertext secure identity-based key encapsulation without ran-dom oracles. Theoretical Computer Sci-ence, 410(47–49):5093–5111, November

REFERENCES 281


Sgall:2009:PSO

[2356] Jirı Sgall, Hadas Shachnai, and TamiTamir. Periodic scheduling with oblig-atory vacations. Theoretical Com-puter Science, 410(47–49):5112–5121,November 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Khamis:2009:RAD

[2357] Soheir M. Khamis, Sameh S. Daoud,and Hanaa A. E. Essa. A random-ized algorithm for determining domi-nating sets in graphs of maximum de-gree five. Theoretical Computer Sci-ence, 410(47–49):5122–5127, November6, 2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Spoerhase:2009:CPP

[2358] J. Spoerhase and H.-C. Wirth. (r, p)-centroid problems on paths and trees.Theoretical Computer Science, 410(47–49):5128–5137, November 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bang-Jensen:2009:DDU

[2359] Jørgen Bang-Jensen and MatthiasKriesell. Disjoint directed and undi-rected paths and cycles in digraphs.Theoretical Computer Science, 410(47–49):5138–5144, November 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Tirnauca:2009:NSC

[2360] Cristina Tırnauca and Satoshi Koba-yashi. Necessary and sufficient con-ditions for learning with correction

queries. Theoretical Computer Sci-ence, 410(47–49):5145–5157, November6, 2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

DAlessandro:2009:PCF

[2361] Flavio D’Alessandro, Benedetto Intrig-ila, and Stefano Varricchio. The Parikhcounting functions of sparse context-free languages are quasi-polynomials.Theoretical Computer Science, 410(47–49):5158–5181, November 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Li:2009:OSU

[2362] Wenjie Li, Jinjiang Yuan, Jianfa Cao,and Hailin Bu. Online scheduling ofunit length jobs on a batching ma-chine to maximize the number of earlyjobs with lookahead. Theoretical Com-puter Science, 410(47–49):5182–5187,November 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Che:2009:NQA

[2363] Ada Che, Vladimir Kats, and Eu-gene Levner. A note on a quadraticalgorithm for the 2-cyclic roboticscheduling problem. Theoretical Com-puter Science, 410(47–49):5188–5190,November 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Dubickas:2009:BWG

[2364] Arturas Dubickas. Binary words witha given Diophantine exponent. Theo-retical Computer Science, 410(47–49):5191–5195, November 6, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

REFERENCES 282

Yu:2009:AEC

[2365] Dongxiao Yu, Jianfeng Hou, GuizhenLiu, Bin Liu, and Lan Xu. Acyclicedge coloring of planar graphs withlarge girth. Theoretical Computer Sci-ence, 410(47–49):5196–5200, November6, 2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Kucera:2009:F

[2366] Ludek Kucera. Foreword. Theoret-ical Computer Science, 410(50):5201,November 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Blaser:2009:SAA

[2367] Markus Blaser and Andreas Meyerde Voltaire. Semisimple algebras ofalmost minimal rank over the re-als. Theoretical Computer Science, 410(50):5202–5214, November 17, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bonsma:2009:FPB

[2368] Paul Bonsma and Luis Cereceda.Finding Paths between graph colour-ings: PSPACE-completeness and su-perpolynomial distances. TheoreticalComputer Science, 410(50):5215–5226,November 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Crochemore:2009:RSA

[2369] Maxime Crochemore, Lucian Ilie, andWojciech Rytter. Repetitions instrings: Algorithms and combina-torics. Theoretical Computer Sci-ence, 410(50):5227–5235, November 17,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Duckworth:2009:LIS

[2370] William Duckworth and Michele Zito.Large independent sets in random reg-ular graphs. Theoretical Computer Sci-ence, 410(50):5236–5243, November 17,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Koiran:2009:VTT

[2371] Pascal Koiran and Sylvain Perifel.VPSPACE and a transfer theoremover the complex field. TheoreticalComputer Science, 410(50):5244–5251,November 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Longpre:2009:CS

[2372] Luc Longpre and Pierre McKenzie. Thecomplexity of Solitaire. TheoreticalComputer Science, 410(50):5252–5260,November 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Nikoletseas:2009:EPC

[2373] S. Nikoletseas, C. Raptopoulos, andP. G. Spirakis. Expander propertiesand the cover time of random intersec-tion graphs. Theoretical Computer Sci-ence, 410(50):5261–5272, November 17,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Salamon:2009:AMI

[2374] Gabor Salamon. Approximating theMaximum Internal Spanning Treeproblem. Theoretical Computer Sci-ence, 410(50):5273–5284, November 17,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 283

Tani:2009:CFA

[2375] Seiichiro Tani. Claw finding algo-rithms using quantum walk. Theoret-ical Computer Science, 410(50):5285–5297, November 17, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Ferragina:2009:F

[2376] Paolo Ferragina and Gad M. Landau.Foreword. Theoretical Computer Sci-ence, 410(51):5299, November 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Bergeron:2009:NLT

[2377] Anne Bergeron, Julia Mixtacki, andJens Stoye. A new linear time al-gorithm to compute the genomic dis-tance via the double cut and joindistance. Theoretical Computer Sci-ence, 410(51):5300–5316, November 28,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Hundt:2009:CGA

[2378] Christian Hundt, Maciej Liskiewicz,and Ragnar Nevries. A combina-torial geometrical approach to two-dimensional robust pattern matchingwith scaling and rotation. Theoret-ical Computer Science, 410(51):5317–5333, November 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Amir:2009:ASM

[2379] Amihood Amir, Yonatan Aumann,Oren Kapah, Avivit Levy, and ElyPorat. Approximate string matchingwith address bit errors. TheoreticalComputer Science, 410(51):5334–5346,

November 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Keller:2009:LCP

[2380] Orgad Keller, Tsvi Kopelowitz, andMoshe Lewenstein. On the longestcommon parameterized subsequence.Theoretical Computer Science, 410(51):5347–5353, November 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Fischer:2009:FEB

[2381] Johannes Fischer, Veli Makinen, andGonzalo Navarro. Faster entropy-bounded compressed suffix trees. The-oretical Computer Science, 410(51):5354–5364, November 28, 2009. CO-DEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Kolpakov:2009:SGP

[2382] Roman Kolpakov and Gregory Kucherov.Searching for gapped palindromes.Theoretical Computer Science, 410(51):5365–5373, November 28, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Ma:2009:WGW

[2383] Bin Ma. Why greed works for shortestcommon superstring problem. Theoret-ical Computer Science, 410(51):5374–5381, November 28, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Yang:2009:P

[2384] Boting Yang and Cao An Wang. Pref-ace. Theoretical Computer Science, 410(52):5383, December 6, 2009. CODEN

REFERENCES 284


Huffner:2009:ICC

[2385] Falk Huffner, Christian Komusiewicz,Hannes Moser, and Rolf Niedermeier.Isolation concepts for clique enumera-tion: Comparison and computationalexperiments. Theoretical ComputerScience, 410(52):5384–5397, December6, 2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Zhang:2009:PCV

[2386] Zhao Zhang, Xiaofeng Gao, and WeiliWu. PTAS for connected vertexcover in unit disk graphs. Theoret-ical Computer Science, 410(52):5398–5402, December 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Danziger:2009:CAA

[2387] Peter Danziger, Eric Mendelsohn, Lu-cia Moura, and Brett Stevens. Cov-ering arrays avoiding forbidden edges.Theoretical Computer Science, 410(52):5403–5414, December 6, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Cai:2009:AAC

[2388] Zhipeng Cai, Zhi-Zhong Chen, andGuohui Lin. A 3.4713-approximationalgorithm for the capacitated multi-cast tree routing problem. Theoret-ical Computer Science, 410(52):5415–5424, December 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Betzler:2009:PCC

[2389] Nadja Betzler and Johannes Uhlmann.Parameterized complexity of candidatecontrol in elections and related digraphproblems. Theoretical Computer Sci-ence, 410(52):5425–5442, December 6,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Brandstadt:2009:SPG

[2390] Andreas Brandstadt and Van Bang Le.Simplicial powers of graphs. Theoret-ical Computer Science, 410(52):5443–5454, December 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Marzban:2009:CSP

[2391] Marjan Marzban, Qian-Ping Gu, andXiaohua Jia. Computational study onplanar dominating set problem. The-oretical Computer Science, 410(52):5455–5466, December 6, 2009. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic).

Bocker:2009:GWP

[2392] S. Bocker, S. Briesemeister, Q. B. A.Bui, and A. Truss. Going weighted:Parameterized algorithms for clusterediting. Theoretical Computer Science,410(52):5467–5480, December 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Shen:2009:SAS

[2393] Zhizhang Shen, Ke Qiu, and Ed-die Cheng. On the surface areaof the (n, k)-star graph. Theoreti-cal Computer Science, 410(52):5481–5490, December 6, 2009. CODEN TC-SCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

REFERENCES 285

Janssen:2009:PGV

[2394] Jeannette Janssen and Pawe l Pra lat.Protean graphs with a variety of rank-ing schemes. Theoretical Computer Sci-ence, 410(52):5491–5504, December 6,2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Wagner:2009:CIS

[2395] Peter Wagner and Andreas Brandstadt.The complete inclusion structure of leafpower classes. Theoretical ComputerScience, 410(52):5505–5514, December6, 2009. CODEN TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic).

Bhattacharya:2009:OMM

[2396] Binay Bhattacharya, Mike Burmester,Yuzhuang Hu, Evangelos Kranakis,Qiaosheng Shi, and Andreas Wiese.Optimal movement of mobile sensorsfor barrier coverage of a planar re-gion. Theoretical Computer Science,410(52):5515–5528, December 6, 2009.CODEN TCSCDI. ISSN 0304-3975(print), 1879-2294 (electronic).

Soloveichik:2011:ESC

[2397] David Soloveichik and Erik Winfree.Erratum to “The computational powerof Benenson automata” [Theoret. Com-put. Sci. 344 (2005) 279–297]. The-oretical Computer Science, 412(43):6112–6113, October 7, 2011. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic). URL http:

//www.sciencedirect.com/science/

article/pii/S0304397511003537. See[323].

Ren:2011:NAC

[2398] Wei Ren and Qing Zhao. A noteon ‘Algorithms for connected set

cover problem and fault-tolerant con-nected set cover problem’. Theoret-ical Computer Science, 412(45):6451–6454, October 21, 2011. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic). URL http:


article/pii/S0304397511006189. See[1974].

Blumensath:2013:ESS

[2399] Achim Blumensath. Erratum to“On the structure of graphs in theCaucal hierarchy” [Theoret. Com-put. Sci. 400 (2008) 19–45]. The-oretical Computer Science, 475(??):126–127, March 4, 2013. CODENTCSCDI. ISSN 0304-3975 (print),1879-2294 (electronic). URL http:


article/pii/S0304397513000108. See[1623].

A Bibliography of Publications in Theoretical Computer Science

Documents

Transcript of A Bibliography of Publications in Theoretical Computer Science