{"entities":{"Q1764625":{"pageid":1775367,"ns":120,"title":"Item:Q1764625","lastrevid":69034116,"modified":"2026-04-13T03:52:30Z","type":"item","id":"Q1764625","labels":{"en":{"language":"en","value":"Exploring new frontiers of theoretical informatics. IFIP 18th world computer congress, TC1 3rd international conference on theoretical computer science (TCS2004), 22--27 August 2004, Toulouse, France."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2138820"}},"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":"Q1764625$B1445AFB-864E-42B6-98B1-D8E153FF95AD","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"18a36773f5f2f25aa33de07d234b202c24f80418","datavalue":{"value":{"text":"Exploring new frontiers of theoretical informatics. IFIP 18th world computer congress, TC1 3rd international conference on theoretical computer science (TCS2004), 22--27 August 2004, Toulouse, France.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1764625$D91D355D-8069-4F7F-8763-783BB731BE53","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"48419277a3044fa65aae5cf19cf62b0ea27ac045","datavalue":{"value":"1057.68001","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1764625$634F4188-7C3C-48F3-A124-C75D84944F9C","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"a6f2bc0116d3585b3787d35b3aba4f0e8d335f51","datavalue":{"value":{"entity-type":"item","numeric-id":162381,"id":"Q162381"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1764625$6DC3C092-8613-46AA-8B5D-3F5EBBE4BEA0","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"ccd3afca070fb9c1f222b2e6f71567886f3a19c1","datavalue":{"value":{"time":"+2005-02-25T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1764625$AD57EB71-EFD8-42C1-959C-26355FD78083","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"3ec78fd244ac94e5474851c7e3890db02a11869f","datavalue":{"value":"The articles of this volume will be reviewed individually.  Indexed articles:  \\textit{Gonnet, Gaston H.}, The tPI (tRNA pairing index), a mathematical measure of repetition in a (biological) sequence, 1-2 [Zbl 1083.92503]  \\textit{Hromkovi\u010d, Juraj}, Stability of approximation in discrete optimization, 3-18 [Zbl 1274.90316]  \\textit{Milner, Robin}, Towards a broader theory of mobile processes, 19 [Zbl 1088.68665]  \\textit{Rusinowitch, Michael}, A decidable analysis of security protocols, 21 [Zbl 1088.68521]  \\textit{Toli, Ilia; Zanoni, Alberto}, Looking inside \\({\\mathcal A}{\\mathcal E}{\\mathcal S}\\) and \\({\\mathcal B}{\\mathcal E}{\\mathcal S}\\), 23-36 [Zbl 1088.68598]  \\textit{Cheng, Zhaohui; Comley, Richard; Vasiu, Luminita}, Remove key escrow from the identity-based encryption system, 37-50 [Zbl 1094.68026]  \\textit{Braeken, An; Wolf, Christopher; Preneel, Bart}, A randomised algorithm for checking the normality of cryptographic Boolean functions, 51-66 [Zbl 1088.68595]  \\textit{Brodsky, Alex}, Reversible circuit realizations of Boolean functions, 67-80 [Zbl 1088.68596]  \\textit{Suzuki, Toshio; Yamakami, Tomoyuki}, Resource bounded immunity and simplicity, 81-95 [Zbl 1094.68571]  \\textit{Spakowski, Holger; Tripathi, Rahul}, Degree bounds on polynomials and relativization theory, 97-110 [Zbl 1088.68605]  \\textit{Schmid, Hubert; Worsch, Thomas}, The firing squad synchronization problem with many generals for one-dimensional CA, 111-124 [Zbl 1088.68650]  \\textit{Egecioglu, Omer; Ibarra, Oscar H.}, A matrix \\(q\\)-analogue of the Parikh map, 125-138 [Zbl 1066.68067]  \\textit{Attiyah, Hagit; Hay, David}, The inherent queuing delay of parallel packet switches, 139-152 [Zbl 1094.68011]  \\textit{Flocchini, Paola; Mesa Enriques, Antonio; Pagli, Linda; Prencipe, Giuseppe; Santoro, Nicola}, Efficient protocols for computing the optimal swap edges of a shortest path tree, 153-166 [Zbl 1088.68517]  \\textit{Melideo, G.; Penna, P.; Proietti, G.; Wattenhofer, R.; Widmayer, P.}, Truthful mechanisms for generalized utilitarian problems, 167-180 [Zbl 1094.68007]  \\textit{Baehni, S.; Baldoni, R.; Guerraoui, R.; Pochon, B.}, The driving philosophers, 181-194 [Zbl 1274.90053]  \\textit{Dementiev, Roman; Sanders, Peter; Schultes, Dominik; Sibeyn, Jop}, Engineering an external memory minimum spanning tree algorithm, 195-208 [Zbl 1094.68693]  \\textit{Cieliebak, Mark; Erlebach, Thomas; Hennecke, Fabian; Weber, Birgitta; Widmayer, Peter}, Scheduling with release times and deadlines on a minimum number of machines, 209-222 [Zbl 1161.68360]  \\textit{Jansen, Klaus}, Approximation algorithms for mixed fractional packing and covering problems, 223-236 [Zbl 1094.68121]  \\textit{Fishkin, Aleksei V.; Gerber, Olga; Jansen, Klaus}, On weighted rectangle packing with large resources, 237-250 [Zbl 1161.68849]  \\textit{Mamada, Satoko; Uno, Takeaki; Makino, Kazuhisa; Fujishige, Satoru}, An \\(O(n\\log^2n)\\) algorithm for a sink location problem in dynamic tree networks, 251-264 [Zbl 1170.68655]  \\textit{Iliopoulos, Costas S.; Makris, Christos; Panagis, Yannis; Perdikuri, Katerina; Theodoridis, Evangeolos; Tsakalidis, Athanasios}, Efficient algorithms for handling molecular weighted sequences, 265-277 [Zbl 1088.68551]  \\textit{Ito, Hiro; Iwama, Kazuo; Tamura, Takeyuki}, Imperfectness of data for STS-based physical mapping, 279-292 [Zbl 1088.68552]  \\textit{Zhang, Hu}, Solving packing problem with weaker block solvers, 293-306 [Zbl 1090.68573]  \\textit{Elmasry, Amr}, Adaptive sorting with AVL trees, 307-316 [Zbl 1066.68030]  \\textit{Colussi, L.; Fil\u00e8, G.; Griggio, A.}, Precise analysis of \\(\\pi\\)-calculus in cubic time, 317-331 [Zbl 1094.68059]  \\textit{Wildmoser, Martin; Nipkow, Tobias; Klein, Gerwin; Nanz, Sebastian}, Prototyping proof carrying code, 333-347 [Zbl 1094.68015]  \\textit{Liu, Zhiming; He, Jifeng; Li, Xiaoshan}, Contract oriented development of component software, 349-365 [Zbl 1094.68542]  \\textit{Bruni, Roberto; Fiadeiro, Jos\u00e9 Luiz; Lanese, Ivan; Lopes, Ant\u00f3nia; Montanari, Ugo}, New insights of architectural connectors, 367-379 [Zbl 1094.68009]  \\textit{Boneva, Iovka; Talbot, Jean-Marc}, On complexity of model-checking for the TQL logic, 381-394 [Zbl 1094.68054]  \\textit{Ku\u010dera, Anton\u00edn; Mayr, Richard}, A generic framework for checking semantic equivalences between pushdown automata and finite-state automata, 395-408 [Zbl 1094.68050]  \\textit{Bournez, O.; Cucker, F.; de Naurois, P. Jacob\u00e9; Marion, J.-Y.}, Tailoring recursion to characterize non-deterministic complexity classes over arbitrary structures, 409-422 [Zbl 1094.68034]  \\textit{Ancona, Davide; Fagorzi, Sonia; Zucca, Elena}, A calculus with lazy module operators, 423-436 [Zbl 1088.68528]  \\textit{Ou, Xinming; Tan, Gang; Mandelbaum, Yitzhak; Walker, David}, Dynamic typing with dependent types, 437-450 [Zbl 1088.68531]  \\textit{Bettini, Lorenzo; Bono, Viviana; Venneri, Betti}, Subtyping-inheritance conflicts: the mobile mixin case, 451-464 [Zbl 1088.68529]  \\textit{Li, Chung-Chih}, Asymptotic behaviors of type-2 algorithms and induced Baire topologies, 465-478 [Zbl 1088.68610]  \\textit{Garg, Deepak; Lal, Akash; Prasad, Sanjiva}, Effective chemistry for synchrony and asynchrony, 479-492 [Zbl 1088.68641]  \\textit{Baier, Christel; Gr\u00f6\u00dfer, Marcus; Leucker, Martin; Bollig, Benedikt; Ciesinski, Frank}, Controller synthesis for probabilistic systems (extended abstract), 493-506 [Zbl 1073.93037]  \\textit{Jan\u010dar, Petr; Srba, Ji\u0159\u00ed}, Highly undecidable questions for process algebras, 507-520 [Zbl 1088.68663]  \\textit{Winskel, Glynn; Zappa Nardelli, Francesco}, New-HOPLA: a higher-order process language with name generation, 521-534 [Zbl 1090.68074]  \\textit{Maffeis, Sergio; Gardner, Philippa}, Behavioural equivalences for dynamic web data, 535-548 [Zbl 1088.68555]  \\textit{Merro, Massimo; Zappa Nardelli, Francesco}, Behavioural theory for mobile ambients, 549-562 [Zbl 1095.68612]  \\textit{Bruni, Roberto; Melgratti, Hern\u00e1n; Montanari, Ugo}, Nested commits for mobile calculi: extending join, 563-576 [Zbl 1088.68507]  \\textit{Coppo, Mario; Dezani-Ciancaglini, Mariangiola; Giovannetti, Elio; Pugliese, Rosario}, Dynamic and local typing for mobile ambients, 577-590 [Zbl 1094.68060]  \\textit{Amtoft, Torben; Makholm, Henning; Wells, J. B.}, Polya: true type polymorphism for mobile ambients, 591-604 [Zbl 1088.68653]  \\textit{Teller, David}, Recovering resources in the \\(\\pi\\)-calculus, 605-618 [Zbl 1088.68667]  \\textit{Deng, Yuxin; Sangiorgi, Davide}, Ensuring termination by typability, 619-632 [Zbl 1088.68661]  \\textit{Wack, Benjamin}, The simply-typed pure pattern type system ensures strong normalization, 633-646 [Zbl 1088.68624]  \\textit{Desharnais, Jules; M\u00f6ller, Bernhard; Struth, Georg}, Termination in modal Kleene algebra, 647-660 [Zbl 1088.68619]  \\textit{Frisch, Alain}, Regular tree language recognition with static information, 661-674 [Zbl 1088.68535]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1764625$BD5E03E3-0240-4DEF-8413-B88FEBD2F49B","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1764625$604012C3-B7C8-4E33-9B05-BD9070A1C8BC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1764625$AC3D6AAD-4BB4-45B2-83EE-7AFB3A539B77","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"2476434aa31f9980aed36d1771fdd426d2985bac","datavalue":{"value":"2138820","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1764625$1A72AC2E-0505-4F73-9114-07560F727B1D","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":"Q1764625$EEE4C853-EDBB-4F83-86B2-FC6B80EECEC5","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Exploring new frontiers of theoretical informatics. IFIP 18th world computer congress, TC1 3rd international conference on theoretical computer science (TCS2004), 22--27 August 2004, Toulouse, France.","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Exploring_new_frontiers_of_theoretical_informatics._IFIP_18th_world_computer_congress,_TC1_3rd_international_conference_on_theoretical_computer_science_(TCS2004),_22--27_August_2004,_Toulouse,_France."}}}}}