{"entities":{"Q1327702":{"pageid":1338452,"ns":120,"title":"Item:Q1327702","lastrevid":68840781,"modified":"2026-04-13T02:25:05Z","type":"item","id":"Q1327702","labels":{"en":{"language":"en","value":"Automata, languages and programming. 21st international colloquium, ICALP '94, Jerusalem, Israel, July 11--14, 1994. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 596400"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1327702$EE12C13F-35EA-45F7-8EB6-D2D2859816FA","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"d20c88c64bca0284c825fe04b655364f5592fea8","datavalue":{"value":{"text":"Automata, languages and programming. 21st international colloquium, ICALP '94, Jerusalem, Israel, July 11--14, 1994. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1327702$BCB3D09A-D074-46EA-BEE8-004FAEBE863E","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"6f0806d2788415d4d551fba9f81531a7ddbce8ec","datavalue":{"value":"0844.00024","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1327702$B5A57BBE-3691-4CB4-8B3B-443604B63F52","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1327702$3671749C-8FC5-4845-8838-02D08EDD093F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"56f49f0dce7aa3414ae51130ffc5f6f5df5ffbe6","datavalue":{"value":{"time":"+1994-06-27T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1327702$95EF18E1-AC39-4265-8ACB-AC0F1B2C6F72","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"fee7181657049dbdde061e2e6fdd230cda6d3cae","datavalue":{"value":"The articles of this volume will be reviewed individually. For the preceding colloquium see [Zbl 0814.00020].  Indexed articles:  \\textit{Pudl\u00e1k, Pavel}, Unexpected upper bounds on the complexity of some communication games, 1-10 [Zbl 1422.68134]  \\textit{Fernau, Henning; Staiger, Ludwig}, Valuations and unambiguity of languages, with applications to fractal geometry, 11-22 [Zbl 1418.68117]  \\textit{Siegelmann, Hava T.}, On the computational power of probabilistic and faulty neural networks, 23-34 [Zbl 1422.68074]  \\textit{\u010cer\u0101ns, K\u0101rlis}, Deciding properties of integral relational automata, 35-46 [Zbl 1418.68126]  \\textit{Aumann, Yonatan; Bar-Ilan, Judit; Feige, Uriel}, On the cost of recomputing: tight bounds on pebbling with faults, 47-58 [Zbl 1418.68100]  \\textit{Asarin, Eugene; Maler, Oded}, On some relations between dynamical systems and transition systems, 59-72 [Zbl 1418.68088]  \\textit{Globerman, Noa; Harel, David}, Complexity results for multi-pebble automata and their logics, 73-82 [Zbl 1418.68118]  \\textit{Kanellakis, Paris C.; Hillebrand, Gerd G.; Mairson, Harry G.}, An analysis of the Core-ML language: expressive power and type reconstruction, 83-105 [Zbl 1422.68020]  \\textit{Gyssens, Marc; Van den Bussche, Jan; Van Gucht, Dirk}, Expressiveness of efficient semi-deterministic choice constructs, 106-117 [Zbl 1418.68074]  \\textit{Gr\u00e4del, Erich; Gurevich, Yuri}, Tailoring recursion for complexity, 118-129 [Zbl 1418.68096]  \\textit{Klarlund, Nils; Mukund, Madhavan; Sohoni, Milind}, Determinizing asynchronous automata, 130-141 [Zbl 1422.68153]  \\textit{Muscholl, Anca}, On the complementation of B\u00fcchi asynchronous cellular automata, 142-153 [Zbl 1422.68166]  \\textit{Corradini, Flavio; De Nicola, Rocco}, Distribution and locality of concurrent systems, 154-165 [Zbl 1418.68137]  \\textit{Gawlick, Rainer; Segala, Roberto; S\u00f8gaard-Andersen, J\u00f8rgen; Lynch, Nancy}, Liveness in timed and untimed systems, 166-177 [Zbl 1418.68139]  \\textit{S\u00e1nchez-Couso, Jos\u00e9-Ram\u00f3n; Fern\u00e1ndez-Camacho, Mar\u00eda-In\u00e9s}, Average-case analysis of pattern-matching in trees under the bst probability model, 178-190 [Zbl 1422.68142]  \\textit{Jiang, Tao; Li, Ming}, On the approximation of shortest common supersequences and longest common subsequences, 191-202 [Zbl 1422.68119]  \\textit{Hariharan, Ramesh; Muthukrishnan, S.}, Optimal parallel algorithms for prefix matching, 203-214 [Zbl 1418.68249]  \\textit{Amir, Amihood; Benson, Gary; Farach, Martin}, Optimal two-dimensional compressed matching, 215-226 [Zbl 1418.68084]  \\textit{Italiano, Giuseppe F.; Ramaswami, Rajiv}, Maintaining spanning trees of small diameter, 227-238 [Zbl 1422.68189]  \\textit{Gil, Joseph; Matias, Yossi}, Simple fast parallel hashing, 239-250 [Zbl 1418.68236]  \\textit{Przytycka, Teresa M.; Larmore, Lawrence L.}, The optimal alphabetic tree problem revisited, 251-262 [Zbl 1422.68133]  \\textit{Buhrman, Harry; Torenvliet, Leen}, On the cutting edge of relativization: the resource bounded injury method, 263-273 [Zbl 1420.68090]  \\textit{Birget, J.-C.; Margolis, S.; Meakin, J.; Weil, P.}, PSPACE-completeness of certain algorithmic problems on the subgroups of free groups, 274-285 [Zbl 1418.68098]  \\textit{Hennessy, M.}, Higher-order processes and their models, 286-303 [Zbl 1418.68143]  \\textit{Vergauwen, B.; Lewi, J.}, Efficient local correctness checking for single and alternating Boolean equation systems, 304-315 [Zbl 1422.68174]  \\textit{Abdulla, Parosh Aziz; Jonsson, Bengt}, Undecidable verification problems for programs with unreliable channels, 316-327 [Zbl 1418.68123]  \\textit{Fix, Limor; Schneider, Fred B.}, Reasoning about programs by exploiting the environment, 328-339 [Zbl 1418.68054]  \\textit{Bra\u00fcner, Torben}, A model of intuitionistic affine logic from stable domain theory, 340-351 [Zbl 1422.03134]  \\textit{Plotkin, Gordon; Winskel, Glynn}, Bistructures, bidomains and linear logic, 352-363 [Zbl 1422.03130]  \\textit{Aziz, Adnan; Singhal, Vigyan; Balarin, Felice; Brayton, Robert K.; Sangiovanni-Vincentelli, Alberto L.}, Equivalences for fair Kripke structures, 364-375 [Zbl 1418.68125]  \\textit{van Breugel, Franck}, Generalizing finiteness conditions of labelled transition systems, 376-387 [Zbl 1422.68173]  \\textit{Droste, Manfred}, A Kleene theorem for recognizable languages over concurrency monoids, 388-399 [Zbl 1418.68138]  \\textit{Seidl, Helmut}, Least solutions of equations over \\(\\mathcal{N}\\), 400-411 [Zbl 1422.68036]  \\textit{Hotz, G\u00fcnter; Pitsch, Gisela}, Fast uniform analysis of coupled-context-free languages, 412-423 [Zbl 1422.68149]  \\textit{Pin, Jean-Eric}, Polynomial closure of group languages and open sets of the Hall topology, 424-435 [Zbl 1422.68159]  \\textit{Caron, Anne-C\u00e9cile; Comon, Hubert; Coquid\u00e9, Jean-Luc; Dauchet, Max; Jacquemard, Florent}, Pumping, cleaning and symbolic constraints solving, 436-449 [Zbl 1418.68114]  \\textit{Hintermeier, Claus; Kirchner, Claude; Kirchner, H\u00e9l\u00e8ne}, Dynamically-typed computations for order-sorted equational presentations, 450-461 [Zbl 1418.68057]  \\textit{Di Cosmo, Roberto; Kesner, Delia}, Combining first order algebraic rewriting systems, recursion and extensional lambda calculi, 462-472 [Zbl 1418.68112]  \\textit{Upfal, Eli}, On the theory of interconnection networks for parallel computers, 473-486 [Zbl 1422.68009]  \\textit{Garg, Naveen; Vazirani, Vijay V.; Yannakakis, Mihalis}, Multiway cuts in directed and node weighted graphs (extended abstract), 487-498 [Zbl 1418.68168]  \\textit{Feige, Uriel}, A fast randomized LOGSPACE algorithm for graph connectivity, 499-507 [Zbl 1418.68167]  \\textit{Nikoletseas, S.; Palem, K.; Spirakis, P.; Yung, M.}, Short vertex disjoint paths and multiconnectivity in random graphs: reliable network computing, 508-519 [Zbl 1422.68192]  \\textit{Lagergren, Jens}, The size of an intertwine, 520-531 [Zbl 1422.68124]  \\textit{Yuster, Raphael; Zwick, Uri}, Finding even cycles even faster, 532-543 [Zbl 1422.05098]  \\textit{H\u00f6fting, F.; Wanke, E.}, Polynomial time analysis of toroidal periodic graphs, 544-555 [Zbl 1422.68114]  \\textit{Bonizzoni, P.}, A tight lower bound for primitivity in \\(k\\)-structures, 556-567 [Zbl 1418.68163]  \\textit{Blundo, Carlo; De Santis, Alfredo; Vaccaro, Ugo}, Randomness in distribution protocols, 568-579 [Zbl 1418.68079]  \\textit{Freivalds, Rusins; Karpinski, Marek}, Lower space bounds for randomized computation, 580-592 [Zbl 1418.68094]  \\textit{Jakoby, Andreas; Schindelhauer, Christian; Reischuk, R\u00fcdiger; Weis, Stephan}, The average case complexity of the parallel prefix problem, 593-604 [Zbl 1422.68117]  \\textit{Golin, Mordecai J.; Young, Neal}, Prefix codes: equiprobable words, unequal letter costs, 605-617 [Zbl 1418.68119]  \\textit{Plaxton, C. Greg; Suel, Torsten}, A super-logarithmic lower bound for hypercubic sorting networks, 618-629 [Zbl 1422.68092]  \\textit{Mei, Aohan; Igarashi, Yoshihide}, Efficient strategies for robot navigation in unknown environment, 630-641 [Zbl 1422.68223]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1327702$11815940-879E-4A28-A8B6-D21BF1091124","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1327702$F2385B08-3E1E-4729-AD97-68D088E95F6B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1327702$3D74B536-9E1F-4806-A504-D8720CB9331D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"1779bee93b63534b6b54d3cfb8bc64aa23e60440","datavalue":{"value":"596400","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1327702$2362EB52-E874-4931-AA89-7BD4B38D5E9D","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e5b2032c6a6e5ea9f5d6c0da15255c9c98be0c60","datavalue":{"value":"Jerusalem (Israel)","type":"string"},"datatype":"string"},"type":"statement","id":"Q1327702$D0DFD127-AD03-40F7-8858-81EC799AABF9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"85413872e180f82c5b8a578e96e74f0315026938","datavalue":{"value":"Colloquium","type":"string"},"datatype":"string"},"type":"statement","id":"Q1327702$4E46D10F-4DBC-47C7-BC25-9AD91AE515B9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q1327702$09E0388B-B3C8-42EE-BF35-6588E80D4AE9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f891bc72c580ba8c6deb193c0a8498043c73f76d","datavalue":{"value":"ICALP '94","type":"string"},"datatype":"string"},"type":"statement","id":"Q1327702$723B4A18-DC9B-4B0B-BAB2-326A8B259C2D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1fff7125545fcdacaefe3808a1a5f0e0a281b403","datavalue":{"value":"Automata","type":"string"},"datatype":"string"},"type":"statement","id":"Q1327702$E5B48671-AD67-4C6D-A392-F3DF362B12C0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9ec8e8b0049b2993c302f718ff35544cfb0150a0","datavalue":{"value":"Languages","type":"string"},"datatype":"string"},"type":"statement","id":"Q1327702$34141FAC-6548-4049-8FB3-AD86694B21D2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"39c11b645d72aab44f88706dc65aaed7361e2cc1","datavalue":{"value":"Programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1327702$7586C088-C082-4280-8EF9-7F086B86A41E","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1327702$FA66C98B-2C60-46E8-B49E-D31A30401F50","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Automata, languages and programming. 21st international colloquium, ICALP '94, Jerusalem, Israel, July 11--14, 1994. Proceedings","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Automata,_languages_and_programming._21st_international_colloquium,_ICALP_%2794,_Jerusalem,_Israel,_July_11--14,_1994._Proceedings"}}}}}