Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Booktitle=Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981)

• Redistribution of computations for improving the worst-case
  S. Rao Kosaraju
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 3-8
• Admissible heuristic search in AND/OR graphs
  A. Bagchi, A. Mahanti
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 9-19
• On the impossibility of infix to prefix translation by a pushdownn machine
  R.K. Shyamasundar
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 21-27
• On the complexity classes and optimal algorithms for parallel evaluation of polynomials
  Kripasindhu Sikdar
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 29-38
• An O(V) algorithm for computing transitive reduction of a planar acyclic digraph
  Sukhamay Kundu
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 39-48
• Installing existing tools in a distributed processing environment
  Sandra A. Mamrak
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 49-56
• Program structures for decentralized algorithms
  N. Natarajan
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 57-66
• Approximate transactions: A methodology for solving a class of database problems
  Mukul K. Sinha
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 67-74
• Experience with the task structuring for a real time system
  K.C. Anand
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 75-86
• Software design of knowledge directed database systems
  Sanjay Mittal, B. Chandrasekaran
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 87-98
• A study of saturated sets and functional dependencies in relational databases using linear graphs
  K.K. Nambiar, T. Radhakrishnan
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 99-107
• Models for programs
  Rohit Parikh
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 109-120
• Synchronous parallel programming languages
  R.H. Perrott
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 121-133
• Correctness proofs of CSP programs
  N. Soundararajan
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 135-142
• Language of functional schemata for parallel processing
  Anwar Jafri
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 143-151
• Two-dimensional pattern matching by two-dimensional on-line tessellation acceptores
  Manabu Toda, Katsushi Inoue, Itsuo Takanami
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 153-166
• Generalized circuit signature of combinational logic circuits
  Bhargab B. Bhattacharya, Bidyut Gupta, Arun K. Choudhury
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 167-178
• Cyclic codes and finite field arithmetic
  T.R.N. Rao, Lois M.L. Delcambre, Awad Iskander
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 179-186
• Unbounded hardware is equivalent to deterministic Turing machines
  Bernard Chazelle, Louis Monier
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 187-192
• Parallel generation of lexicographic combinations
  Phalguni Gupta, G.P. Bhattacharjee
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 193-200
• Efficient VLSI networks for parallel processing based on orthogonal trees
  Dhruva Nath, S.N. Maheshwari, P.C.P. Bhatt
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 201-216
• A parallel algorithm for finding a fundamental set of cycles of an undirected graph
  Ratan K. Ghosh, G.P. Bhattacharjee
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 217-226
• Data flow analysis of structured programs
  B.H. Jajoo, H.V. Sahasrabuddhe
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 227-240
• Relation between algebraic specifications and Turing machines
  Abha Moitra
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 241-249
• Permutation algorithms: A case study in algorithm schema transformation
  M.N. Muralidharan, H.V. Sahasrabuddhe
  Proceedings of the 1st Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'1981 (Bangalore, India, December 11-12, 1981), 1981, pp. 251-259