Foundations of software technology and theoretical computer science. 14th conference, Madras, India, December 15-17, 1994. Proceedings (Q1339725)

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ühne, Martin}, Matching upper and lower bounds for simulations of several tapes on one multidimensional tape, 24-35 [Zbl 1044.68626] \textit{Caussinus, Hervé; Lemieux, François}, 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örg}, 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ý, 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]