The L-machine: An attempt at parallel hardware for symbolic computation

  • B. Buchberger
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 229)


Parallel Algorithm Parallel Machine Symbolic Computation Sequential Algorithm Full Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Aho A.V., Hopcroft J.E., Ullman J.D., 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, Reading, Massachusetts.Google Scholar
  2. Aspetsberger K., 1980. Algorithmentypen für Multi-Mikrocomputer-Systeme. Diplomarbeit, Inst. f. Math., University of Linz.Google Scholar
  3. Aspetsberger K., 1983. Parallel Algorithm for the Minimum Cost Spanning Tree Problem on L-Networks. Tech. Rep. CAMP-Publ.-Nr.: 83-12.0, Oct. 1983.Google Scholar
  4. Aspetsberger K., 1984. Some Examples of Parallel Algorithms for L-Networks. MIMI 84, Bari, Acta Press, Anaheim, p. 182–185.Google Scholar
  5. Aspetsberger K., 1985a. Towards Parallel Machines for Artificial Intelligence: Realization of the ALICE Architecure by the L-Components. Proceedings of the Austrian Workshop on Artificial Intelligence, Vienna, Sept. 24–27, 1985. Informatik-Fachberichte-KI, Springer Verlag.Google Scholar
  6. Aspetsberger K., 1985b. Substitution Expressions: Extracting Solutions of Non-Horn Clause Proofs. Proceedings of EUROCAL 85, Linz, April 1–3, 1985. Lecture Notes in Comp. Scie., Springer Verlag, Heidelberg.Google Scholar
  7. Aspetsberger K., Bayerl S., 1985. Two Parallel Versions of the Connection Method for Propositional Logic on the L-Machine. Proceedings of the German Workshop on Artificial Intelligence, Dassel/Solling, Sept. 23–28, 1985. Informatik-Fachberichte, Springer Verlag.Google Scholar
  8. Bentley J.L., 1980. A Parallel Algorithm for Construction Minimum Spanning Trees. Journal of Algorithms 1, p. 51–59.Google Scholar
  9. Bernutat-Buchmann U., Rudolph D., Schloßer K.-H., 1983. Parallel Computing I, A Bibliography. Bochumer Schriften zur Parallelen Datenverarbeitung. Ruhr Universität Bochum.Google Scholar
  10. Bibel W., 1983. Matings in Matrices. CACM 26, pp. 844–852.Google Scholar
  11. Bibel W., Aspetsberger K., 1985. A Bibliography on Parallel Inference Machines. J. Symbolic Computation (1985), 1/1, p. 115–118, Academic Press Inc., London.Google Scholar
  12. Bibel W., Buchberger B., 1984. Towards a Connection Machine for Logical Inference. Int. Symb. on Fifth Generation and Super Computers, Rotterdam, Dec. 11–13, 1984. Appeared in: Future Generations Computer Systems, 1/3, p. 177–188, North Holland Publishing Company.Google Scholar
  13. Buchberger B., 1978. Computer Trees and their Programming. 4th Coll. “Trees in algebra and programming”, Univ. Lille, Feb. 16–18, p. 1–18.Google Scholar
  14. Buchberger B., 1983. Components for Restructurable Multi-Microprocessor Systems of Arbitrary Topology. MIMI 83, Lugano, Acta Press, Anaheim, p. 67–71.Google Scholar
  15. Buchberger B., 1984. The Present State of the L-Network Project. MIMI 84, Bari, Acta Press, Anaheim, p. 178–181.Google Scholar
  16. Fessler G., Paepcke A., Schröter N., 1981. Parallelrechner: Probleme und Strukturen. Elektronische Rechenanlagen, 23/5, p. 211–220.Google Scholar
  17. Hintenaus P., Buchberger B., 1985. The L-Language for the Parallel L-Machine (A Parallel Architecture for AI Applications). Proceedings of the Austrian Workshop on Artificial Intelligence, Vienna, Sept. 24–27, 1985. Informatik-Fachberichte-KI, Springer Verlag.Google Scholar
  18. Hwang K., Briggs F.A., 1984. Computer Architecture and Parallel Processing. McGraw-Hill Book Company, New York.Google Scholar
  19. Lichtenberger F., 1979. Speeding up Algorithms on Graphs by Using Computer Trees. In: Graphs, Data Structures, Algorithms (Nagl M., Schneider H.-J., eds.). Appl. Comp. Scie. 13, Hanser Verlag, p. 66–79.Google Scholar
  20. Paker Y., 1983. Multi-microprocessor Systems. Apic Studies in Data Processing No. 18. Academic Press Inc., London.Google Scholar
  21. Todd S., 1978. Algorithm and Hardware for a Merge Sort Using Multiple Processors. IBM J. Res. Develop., 22/5, Sept. 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • B. Buchberger
    • 1
  1. 1.Johannes-Kepler-UniversityLinzAustria, Europe

Personalised recommendations