Volume 11, Number 1, March 2000

• 
  Harald Ganzinger, Florent Jacquemard, Margus Veanes: Rigid Reachability, The Non-Symmetric Form of Rigid E-Unification. 3-27
• 
  Martin Müller, Susumu Nishimura: Type Inference for First-Class Messages with Feature Constraints. 29-63
• 
  Masatomo Hashimoto: First-Class Contexts in ML. 65-87
• 
  Ichiro Ogata: Constructive Classical Logic as CPS-Calculus. 89-112
• 
  Luca Roversi: Light Affine Logic as a Programming Language: A First Contribution. 113-152

• 
  Zhonghua Yang, Chengzheng Sun, Yuan Miao, Abdul Sattar, Yanyan Yang: Guaranteed Mutually Consistent Checkpointing in Distributed Computations. 153-166
• 
  Gheorghe Paun: Computing with Membranes (P Systems): A Variant. 167-181
• 
  Arnold L. Rosenberg: Guidelines for Data-Parallel Cycle-Stealing in Networks of Workstations II: On Maximizing Guaranteed Output. 183-204

Volume 11, Number 2, June 2000

• 
  Sanguthevar Rajasekaran, Sartaj Sahni: Special Issue on Randomized Computing. 205
• 
  Keqin Li: A Method for Evaluating the Expected Load of Dynamic Tree Embeddings in Hypercubes. 207-230
• 
  Nihar R. Mahapatra, Shantanu Dutt: Random Seeking: A General, Efficient, and Informed Randomized Scheme for Dynamic Load Balancing. 231-246
• 
  Sotiris E. Nikoletseas, Krishna V. Palem, Paul G. Spirakis, Moti Yung: Connectivity Properties in Random Regular Graphs with Edge Faults. 247-262
• 
  Hung-Min Sun: On the Dealer's Randomness Required in Perfect Secret Sharing Schemes with Access Structures of Constant Rank. 263-281

• 
  R. K. Shyamasundar, S. Ramesh: Languages for Reactive Specifications: Synchrony Vs Asynchrony. 283-314
• 
  Harald Hempel, Gerd Wechsung: The Operators min and max on the Polynomial Hierarchy. 315-342
• 
  Hans Zantema, Hans L. Bodlaender: Finding Small Equivalent Decision Trees is Hard. 343-354

Volume 11, Number 3, September 2000

• 
  Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle: Mod-2 Independence and Domination in Graphs. 355-363
• 
  Ljubomir Perkovic, Bruce A. Reed: An Improved Algorithm for Finding Tree Decompositions of Small Width. 365-371
• 
  Öjvind Johansson: NLC₂-Decomposition in Polynomial Time. 373-395
• 
  Anne Berry, Jean Paul Bordat, Olivier Cogis: Generating All the Minimal Separators of a Graph. 397-403
• 
  Anna Accornero, Massimo Ancona, Sonia Varini: All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time. 405-421
• 
  Martin Charles Golumbic, Udi Rotics: On the Clique-Width of Some Perfect Graph Classes. 423-443
• 
  Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos: Finding Smallest Supertrees Under Minor Containment. 445-465
• 
  Annegret Liebers, Dorothea Wagner, Karsten Weihe: On the Hardness of Recognizing Bundles in Time Table Graphs. 467-484

• 
  Seonghun Cho, Sartaj Sahni: A New Weight Balanced Binary Search Tree. 485-513
• 
  Takeshi Okadome: Some Sufficient Conditions of Learnability in the Limit From Positive Data. 515-524

Volume 11, Number 4, December 2000

• 
  Sven Kosub, Heinz Schmitz, Heribert Vollmer: Uniform Characterizations of Complexity Classes of Functions. 525-551
• 
  Anu G. Bourgeois, Jerry L. Trahan: Relating Two-Dimensional Reconfigurable Meshes with Optically Pipelined Buses. 553-571
• 
  Guozhu Dong, Louxin Zhang: Separating Auxiliary Arity Hierarchy of First-Order Incremental Evaluation Systems Using (3k+1)-ary Input Relations. 573-578
• 
  Paola Bonizzoni, Gianluca Della Vedova, Giancarlo Mauri: Approximating the Maximum Isomorphic Agreement Subtree is Hard. 579-590
• 
  Ron van der Meyden: Predicate Boundedness of Linear Monadic Datalog is in PSPACE. 591-612
• 
  Johannes Köbler, Wolfgang Lindner: Oracles in S^p₂ are Sufficient for Exact Learning. 615-632
• 
  Erzsébet Csuhaj-Varjú, Carlos Martín-Vide, Victor Mitrana, György Vaszil: Parallel Communicating Pushdown Automata Systems. 633-650

last updated on Sat May 25 06:14:59 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page