Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Theoretical computer science. Exploring new frontiers of theoretical informatics. International conference IFIP TCS 2000, Sendai, Japan, August 17--19, 2000. Proceedings - MaRDI portal

Theoretical computer science. Exploring new frontiers of theoretical informatics. International conference IFIP TCS 2000, Sendai, Japan, August 17--19, 2000. Proceedings (Q1578446)

From MaRDI portal





scientific article; zbMATH DE number 1498565
Language Label Description Also known as
English
Theoretical computer science. Exploring new frontiers of theoretical informatics. International conference IFIP TCS 2000, Sendai, Japan, August 17--19, 2000. Proceedings
scientific article; zbMATH DE number 1498565

    Statements

    Theoretical computer science. Exploring new frontiers of theoretical informatics. International conference IFIP TCS 2000, Sendai, Japan, August 17--19, 2000. Proceedings (English)
    0 references
    31 August 2000
    0 references
    The articles of this volume will be reviewed individually. Indexed articles: \textit{Abadi, Martín; Rogaway, Phillip}, Reconciling two views of cryptography (the computational soundness of formal encryption), 3-22 [Zbl 1008.68048] \textit{Hagiya, Masami}, Theory and construction of molecular computers, 23-24 [Zbl 0998.68647] \textit{Sudan, Madhu}, List decoding: Algorithms and applications, 25-41 [Zbl 1009.94572] \textit{Mauri, Giancarlo; Pavesi, Giulio}, Approximation algorithms for string folding problems, 45-58 [Zbl 0998.68703] \textit{Fredriksson, Kimmo; Navarro, Gonzalo; Ukkonen, Esko}, An index for two dimensional string matching allowing rotations, 59-75 [Zbl 0998.68546] \textit{Jeong, Chang-Sung; Cho, Sung-Up; Whang, Sun-Chul; Choi, Mi-Young}, Parallel edge coloring of a tree on a mesh connected computer, 76-83 [Zbl 0998.68700] \textit{Uehara, Ryuhei; Chen, Zhi-Zhong}, Parallel approximation algorithms for maximum weighted matching in general graphs, 84-98 [Zbl 0998.68229] \textit{Mayr, Ernst W.}, It is on the boundary: Complexity considerations for polynomial ideals, 99 [Zbl 0998.68661] \textit{Chung, Yoojin; Park, Kunsoo; Kwon, Hyuk-Chul}, An efficient parallel algorithm for scheduling interval ordered tasks, 100-111 [Zbl 0998.68511] \textit{Shchepin, Evgeny V.; Vakhania, Nodari N.}, Task distributions on multiprocessor systems, 112-125 [Zbl 0998.68021] \textit{Sarzeaud, Olivier; Stéphan, Yann}, Fast interpolation using Kohonen self-organizing neural networks, 126-139 [Zbl 0998.68667] \textit{Blundo, Carlo; Galdi, Clemente}, Steganography using modern arts (extended abstract), 140-151 [Zbl 0998.68671] \textit{Flajolet, Philippe; Hatzis, Kostas; Nikoletseas, Sotiris; Spirakis, Paul}, Trade-offs between density and robustness in random interconnection graphs, 152-168 [Zbl 1001.05108] \textit{Taoka, Satoshi; Watanabe, Toshimasa}, The \((\sigma+1)\)-edge-connectivity augmentation problem without creating multiple edges of a graph, 169-185 [Zbl 1001.05114] \textit{Mishra, Sounaka; Sikdar, Kripasindhu}, On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem (extended abstract), 186-199 [Zbl 1010.90523] \textit{Eidenbenz, Stephan; Stamm, Christoph}, Maximum Clique and Minimum Clique Partition in visibility graphs, 200-212 [Zbl 0998.68091] \textit{Buchholz, Thomas; Klein, Andreas; Kutrib, Martin}, Real-time language recognition by alternating cellular automata, 213-225 [Zbl 0998.68081] \textit{Martin, Bruno}, Damage spreading and \(\mu\)-sensitivity on cellular automata, 226-242 [Zbl 0998.68082] \textit{Tezuka, Shu}, Discrepancy theory and its application to finance, 243-256 [Zbl 1015.91033] \textit{Boros, Endre; Ibaraki, Toshihide; Makino, Kazuhisa}, Fully consistent extensions of partially defined Boolean functions with missing bits, 257-272 [Zbl 1010.94568] \textit{Mizuki, Takaaki; Shizuya, Hiroki; Nishizeki, Takao}, Characterization of optimal key set protocols. (Extended abstract), 273-285 [Zbl 1012.94543] \textit{Brimkov, Valentin E.; Dantchev, Stefan S.}, On the complexity of integer programming in the Blum-Shub-Smale computational model, 286-300 [Zbl 1010.90100] \textit{Albrecht, Andreas; Wong, Chak-Kuen}, On logarithmic simulated annealing, 301-314 [Zbl 0998.68232] \textit{Yannakakis, Mihalis}, Hierarchical state machines, 315-330 [Zbl 0998.68525] \textit{Cardelli, Luca; Ghelli, Giorgio; Gordon, Andrew D.}, Ambient groups and mobility types, 333-347 [Zbl 0998.68536] \textit{Fournet, Cédric; Lévy, Jean-Jacques; Schmitt, Alan}, An asynchronous, distributed implementation of mobile ambients, 348-364 [Zbl 0998.68537] \textit{Kobayashi, Naoki}, Type systems for concurrent processes: From deadlock-freedom to livelock-freedom, time-boundedness, 365-389 [Zbl 0998.68085] \textit{Merro, Massimo; Kleist, Josva; Nestmann, Uwe}, Local \(\pi\)-calculus at work: Mobile objects as mobile processes, 390-408 [Zbl 0998.68517] \textit{Dal Zilio, Silvano}, An interpretation of typed concurrent objects in the blue calculus, 409-424 [Zbl 0998.68086] \textit{Despeyroux, Joëlle}, A higher-order specification of the \(\pi\)-calculus, 425-439 [Zbl 0998.68538] \textit{Bruni, Roberto; Montanari, Ugo; Sassone, Vladimiro}, Open ended systems, dynamic bisimulation and tile logic, 440-456 [Zbl 0998.68087] \textit{Fiore, Marcelo P.}, Fibred models of processes: Discrete, continuous, and hybrid systems (extended abstract), 457-473 [Zbl 0998.68539] \textit{Mayr, Richard}, On the complexity of bisimulation problems for pushdown automata, 474-488 [Zbl 0998.68088] \textit{Kameyama, Yukiyoshi}, A type-theoretic study on partial continuations, 489-504 [Zbl 0998.68033] \textit{Fujita, Ken-Etsu; Schubert, Aleksy}, Partially typed terms between Church-style and Curry-style, 505-520 [Zbl 0998.03009] \textit{Löding, Christof; Thomas, Wolfgang}, Alternating automata and logics over infinite words (extended abstract), 521-535 [Zbl 0998.68526] \textit{Loyer, Yann; Spyratos, Nicolas; Stamate, Daniel}, Hypothesis support for information integration in four-valued logics, 536-548 [Zbl 0998.68169] \textit{Henzinger, Thomas A.}, Masaccio: A formal model for embedded components, 549-563 [Zbl 0998.93507] \textit{Lermer, Karl; Strooper, Paul}, A single complete refinement rule for demonic specifications, 564-579 [Zbl 0998.68080] \textit{Charpentier, Michel; Chandy, K. Mani}, Reasoning about composition using property transformers and their conjugates, 580-595 [Zbl 0998.68518] \textit{Gruska, Jozef}, New challenges for theoretical computer science (general introduction to the panel), 599-601 [Zbl 0998.68698] \textit{Ausiello, Giorgio}, Algorithm design challenges (position statement), 602-603 [Zbl 0998.68694] \textit{Gruska, Jozef}, Quantumization of theoretical informatics (position statement), 604-608 [Zbl 0998.68695] \textit{Montanari, Ugo}, Two problems in wide area network programming (position statement), 609-611 [Zbl 0998.68696] \textit{Toyama, Yoshihito}, New challenges for computational models (position statement), 612-613 [Zbl 0998.68697] \textit{Wiedermann, Jiří}, Towards a computational theory of everything (position statement), 614-615 [Zbl 0998.68699] \textit{van Leeuwen, Jan; Wiedermann, Jiří}, On the power of interactive computing, 619-623 [Zbl 0998.68527] \textit{Mosses, Peter D.}, The varieties of programming language semantics (summary), 624-628 [Zbl 0998.68614]
    0 references
    Sendai (Japan)
    0 references
    Proceedings
    0 references
    Conference
    0 references
    IFIP TCS 2000
    0 references
    Theoretical computer science
    0 references

    Identifiers