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: Series=LNCS AND Volume=907

• Time and information in sequential and concurrent computation
  Vaughan Pratt
  Lecture Notes in Computer Science 907, 1995, pp. 1-24
• Notes on P-algebra 1: Process structure
  Kohei Honda
  Lecture Notes in Computer Science 907, 1995, pp. 25-44
• Simulating guarded programs in linear logic
  Max I. Kanovich
  Lecture Notes in Computer Science 907, 1995, pp. 45-69
• Sharing mutable objects and controlling groups of tasks in a concurrent and distributed language
  Christian Queinnec
  Lecture Notes in Computer Science 907, 1995, pp. 70-93
• Multi-threaded PaiLisp with granularity adaptive parallel execution
  Shin-ichi Kawamoto, Takayasu Ito
  Lecture Notes in Computer Science 907, 1995, pp. 94-120
• Stack threads: An abstract machine for scheduling fine-grain threads on stock CPUs
  Kenjiro Taura, Satoshi Matsuoka, Akinori Yonezawa
  Lecture Notes in Computer Science 907, 1995, pp. 121-136
• Higher-order concurrent linear logic programming
  Naoki Kobayashi, Akinori Yonezawa
  Lecture Notes in Computer Science 907, 1995, pp. 137-166
• A parallel object-oriented language OCore
  Hiroki Konaka, Takashi Tomokiyo, Munenori Maeda, Yutaka Ishikawa, Atsushi Hori
  Lecture Notes in Computer Science 907, 1995, pp. 167-186
• Concurrent objects in a process calculus
  Benjamin C. Pierce, David N. Turner
  Lecture Notes in Computer Science 907, 1995, pp. 187-215
• A formalism for remotely interacting processes
  Ichiro Satoh, Mario Tokoro
  Lecture Notes in Computer Science 907, 1995, pp. 216-228
• ProCSuS: A meta system for concurrent process calculi based on SOS
  Atsushi Togashi, Sen Yoshida, Shigetomo Kimura, Norio Shiratori
  Lecture Notes in Computer Science 907, 1995, pp. 229-234
• First-class synchronous operations
  John H. Reppy
  Lecture Notes in Computer Science 907, 1995, pp. 235-252
• Self-describing files + smart modules = parallel program visualization
  Robert H., Jr. Halstead
  Lecture Notes in Computer Science 907, 1995, pp. 253-283
• A:performance debugger for parallel logic programming language fleng
  Junichi Tatemura, Hanpei Koike, Hidehiko Tanaka
  Lecture Notes in Computer Science 907, 1995, pp. 284-299
• First class continuation facilities in concurrent programming language harmony/2
  Ken Wakita
  Lecture Notes in Computer Science 907, 1995, pp. 300-319
• Locality abstractions for parallel and distributed computing
  Suresh Jagannathan
  Lecture Notes in Computer Science 907, 1995, pp. 320-345
• An algorithm for efficient global garbage collection on massively parallel computers
  Tomio Kamada, Satoshi Matsuoka, Akinori Yonezawa
  Lecture Notes in Computer Science 907, 1995, pp. 346-355
• I/O mode analysis in concurrent logic programming
  Kazunori Ueda
  Lecture Notes in Computer Science 907, 1995, pp. 356-368
• Advanced component interface specification
  Manfred Broy
  Lecture Notes in Computer Science 907, 1995, pp. 369-392
• Graph notation for concurrent combinators
  Nobuko Yoshida
  Lecture Notes in Computer Science 907, 1995, pp. 393-412
• A calculus for exploiting data parallelism on recursively defined data
  Susumu Nishimura, Atsushi Ohori
  Lecture Notes in Computer Science 907, 1995, pp. 413-432
• The data-parallel C language NCX and its implementation strategies
  Taiichi Yuasa, Toshiro Kijima, Yutaka Konishi
  Lecture Notes in Computer Science 907, 1995, pp. 433-456
• A dataflow-based massively parallel programming language "V" and its implementation on a stock parallel machine
  Shigeru Kusakabe, Makoto Amamiya
  Lecture Notes in Computer Science 907, 1995, pp. 457-471
• Programming with distributed data structure for EM-X multiprocessor
  Mitsuhisa Sato, Yuetsu Kodama, Hirofumi Sakane, Shuichi Sakai, Yoshinori Yamaguchi, Satoshi Sekiguchi
  Lecture Notes in Computer Science 907, 1995, pp. 472-483