Table Of Content

Index to Volume 34 AGRAWAL, M.: The Satisfiability Problem for Probabilistic Ordered Branch ing Programs AKL, S. G.: see Bruda, S$. D AL-AMMAL, H.: An Improved Stability Bound for Binary Exponential Backoft ARORA, N. S.: Thread Scheduling for Multiprogrammed Multiprocessors BARBOSA, V. C.: Sharing Resources at Nonuniform Access Rates BECKER, R.: A Polynomial-Time Algorithm for Max-Min Partitioning of Ladders BENEVIDES, M. R. F.: see Barbosa, V. C BLUMOFE,R . D.: see Arora, N.S BORNSTEIN, C. F.: On the Bisection Width and Expansion of Butterfly Networks BRUDA, S. D.: Pursuit and Evasion on a Ring: An Infinite Hierarchy for Parallel Real-Time Systems CARPI, A: Special Factors and Uniqueness Conditions in Rational Trees CAUCAL, D: An Internal Presentation of Regular Graphs by Prefix-Recog nizable Graphs CHAN-SU SHIN: see Sung Kwon Kim CUCKER, F.: Decision Problems and Round-Off Machines DE LA TORRE, P.: Polynomially Improved Efficiency for Fast Parallel Single Source Lexicographic Depth-First Search, Breadth-First Search, and lopological-First Search DE LUCA, A.: see Carpi, A DEDIEU, J.-P.: see Cucker, | DITTRICH, W.: Blocking in Parallel Multisearch Problems FORTNOW, L.: Distributionally Hard Languages FRANCA, F. M. G.: see Barbosa, V. ¢ GARDNER, L.: One-to-Many Embeddingso f Hypercubes into Cayley Graphs Generated by Reversals GOLDBERG, L. A.: see Al-Ammal, H HOLTON, C.: Directed Graphs and Substitutions HONKALA, J.: A Polynomial Bound for Certain Cases of the DOL Sequence Equivalence Problem HUTCHINSON, D. A.: see Dittrich,W KIRSTEN, D.: Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids KNAPIK, T.: see Caucal, D RANAKIS, E.: On Recognizing a Strinogn an Anonymous Ring KRIZANC, D.: see Kranakis, I KRUSKAL, C. P.: see de la Torre, P. LARI, L.: see Becker, R LECOMTE, P. B. A.: Numeration Systems on a Regular Language LI, K.: Deterministic and Randomized Algorithms for Distributed On-Line Task Assignment and Load Balancing without Load Status Information LITMAN, A.: see Bornstein,C . I LUCERTINI, M.: see Becker, R LUCCIO, F. L.: see Kranakis, I MACKENZIE, P.: see Al-Ammal, H MAGGS, B. M.: see Bornstein,C . I MAHESHWARL, A.: see Dittrich, W MILLER, Z.: see Gardner, I MITZENMACHER, M.: Analyseso f Load Stealing Models Basedo n Families of Differential Equations NOLL, T.: The Universality of Higher-Order Attributed Tree Transducers PAVAN, A.: see Fortnow, L PLAXTON,C . G.: see Arora, N.S PRITIKIN, D.: see Gardner, I RAJASEKARAN, S.: A Framework for Simple Sorting Algorithms on Parallel Disk Systems RICHOMME,G :: see Kirsten, D RIGO, M.: see Lecomte, P. B. A SELMAN, A. L.: Editorial Statement SELMAN, A. L.: see Fortnow, L SHAVIT, N.: A Wait-Free Sorting Algorithm SIMEONE, B.: see Becker, R SITARAMAN, R. K.: see Bornstein,C . I SUDBOROUGH, I. H.: see Gardner, I SUNG KWON KIM: Computing the Optimal Bridge between Two Polygons PHIERAUF, T.: see Agrawal, M UPFAL, E.: see Shavit, N VARRICCHIO,S .: see Carpi, A VOGLER, H.: see Noll, T YATZKAR, T.: see Bornstein, C. F ZAMBONL L. Q.: see Holton,C ZEMACH, A.: see Shavit, N