Show indexed articles as search result.

The articles of this volume will be reviewed individually. The preceding conference (22, 1995) has been reviewed (see Zbl 0844.00016).
Indexed articles:
Ganzinger, Harald, Saturation-based theorem proving (abstract), 1-3 [Zbl 1046.68641]
Ranade, Abhiram, Bandwidth efficient parallel computation, 4-23 [Zbl 1046.68534]
Bruyère, Véronique; Latteux, Michel, Variable-length maximal codes, 24-47 [Zbl 1046.94511]
Razborov, Alexander, Lower bounds for propositional proofs and independence results in bounded arithmetic, 48-62 [Zbl 1045.03524]
Chen, Xiao Jun; De Nicola, Rocco, Algebraic characterizations of decorated trace equivalences over tree-like structures (extended abstract), 63-74 [Zbl 1046.68617]
Jenner, Lars; Vogler, Walter, Fast asynchronous systems in dense time, 75-86 [Zbl 1046.68623]
Lenzi, Giacomo, A hierarchy theorem for the \(\mu\)-calculus, 87-97 [Zbl 1045.03516]
Bradfield, Julian; Esparza, Javier; Mader, Angelika, An effective tableau system for the linear time \(\mu\)-calculus, 98-109 [Zbl 1045.03514]
Joung, Yuh-Jzer, Characterizing fairness implementability for multiparty interaction, 110-121 [Zbl 1046.68624]
Lucas, Salvador, Termination of context sensitive rewriting by rewriting, 122-133 [Zbl 1046.68565]
Cheng, Allan; Kozen, Dexter, A complete Gentzen-style axiomatization for set constraints, 134-145 [Zbl 1045.03515]
Billaud, Michel, Fatal errors in conditional expressions (extended abstract), 146-157 [Zbl 1045.03513]
Mossakowski, Till, Different types of arrow between logical frameworks, 158-169 [Zbl 1046.68509]
Mitchell, John; Viswanathan, Ramesh, Effective models of polymorphism, subtyping and recursion (extended abstract), 170-181 [Zbl 1045.03517]
Bosscher, D. J. B.; Griffioen, W. O. D., Regularity for a large class of context-free processes is decidable, 182-193 [Zbl 1046.68614]
Caucal, Didier, On infinite transition graphs having a decidable monadic theory, 194-205 [Zbl 1045.03509]
Sénizergues, Géraud, Semigroups acting on context-free graphs, 206-218 [Zbl 1046.68612]
Lisovik, Leonid P., Hard sets method and semilinear reservoir method with applications, 219-231 [Zbl 1046.68569]
Flajolet, Philippe; Gourdon, Xavier; Panario, Daniel, Random polynomials and polynomial factorization, 232-243 [Zbl 0906.11057]
Koppenhagen, Ulla; Mayr, Ernst W., Optimal Gröbner base algorithms for binomial ideals, 244-255 [Zbl 1046.68985]
Kloks, T.; Kratsch, D.; Wong, C. K., Minimum fill-in on circle and circular-arc graphs, 256-267 [Zbl 1046.68631]
Chen, Zhi-Zhong, Practical approximation schemes for maximum induced-subgraph problems on \(K_{3,3}\)-free or \(K_5\)-free graphs, 268-279 [Zbl 1046.05501]
Koutsoupias, Elias; Papadimitriou, Christos; Yannakakis, Mihalis, Searching a fixed graph, 280-289 [Zbl 1045.90532]
Rauch Henzinger, Monika; Thorup, Mikkel, Improved sampling with applications to dynamic graph algorithms, 290-299 [Zbl 1046.68983]
Pin, Jean-Eric, The expressive power of existential first order sentences of Büchi’s sequential calculus, 300-311 [Zbl 1045.03518]
Kaivola, Roope, Fixpoints for Rabin tree automata make complementation easy, 312-323 [Zbl 1045.03520]
Hashiguchi, Kosaburo, New upper bounds to the limitedness of distance automata, 324-335 [Zbl 1046.68568]
Raymond, Pascal, Recognizing regular expressions by means of dataflow networks, 336-347 [Zbl 1046.68570]
Ablayev, Farid; Karpinski, Marek, On the power of randomized branching programs, 348-356 [Zbl 1046.68531]
Andreev, Alexander E.; Clementi, Andrea E. F.; Rolim, José D. P., Hitting sets derandomize BPP, 357-368 [Zbl 1046.68536]
Book, Ronald V.; Vollmer, Heribert; Wagner, Klaus W., On type-2 probabilistic quantifiers, 369-380 [Zbl 1046.68537]
Wiedermann, Jiří, Speeding-up single-tape nondeterministic computations by single alternation, with separation results, 381-392 [Zbl 1046.68532]
Julia, Sandrine, On \(\omega\)-generators and codes, 393-402 [Zbl 1046.68632]
de Luca, Aldo, On standard Sturmian morphisms, 403-415 [Zbl 1046.68633]
Ateniese, Giuseppe; Blundo, Carlo; De Santis, Alfredo; Stinson, Douglas R., Constructions and bounds for visual cryptography, 416-428 [Zbl 1046.94513]
Azar, Yossi; Bartal, Yair; Feuerstein, Esteban; Fiat, Amos; Leonardi, Stefano; Rosén, Adi, On capital investment, 429-441 [Zbl 1045.90518]
Miltersen, Peter Bro, Lower bounds for static dictionaries on RAMs with bit operations but no multiplication, 442-453 [Zbl 1046.68540]
Bradford, Phillip G.; Reinert, Knut, Lower bounds for row minima searching (extended abstract), 454-465 [Zbl 1046.68539]
Shukla, Sandeep; Hunt, Harry B. III; Rosenkrantz, Daniel J.; Stearns, Richard E., On the complexity of relational problems for finite state processes (extended abstract), 466-477 [Zbl 1046.68627]
Jančar, Petr; Esparza, Javier, Deciding finiteness of Petri nets up to bisimulation, 478-489 [Zbl 1046.68622]
Bodei, Chiara; Degano, Pierpaolo; Priami, Corrado, Mobile processes with a distributed environment, 490-501 [Zbl 1046.68613]
van Glabbeek, R. J., The meaning of negative premises in transition system specifications. II. (Extended abstract), 502-513 [Zbl 1046.68629]
Albers, Susanne; Mitzenmacher, Michael, Average case analyses of list update algorithms, with applications to data compression, 514-525 [Zbl 1046.68978]
Schulz, Frank; Schömer, Elmar, Self-organizing data structures with dependent accesses, 526-537 [Zbl 1046.68513]
Choi, Vicky Siu-Ngan; Golin, Mordecai, Lopsided trees: Analyses, algorithms, and applications (extended abstract), 538-549 [Zbl 1046.68511]
Farach, Martin; Muthukrishnan, S., Optimal logarithmic time randomized suffix tree construction, 550-561 [Zbl 1046.68512]
Alon, Noga; Srinivasan, Aravind, Improved parallel approximation of a class of integer programming problems, 562-573 [Zbl 1046.68984]
Bermond, J.-C.; Gargano, L.; Perennes, S.; Rescigno, A. A.; Vaccaro, U., Efficient collective communication in optical networks, 574-585 [Zbl 1045.90502]
Chlebus, Bogdan S.; Gambin, Anna; Indyk, Piotr, Shared-memory simulations on a faulty-memory DMM, 586-597 [Zbl 1046.68533]
Herley, Kieran T.; Pietracaprina, Andrea; Pucci, Geppino, Fast deterministic backtrack search, 598-609 [Zbl 1046.68644]
Yu, Xiangdong; Yung, Moti, Agent rendezvous: A dynamic symmetry-breaking problem, 610-621 [Zbl 1046.68535]
Aumann, Yonatan; Bender, Michael A., Efficient asynchronous consensus with the value-oblivious adversary scheduler, 622-633 [Zbl 1046.68504]
Cowen, Lenore; Feigenbaum, Joan; Kannan, Sampath, A formal framework for evaluating heuristic programs, 634-645 [Zbl 1046.68510]
Chakrabarti, Soumen; Phillips, Cynthia A.; Schulz, Andreas S.; Shmoys, David B.; Stein, Cliff; Wein, Joel, Improved scheduling algorithms for minsum criteria (extended abstract), 646-657 [Zbl 1046.68505]
Paterson, Mike; Przytycka, Teresa, On the complexity of string folding, 658-669 [Zbl 1047.65503]
Fernández-Baca, David; Lagergren, Jens, A polynomial-time algorithm for near-perfect phylogeny, 670-680 [Zbl 1046.68541]