{"entities":{"Q1339725":{"pageid":1350464,"ns":120,"title":"Item:Q1339725","lastrevid":68501634,"modified":"2026-04-13T00:08:06Z","type":"item","id":"Q1339725","labels":{"en":{"language":"en","value":"Foundations of software technology and theoretical computer science. 14th conference, Madras, India, December 15-17, 1994. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 699957"}},"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":"Q1339725$CFAF94F6-E5DA-4773-8255-E08185DAD75C","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"6bf7157c61f08d58bbd25e7e8f9381549f1908e4","datavalue":{"value":{"text":"Foundations of software technology and theoretical computer science. 14th conference, Madras, India, December 15-17, 1994. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1339725$D755E13D-4DA7-4F92-8574-C3490530D99B","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"3728a56e70ebd79887c9fd9dbfc2554eaa476edb","datavalue":{"value":"0802.00044","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1339725$7CCFC6CB-6630-4226-B3D4-1EAFED2D2F80","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"9777c7e05e1f69e15c2827bae2cee38549af4222","datavalue":{"value":"10.1007/3-540-58715-2","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1339725$232439DD-A10B-4960-8DD9-9EB2073B59C1","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":"Q1339725$55222B7F-954A-4A23-865F-1E6CAF488FB8","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"639e2a3a6cef7461b2fe9383e8a717703cc7a062","datavalue":{"value":{"time":"+1994-12-05T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1339725$AA16F354-E5BD-42FD-8434-85F476CB0EC7","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"0e3b6af298c932ea0213f18eac3063b21b1282af","datavalue":{"value":"The articles of this volume will be reviewed individually.  Indexed articles:  \\textit{Kozen, Dexter}, Efficiency resolution of singularities of plane curves, 1-11 [Zbl 1044.68944]  \\textit{Couveignes, Jean-Marc; Diaz-Frias, Juan Francisco; de Rougemont, Michel; Santha, Miklos}, On the interactive complexity of graph reliability, 12-23 [Zbl 1044.68652]  \\textit{Dietzfelbinger, Martin; H\u00fchne, Martin}, Matching upper and lower bounds for simulations of several tapes on one multidimensional tape, 24-35 [Zbl 1044.68626]  \\textit{Caussinus, Herv\u00e9; Lemieux, Fran\u00e7ois}, The complexity of computing over quasigroups, 36-47 [Zbl 1044.68679]  \\textit{Mahajan, Meena; Vinay, V.}, Non-commutative computation, depth reduction, and skew circuits (extended abstract), 48-59 [Zbl 1044.94557]  \\textit{Coquand, Thierry; Dybjer, Peter}, Inductive definitions and type theory. An introduction (preliminary version), 60-76 [Zbl 1044.03521]  \\textit{Broy, Manfred; Hinkel, Ursula; Nipkow, Tobias; Prehofer, Christian; Schieder, Birgit}, Interpreter verification for a functional language, 77-88 [Zbl 1044.68666]  \\textit{Lakshmanan, Laks V. S.}, An epistemic foundation for logic programming with uncertainty, 89-100 [Zbl 1044.68816]  \\textit{Tsuiki, Hideki}, On typed calculi with a merge operator, 101-112 [Zbl 1044.03511]  \\textit{Frigioni, Daniele; Marchetti-Spaccamela, Alberto; Nanni, Umberto}, Incremental algorithms for the single-source shortest path problem, 113-124 [Zbl 1044.05512]  \\textit{Rao Arikati, Srinivasa; Maheshwari, Anil}, An \\(O(n)\\) algorithm for realizing degree sequences, 125-136 [Zbl 1044.05513]  \\textit{Subramanian, C. R.; Veni Madhavan, C. E.}, Coloring semi-random graphs in polynomial expected time, 137-148 [Zbl 1044.05514]  \\textit{Thomas, Wolfgang}, Finite-state strategies in regular infinite games, 149-158 [Zbl 1044.68663]  \\textit{Nandy, Subhas C.; Sinha, Arani; Bhattacharya, Bhargab B.}, Location of the largest empty rectangle among arbitrary obstacles, 159-170 [Zbl 1044.68864]  \\textit{Dahlhaus, Elias}, Efficient parallel and linear time sequential split decomposition (extended abstract), 171-180 [Zbl 1044.05511]  \\textit{Biswas, Supriya; Prasad, D. Chithra; Pal, Sudebkumar Prasant}, Algorithms for convex visibility problems, 181-192 [Zbl 1044.68856]  \\textit{Sen, Sandeep}, Lower bounds for parallel algebraic decision trees, complexity of convex hulls and related problems, 193-204 [Zbl 1044.68937]  \\textit{Amadio, Roberto M.; Prasad, Sanjiva}, Localities and failures (extended summary), 205-216 [Zbl 1044.68682]  \\textit{Natarajan, V.; Christoff, I.; Christoff, L.; Cleaveland, R.}, Priority and abstraction in process algebra, 217-230 [Zbl 1044.68688]  \\textit{Kumar, K. Narayan; Pandya, Paritosh K.}, On the computational power of operators in ICSP with fairness, 231-242 [Zbl 1044.68687]  \\textit{Wang, Yi; Jonsson, Bengt}, Decidability of timed language-inclusion for networks of real-time communicating sequential processes, 243-255 [Zbl 1044.68690]  \\textit{Fortnow, Lance}, My favorite ten complexity theorems of the past decade, 256-275 [Zbl 1044.68632]  \\textit{Kaji, Yuichi; Fujiwara, Toru; Kasami, Tadao}, Solving a unification problem under constrained substitutions using tree automata, 276-287 [Zbl 1044.68649]  \\textit{Ramesh, R.; Ramakrishnan, I. V.; Sekar, R. C.}, Automata-driven efficient subterm unification, 288-299 [Zbl 1044.68651]  \\textit{Raghavan, Prabhakar}, Randomized approximation algorithms in combinatorial optimization, 300-317 [Zbl 1044.90522]  \\textit{Arora, Vivek; Santosh, Vempala; Saran, Huzur; Vazirani, Vijay V.}, A limited-backtrack greedy schema for approximation algorithms, 318-329 [Zbl 1044.90521]  \\textit{Crescenzi, Pierluigi; Trevisan, Luca}, On approximation scheme preserving reducibility and its applications, 330-341 [Zbl 1044.68942]  \\textit{Hunt, H. B. III; Marathe, M. V.; Radhakrishnan, V.; Ravi, S. S.; Rosenkrantz, D. J.; Stearns, R. E.}, Approximation schemes using \\(L\\)-reductions, 342-353 [Zbl 1044.68943]  \\textit{Subramanian, Ashok}, An explanation of splaying, 354-365 [Zbl 1044.68802]  \\textit{Desel, J\u00f6rg}, Proving non-reachability by modulo-place-invariants, 366-377 [Zbl 1044.68683]  \\textit{Knapp, Edgar}, Soundness and completeness of UNITY logic, 378-389 [Zbl 1044.03522]  \\textit{Savick\u00fd, Petr; Wegener, Ingo}, Efficient algorithms for the transformation between different types of binary decision diagrams, 390-401 [Zbl 1044.68627]  \\textit{Siegel, M.; Stomp, F. A.}, Extending the limits of sequentially phased reasoning, 402-413 [Zbl 1044.68556]  \\textit{Estivill-Castro, Vladimir; Wood, Derick}, Foundations for faster external sorting (extended abstract), 414-425 [Zbl 1044.68568]  \\textit{Hooker, J. N.; Vinay, V.}, Branching rules for satisfiability (extended abstract), 426-437 [Zbl 1044.68766]  \\textit{Kapur, Deepak; Subramaniam, M.}, Using linear arithmetic procedure for generating induction schemes, 438-449 [Zbl 1044.03504]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1339725$5C502ED6-4291-49A0-8C8E-39DAA53CC189","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1339725$7C3210F1-7B1F-45DA-9AF2-BC6D22C8C2CE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1339725$AB6CC2BD-0EE4-4FB0-BBBD-AD5782F1EAED","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"9d7fc4d06fe369dd06b995d05676babc845a2636","datavalue":{"value":"699957","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1339725$5677727E-C3B4-494A-A9F9-40A48D818BE3","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"2aa8aa12283ae485c6a70dc55234550402534c70","datavalue":{"value":"Madras (India)","type":"string"},"datatype":"string"},"type":"statement","id":"Q1339725$42CAC6CD-6FDB-46EF-A798-561905DABC2D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q1339725$841D7E45-97E1-4B38-BD29-34C852098E5B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5d83ae477e518ffecea78688f13a2aaaeca13299","datavalue":{"value":"Conference","type":"string"},"datatype":"string"},"type":"statement","id":"Q1339725$86B702BD-54F7-4774-9FD5-F726EFEF3D2E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"12d6e443c891ec0959991d8c57803a2654164922","datavalue":{"value":"Software technology","type":"string"},"datatype":"string"},"type":"statement","id":"Q1339725$F400FDC6-0B1F-4C93-837F-B6F3AC831F2B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"c375465c0e95e14e74428516f5dea4f5b18df1be","datavalue":{"value":"Theoretical computer science","type":"string"},"datatype":"string"},"type":"statement","id":"Q1339725$94D45598-C470-47DE-B8CE-68CAABEC3FF0","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":"Q1339725$2981A716-8D17-43B0-8D97-A37A7B198B83","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"6443c49fd995efec1cdac5d1efcc487e0ab4c302","datavalue":{"value":"https://doi.org/10.1007/3-540-58715-2","type":"string"},"datatype":"url"},"type":"statement","id":"Q1339725$B70D33D9-DB76-4A9B-B936-159F6970ED40","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"488abdaf80803065dc6ba11af6a67bea0776c5cb","datavalue":{"value":"W2477328962","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1339725$BB1527BB-489A-4713-97FA-0359861E93EC","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Foundations of software technology and theoretical computer science. 14th conference, Madras, India, December 15-17, 1994. Proceedings","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Foundations_of_software_technology_and_theoretical_computer_science._14th_conference,_Madras,_India,_December_15-17,_1994._Proceedings"}}}}}