{"entities":{"Q5952233":{"pageid":8129035,"ns":120,"title":"Item:Q5952233","lastrevid":25476251,"modified":"2024-03-04T22:47:15Z","type":"item","id":"Q5952233","labels":{"en":{"language":"en","value":"FST TCS 2001: Foundations of software technology and theoretical computer science. 21st conference, Bangalore, India, December 13--15, 2001. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1688271"}},"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":"Q5952233$3375BB4E-4CFB-4C7D-BBD1-17C1A0C3BCA4","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"8c58e7c24a7c17145586c65e02ec98efd86983cd","datavalue":{"value":{"text":"FST TCS 2001: Foundations of software technology and theoretical computer science. 21st conference, Bangalore, India, December 13--15, 2001. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5952233$60239613-541C-4854-B470-1FD4B9928CB5","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"a33876b0aba893580cc8a48fc44855901bdfadc2","datavalue":{"value":"0977.00041","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5952233$71120A0D-71A2-4D50-8253-C7CF6F38E188","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":"Q5952233$3481F83C-AC2D-48E8-B6BD-DEB0C4EB2597","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"d99679be6596c8cc4e11d1bbb5f9466f6a2a85c4","datavalue":{"value":{"time":"+2002-01-09T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5952233$DBA0316F-F957-4E0A-9AAB-71A4B205D260","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"ca6c3954ea83b8fe5d9887ce4054ff8220479ab4","datavalue":{"value":"The articles of mathematical interest will be reviewed individually. The preceding conference (20th, 2000) has been reviewed (see Zbl 0952.00044).  Indexed articles:  \\textit{Allender, Eric}, When worlds collide: Derandomization, lower bounds, and Kolmogorov complexity, 1-15 [Zbl 1052.68059]  \\textit{Arora, Sanjeev}, Approximation schemes for geometric NP-hard problems: A survey, 16-17 [Zbl 1052.90595]  \\textit{Harel, David; Koren, Yehuda}, On clustering using random walks, 18-41 [Zbl 1052.68120]  \\textit{Stirling, Colin}, An introduction to decidability of DPDA equivalence, 42-56 [Zbl 1057.68051]  \\textit{Zwick, Uri}, Semidefinite programming based approximation algorithms, 57 [Zbl 1052.90602]  \\textit{Agrawal, Manindra}, Hard sets and pseudo-random generators for constant depth circuits, 58-69 [Zbl 1052.68047]  \\textit{Agrawal, Manindra}, The first-order isomorphism theorem, 70-82 [Zbl 1052.68048]  \\textit{Anderson, Richard; Kannan, Sampath; Karloff, Howard; Ladner, Richard E.}, Thresholds and optimal binary comparison search trees, 83-95 [Zbl 1052.68589]  \\textit{Brim, Lubo\u0161; \u010cern\u00e1, Ivana; Kr\u010d\u00e1l, Pavel; Pel\u00e1nek, Radek}, Distributed LTL model checking based on negative cycle detection, 96-107 [Zbl 1052.68631]  \\textit{Calcagno, Cristiano; Yang, Hongseok; O'Hearn, Peter W.}, Computability and complexity results for a spatial assertion language for data structures, 108-119 [Zbl 1052.68590]  \\textit{Chen, Jianer; Friesen, Donald K.; Jia, Weijia; Kanj, Iyad A.}, Using nondeterminism to design deterministic algorithms, 120-131 [Zbl 1052.68622]  \\textit{Dang, Zhe; Ibarra, Oscar H.; San Pietro, Pierluigi}, Liveness verification of reversal-bounded multicounter machines with a free counter, 132-143 [Zbl 1053.03021]  \\textit{Dold, Axel; Vialard, Vincent}, A mechanically verified compiling specification for a Lisp compiler, 144-155 [Zbl 1052.68584]  \\textit{Fisman, Dana; Pnueli, Amir}, Beyond regular model checking, 156-170 [Zbl 1052.68084]  \\textit{Forster, J\u00fcrgen; Krause, Matthias; Lokam, Satyanarayana V.; Mubarakzjanov, Rustam; Schmitt, Niels; Simon, Hans Ulrich}, Relations between communication complexity, linear arrangements, and computational complexity, 171-182 [Zbl 1052.68051]  \\textit{Gupta, Neelima; Chopra, Sumit; Sen, Sandeep}, Optimal, output-sensitive algorithms for constructing upper envelope of line segments in parallel, 183-194 [Zbl 1052.68767]  \\textit{Guruswami, Venkatesan}, List decoding from erasures: Bounds and code constructions, 195-206 [Zbl 1052.94505]  \\textit{Jaggi, Neeraj; Gopinath, K.}, Verification of a leader election algorithm in timed asynchronous systems, 207-218 [Zbl 1052.68532]  \\textit{Jakoby, Andreas; Schindelhauer, Christian}, Efficient addition on field programmable gate arrays, 219-231 [Zbl 1052.68980]  \\textit{Krishnan, Radha; Raghavachari, Balaji}, The directed minimum-degree spanning tree problem, 232-243 [Zbl 1052.68642]  \\textit{Lukovszki, Tam\u00e1s; Maheshwari, Anil; Zeh, Norbert}, I/O-efficient batched range counting and its applications to proximity problems, 244-255 [Zbl 1052.68595]  \\textit{Madhusudan, P.; Meenakshi, B.}, Beyond message sequence graphs, 256-267 [Zbl 1052.68633]  \\textit{Mastrolilli, Monaldo}, Grouping techniques for one machine scheduling subject to precedence constraints, 268-279 [Zbl 1052.68562]  \\textit{Nielsen, Mogens; Sassone, Vladimiro; Srba, Jir\u00ed}, Properties of distributed timed-arc Petri nets, 280-291 [Zbl 1052.68639]  \\textit{Peled, Doron; Pnueli, Amir; Zuck, Lenore}, From falsification to verification, 292-304 [Zbl 1052.68086]  \\textit{Plaku, Erion; Shparlinski, Igor E.}, On polynomial representations of Boolean functions related to some number theoretic problems, 305-316 [Zbl 1052.68054]  \\textit{Pnueli, Amir; Rodeh, Yoav; Shtrichman, Ofer}, Range allocation for equivalence logic, 317-333 [Zbl 1052.68088]  \\textit{Tiwari, Ashish}, Rewrite closure for ground and cancellative AC theories, 334-346 [Zbl 1052.68068]","type":"string"},"datatype":"string"},"type":"statement","id":"Q5952233$02F23642-2BBF-4502-9A45-C1F01A9EABB5","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5952233$9CF2911E-0112-48EE-8906-616FB1A6C930","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5952233$B5685F07-E959-42F4-B30A-D3F0BC70AD9A","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c78fde347551b7fbc4c3f028864a12fbaf008718","datavalue":{"value":"1688271","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5952233$A1A31E2E-B825-47A1-9487-4B768357CD7C","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"1c2994ed9cdd8271f05984276c7b6bac48549f19","datavalue":{"value":"Bangalore (India)","type":"string"},"datatype":"string"},"type":"statement","id":"Q5952233$FAB29314-ED4E-4F22-981B-EDB13F91A792","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q5952233$E7369AD7-E2F3-40B4-90DD-E90103115E4F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5d83ae477e518ffecea78688f13a2aaaeca13299","datavalue":{"value":"Conference","type":"string"},"datatype":"string"},"type":"statement","id":"Q5952233$38789E4A-E565-4CA3-B2B5-5EEDF1FB23E2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"37e65a053ab9ac11b3ff48bafa07539174fa1857","datavalue":{"value":"FST TCS 2001","type":"string"},"datatype":"string"},"type":"statement","id":"Q5952233$E1779143-4B53-4D9E-BA55-771277153493","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"12d6e443c891ec0959991d8c57803a2654164922","datavalue":{"value":"Software technology","type":"string"},"datatype":"string"},"type":"statement","id":"Q5952233$032B4A26-04B6-447F-975F-8A22FDCF3CFB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c375465c0e95e14e74428516f5dea4f5b18df1be","datavalue":{"value":"Theoretical computer science","type":"string"},"datatype":"string"},"type":"statement","id":"Q5952233$B2C63EAB-DCD0-435C-8371-D2BC81EF0D00","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":"Q5952233$4C25FE3A-C1E6-4C6B-A4EE-509E2017B341","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:5952233","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:5952233"}}}}}