Conferences in DBLP
Martín Abadi , Phillip Rogaway Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption). [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:3-22 [Conf ] Masami Hagiya Theory and Construction of Molecular Computers. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:23-24 [Conf ] Madhu Sudan List Decoding: Algorithms and Applications. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:25-41 [Conf ] Giancarlo Mauri , Giulio Pavesi Approximation Algorithms for String Folding Problems. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:45-58 [Conf ] Kimmo Fredriksson , Gonzalo Navarro , Esko Ukkonen An Index for Two Dimensional String Matching Allowing Rotations. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:59-75 [Conf ] Chang-Sung Jeong , Sung-Up Cho , Sun-Chul Whang , Mi-Young Choi Parallel Edge Coloring of a Tree on a Mesh Connected Computer. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:76-83 [Conf ] Ryuhei Uehara , Zhi-Zhong Chen Paralle Approximation Algorithms for Maximum Weighted Matching in General Graphs. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:84-98 [Conf ] Ernst W. Mayr In Is on the Boundary: Complexity Considerations for Polynominal Ideals. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:99- [Conf ] Yoojin Chung , Kunsoo Park , Hyuk-Chul Kwon An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:100-111 [Conf ] Evgeny V. Shchepin , Nodari Vakhania Task Distributions on Multiprocessor Systems. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:112-125 [Conf ] Olivier Sarzeaud , Yann Stéphan Fast Interpolation Using Kohonen Self-Organizing Neural Networks. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:126-139 [Conf ] Carlo Blundo , Clemente Galdi Steganography Using Modern Arts. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:140-151 [Conf ] Philippe Flajolet , Kostas P. Hatzis , Sotiris E. Nikoletseas , Paul G. Spirakis Trade-Offs between Density and Robustness in Random Interconnection Graphs. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:152-168 [Conf ] Satoshi Taoka , Toshimasa Watanabe The (sigma+1)-Edge-Connectivity Augmentation Problem without Creating Multiple Edges of a Graph. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:169-185 [Conf ] Sounaka Mishra , Kripasindhu Sikdar On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:186-199 [Conf ] Stephan Eidenbenz , Christoph Stamm MAXIMUM CLIQUE and MINIMUM CLIQUE PARTITION in Visibility Graphs. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:200-212 [Conf ] Thomas Buchholz , Andreas Klein , Martin Kutrib Real-Time Language Recognition by Alternating Cellular Automata. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:213-225 [Conf ] Bruno Martin Damage Spreading and µ-Sensitivity on Cellular Automata. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:226-242 [Conf ] Shu Tezuka Discrepancy Theory and Its Application to Finance. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:243-256 [Conf ] Endre Boros , Toshihide Ibaraki , Kazuhisa Makino Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:257-272 [Conf ] Takaaki Mizuki , Hiroki Shizuya , Takao Nishizeki Characterization of Optimal Key Set Protocols. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:273-285 [Conf ] Valentin E. Brimkov , Stefan S. Dantchev On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:286-300 [Conf ] Andreas Alexander Albrecht , Chak-Kuen Wong On Logarithmic Simulated Annealing. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:301-314 [Conf ] Mihalis Yannakakis Hierarchical State Machines. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:315-330 [Conf ] Luca Cardelli , Giorgio Ghelli , Andrew D. Gordon Ambient Groups and Mobility Types. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:333-347 [Conf ] Cédric Fournet , Jean-Jacques Lévy , Alan Schmitt An Asynchronous, Distributed Implementation of Mobile Ambients. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:348-364 [Conf ] Naoki Kobayashi Type Systems for Concurrent Processes: From Deadlock-Freedom to Livelock-Freedom, Time-Boundedness. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:365-389 [Conf ] Massimo Merro , Josva Kleist , Uwe Nestmann Local pi-Calculus at Work: Mobile Objects as Mobile Processes. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:390-408 [Conf ] Silvano Dal-Zilio An Interpretation of Typed Concurrent Objects in the Blue Calculus. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:409-424 [Conf ] Joëlle Despeyroux A Higher-Order Specification of the pi-Calculus. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:425-439 [Conf ] Roberto Bruni , Ugo Montanari , Vladimiro Sassone Open Ended Systems, Dynamic Bisimulation and Tile Logic. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:440-456 [Conf ] Marcelo P. Fiore Fibred Models of Processes: Discrete, Continuous, and Hybrid Systems. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:457-473 [Conf ] Richard Mayr On the Complexity of Bisimulation Problems for Pushdown Automata. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:474-488 [Conf ] Yukiyoshi Kameyama A Type-Theoretic Study on Partial Continuations. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:489-504 [Conf ] Ken-etsu Fujita , Aleksy Schubert Partially Typed Terms between Church-Style and Curry-Style. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:505-520 [Conf ] Christof Löding , Wolfgang Thomas Alternating Automata and Logics over Infinite Words. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:521-535 [Conf ] Yann Loyer , Nicolas Spyratos , Daniel Stamate Hypothesis Support for Information Integration in Four-Valued Logics. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:536-548 [Conf ] Thomas A. Henzinger Masaccio: A Formal Model for Embedded Components. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:549-563 [Conf ] Karl Lermer , Paul A. Strooper A Single Complete Refinement Rule for Demonic Specifications. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:564-579 [Conf ] Michel Charpentier , K. Mani Chandy Reasoning about Composition Using Property Transformers and Their Conjugates. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:580-595 [Conf ] Gordon D. Plotkin Some New Directions in the Syntax and Semantics of Formal Languages. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:596- [Conf ] Jozef Gruska New Challenges for Theoretical Computer Science. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:599-601 [Conf ] Giorgio Ausiello Algorithm Design Challenges. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:602-603 [Conf ] Jozef Gruska Quantumization of Theoretical Informatics. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:604-608 [Conf ] Ugo Montanari Two Problems in Wide Area Network Programming. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:609-611 [Conf ] Yoshihito Toyama New Challenges for Compuational Models. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:612-613 [Conf ] Jirí Wiedermann Towards a Computational Theory of Everything. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:614-615 [Conf ] Jan van Leeuwen , Jirí Wiedermann On the Power of Interactive Computing. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:619-623 [Conf ] Peter D. Mosses The Varieties of Programming Language Semantics. [Citation Graph (0, 0)][DBLP ] IFIP TCS, 2000, pp:624-628 [Conf ]