Abstract is missing.
- Spreading of Messages in Random GraphsChing-Lueh Chang, Yuh-Dauh Lyuu. 3-7 [doi]
- Minimum Cost Homomorphism to Oriented Cycles with Some LoopsMehdi Karimi, Arvind Gupta. 7-17 [doi]
- Testing Square-Freeness of Strings Compressed by Balanced Straight Line ProgramWataru Matsubara, Shunsuke Inenaga, Ayumi Shinohara. 19-28 [doi]
- On Process ComplexityAdam R. Day. 29-34 [doi]
- Reasoning about a Distributed Probabilistic SystemUkachukwu Ndukwu, Jeff W. Sanders. 35-42 [doi]
- Augmenting Edge-Connectivity between Vertex SubsetsToshimasa Ishii, Kazuhisa Makino. 43-49 [doi]
- Type Checking and Inference for Polymorphic and Existential TypesKoji Nakazawa, Makoto Tatsuta. 61-69 [doi]
- Transformation Rules for ZMark Utting, Petra Malik, Ian Toyn. 71-80 [doi]
- Computing Nash Equilibria Gets Harder: New Results Show Hardness Even for Parameterized ComplexityVladimir Estivill-Castro, Mahdi Parsa. 81-87 [doi]
- Lower Bounds on Quantum Query Complexity for Read-Once Decision Trees with Parity NodesHideaki Fukuhara, Eiji Takimoto. 89-98 [doi]
- Longest Paths in Planar DAGs in Unambiguous LogspaceNutan Limaye, Meena Mahajan, Prajakta Nimbhorkar. 99-105 [doi]
- Formal Model of a Protocol ConverterJing Cao, Albert Nymeyer. 107-117 [doi]
- Boolean Affine Approximation with Binary Decision DiagramsKevin Henshall, Peter Schachte, Harald Søndergaard, Leigh Whiting. 119-127 [doi]
- Structural Properties of Random Graph ModelsAndras Farago. 129-136 [doi]
- Linear Axis for Planar Straight Line GraphsKira Vyatkina. 137-150 [doi]
- Edge-Selection Heuristics for Computing Tutte PolynomialsDavid J. Pearce, Gary Haggard, Gordon Royle. 151-159 [doi]
- Distributing Frequency-Dependent Data Stream ComputationsSumit Ganguly. 161-167 [doi]