Show indexed articles as search result.

The articles of mathematical interest will be reviewed individually. The preceding conference (18th, 1998) has been indicated (see Zbl 0903.00078).
Indexed articles:
Sharir, Micha, Recent developments in the theory of arrangements of surfaces, 1-20 [Zbl 0958.68180]
Aluru, Srinivas; Sevilgen, Fatih E., Dynamic compressed hyperoctrees with application to the N-body problem, 21-33 [Zbl 0958.68052]
Herrmann, Philippe, Renaming is necessary in timed regular expressions, 47-59 [Zbl 0961.68073]
D’Souza, Deepak; Thiagarajan, P. S., Product interval automata: A subclass of timed automata, 60-71 [Zbl 0958.68087]
Löding, Christof, Optimal bounds for transformations of \(\omega\)-automata, 97-109 [Zbl 0961.68074]
Wilke, Thomas, CTL\(^+\) is exponentially more succinct than CTL, 110-121 [Zbl 0952.03017]
Abadi, Martín; Fournet, Cédric; Gonthier, Georges, A top-down look at a secure message, 122-141 [Zbl 0983.94511]
Dix, Jürgen; Schlechta, Karl, Explaining updates by minimal sums, 142-154 [Zbl 0958.68165]
Lu, James J.; Murray, Neil V.; Rosenthal, Erik, A foundation for hybrid knowledge bases, 155-167 [Zbl 0961.68132]
von Oheimb, David, Hoare logic for mutual recursion and local variables, 168-180 [Zbl 0956.68086]
Lévy, Jean-Jacques; Maranget, Luc, Explicit substitutions and programming languages, 181-200 [Zbl 0958.68043]
Becchetti, Luca; Di Ianni, Miriam; Marchetti-Spaccamela, Alberto, Approximation algorithms for routing and call scheduling in all-optical chains and rings, 201-212 [Zbl 0953.90031]
Garg, Naveen; Jain, Sachin; Swamy, Chaitanya, A randomized algorithm for flow shop scheduling, 213-218 [Zbl 0952.90015]
Castellani, Ilaria; Mukund, Madhavan; Thiagarajan, P. S., Synthesizing distributed transition systems from global specifications, 219-231 [Zbl 0956.68008]
Mukhopadhyay, Supratik; Podelski, Andreas, Beyond region graphs: Symbolic forward analysis of timed automata, 232-244 [Zbl 0958.68088]
Bidoit, Nicole; de Amo, Sandra, Implicit temporal query languages: Towards completeness, 245-257 [Zbl 0958.68057]
Baaz, Matthias; Ciabattoni, Agata; Fermüller, Christian; Veith, Helmut, On the undecidability of some sub-classical first-order logics, 258-268 [Zbl 0952.03003]
Chandran, L. Sunil, A high girth graph construction and a lower bound for hitting set size for combinatorial rectangles, 283-290 [Zbl 0954.05043]
Amadio, Roberto M.; Boudol, Gérard; Lhoussaine, Cédric, The receptive distributed \(\pi\)-calculus. (Extended abstract), 304-315 [Zbl 0958.68117]
Ésik, Zoltán; Okawa, Satoshi, Series and parallel operations on pomsets, 316-328 [Zbl 0959.08002]
Sauerhoff, Martin, Computing with restricted nondeterminism: The dependence of the OBDD size on the number of nondeterministic variables, 342-355 [Zbl 0958.68062]
Sieling, Detlef, Lower bounds for linear transformed OBDDs and FBDDs, 356-368 [Zbl 0958.68071]
Huth, Michael, A unifying framework for model checking labeled Kripke structures, modal transition systems, and interval transition systems, 369-380 [Zbl 0958.68118]
Corradini, Flavio; De Nicola, Rocco; Labella, Anna, Graded modalities and resource bisimulation, 381-393 [Zbl 0948.03024]
Schindelhauer, Christian; Jakoby, Andreas, The non-recursive power of erroneous computation, 394-406 [Zbl 0956.68062]
Yamakami, Tomoyuki, Analysis of quantum functions, 407-419 [Zbl 0964.81019]
Heinemann, Bernhard, On sets growing continuously, 420-431 [Zbl 0957.03028]
van der Meyden, Ron; Shilov, Nikolay V., Model checking knowledge and time in systems with perfect recall. (Extended abstract), 432-445 [Zbl 0958.68119]