DOCSLIB.ORG

A Bibliography of Publications in Theoretical Computer Science: 2005–2009

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Bibliography of Publications in Theoretical Computer Science: 2005–2009 A Bibliography of Publications in Theoretical Computer Science: 2005{2009 Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 14 October 2017 Version 1.15 Title word cross-reference `p [782]. [1183, 729]. F0 [2005]. FS [1741]. H [1823, 1585]. k [1116, 1805, 796, 803, 173, 781, 1961, 1609, 775, 1989, 178, 1310, 630, 1311, 951, 62, 1823, 1809, 2253, 2061, 2003, #CSP [2264]. #P [1788]. 1624, 953, 1226, 1306, 1290, 2007]. k>2 #P-completeness [1788]. [173]. Kmax;Kmin [541]. κ [1836]. L(2; 1) [2243, 1635]. L(d; s) [440]. l1 [961]. λ (1 + 1) [1683]. (1,λ) [115]. (18=11)n [2213]. [2281, 400, 1588, 562]. λµ [1159]. log N (α, β) [2215]. (n; k) [2392, 1557]. (n; t) [1049]. d [547]. LU [1217]. m (p; k) [467]. (r; p) [2357]. $-calculus [1275]. [1760, 1324, 2258, 1745, 1226, 1306]. µ 1 [220, 503]. 2 [187, 400, 589, 359, 101]. n [1425, 2304, 1890, 2253, 2333, 1287, 1302]. d ≥ ≤ [1909, 958, 2079, 1451]. N [1444]. n 30 2 <α 7=3 [2163]. 3 [1628, 1771]. 3:4713 6 1:75 + [2169]. = [789]. O(n ) [2243]. [2387]. 4 [2260]. 5 + [1968]. 5=2 [90]. 5=4 2 ! ∗ ; Ø(n polylogn) [1915]. O(n ) [1553]. [778]. [0; 1] [503]. [58]. [109]. 1 [1543]. p o(n log n) [1313]. Ω [196]. A [1200]. α [2163, 132]. b [1319]. β [1372, 974, 1655, 663, 826]. !(1) [1752]. P [1456]. c [469, 641]. Cb! [2338]. C1 [1502]. d [1527, 433]. φ [115]. π [1245, 912, 1690, 817, 105]. ∆ [439]. p b c [35, 56, 1436, 143, 1440]. Π2 [441]. Q [1034]. D logm D [648]. `1 [2296]. `1 [2296, 1543]. 1 2 R [974, 417]. Rd [2062]. σ [1233]. t [893]. T 2 1 [385]. 1/2 [2399]. [1320]. × [445]. U [1768]. w × w [1502, 2338]. k k1 k2 ··· kn x = z1 z2 zn [12]. Z [1859]. 2 [386]. 2-approximate [1915]. 2-approximation [1963]. 2-categories * [400]. *- [400]. [102]. 2-coloring [2312]. 2-constraint [431]. 2-cyclic [2362, 1991]. 2-interval -achievement [1881]. -antipodal [1049]. [1322, 1541, 2123]. 2-letter [1493]. -approximation [2387, 1968, 1287, 778]. 2-median [1979]. 2-radiian [1821]. -ary [953]. -automata [826]. -avoidable 2-radius [1821]. 2005 [987, 1434]. 2006 [1890]. -batch [1989]. -bit [1313]. -calculi [1513, 2302]. 2nd [1554]. 2nd-order [1554]. [101]. -calculus [35, 2281, 187, 56, 589, 359, 2SAT [74]. 143, 562, 1440, 1436]. -categories [1372, 1034]. -center [775, 62]. -centroid 3-COL [1716]. 3-coloring [1554]. [2357]. -cliques [469]. -collapsing [1451]. 3-dimensional [1818]. 3-regular [1289]. -coloring [467, 439]. -complete [441]. 3-SAT [1025, 1810]. 3-tier [835]. -connected [1311, 2253, 1226, 1306]. 3-vertex-connectivity [1012]. 380 [2399]. -context-free [1624]. -contextual [893]. 3D [689]. 3SAT [74]. -counter [220]. -cube [958]. -dimensional [1752, 817, 105]. -domains [1741]. 4-coloring [1414]. 4-cycles [944]. 4-way -dominating [2253, 1306]. -EA [1683]. [2040]. 400 [2398]. -edge [1319]. -estimation [2005]. -facility [1290]. -flat [1760]. -free [433, 1823]. -game 5 [898]. [1233]. -iet [1628]. -in-a-row [1310]. -induced [1823]. -integers [1456]. 6-man [446]. 60th [2270, 1531, 2287]. -irreducible [115]. -labeling [2243, 1635]. 64-bit [503]. -labelings [440]. -language [663]. -limited [2079]. -longest [1809]. -maximum-sums 7/8 [2346]. 7/8-approximation [2346]. [796]. -Median [781]. -nearest-neighbor [2061]. -panconnectivity [1324]. -path 8-approximation [2346]. [630]. -points [729]. -polygons [1768]. -power-free [2163]. -reducibilities [1745]. abelian [2260, 1184, 1890, 1911]. absence -regular [1245, 1624]. -SA-ES [115]. -SAT [1139]. Absolute [1577, 317, 1296]. [178]. -semirings [400]. -spanner [173]. absoluteness [1514]. absorption [372]. -spanners [2215]. -splittable [951]. -star Abstract [1557, 2392]. -Steiner [2007]. -strict [1200]. [154, 2325, 672, 1685, 278, 356, 856, 1069, -sub-recursive [417]. -subshifts [1444]. 163, 1084, 1926, 186, 159, 1677, 1864]. -tape [1909]. -terms [974]. -theories [1588]. abstraction -tonic [2003]. -transitions [1183]. -trees [593, 1729, 1784, 1436, 1695, 1029]. [1961]. -tuple [1226]. -valued [912, 1690]. abstractions [1698]. Accelerating -varieties [641]. -variety [1655]. -words [2231, 2245]. acceptance [24, 72]. [1502, 2338]. Accepting [993, 1135, 2199, 1941, 1251]. Access [1596, 1242, 1597, 1003, 159]. .NET [858]. accessible [1214]. achievable [2109]. achievement [1881]. achieving [1016]. 3 achromatic [1974, 773]. acid [1932]. 2293, 1454, 2138, 1287, 1503, 2110, 431, 1688, Acknowledged [1103]. acknowledgment 462, 627, 1290, 2007, 693]. Algorithmic [1983]. acknowledgments [947]. across [1161, 1423, 1276, 720, 1169, 2192, 949, 253, [1793]. action [753, 59]. action-based 408]. Algorithms [753, 59]. Actions [641, 916]. actor [1863]. [1886, 1531, 1539, 1809, 1399, 130, 1856, Actors [1925]. Acyclic 1226, 1101, 1973, 1129, 1777, 937, 386, 1148, [2364, 1565, 1179, 413, 1059, 2154, 971]. ad 1906, 2313, 458, 2391, 433, 1683, 2019, 86, [1665, 1663, 157, 1664, 1103]. ad-hoc 2052, 859, 3, 402, 1979, 2062, 268, 1216, 2351, [1665, 1664]. Adams [2089]. Adaptive 796, 1648, 1801, 1606, 1179, 1607, 1114, 2242, [1367, 1663, 2212, 1952, 2020, 909, 1098]. 2023, 1219, 421, 781, 549, 836, 1309, 1609, adaptiveness [107]. Addendum [2399]. 1853, 1173, 1676, 2309, 217, 833, 1908, 1284, Adding [164, 1038]. Addition [1127]. 269, 511, 1629, 1311, 624, 2049, 773, 1499, Additive [381, 2331, 1323, 546]. Additivity 1025, 1982, 297, 2289, 1042, 1128, 84, 1699, [1772]. address [2378]. addressable [610]. 1927, 539, 542, 1631, 1221, 1532, 530, 1237, addressing [1857, 67]. AdHoc [2136]. adic 1050, 694, 44, 2132, 2005, 1011, 2374, 1306, [1193]. Admissible [501, 374]. ADMs 710, 2063, 1774, 1997, 2368, 1547, 2397]. [457, 1301]. advances [1682]. Adversarial Aliased [1800]. Alice&Bob [899]. [1960, 1231]. adversaries [224, 227]. advice alignment [926, 966]. all- [132]. all-ones [1676, 2018]. Affine [2055, 1389, 569, 1540]. [1307]. all-optical [109]. All-pairs affix [1410]. after [1040]. again [1104]. [1915, 1553]. all-shortest-path [1408]. against [574]. agent [805]. agents all-to-all [109]. allocation [288, 1461, 1305, 1926, 1487, 515]. [950, 2100, 1180, 549, 1781, 1800]. allowing aggregate [981]. aggregation [388]. almost [2366, 2025, 1110]. [737, 310, 2022, 1875]. AGh [921]. agnostic almost-complete [2025]. alpha [1193]. [1110]. agreeable [1054]. Agreement alpha-adic [1193]. Alphabet [1300, 133, 2020, 1954, 985, 1050]. [1313, 245, 2037, 2200, 1446]. agreements [473]. al. [1909]. Alberto Alphabet-independent [1313]. [1531, 363]. Alder [43]. algebra alphabet-size [2200]. alphabets [881, 141, 137, 140, 300, 882, 1469, 1275, [262, 1493, 1314, 2168, 1909, 75]. 1074, 509, 360, 210, 2053, 579, 1440]. alternating [194, 251, 170, 567]. Algebraic [939, 238, 682, 1475, 2321, 338, Alternating-time [567]. Alternative 957, 485, 1870, 1067, 579, 788, 497]. [889, 1728, 691]. Amalgamating [1923]. algebraicity [2278]. algebraization [584]. Amalgamation [51]. amazons [451]. ambg Algebras [35]. Ambainis [214]. ambient [1377, 514, 2366, 406, 2058, 1830, 584, 1100]. [666, 883, 37, 1596, 667]. ambient-like [666]. Algol [1066, 1438]. algorithm ambients [1030, 97, 1597, 2016]. ambiguity [2113, 811, 553, 1168, 1109, 1963, 2376, 2162, [959, 352]. Ambiguous [101]. amiable 2387, 1700, 859, 640, 2295, 469, 128, 2308, [1430]. among [2002, 1487]. amplification 2362, 960, 711, 1143, 1426, 1663, 1783, 1869, [984, 2075]. analog [1063, 995, 996]. 1968, 778, 1551, 1951, 2000, 1182, 1139, 329, analyser [274]. analyses [857]. Analysis 79, 1055, 1169, 1330, 1955, 1140, 2356, 966, [1652, 693, 447, 598, 1161, 1423, 1693, 897, 387, 1321, 1647, 2147, 723, 815, 1111, 1404, 2322, 2192, 591, 1468, 197, 154, 898, 734, 2263, 909, 1721, 2021, 1267, 727, 2230, 1428, 268, 931, 2189, 2274, 595, 1373, 157, 222, 265, 468, 728, 1976, 1771, 1132, 1451, 1991, 192, 1558, 1555, 1169, 1071, 1150, 1362, 1637, 4 723, 1534, 1404, 2253, 373, 1151, 568, 449, [134]. Arbitrage [1793, 832]. Arbitrary 903, 1132, 540, 1677, 2333, 225, 1463, 905, [1814, 262, 205, 1967, 1298, 2099, 1756, 1431, 1410, 332, 885, 462, 1811, 551, 1922, 2191]. 77]. arboricity [1224]. architectural [141]. analytical [1760, 1323]. Analyzer [902]. architecture [55]. Area [1848, 2392]. Analyzing [1072, 637, 1421, 1839]. anarchy Area-time [1848]. areas [2004]. arising [934]. ancestor [1553]. ancestors [1179]. [532]. Arithmetic [1127, 918, 502, 505, 506, AND/OR [1647]. Angel [1401, 465]. 503, 1453, 1403, 138, 679]. arithmetical animation [1738]. Anisotropic [1850]. [1198, 207, 1907]. Arity [1704]. arm annealing [1330]. annotated [1620]. [1122, 627]. armed [2069]. arrangements anonymity [2271]. anonymous [474]. array [1410]. arrays [1814, 1611]. answer [1884]. answering [2386, 548, 1313, 1537]. arrivals [2151]. [1001, 149]. Ant [322]. antichain [1147]. Artemis [2105]. artificial [686, 1682]. ary antimagic [1047]. antimagicness [1965]. [953]. ASM [161]. AsmL [303]. Aspects antipodal [1049]. antiport [1021, 692]. [64, 1240, 2271, 47, 1235, 1516, 312, 790, 2006]. Antonio [230]. Any [284, 612, 2183]. assembling [1936]. assembly Any-world [284]. Apartness [1734]. [2039, 1127, 1522, 1524, 2034, 1048, 1715, Apostolico [1531]. Application 721, 2030, 1523, 1940, 528]. assertion [735, 34, 804, 1421, 581, 689, 1175, 1131]. [54, 1830]. assertion-based [54]. Applications assignment [288, 1168, 558, 1796, 1594, 438, [2322, 1255, 870, 1291, 602, 1584, 1468, 1197, 1267, 1556, 2104, 1590]. assignments [1501]. 979, 365, 1061, 1932, 1279, 1924, 2299, 251, associated [1790, 1229, 767, 716, 1799]. 559, 1311, 2298, 1721, 601, 1410, 1500]. associativity [1639, 1207]. assumption Applied [271]. approach [404, 974, 1850, [227]. assumptions [284, 1966]. 757, 919, 1626, 737, 949, 967, 883, 2377, asymmetric [1959]. Asymmetry [775]. 1156, 58, 705, 295, 328, 748, 1323, 60, 247, Asymptotic [2092, 723, 1481, 1347]. 2009, 1621, 2288, 152, 2239, 466, 962, 841]. Asynchronous approaches [957, 1933]. approaching [909]. [2118, 628, 700, 1339, 2279, 1261, 139, 786, appropriateness [480]. Approximability 168, 1814, 1424, 1052, 1957, 2333, 2130]. [1319, 288, 951, 68, 267]. approximants Atomic [2210]. atoms [1070]. ATSP [978]. [358].
Load more

Recommended publications
  • Quantum Hypercomputation—Hype Or Computation?
    Quantum Hypercomputation—Hype or Computation? Amit Hagar,∗ Alex Korolev† February 19, 2007 Abstract A recent attempt to compute a (recursion–theoretic) non–computable func- tion using the quantum adiabatic algorithm is criticized and found wanting. Quantum algorithms may outperform classical algorithms in some cases, but so far they retain the classical (recursion–theoretic) notion of computability. A speculation is then offered as to where the putative power of quantum computers may come from. ∗HPS Department, Indiana University, Bloomington, IN, 47405. [email protected] †Philosophy Department, University of BC, Vancouver, BC. [email protected] 1 1 Introduction Combining physics, mathematics and computer science, quantum computing has developed in the past two decades from a visionary idea (Feynman 1982) to one of the most exciting areas of quantum mechanics (Nielsen and Chuang 2000). The recent excitement in this lively and fashionable domain of research was triggered by Peter Shor (1994) who showed how a quantum computer could exponentially speed–up classical computation and factor numbers much more rapidly (at least in terms of the number of computational steps involved) than any known classical algorithm. Shor’s algorithm was soon followed by several other algorithms that aimed to solve combinatorial and algebraic problems, and in the last few years the- oretical study of quantum systems serving as computational devices has achieved tremendous progress. According to one authority in the field (Aharonov 1998, Abstract), we now have strong theoretical evidence that quantum computers, if built, might be used as powerful computational tool, capable of per- forming tasks which seem intractable for classical computers.
    [Show full text]
  • Handbook of Formal Languages
    Handbook of Formal Languages von Grzegorz Rozenberg, Arto Salomaa 1. Auflage Handbook of Formal Languages – Rozenberg / Salomaa schnell und portofrei erhältlich bei beck-shop.de DIE FACHBUCHHANDLUNG Springer 1997 Verlag C.H. Beck im Internet: www.beck.de ISBN 978 3 540 60420 4 Contents of Volume 1 Chapter 1. Formal Languages: an Introduction and a Synopsis Alexandru Mateescu and Arto Salomaa ............................ 1 1. Languages, formal and natural ................................. 1 1.1 Historical linguistics ...................................... 3 1.2 Language and evolution ................................... 7 1.3 Language and neural structures ............................ 9 2. Glimpses of mathematical language theory ...................... 9 2.1 Words and languages ..................................... 10 2.2 About commuting ........................................ 12 2.3 About stars ............................................. 15 2.4 Avoiding scattered subwords .............................. 19 2.5 About scattered residuals ................................. 24 3. Formal languages: a telegraphic survey ......................... 27 3.1 Language and grammar. Chomsky hierarchy ................. 27 3.2 Regular and context-free languages ......................... 31 3.3 L Systems............................................... 33 3.4 More powerful grammars and grammar systems .............. 35 3.5 Books on formal languages ................................ 36 References ..................................................... 38 Chapter
    [Show full text]
  • Alan Turing, Hypercomputation, Adam Smith and Next Generation Intelligent Systems
    J. Intell. Syst. 21 (2012), 325–330 DOI 10.1515/jisys-2012-0017 © de Gruyter 2012 Something Old, Something New, Something Borrowed, Something Blue Part 1: Alan Turing, Hypercomputation, Adam Smith and Next Generation Intelligent Systems Mark Dougherty Abstract. In this article intelligent systems are placed in the context of accelerated Turing machines. Although such machines are not currently a reality, the very real gains in computing power made over previous decades require us to continually reevaluate the potential of intelligent systems. The economic theories of Adam Smith provide us with a useful insight into this question. Keywords. Intelligent Systems, Accelerated Turing Machine, Specialization of Labor. 2010 Mathematics Subject Classification. Primary 01-02, secondary 01A60, 01A67. 1 Introduction The editor-in-chief of this journal has asked me to write a series of shorter articles in which I try to illuminate various challenges in intelligent systems. Given space requirements they cannot be regarded as comprehensive reviews, they are intended to provide an overview and to be a point of departure for discussion and debate. The title of the series implies that I will look at both very old and rather new concepts and I will not be afraid to borrow from other subjects. Nor will I be afraid to incorporate radical “blue skies” ideas or hypotheses. By challenges I mean aspects of our subject which cannot easily be tackled by either theoretical means or through empirical enquiry. That may be because the questions raised are not researchable or because no evidence has yet been ob- served. Or it may be that work is underway but that no firm conclusions have yet been reached by the research community.
    [Show full text]
  • The Best Nurturers in Computer Science Research
    The Best Nurturers in Computer Science Research Bharath Kumar M. Y. N. Srikant IISc-CSA-TR-2004-10 http://archive.csa.iisc.ernet.in/TR/2004/10/ Computer Science and Automation Indian Institute of Science, India October 2004 The Best Nurturers in Computer Science Research Bharath Kumar M.∗ Y. N. Srikant† Abstract The paper presents a heuristic for mining nurturers in temporally organized collaboration networks: people who facilitate the growth and success of the young ones. Specifically, this heuristic is applied to the computer science bibliographic data to find the best nurturers in computer science research. The measure of success is parameterized, and the paper demonstrates experiments and results with publication count and citations as success metrics. Rather than just the nurturer’s success, the heuristic captures the influence he has had in the indepen- dent success of the relatively young in the network. These results can hence be a useful resource to graduate students and post-doctoral can- didates. The heuristic is extended to accurately yield ranked nurturers inside a particular time period. Interestingly, there is a recognizable deviation between the rankings of the most successful researchers and the best nurturers, which although is obvious from a social perspective has not been statistically demonstrated. Keywords: Social Network Analysis, Bibliometrics, Temporal Data Mining. 1 Introduction Consider a student Arjun, who has finished his under-graduate degree in Computer Science, and is seeking a PhD degree followed by a successful career in Computer Science research. How does he choose his research advisor? He has the following options with him: 1. Look up the rankings of various universities [1], and apply to any “rea- sonably good” professor in any of the top universities.
    [Show full text]
  • A Complete Bibliography of Publications in the Journal of Computer and System Sciences
    A Complete Bibliography of Publications in the Journal of Computer and System Sciences Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 26 May 2021 Version 1.04 Title word cross-reference (s; t) [1475]. 0(n) [1160]. 1 [270]. 1 − L [1371, 924]. 12n2 [450]. 2 [3525, 3184, 2191, 1048, 3402, 1500, 3364, 2034, 2993, 834, 2473, 3101]. f2; 3g [2843]. #09111 [1814]. #AM01053M 2pn 1=3 − 2 O(n ) [1862, 1877, 1904]. #better 5X8 els [1856]. 2 [2353]. 2 [445]. 2 [1977]. 3 #better 5X8 els.pdf [1856]. #BIS [3184]. [1920, 2242, 2827, 2374, 1961, 2825, 3240, · #BIS-hardness #CSP 1071, 1133]. 43 [3620]. 4 Log2N [655]. 5=4 [3184]. ∗ 0 #econdirectM [1612]. 8 [2998]. =? [1433]. [858]. [2696, 2908, 2500, 3508]. 1 ∗ NP [1893]. #HA03022M [1860, 1875]. [1625, 3418, 1085]. [1523]. [3194]. NP[O(log n)] p ⊆ PH #HA05062N [1876]. #HA05062O [2235]. [995]. 2 [2235]. [1849, 1861]. #HA06043M [1501]. 2 [3418]. H [1565]. a [426, 289]. [1892, 1871, 1889]. #HA08111M [1846]. A[P (x); 2x; x + 1] [500]. Ax = λBx [377]. b · #P [1195, 3598, 1261, 1264]. [3253]. β [3444]. [3418]. d #praise 5X8 els.pdf [1832]. [2527, 1362, 3256, 3563]. δ [3553]. `p [2154]. #sciencejobs N [1802]. [1551, 2617, 1864, 1693]. g [3312]. h [1019]. K [1320, 2756, 191, 3494, 1300, 1546, 3286, #P [1373].
    [Show full text]
  • Biological Computation: a Road
    918 Biological Computation: A Road to Complex Engineered Systems Nelson Alfonso Gómez-Cruz Modeling and Simulation Laboratory Universidad del Rosario Bogotá, Colombia [email protected] Carlos Eduardo Maldonado Research Professor Universidad del Rosario Bogotá, Colombia [email protected] Provided that there is no theoretical frame for complex engineered systems (CES) as yet, this paper claims that bio-inspired engineering can help provide such a frame. Within CES bio- inspired systems play a key role. The disclosure from bio-inspired systems and biological computation has not been sufficiently worked out, however. Biological computation is to be taken as the processing of information by living systems that is carried out in polynomial time, i.e., efficiently; such processing however is grasped by current science and research as an intractable problem (for instance, the protein folding problem). A remark is needed here: P versus NP problems should be well defined and delimited but biological computation problems are not. The shift from conventional engineering to bio-inspired engineering needs bring the subject (or problem) of computability to a new level. Within the frame of computation, so far, the prevailing paradigm is still the Turing-Church thesis. In other words, conventional 919 engineering is still ruled by the Church-Turing thesis (CTt). However, CES is ruled by CTt, too. Contrarily to the above, we shall argue here that biological computation demands a more careful thinking that leads us towards hypercomputation. Bio-inspired engineering and CES thereafter, must turn its regard toward biological computation. Thus, biological computation can and should be taken as the ground for engineering complex non-linear systems.
    [Show full text]
  • State of the Art of Information Technology Computing Models for Autonomic Cloud Computing †
    Proceedings State of the Art of Information Technology Computing Models for Autonomic Cloud Computing † Eugene Eberbach Department of Computer Science and Robotics Engineering Program, Worcester Polytechnic Institute, 100 Institute Road, Worcester, MA 01609-2280, USA; [email protected]; Tel.: +1-508-831-4937 † Presented at the IS4SI 2017 Summit DIGITALISATION FOR A SUSTAINABLE SOCIETY, Gothenburg, Sweden, 12–16 June 2017. Published: 9 June 2017 Abstract: In the paper we present several models of computation for autonomic cloud computing. In particular, we justify that for autonomic cloud computing if we require perfect self-reflection, we need models of computation going beyond Turing machines. To approximate self-reflection, models below Turing machines are sufficient. The above claims are illustrated using as an example the DIME Network Architecture. Keywords: autonomic cloud computing; Turing machine; incompleteness; self-reflection; superTuring machines; DIME network architecture 1. Introduction A distributed system is a collection of independent computers that appears to its users as a single coherent system with basic characteristics: 1. concurrency of components, lack of a global clock, scalability and independent failures of components, 2. underlying transparency (inherited by cloud computing), hiding unnecessary details of management, networking, multi-computer implementation or services, 3. providing a uniform way of looking at the whole distributed system. We will consider two subclasses of distributed systems represented by cloud and autonomic computing. Cloud Computing is a relatively new concept in computing that emerged in the late 1990s and the 2000s (but having roots from 1960s—IBM VMs for System360/370/390), first under the name software as a service—the details of computing are hidden transparently in the networking “cloud” 1.
    [Show full text]
  • The EATCS Award 2020 Laudatio for Toniann (Toni)Pitassi
    The EATCS Award 2020 Laudatio for Toniann (Toni)Pitassi The EATCS Award 2021 is awarded to Toniann (Toni) Pitassi University of Toronto, as the recipient of the 2021 EATCS Award for her fun- damental and wide-ranging contributions to computational complexity, which in- cludes proving long-standing open problems, introducing new fundamental mod- els, developing novel techniques and establishing new connections between dif- ferent areas. Her work is very broad and has relevance in computational learning and optimisation, verification and SAT-solving, circuit complexity and communi- cation complexity, and their applications. The first notable contribution by Toni Pitassi was to develop lifting theorems: a way to transfer lower bounds from the (much simpler) decision tree model for any function f, to a lower bound, the much harder communication complexity model, for a simply related (2-party) function f’. This has completely transformed our state of knowledge regarding two fundamental computational models, query algorithms (decision trees) and communication complexity, as well as their rela- tionship and applicability to other areas of theoretical computer science. These powerful and flexible techniques resolved numerous open problems (e.g., the su- per quadratic gap between probabilistic and quantum communication complex- ity), many of which were central challenges for decades. Toni Pitassi has also had a remarkable impact in proof complexity. She in- troduced the fundamental algebraic Nullstellensatz and Ideal proof systems, and the geometric Stabbing Planes system. She gave the first nontrivial lower bounds on such long-standing problems as weak pigeon-hole principle and models like constant-depth Frege proof systems. She has developed new proof techniques for virtually all proof systems, and new SAT algorithms.
    [Show full text]
  • MAURICE NIVAT, UNE GRANDE FIGURE 89 ◦◦◦◦••◦◦ Une Brève Biographie Scientifique De Maurice Nivat 2
    HOMMAGE Maurice Nivat, une grande gure Pierre-Louis Curien 1 Le texte qui suit a été rédigé en 2001, pour le volume intitulé « Merci, Maurice : a mosaic in honour of Maurice Nivat », paru comme numéro spécial de la revue Theoretical Com- puter Science, que Maurice Nivat avait fon- dée. En écrivant ce texte, je me réjouissais par avance des travaux scientifiques que Maurice continuerait de poursuivre, des combats qu’il continuerait à livrer pour la pleine reconnais- sance de notre discipline et pour son enseigne- ment « de première classe », et de la liberté qu’il aurait, sa retraite prise, pour assouvir à loisir d’autres passions : celles pour le patri- moine, pour l’ethnographie, pour le théâtre, pour les voyages... Et, en effet, Maurice a poursuivi pendant plusieurs années ses travaux en tomographie discrète. Accompagné par son épouse Paule, il a parcouru le monde en long et en large, à six reprises. Il a mené un combat acharné pour l’introduction de l’informatique dans les programmes de l’enseignement secon- daire. Maurice nous a quittés au terme d’une maladie qu’il a combattue avec un im- mense courage, continuant à lire, à s’informer, à s’enflammer pour les causes qu’il 1. Institut de recherche en informatique fondamentale (IRIF, UMR 8243), CNRS et université Paris- Diderot. 1024 – Bulletin de la société informatique de France, numéro 12, juin 2018, pp. 87–107 88 PIERRE-LOUIS CURIEN ◦◦◦◦••◦◦ défendait. Je me souviendrai de la gourmandise qu’il avait encore dans les yeux et dans le verbe pour me parler, sur son lit d’hôpital, de sa fascination pour les iguanes, alors que je revenais d’une conférence aux îles Galápagos.
    [Show full text]
  • Arto Salomaa
    Arto Salomaa A Pioneer of Science from Turku Arto Salomaa, A Pioneer of Science 1 / 52 Arto Arto Salomaa, A Pioneer of Science 2 / 52 Turku Cathedral Arto Salomaa, A Pioneer of Science 3 / 52 Proud of his native Turku, in particular of native \Turku language" Never left Turku permanently Proud of Finnish Sauna, in particular of his Salosauna Jealous of those who have never seen \lousy white stuff" Arto & Turku Born in Turku, 1934 Arto Salomaa, A Pioneer of Science 4 / 52 Never left Turku permanently Proud of Finnish Sauna, in particular of his Salosauna Jealous of those who have never seen \lousy white stuff" Arto & Turku Born in Turku, 1934 Proud of his native Turku, in particular of native \Turku language" Arto Salomaa, A Pioneer of Science 4 / 52 Proud of Finnish Sauna, in particular of his Salosauna Jealous of those who have never seen \lousy white stuff" Arto & Turku Born in Turku, 1934 Proud of his native Turku, in particular of native \Turku language" Never left Turku permanently Arto Salomaa, A Pioneer of Science 4 / 52 Jealous of those who have never seen \lousy white stuff" Arto & Turku Born in Turku, 1934 Proud of his native Turku, in particular of native \Turku language" Never left Turku permanently Proud of Finnish Sauna, in particular of his Salosauna Arto Salomaa, A Pioneer of Science 4 / 52 Arto & Turku Born in Turku, 1934 Proud of his native Turku, in particular of native \Turku language" Never left Turku permanently Proud of Finnish Sauna, in particular of his Salosauna Jealous of those who have never seen \lousy white stuff" Arto Salomaa, A Pioneer of Science 4 / 52 Roots in Turku Arto and his father J.E.
    [Show full text]
  • Events and Languages
    Arto Salomaa Professor Arto Salomaa received his Ph.D. in 1960 and has b een Professor of Mathe- matics at the UniversityofTurku since 1965. He has authored more than 400 scienti c publications in ma jor journals, as well as ten b o oks, some of whichhave app eared also in French, German, Japanese, Romanian, Russian, Vietnamese and Chinese transla- tions. Prof. Salomaa holds the degree of do ctor honoris causa at six universities. He has b een an invited sp eaker at numerous conferences in computer science and math- ematics, and a program committee member or chairman for ma jor computer science conferences, including STOC, ICALP,MFCS, FCT. Prof. Salomaa was EATCS Pres- ident 1979-85 and is currently the editor-in-chief of the EATCS Monograph Series published by Springer-Verlag, as well as an editor of eight international journals of Computer Science. Festival conferences \Salo days in Theoretical Computer Science" Bucharest 1992, \Salo days in Auckland" Auckland, NZ, 1994 and \Imp ortant Re- sults and Trends in Theoretical Computer Science" Graz, 1994 have b een arranged in his honor. Prof. Salomaa is a memb er of the Academy of Sciences of Finland, the Swedish Academy of Sciences of Finland and Academia Europaea 92. Currently,heisa Research Professor at the Academy of Finland and the head of the Academy's research pro ject on mathematical structures in computer science. Events and Languages Early computer science It is customary to b egin a pap er with an abstract or a summary. The purp ose of this article is to tell ab out some people and ideas in the early history of computer 254 Salomaa science, roughly up to 1970.
    [Show full text]
  • The Many Forms of Hypercomputation
    Applied Mathematics and Computation 178 (2006) 143–153 www.elsevier.com/locate/amc The many forms of hypercomputation Toby Ord Balliol College, Oxford OX1 3BJ, UK Abstract This paper surveys a wide range of proposed hypermachines, examining the resources that they require and the capa- bilities that they possess. Ó 2005 Elsevier Inc. All rights reserved. Keywords: Hypercomputation; Oracles; Randomness; Infinite time Turing machine; Accelerating Turing machine 1. Introduction: computation and hypercomputation The Turing machine was developed as a formalisation of the concept of computation. While algorithms had played key roles in certain areas of mathematics, prior to the 1930s they had not been studied as mathematical entities in their own right. Alan Turing [41] changed this by introducing a type of imaginary machine which could take input representing various mathematical objects and process it with a number of small precise steps until the final output is generated. Turing found a machine of this type corresponding to many of the tradi- tional mathematical algorithms and provided convincing reasons to believe that any mathematical procedure that was precise enough to be recognised as an algorithm or Ôeffective procedureÕ would have a corresponding Turing machine. Other contemporaneous attempts at formalising algorithms [4,26] were soon shown to lead to the same class of Ôrecursive functionsÕ. The immediate benefit of this analysis of computation was the ability to prove certain negative results. Tur- ing showed that, on pain of contradiction, there could not be a Turing machine which took an arbitrary for- mula of the predicate calculus and decided whether or not it was a tautology.
    [Show full text]