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 [1]	Hilfe

Suche: Series=LNCS AND YEAR=1995

• Prefix graphs and their applications
  Shiva Chaudhuri, Torben Hagerup
  Lecture Notes in Computer Science 903, 1995, pp. 206-218
• The maximal f-dependent set problem for planar graphs is in NC
  Zhi-Zhong Chen
  Lecture Notes in Computer Science 903, 1995, pp. 232-241
• Rankings of graphs
  H.L. Bodlaender, J.S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. Müller, Zs. Tuza
  Lecture Notes in Computer Science 903, 1995, pp. 292-304
• NC algorithms for antidirected Hamiltonian paths and cycles in tournaments
  E. Bampis, Y. Manoussakis, I. Milis
  Lecture Notes in Computer Science 903, 1995, pp. 387-394
• Directed path graph isomorphism
  Luitpold Babel, Ilia Ponomarenko, Gottfried Tinhofer
  Lecture Notes in Computer Science 903, 1995, pp. 395-406
• Communication complexity of key agreement on small ranges
  Jin-Yi Cai, Richard J. Lipton, Luc Longpré, Mitsunori Ogihara, Kenneth W. Regan, D. Sivakumar
  Lecture Notes in Computer Science 900, 1995, pp. 38-49
• On compact representations of propositional circumscription
  Marco Cadoli, Francesco M. Donini, Marco Schaerf
  Lecture Notes in Computer Science 900, 1995, pp. 205-216
• A fully abstract semantics for causality in the \pi-calculus
  Michele Boreale, Davide Sangiorgi
  Lecture Notes in Computer Science 900, 1995, pp. 243-254
• A family of tag systems for paperfolding sequences
  Christiane Bercoff
  Lecture Notes in Computer Science 900, 1995, pp. 303-312
• Growing context-sensitive languages and Church-Rosser languages
  Gerhard Buntrock, Friedrich Otto
  Lecture Notes in Computer Science 900, 1995, pp. 313-324
• Simultaneous messages vs.\ communication
  László Babai, Peter G. Kimmel, Satyanarayana V. Lokam
  Lecture Notes in Computer Science 900, 1995, pp. 361-372
• Coding and strong coding in trace monoids
  Véronique Bruyère, Clelia De Felice
  Lecture Notes in Computer Science 900, 1995, pp. 373-384
• Partial derivates of regular expressions and finite automata constructions
  Valentin Antimirov
  Lecture Notes in Computer Science 900, 1995, pp. 455-466
• Dependence orders for computations of concurrent automata
  Felipe Bracho, Manfred Droste, Dietrich Kuske
  Lecture Notes in Computer Science 900, 1995, pp. 467-478
• On the sparse set conjecture for sets with low density
  Harry Buhrman, Montserrat Hermo
  Lecture Notes in Computer Science 900, 1995, pp. 609-618
• A possible code in the genetic code
  Didier G. Arquès, Christian J. Michel
  Lecture Notes in Computer Science 900, 1995, pp. 640-651
• Solving alignment using elementary linear algebra
  David Bau, Induprakas Kodukula, Vladimir Kotlyar, Keshav Pingali, Paul Stodghill
  Lecture Notes in Computer Science 892, 1995, pp. 46-60
• Detecting and using affinity in an automatic data distribution tool
  Eduard Ayguadé, Jordi Garcia, Mercè Gironés, Jesus Labarta, Jordi Torres, Mateo Valero
  Lecture Notes in Computer Science 892, 1995, pp. 61-75
• Array distribution in data-parallel programs
  Siddhartha Chatterjee, John R. Gilbert, Robert Schreiber, Thomas J. Sheffler
  Lecture Notes in Computer Science 892, 1995, pp. 76-91
• A new algorithm for global optimization for parallelism and locality
  Bill Appelbe, Srinivas Doddapaneni, Charles Hardnett
  Lecture Notes in Computer Science 892, 1995, pp. 125-140
• Polaris:Improving the effectiveness of parallelizing compilers
  William Blume, Rudolf Eigenmann, Keith Faigin, John Grout, Jay Hoeflinger, David Padua, Paul Petersen, William Pottenger, Lawrence Rauchwerger, Peng Tu, Stephen Weatherford
  Lecture Notes in Computer Science 892, 1995, pp. 141-154
• Flow-insensitive interprocedural alias analysis in the presence of pointers
  Michael Burke, Paul Carini, Jong-Deok Choi, Michael Hind
  Lecture Notes in Computer Science 892, 1995, pp. 234-250
• Interprocedural communication optimizations for distributed memory compilation
  Gagan Agrawal, Joel Saltz
  Lecture Notes in Computer Science 892, 1995, pp. 283-299
• Reshaping access patterns for generating sparse codes
  Aart J.C. Bik, Peter M.W. Knijnenburg, Harry A.G. Wijshoff
  Lecture Notes in Computer Science 892, 1995, pp. 406-422
• Evaluating two loop transformations for reducing multiple-writer false sharing
  François Bodin, Elana D. Granston, Thierry Montaut
  Lecture Notes in Computer Science 892, 1995, pp. 423-439