Conferences in DBLP
Gaston H. Gonnet The tPI (tRNA Pairing Index), a Mathematical Measure of Repetition in a (Biological) Sequence. [Citation Graph (0, 0)][DBLP ] Conf ] Juraj Hromkovic Stability of Approximation in Discrete Optimization. [Citation Graph (0, 0)][DBLP ] Conf ] Robin Milner Towards a Broader Theory of Mobile Processes. [Citation Graph (0, 0)][DBLP ] Conf ] Michaël Rusinowitch A Decidable Analysis of Security Protocols. [Citation Graph (0, 0)][DBLP ] Conf ] Ilia Toli , Alberto Zanoni Looking Inside AES and BES. [Citation Graph (0, 0)][DBLP ] Conf ] Zhaohui Cheng , Richard Comley , Luminita Vasiu Remove Key Escrow from The Identity-Based Encryption System. [Citation Graph (0, 0)][DBLP ] Conf ] An Braeken , Christopher Wolf , Bart Preneel A Randomised Algorithm for Checking the Normality of Cryptographic Boolean Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Alex Brodsky Reversible Circuit Realizations of Boolean Functions. [Citation Graph (0, 0)][DBLP ] Conf ] Toshio Suzuki , Tomoyuki Yamakami Resource Bounded Immunity and Simplicity. [Citation Graph (0, 0)][DBLP ] Conf ] Holger Spakowski , Rahul Tripathi Degree Bounds on Polynomials and Relativization Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Hubert Schmid , Thomas Worsch The Firing Squad Synchronization Problem with Many Generals For One-Dimensional CA. [Citation Graph (0, 0)][DBLP ] Conf ] Ömer Egecioglu , Oscar H. Ibarra A Matrix q-Analogue of the Parikh Map. [Citation Graph (0, 0)][DBLP ] Conf ] Hagit Attiya , David Hay The Inherent Queuing Delay of Parallel Packet Switches. [Citation Graph (0, 0)][DBLP ] Conf ] Paola Flocchini , Antonio Mesa Enriques , Linda Pagli , Giuseppe Prencipe , Nicola Santoro Efficient Protocols for Computing the Optimal Swap Edges of a Shortest Path Tree. [Citation Graph (0, 0)][DBLP ] Conf ] Giovanna Melideo , Paolo Penna , Guido Proietti , Roger Wattenhofer , Peter Widmayer Truthful Mechanisms for Generalized Utilitarian Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Sébastien Baehni , Roberto Baldoni , Rachid Guerraoui , Bastian Pochon The Driving Philosophers. [Citation Graph (0, 0)][DBLP ] Conf ] Roman Dementiev , Peter Sanders , Dominik Schultes , Jop F. Sibeyn Engineering an External Memory Minimum Spanning Tree Algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Cieliebak , Thomas Erlebach , Fabian Hennecke , Birgitta Weber , Peter Widmayer Scheduling with Release Times and Deadlines on a Minimum Number of Machines. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Jansen Approximation Algorithms for Mixed Fractional Packing and Covering Problems. [Citation Graph (0, 0)][DBLP ] Conf ] Aleksei V. Fishkin , Olga Gerber , Klaus Jansen On Weighted Rectangle Packing with Large Resources. [Citation Graph (0, 0)][DBLP ] Conf ] Satoko Mamada , Takeaki Uno , Kazuhisa Makino , Satoru Fujishige An O(n log 2n) Algorithm for the Optimal Sink Location Problem in Dynamic Tree Networks. [Citation Graph (0, 0)][DBLP ] Conf ] Costas S. Iliopoulos , Christos Makris , Yannis Panagis , Katerina Perdikuri , Evangelos Theodoridis , Athanasios K. Tsakalidis Efficient Algorithms for Handling Molecular Weighted Sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Hiro Ito , Kazuo Iwama , Takeyuki Tamura Imperfectness of Data for STS-Based Physical Mapping. [Citation Graph (0, 0)][DBLP ] Conf ] Hu Zhang Solving Packing Problem with Weaker Block Solvers. [Citation Graph (0, 0)][DBLP ] Conf ] Amr Elmasry Adaptive Sorting with AVL Trees. [Citation Graph (0, 0)][DBLP ] Conf ] Livio Colussi , Gilberto Filé , A. Griggio Precise Analysis of p-Calculus in Cubic Time. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Wildmoser , Tobias Nipkow , Gerwin Klein , Sebastian Nanz Prototyping Proof Carrying Code. [Citation Graph (0, 0)][DBLP ] Conf ] Zhiming Liu , Jifeng He , Xiaoshan Li Contract Oriented Development of Component Software. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Bruni , José Luiz Fiadeiro , Ivan Lanese , Antónia Lopes , Ugo Montanari New Insights on Architectural Connectors. [Citation Graph (0, 0)][DBLP ] Conf ] Iovka Boneva , Jean-Marc Talbot On Complexity of Model-Checking for the TQL Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Antonín Kucera , Richard Mayr A Generic Framework for Checking Semantic Equivalences between Pushdown Automata and Finite-State Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Bournez , Felipe Cucker , Paulin Jacobé de Naurois , Jean-Yves Marion Tailoring Recursion to Characterize Non-Deterministic Complexity Classes over Arbitrary Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Davide Ancona , Sonia Fagorzi , Elena Zucca A Calculus with Lazy Module Operators. [Citation Graph (0, 0)][DBLP ] Conf ] Xinming Ou , Gang Tan , Yitzhak Mandelbaum , David Walker Dynamic Typing with Dependent Types. [Citation Graph (0, 0)][DBLP ] Conf ] Lorenzo Bettini , Viviana Bono , Betti Venneri Subtyping-Inheritance Conflicts: The Mobile Mixin Case. [Citation Graph (0, 0)][DBLP ] Conf ] Chung-Chih Li Asymptotic Behaviors of Type-2 Algorithms and Induced Baire Topologies. [Citation Graph (0, 0)][DBLP ] Conf ] Deepak Garg , Akash Lal , Sanjiva Prasad Effective Chemistry for Synchrony and Asynchrony. [Citation Graph (0, 0)][DBLP ] Conf ] Christel Baier , Marcus Größer , Martin Leucker , Benedikt Bollig , Frank Ciesinski Controller Synthesis for Probabilistic Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Petr Jancar , Jirí Srba Highly Undecidable Questions for Process Algebras. [Citation Graph (0, 0)][DBLP ] Conf ] Glynn Winskel , Francesco Zappa Nardelli New-HOPLA: A Higher-order Process Language with Name Generation. [Citation Graph (0, 0)][DBLP ] Conf ] Sergio Maffeis , Philippa Gardner Behavioural Equivalences for Dynamic Web Data. [Citation Graph (0, 0)][DBLP ] Conf ] Massimo Merro , Francesco Zappa Nardelli Behavioural Theory for Mobile Ambients. [Citation Graph (0, 0)][DBLP ] Conf ] Roberto Bruni , Hernán C. Melgratti , Ugo Montanari Nested Commits for Mobile Calculi: Extending Join. [Citation Graph (0, 0)][DBLP ] Conf ] Mario Coppo , Mariangiola Dezani-Ciancaglini , Elio Giovannetti , Rosario Pugliese Dynamic and Local Typing for Mobile Ambients. [Citation Graph (0, 0)][DBLP ] Conf ] David Teller Recovering Resources in the p-calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Yuxin Deng , Davide Sangiorgi Ensuring Termination by Typability. [Citation Graph (0, 0)][DBLP ] Conf ] Benjamin Wack The Simply-typed Pure Pattern Type System Ensures Strong Normalization. [Citation Graph (0, 0)][DBLP ] Conf ] Jules Desharnais , Bernhard Möller , Georg Struth Termination in Modal Kleene Algebra. [Citation Graph (0, 0)][DBLP ] Conf ] Alain Frisch Regular Tree Language Recognition with Static Information. [Citation Graph (0, 0)][DBLP ] Conf ] Torben Amtoft , Henning Makholm , J. B. Wells PolyA: True Type Polymorphism for Mobile Ambients. [Citation Graph (0, 0)][DBLP ] Conf ] 