Abstract is missing.
- Game Semantics: Achievements and ProspectsSamson Abramsky. 1 [doi]
- Introduction: The Fourth International Workshop on Randomization and Approximation Techniques in Computer ScienceAndrei Z. Broder. 1-2
- Clique Is Hard to Approximate within ::::n:::::::1-::::o::::(1):::Lars Engebretsen, Jonas Holmerin. 2-12 [doi]
- On the Distribution of the Number of Roots of Polynomials and Explicit Logspace ExtractorsTzvika Hartman, Ran Raz. 3-22
- Approximating the Independence Number and the Chromatic Number in Expected Polynominal TimeMichael Krivelevich, Van H. Vu. 13-24 [doi]
- Optimal Approximation of Uniform Distributions with a Biased CoinFerdinando Cicalese, Luisa Gargano, Ugo Vaccaro. 23-38
- Closed Types as a Simple Approach to Safe Imperative Multi-stage ProgrammingCristiano Calcagno, Eugenio Moggi, Walid Taha. 25-36 [doi]
- A Statically Allocated Parallel Functional LanguageAlan Mycroft, Richard Sharp. 37-48 [doi]
- Derandomization of a Parallel MIS Algorithm in a Linear HypergraphEdyta Szymanska. 39-52
- An Optimal Minimum Spanning Tree AlgorithmSeth Pettie, Vijaya Ramachandran. 49-60 [doi]
- Dispersing Hash FunctionsRasmus Pagh. 53-68
- Improved Shortest Paths on the Word RAMTorben Hagerup. 61-72 [doi]
- Worst-case Time Bounds for MAX-k-SAT with respect to the Number of Variables Using Local SearchEdward A. Hirsch. 69-76
- Improved Algorithms for Finding Level Ancestors in Dynamic TreesStephen Alstrup, Jacob Holm. 73-84 [doi]
- On Pseudorandomness with respect to Deterministic ObservesOded Goldreich, Avi Wigderson. 77-84
- Lax Logical RelationsGordon D. Plotkin, John Power, Donald Sannella, Robert D. Tennent. 85-102 [doi]
- Two-coloring Random HypergraphsDimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali. 85-96
- Introduction: Approximation and Randomized Algorithms in Communication NetworksUgo Vaccaro. 97-98
- Routing Tree Problems on Random GraphsCarme Àlvarez, Rafel Cases, Josep Díaz, Jordi Petit, Maria J. Serna. 99-110
- Reasoning about Idealized ALGOL Using Regular LanguagesDan R. Ghica, Guy McCusker. 103-115 [doi]
- Experimental Evaluation of Approximation Algorithms for the Minimum Cost Multiple-source Unsplittable Flow ProblemYasuhito Asano. 111-122
- The Measurement Process in Domain TheoryKeye Martin. 116-126 [doi]
- A Note on Parallel Read Operations on Large Public DatabasesGian Carlo Bongiovanni, Andrea E. F. Clementi, Paolo Penna. 123-134
- Graph Transformation as a Conceptual and Formal Framework for System Modeling and Model EvolutionGregor Engels, Reiko Heckel. 127-150 [doi]
- Conversion of Coloring Algorithms into Maximum Weight Independent Set AlgorithmsThomas Erlebach, Klaus Jansen. 135-146
- Distributive Online Channel Assignment for Hexagonal Cellular Networks with ConstraintsShannon L. Fitzpatrick, Jeannette Janssen, Richard J. Nowakowski. 147-154
- Monotone Proofs of the Pigeon Hole PrincipleAlbert Atserias, Nicola Galesi, Ricard Gavaldà. 151-162 [doi]
- Coloring Circular Arcs with ApplicationsLuisa Gargano, Adele A. Rescigno. 155-166
- Fully-Abstract Statecharts Semantics via Intuitionistic Kripke ModelsGerald Lüttgen, Michael Mendler. 163-174 [doi]
- The Complexity of Base Station Positioning in Cellular NetworksChristian Glaßer, Steffen Reith, Heribert Vollmer. 167-178
- Algebraic Models for Contextual NetsRoberto Bruni, Vladimiro Sassone. 175-186 [doi]
- Parallel Machine Scheduling Problems with Controllable Processing TimesKlaus Jansen, Monaldo Mastrolilli. 179-190
- Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD ProblemsBeate Bollig, Ingo Wegener. 187-198 [doi]
- Efficient Automatic Simulation of Parallel Computation on Network of WorkstationsChristos Kaklamanis, Danny Krizanc, Manuela Montangero, Pino Persiano. 191-202
- Measures of Nondeterminism in Finite AutomataJuraj Hromkovic, Juhani Karhumäki, Hartmut Klauck, Georg Schnitger, Sebastian Seibert. 199-210 [doi]
- Wavelength Routing of Uniform Instances in Optical RingsLata Narayanan, Jaroslav Opatrny. 203-214
- LTL Is Expressively Complete for Mazurkiewicz TracesVolker Diekert, Paul Gastin. 211-222 [doi]
- Efficient Communication Establishment in Adverse Communication EnvironmentsSotiris E. Nikoletseas, Paul G. Spirakis. 215-226
- An Automata-Theoretic Completeness Proof for Interval Temporal LogicBen C. Moszkowski. 223-234 [doi]
- Introduction: Workshop on Boolean Functions and ApplicationsJuraj Hromkovic, Ingo Wegener. 227-228
- On Complexity of Regular (1, +k)-Branching ProgramsFarid M. Ablayev. 229-240
- Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms?Johan Håstad. 235 [doi]
- Deterministic Algorithms for ::::k::::-SAT Based on Covering Codes and Local SearchEvgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schöning. 236-247 [doi]
- Quantum Communication ComplexityHartmut Klauck. 241-252
- Closest Vectors, Successive Minima, and Dual HKZ-Bases of LatticesJohannes Blömer. 248-259 [doi]
- On the Shannon Function for Partially Defined Boolean FunctionsPeter Bro Miltersen. 253-258
- Restricted Branching Programs with Parity-Type Augmentations-Lower Bounds and AlgorithmsDetlef Sieling. 259-262
- Variable Independence, Quantifier Elimination, and Constraint RepresentationsLeonid Libkin. 260-271 [doi]
- Introduction: Workshop on Intersection Types and Related Systems (ITRS 00)J. B. Wells. 263-266
- Intersection Types and Properties of Lambda TermsMariangiola Dezani-Ciancaglini. 267-268
- An Intrinsic Semantics of Intersection TypesJohn C. Reynolds. 269-270
- Conjunctive Types and Useless-code EliminationFerruccio Damiani. 271-286
- Constraint Satisfaction Problems and Finite AlgebrasAndrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons. 272-282 [doi]
- An Optimal Online Algorithm for Bounded Space Variable-Sized Bin PackingSteven S. Seiden. 283-295 [doi]
- A Complete Characterization of the Complete Intersection-Type TheoriesMariangiola Dezani-Ciancaglini, Furio Honsell, Fabio Alessi. 287-302
- Resource Augmentation for Online Bounded Space Bin PackingJános Csirik, Gerhard J. Woeginger. 296-304 [doi]
- Intersection Types and Topologies and Lambda CalculusSilvia Ghilezan. 303-304
- Optimal Projective Algorithms for the List Update ProblemChristoph Ambühl, Bernd Gärtner, Bernhard von Stengel. 305-316 [doi]
- A Minimal System of Disjunctive Properties for Strictness AnalysisGrzegorz Grudzinski. 305-322
- Efficient Verification Algorithms for One-Counter ProcessesAntonín Kucera. 317-328 [doi]
- A Polar Type SystemTrevor Jim. 323-338
- On the Complexity of Bisimulation Problems for Basic Parallel ProcessesRichard Mayr. 329-341 [doi]
- Characterizing Strongly Normalizing Terms of a Calculus with Generalized Applications via Intersection TypesRalph Matthes. 339-354
- Decidable First-Order Transition Logics for PA-ProcessesDenis Lugiez, Ph. Schnoebelen. 342-353 [doi]
- Non Interference for the Analysis of Cryptographic ProtocolsRiccardo Focardi, Roberto Gorrieri, Fabio Martinelli. 354-372 [doi]
- What Entailment Can do for Type TheoryRobert K. Meyer. 355-356
- Introduction: Graph Transformation and Visual Modeling TechniquesAndrea Corradini, Reiko Heckel. 357-358
- Graph Transformations on the UML MetamodelMartin Gogolla. 359-372
- From Trees to Graphs: Defining the Semantics of Diagram Languages with Graph TransformationGregor Engels, Reiko Heckel. 373-382
- Average Bit-Complexity of Euclidean AlgorithmsAli Akhavi, Brigitte Vallée. 373-387 [doi]
- Which Graphs for Visual Modeling?Francesco Parisi-Presicce. 383-386
- Can Graph Grammars Make Formal Methods More Human?Mauro Pezzè, Luciano Baresi. 387-394
- Planar Maps and Airy PhenomenaCyril Banderier, Philippe Flajolet, Gilles Schaeffer, Michèle Soria. 388-402 [doi]
- Parsing Context-Sensitive NCE Graph GrammarsYoshihiro Adachi, Suguru Kobayashi. 395-402
- Analysing Input/Output-Capabilities of Mobile Processes with a Generic Type SystemBarbara König. 403-414 [doi]
- A Graph-Grammar Based Approach to the Specification of Hypermedia Application DynamicsGiorgio Busatto, Pieter Jan t Hoen. 403-410
- Graphical Operational SemanticsAndrea Corradini, Reiko Heckel, Ugo Montanari. 411-418
- Information Flow vs. Resource Access in the Asynchronous Pi-CalculusMatthew Hennessy, James Riely. 415-427 [doi]
- Formalizing the Development of Agent-Based Systems Using Graph ProcessesRalph Depke, Reiko Heckel. 419-426
- A Proposal for Consistent Integration of Visual Computing with Visual Development of Software ComponentsHartmut Ehrig, Gabriele Taentzer. 427-434
- The Genomics Revolution and Its Challenges for Algorithmic ResearchRichard M. Karp. 428 [doi]
- Alternating the Temporal Picture for SafetyZohar Manna, Henny Sipma. 429-450 [doi]
- A Visual Modeling Technique for Controlling Graph TransformationStefan Gruner, Murat Kurt, Gabriele Taentzer. 435-442
- A Generic Model for Diagram Syntax and SemanticsBerthold Hoffmann, Mark Minas. 443-450
- A Graph Rewriting Semantics for the Polyadic CalculusBarbara König. 451-458
- Necessary and Sufficient Assumptions for Non-iterative Zero-Knowledge Proofs of Knowledge for All NP RelationsAlfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano. 451-462 [doi]
- Generic and Polymorphic Graph Transformations-Supporting the Definition of Visual LanguagesManfred Münch, Andy Schürr. 459-466
- Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NPWilliam Aiello, Sandeep N. Bhatt, Rafail Ostrovsky, Sivaramakrishnan Rajagopalan. 463-474 [doi]
- Rule-Based and Visual Model Evolution using GENGEDJulia Padberg, Claudia Ermel, Roswitha Bardohl. 467-476
- A New Unfolding Approach to LTL Model CheckingJavier Esparza, Keijo Heljanko. 475-486 [doi]
- OpenSESAME: A Tool s ConceptM. Walter. 477-484
- Introduction: International Workshop on Process Algebra and Performance ModellingRoberto Gorrieri. 485-486
- Reasoning about Message Passing in Finite State EnvironmentsB. Meenakshi, Ramaswamy Ramanujam. 487-498 [doi]
- Branching-Time Probalistic Model CheckingRance Cleaveland, S. Purushothaman Iyer. 487-500
- Extended Notions of Security for Multicast Public Key CryptosystemsOlivier Baudron, David Pointcheval, Jacques Stern. 499-511 [doi]
- Are Stochastic Process Algebras Good for Performance and Dependability EvaluationBoudewijn R. Haverkort. 501-510
- Temporal Rewards for Performance EvaluationJeroen Voeten. 511-522
- One-Round Secure Computation and Secure Autonomous Mobile AgentsChristian Cachin, Jan Camenisch, Joe Kilian, Joy Müller. 512-523 [doi]
- Amalgamation of Transition Sequences in the PEPA FormalismJane Hillston, J. Tomasik. 523-534
- Round-Optimal and Abuse Free Optimistic Multi-party Contract SigningBirgit Baum-Waidner, Michael Waidner. 524-535 [doi]
- A tool for quantitative analysis of calculus processesLinda Brodo, Pierpaolo Degano, Corrado Priami. 535-550
- On the Centralizer of a Finite SetJuhani Karhumäki, Ion Petre. 536-546 [doi]
- On the Power of Tree-Walking AutomataFrank Neven, Thomas Schwentick. 547-560 [doi]
- Integrating Two Towers and GreatSPNMarco Bernardo, Nadia Busi, Marina Ribaudo. 551-564
- Determinization of Transducers over Infinite WordsMarie-Pierre Béal, Olivier Carton. 561-570 [doi]
- Performance Analysis of UMTS Resource Allocation Strategies using TIPPtoolFulvio Babich, Lia Deotto. 565-578
- Constraint Programming and Graph AlgorithmsKurt Mehlhorn. 571-575 [doi]
- Scalable Secure Storage when Half the System Is FaultyNoga Alon, Haim Kaplan, Michael Krivelevich, Dahlia Malkhi, Julien P. Stern. 576-587 [doi]
- A Matrix-based Method for Analysing Stochastic Process AlgebrasJeremy T. Bradley, N. J. Davies. 579-590
- Generating Partial and Multiple Transversals of a HypergraphEndre Boros, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino. 588-599 [doi]
- An Asynchronous Calculus for Generative-Reactive Probalistic SystemsAlessandro Aldini, Mario Bravetti. 591-606
- Revisiting the Correspondence between Cut Elimination and NormalisationJosé Espírito Santo. 600-611 [doi]
- Approximating Variance in Non-product Form Decomposed ModelsNigel Thomas, Jeremy T. Bradley. 607-619
- Negation Elimination from Simple Equational FormulaeReinhard Pichler. 612-623 [doi]
- Hardness of Set Cover with Intersection 1V. S. Anil Kumar, Sunil Arya, H. Ramesh. 624-635 [doi]
- Strong Inapproximability of the Basic ::::k::::-Spanner ProblemMichael Elkin, David Peleg. 636-647 [doi]
- Infinite Series-Parallel Posets: Logic and LanguagesDietrich Kuske. 648-662 [doi]
- On Deciding if Deterministic Rabin Language Is in Büchi ClassTomasz Fryderyk Urbanski. 663-674 [doi]
- On Message Sequence Graphs and Finitely Generated Regular MSC LanguagesJesper G. Henriksen, Madhavan Mukund, K. Narayan Kumar, P. S. Thiagarajan. 675-686 [doi]
- PseudorandomnessOded Goldreich. 687-704 [doi]
- A Bound on the Capacity of Backoff and Acknowledgement-Based ProtocolsLeslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson. 705-716 [doi]
- Deterministic Radio BroadcastingBogdan S. Chlebus, Leszek Gasieniec, Anna Östlin, John Michael Robson. 717-728 [doi]
- An ::::omega::::-Complete Equational Specification of InterleavingWan Fokkink, Bas Luttik. 729-743 [doi]
- A Complete Axiomatization for Observational Congruence of Prioritized Finite-State BehaviorsMario Bravetti, Roberto Gorrieri. 744-755 [doi]
- Tight Size Bounds for Packet Headers in Narrow MeshesMicah Adler, Faith E. Fich, Leslie Ann Goldberg, Mike Paterson. 756-767 [doi]
- Wavelength Assignment Problem on All-Optical Networks with ::::k:::: Fibres per LinkLuciano Margara, Janos Simon. 768-779 [doi]
- On the Logical Characterisation of Performability PropertiesChristel Baier, Boudewijn R. Haverkort, Holger Hermanns, Joost-Pieter Katoen. 780-792 [doi]
- On the Representation of Timed PolyhedraOlivier Bournez, Oded Maler. 793-807 [doi]
- Min-wise Independent Permutations: Theory and PracticeAndrei Z. Broder. 808 [doi]
- Testing Acyclicity of Directed Graphs in Sublinear TimeMichael A. Bender, Dana Ron. 809-820 [doi]
- Computing the Girth of a Planar GraphHristo Djidjev. 821-831 [doi]
- Lower Bounds Are Not Easier over the Reals: Inside PHHervé Fournier, Pascal Koiran. 832-843 [doi]
- Unlearning HelpsGanesh Baliga, John Case, Wolfgang Merkle, Frank Stephan. 844-855 [doi]
- Fast Approximation Schemes for Euclidean Multi-connectivity ProblemsArtur Czumaj, Andrzej Lingas. 856-868 [doi]
- Approximate TSP in Graphs with Forbidden MinorsMichelangelo Grigni. 869-877 [doi]
- Polynominal Time Approximation Schemes for General Multiprocessor Job Shop SchedulingKlaus Jansen, Lorant Porkolab. 878-889 [doi]
- The Many Faces of a TranslationPierre McKenzie, Thomas Schwentick, Denis Thérien, Heribert Vollmer. 890-901 [doi]
- Gales and the Constructive Dimension of Individual SequencesJack H. Lutz. 902-913 [doi]
- The Global Power of Additional Queries to p-Random OraclesWolfgang Merkle. 914-925 [doi]
- Homogenization and the Polynominal CalculusJosh Buresh-Oppenheim, Matthew Clegg, Russell Impagliazzo, Toniann Pitassi. 926-937 [doi]