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 YEAR=1993

• The role of randomness in the design of interconnection networks
  Tom Leighton, Bruce Maggs
  Lecture Notes in Computer Science 678, 1993, pp. 131-145
• An experimental study of wormhole routing in parallel computers
  Sergio Felperin, Prabhakar Raghavan, Eli Upfal
  Lecture Notes in Computer Science 678, 1993, pp. 156-165
• Parallel implementations of graph embeddings
  Fred S. Annexstein
  Lecture Notes in Computer Science 678, 1993, pp. 207-217
• On sorting by prefix reversals and the diameter of pancake networks
  Mohammad H. Heydari, I. Hal Sudborough
  Lecture Notes in Computer Science 678, 1993, pp. 218-227
• Replacement of open interface subnets and stable state transformation equivalence
  Ghassan Chehaibar
  Lecture Notes in Computer Science 674, 1993, pp. 1-25
• Bounded self-stabilizing Petri nets
  Ludmila Cherkasova, Rodney R. Howell, Louis E. Rosier
  Lecture Notes in Computer Science 674, 1993, pp. 26-50
• Generative families of positive invariant in coloured nets sub-classes
  J.M. Couvreur, S. Haddad, J.F. Peyre
  Lecture Notes in Computer Science 674, 1993, pp. 51-70
• Autonomous and timed continuous Petri nets
  René David, Hassane Alla
  Lecture Notes in Computer Science 674, 1993, pp. 71-90
• The Devnet: A Petri net for discrete event simulation
  John B. Evans
  Lecture Notes in Computer Science 674, 1993, pp. 91-125
• A new technique for finding a generating family of siphons, traps and st-components. Application to colored Petri nets
  J. Ezpeleta, J.M. Couvreur, M. Silva
  Lecture Notes in Computer Science 674, 1993, pp. 126-147
• A concept of hierarchical Petri nets with building blocks
  Rainer Fehling
  Lecture Notes in Computer Science 674, 1993, pp. 148-168
• Petri net tool overview 1992
  Frits Feldbrugge
  Lecture Notes in Computer Science 674, 1993, pp. 169-209
• The minimal coverability graph for Petri nets
  Alain Finkel
  Lecture Notes in Computer Science 674, 1993, pp. 210-243
• Distributed implementation of CCS
  Roberto Gorrieri, Ugo Montanari
  Lecture Notes in Computer Science 674, 1993, pp. 244-266
• Saturation conditions for stochastic Petri nets
  R. Gouet, F. Plo, M. San Miguel, B. Ycart
  Lecture Notes in Computer Science 674, 1993, pp. 267-280
• Marking optimization in timed event graphs
  S. Laftit, J.M. Proth, X.L. Xie
  Lecture Notes in Computer Science 674, 1993, pp. 281-300
• Iterative decomposition and aggregation of stochastic marked graph Petri nets
  Yao Li, C. Murray Woodside
  Lecture Notes in Computer Science 674, 1993, pp. 325-349
• Sequence based methods for data transmission and source compression
  A.R. Calderbank, P.C. Fishburn, A. Rabinovich
  Lecture Notes in Computer Science 673, 1993, pp. 1-12
• On the apparent duality of the Kerdock and Preparata codes
  A. Roger, Jr. Hammons, P. Vijay Kumar, A.R. Calderbank, N.J.A. Sloane, Patrick Solé
  Lecture Notes in Computer Science 673, 1993, pp. 13-24
• Bounds for codes as solutions of extremum problems for systems of orthogonal polynomials
  Vladimir Levenshtein
  Lecture Notes in Computer Science 673, 1993, pp. 25-42
• A ``Divide and Conquer'' algorithm for Hilbert-Poincaré series, multiplicity and dimension of monomial ideals
  Anna Maria Bigatti, Pasqualina Conti, Lorenzo Robbiano, Carlo Traverso
  Lecture Notes in Computer Science 673, 1993, pp. 76-88
• An efficient algorithm for the sparse mixed resultant
  John Canny, Ioannis Emiris
  Lecture Notes in Computer Science 673, 1993, pp. 89-104
• Some features of binary block codes for correcting asymmetric errors
  G. Fang, H.C.A. van Tilborg, F.W. Sun, I.S. Honkala
  Lecture Notes in Computer Science 673, 1993, pp. 105-120
• Fixed-parameter complexity and cryptography
  Michael R. Fellows, Neal Koblitz
  Lecture Notes in Computer Science 673, 1993, pp. 121-131
• A class of algebraic geometric codes from curves in high-dimensional projective spaces
  G.L. Feng, T.R.N. Rao
  Lecture Notes in Computer Science 673, 1993, pp. 132-146