{"entities":{"Q1295986":{"pageid":1306736,"ns":120,"title":"Item:Q1295986","lastrevid":43012855,"modified":"2025-07-16T21:28:42Z","type":"item","id":"Q1295986","labels":{"en":{"language":"en","value":"Automata, languages and programming. 26th international colloquium, ICALP `99. Prague, Czech Republic, July 11--15, 1999. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1313893"}},"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":"Q1295986$8405F4D2-F026-4542-8D2A-F4A18C803F3E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"117fc4c9ec5cddb4398778de651a44a46bc8549b","datavalue":{"value":{"text":"Automata, languages and programming. 26th international colloquium, ICALP `99. Prague, Czech Republic, July 11--15, 1999. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1295986$5A9E81F7-6A80-478D-A8C0-F583A676A5D7","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"2f89b807c15c83183f31646b9bdb1a7124224019","datavalue":{"value":"0917.00014","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1295986$7C41495B-F2FB-4CB8-9748-03C0B1F75F81","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"17a55b5107ed93533ef93eb69aab9729675a3fa6","datavalue":{"value":"10.1007/3-540-48523-6","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1295986$A089EBC5-1BF2-4FEA-AE55-70700E0D4790","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":"Q1295986$7FD37962-AA42-4266-A154-D3C6AA5912C5","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"3f17fe6f73043bfd4b99079c382b6d17c4e7b22f","datavalue":{"value":{"time":"+1999-07-07T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1295986$4B5049F0-68E7-41C7-B0A8-D251ECE18C2E","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"7da5dc6122e5e567386113b52105b8479461e3a4","datavalue":{"value":"The articles of mathematical interest will be reviewed individually. The preceding colloquium (25th, 1998) has been announced (see Zbl 0893.00039).  Indexed articles:  \\textit{Ajtai, Mikl\u00f3s}, Generating hard instances of the short basis problem, 01-09 [Zbl 0987.94021]  \\textit{Compton, Kevin J.; Dexter, Scott}, Proof techniques for cryptographic protocols, 25-39 [Zbl 0987.94508]  \\textit{Cucker, Felipe}, Real computations with fake numbers, 55-73 [Zbl 0944.03030]  \\textit{Edalat, Abbas; Krznari\u0107, Marko}, Numerical integration with exact real arithmetic, 90-104 [Zbl 0937.65025]  \\textit{Rozenberg, Grzegorz; Salomaa, Arto}, DNA computing: New ideas and paradigms, 106-118 [Zbl 0939.68040]  \\textit{Allender, Eric; Ambainis, Andris; Mix Barrington, David A.; Datta, Samir; Huong L\u00ea Thanh}, Bounded depth arithmetic circuits: Counting and closure, 149-158 [Zbl 1020.94543]  \\textit{Alur, Rajeev; Etessami, Kousha; La Torre, Salvatore; Peled, Doron}, Parametric temporal logic for ``model measuring'', 159-168 [Zbl 0939.03021]  \\textit{Andreev, Alexander E.; Baskakov, Juri L.; Clementi, Andrea E. F.; Rolim, Jos\u00e9 D. P.}, Small pseudo-random sets yield hard functions: New tight explicit lower bounds for branching programs, 179-189 [Zbl 0941.68567]  \\textit{Bednarczyk, Marek A.; Borzyszkowski, Andrzej M.}, General morphisms of Petri nets. (Extended abstract), 190-199 [Zbl 0941.68645]  \\textit{Bouyer, Patricia; Petit, Antoine}, Decomposition and composition of timed automata, 210-219 [Zbl 0946.68094]  \\textit{Buhrman, Harry; Jiang, Tao; Li, Ming; Vit\u00e1nyi, Paul}, New applications of the incompressibility method. (Extended abstract), 220-229 [Zbl 0939.68055]  \\textit{Clote, Peter}, Protein folding, the Levinthal paradox and rapidly mixing Markov chains., 240-249 [Zbl 1037.92016]  \\textit{Cortier, Veronique; Ganzinger, Harald; Jacquemard, Florent; Veanes, Margus}, Decidable fragments of simultaneous rigid reachability, 250-260 [Zbl 0943.68096]  \\textit{De Santis, A.; Di Crescenzo, G.; Persiano, G.}, Non-interactive zero-knowledge: A low randomness characterization of NP, 271-280 [Zbl 0943.68073]  \\textit{Dickh\u00f6fer, Martin; Wilke, Thomas}, Timed alternating tree automata: The automata-theoretic solution to the TCTL model checking problem, 281-290 [Zbl 0939.03041]  \\textit{Dufourd, C.; Janc\u01cer, P.; Schnoebelen, Ph.}, Boundedness of reset P/T nets, 301-310 [Zbl 0943.68122]  \\textit{Engelfriet, Joost; Hoogeboom, Hendrik Jan}, Two-way finite state transducers and monadic second-order logic, 311-320 [Zbl 0946.68083]  \\textit{Frick, Markus; Grohe, Martin}, Deciding first-order properties of locally tree-decomposable graphs, 331-340 [Zbl 0939.03010]  \\textit{Gottlob, Georg; Leone, Nicola; Scarcello, Francesco}, Computing LOGCFL certificates, 361-371 [Zbl 0941.68580]  \\textit{Hirshfeld, Yoram; Jerrum, Mark}, Bisimulation equivalence is decidable for normed process algebra. (Extended abstract), 412-421 [Zbl 0941.68574]  \\textit{Hirshfeld, Yoram; Rabinovich, Alexander}, A framework for decidable metrical logics, 422-432 [Zbl 0939.03023]  \\textit{Hromkovi\u010d, Juraj; Schnitger, Georg}, On the power of Las Vegas. II: Two-way finite automata, 433-442 [Zbl 0939.68071]  \\textit{Iwama, Kazuo; Manlove, David; Miyazaki, Shuichi; Morita, Yasufumi}, Stable marriage with incomplete lists and ties, 443-452 [Zbl 0948.90155]  \\textit{Kirsten, Daniel}, A connection between the star problem and the finite power property in trace monoids. (Extended abstract), 473-482 [Zbl 0941.20068]  \\textit{Kirsten, Daniel; Marcinkowski, Jerzy}, Two techniques in the area of the star problem, 483-492 [Zbl 0941.20069]  \\textit{Lepist\u00f6, A.}, Relations between local and global periodicity of words. (Extended abstract), 534-543 [Zbl 0941.68658]  \\textit{Miculan, Marino}, Formalizing a lazy substitution proof system for \\(\\mu\\)-calculus in the calculus of inductive constructions, 554-564 [Zbl 0939.03024]  \\textit{Nichitiu, Codrin; R\u00e9mila, Eric}, Leader election by \\(d\\) dimensional cellular automata, 565-574 [Zbl 0941.68640]  \\textit{Niedermeier, Rolf; Rossmanith, Peter}, New upper bounds for MaxSat, 575-584 [Zbl 0946.68061]  \\textit{Olshevsky, Vadim; Pan, Victor Y.}, Polynomial and rational evaluation and interpolation (with structured matrices), 585-594 [Zbl 0937.65010]  \\textit{Peichl, Timo; Vollmer, Heribert}, Finite automata with generalized acceptance criteria, 605-614 [Zbl 0943.68119]  \\textit{Power, John; Thielecke, Hayo}, Closed Freyd- and \\(\\kappa\\)-categories, 625-634 [Zbl 0938.03026]  \\textit{Rutten, J. J. M. M.}, Automata, power series, and coinduction: Taking input derivatives seriously. (Extended abstract), 646-654 [Zbl 0941.68638]  \\textit{S\u00e9nizergues, G\u00e9raud}, T(A)=T(B)?, 665-675 [Zbl 0943.68118]  \\textit{Szegedy, Mario}, Many-valued logics and holographic proofs, 676-686 [Zbl 0938.03022]  \\textit{Umans, Christopher}, On the complexity and inapproximability of shortest implicant problems, 687-696 [Zbl 0983.94064]  \\textit{Weihrauch, Klaus; Zhong, Ning}, The wave propagator is Turing computable, 697-706 [Zbl 0945.03092]  \\textit{Tiskin, A.}, Erratum: Bulk-synchronous parallel multiplication of Boolean matrices, 717-718 [Zbl 0938.65076]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1295986$85063764-41E0-4F5F-9E7D-8ABB5BAC94D0","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1295986$CC413C25-C4AB-4524-A127-9DA9CB281556","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1295986$766DCBA9-74A4-4D6C-8159-1A19267BB7F2","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"3a5453b01c5868e4b3b20a0598d015161d9f9f3c","datavalue":{"value":"1313893","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1295986$F94B14F7-4466-4D14-B036-828272CB2145","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c0aa30c9bbca6402d32c13a132971934631af137","datavalue":{"value":"Prague (Czech Republic)","type":"string"},"datatype":"string"},"type":"statement","id":"Q1295986$7CD85DC7-9A7D-4B1D-8D29-CB66D96DC21E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q1295986$6E882E97-7655-46FD-971F-65B0C0CB9236","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"85413872e180f82c5b8a578e96e74f0315026938","datavalue":{"value":"Colloquium","type":"string"},"datatype":"string"},"type":"statement","id":"Q1295986$53FAD49E-29F9-44D4-9EAD-6F72CD21D676","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1627eafcb2d543cc4281adf6f46b85835322dc7c","datavalue":{"value":"ICALP `99","type":"string"},"datatype":"string"},"type":"statement","id":"Q1295986$39FEBF21-9965-4A84-823E-EA655F46238B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1fff7125545fcdacaefe3808a1a5f0e0a281b403","datavalue":{"value":"Automata","type":"string"},"datatype":"string"},"type":"statement","id":"Q1295986$C04A3516-758D-487A-AF8F-C1E24164A343","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9ec8e8b0049b2993c302f718ff35544cfb0150a0","datavalue":{"value":"Languages","type":"string"},"datatype":"string"},"type":"statement","id":"Q1295986$1D1A95C4-57E4-4C86-BD34-FB9A57210176","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"39c11b645d72aab44f88706dc65aaed7361e2cc1","datavalue":{"value":"Programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1295986$C60F6DC8-C5E5-4DD5-BA4C-64A3AD9023EC","rank":"normal"}],"P12":[{"mainsnak":{"snaktype":"value","property":"P12","hash":"40fd4066aa5aaf84eb0338c6cf58dadcd1e0ed20","datavalue":{"value":"Q56335601","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1295986$AAEF72DA-E703-4211-B7B2-96BDCF25FAD5","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":"Q1295986$54124948-8EAE-4EBD-8E0E-F6B7BB9DBB61","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"86fd9a9590e46b88a12272bfc3362efcb782875e","datavalue":{"value":"https://doi.org/10.1007/3-540-48523-6","type":"string"},"datatype":"url"},"type":"statement","id":"Q1295986$5FF0520C-A795-4F7E-9F9E-824AC9426DAF","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"20d17d80aa5043947455e32501f05dcc5f6e420f","datavalue":{"value":"W2741645723","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1295986$3EBE5CD1-B85B-4A3F-8EA5-7B79839A1493","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:1295986","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:1295986"}}}}}