Larsen, Kim G. (ed.); Skyum, Sven (ed.); Winskel, Glynn (ed.) Automata, languages and programming. 25th international colloquium, ICALP ’98. Aalborg, Denmark, July 13–17, 1998. Proceedings. (English) Zbl 0893.00039 Lecture Notes in Computer Science 1443. Berlin: Springer. xvi, 932 p. (1998). Show indexed articles as search result. The articles of mathematical interest will be reviewed individually. The preceding colloquium (23rd, 1996) has been reviewed (see Zbl 1369.68020).Indexed articles:Borchert, Bernd; Kuske, Dietrich; Stephan, Frank, On existentially first-order definable languages and their relation to NP, 17-28 [Zbl 0917.68076]Raymond, Jean-François; Tesson, Pascal; Thérien, Denis, An algebraic approach to communication complexity, 29-40 [Zbl 0909.68081]Liu, Xinxin; Smolka, Scott A., Simple linear-time algorithms for minimal fixed points (extended abstract), 53-66 [Zbl 1527.68132]Lasota, Sławomir, Partial-congruence factorization of bisimilarity induced by open maps, 91-102 [Zbl 0910.68081]Dufourd, C.; Finkel, A.; Schnoebelen, Ph., Reset nets between decidability and undecidability, 103-115 [Zbl 0909.68124]Walukiewicz, Igor, Difficult configurations – on the complexity of LTrL. (Extended abstract), 140-151 [Zbl 0909.03024]Boigelot, Bernard; Rassart, Stéphane; Wolper, Pierre, On the expressiveness of real and integer arithmetic automata. (Extended abstract), 152-163 [Zbl 0910.68149]Halldórsson, Magnús M.; Kratochvíl, Jan; Telle, Jan Arne, Independent sets with domination constraints, 176-187 [Zbl 0937.05069]Grolmusz, Vince, A degree-decreasing lemma for \((\text{MOD}_q,\text{MOD}_p)\) circuits, 215-222 [Zbl 0928.94014]Gadducci, F.; Montanari, U., Axioms for contextual net processes, 296-308 [Zbl 0912.68142]Dyer, Martin; Greenhill, Catherine, A genuinely polynomial-time algorithm for sampling two-rowed contingency tables, 339-350 [Zbl 0918.62053]Power, John; Rosolini, Giuseppe, A modular approach to denotational semantics, 351-362 [Zbl 0913.18005]Kao, Ming-Yang; Wang, Jie, Efficient minimization of numerical summation errors, 375-386 [Zbl 0910.65008]Bazgan, Cristina; Santha, Miklos; Tuza, Zsolt, Efficient approximation algorithms for the SUBSET-SUMS EQUALITY problem, 387-396 [Zbl 0914.90223]Giménez, Eduardo, Structural recursive definitions in type theory, 397-408 [Zbl 0910.03022]Karhumäki, Juhani; Lepistö, Arto; Plandowski, Wojciech, Locally periodic infinite words and a chaotic behaviour, 421-430 [Zbl 0909.68133]Pin, Jean-Éric, Bridges for concatenation hierarchies, 431-442 [Zbl 0909.68113]Lin, H., Complete proof systems for observation congruences in finite-control \(\pi\)-calculus, 443-454 [Zbl 0910.03020]Victor, Björn; Parrow, Joachim, Concurrent constraints in the fusion calculus. (Extended abstract), 455-469 [Zbl 0915.03029]D’amico, Michele; Manzini, Giovanni; Margara, Luciano, On computing the entropy of cellular automata, 470-481 [Zbl 0909.68122]Buchsbaum, Adam L.; Giancarlo, Raffaele; Westbrook, Jeffery R., On the determinization of weighted finite automata, 482-493 [Zbl 0909.68121]Tiskin, A., Bulk-synchronous parallel multiplication of Boolean matrices, 494-506 [Zbl 0910.65023]Melliès, Paul-André, On a duality between Kruskal and Dershowitz theorems, 518-529 [Zbl 0921.04001]Vardi, Moshe Y., Reasoning about the past with two-way automata, 628-641 [Zbl 0909.03019]Czumaj, Artur; Lingas, Andrzej, A polynomial time approximation scheme for Euclidean minimum cost \(k\)-connectivity, 682-694 [Zbl 0913.05069]Sewell, Peter, Global/local subtyping and capability inference for a distributed \(\pi\)-calculus, 695-706 [Zbl 0910.03021]Li, Zhoujun; Chen, Huowang, Checking strong/weak bisimulation equivalences and observation congruence for the \(\pi\)-calculus. (Extended abstract), 707-718 [Zbl 0913.03037]Bini, Dario; Del Corso, Gianna M.; Manzini, Giovanni; Margara, Luciano, Inversion of circulant matrices over \(\mathbb{Z}_m\), 719-730 [Zbl 0910.65013]Plandowski, Wojciech; Rytter, Wojciech, Application of Lempel-Ziv encodings to the solution of word equations, 731-742 [Zbl 0909.68134]Ghani, Neil; de Paiva, Valeria; Ritter, Eike, Explicit substitutions for constructive necessity, 743-754 [Zbl 0949.03014]Barthe, Gilles, The relevance of proof-irrelevance. A meta-theoretical study of generalised calculi of constructions, 755-768 [Zbl 0914.03016]Hertling, Peter; Weihrauch, Klaus, Randomness spaces (extended abstract), 796-807 [Zbl 0914.03054]Fournet, Cédric; Gonthier, Georges, A hierarchy of equivalences for asynchronous calculi. (Extended abstract), 844-855 [Zbl 0909.03030]Merro, Massimo; Sangiorgi, Davide, On asynchrony in name-passing calculi, 856-867 [Zbl 0910.03019] Cited in 1 Review MSC: 00B25 Proceedings of conferences of miscellaneous specific interest 68-06 Proceedings, conferences, collections, etc. pertaining to computer science 03-06 Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations 68Q45 Formal languages and automata Keywords:Aalborg (Denmark); Proceedings; Colloquium; ICALP ’98; Automata; Languages; Programming Citations:Zbl 0851.00043; Zbl 1369.68020 PDFBibTeX XMLCite \textit{K. G. Larsen} (ed.) et al., Automata, languages and programming. 25th international colloquium, ICALP '98. Aalborg, Denmark, July 13--17, 1998. Proceedings. Berlin: Springer (1998; Zbl 0893.00039) Full Text: DOI