Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND YEAR=1995

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

A framework for the specification of reactive and concurrent systems in Z
Peter Baumann, Karl Lermer
Lecture Notes in Computer Science 1026, 1995, pp. 62-79
An algorithm for reducing binary branchings
Paul Caspi, Jean-Claude Fernandez, Alain Girault
Lecture Notes in Computer Science 1026, 1995, pp. 279-293
On the complexity of bisimilarity for value-passing processes
Michele Boreale, Luca Trevisan
Lecture Notes in Computer Science 1026, 1995, pp. 294-308
Path balance heuristic for self-adjusting binary search trees
R. Balasubramanian, Venkatesh Raman
Lecture Notes in Computer Science 1026, 1995, pp. 338-348
All-pairs min-cut in sparse networks
Srinivasa R. Arikati, Shiva Chaudhuri, Christos D. Zaroliagis
Lecture Notes in Computer Science 1026, 1995, pp. 363-376
Minimizing space usage in evaluation of expression trees
Sandip K. Biswas, Sampath Kannan
Lecture Notes in Computer Science 1026, 1995, pp. 377-390
Achilles and the tortoise climbing up the arithmetical hierarchy
Eugene Asarin, Oded Maler
Lecture Notes in Computer Science 1026, 1995, pp. 471-483
Generalized temporal verification diagrams
I.A. Browne, Z. Manna, H.B. Sipma
Lecture Notes in Computer Science 1026, 1995, pp. 484-498
Model checking of probabilistic and nondeterministic systems
Andrea Bianco, Luca de Alfaro
Lecture Notes in Computer Science 1026, 1995, pp. 499-513
Minimal supports in linear codes
Alexei Ashikhmin, Alexander Barg
Lecture Notes in Computer Science 1025, 1995, pp. 13-13
Linear span analysis of a set of periodic sequence generators
P. Caballero-Gil, A. Fúster-Sabater
Lecture Notes in Computer Science 1025, 1995, pp. 22-33
Multi-dimensional ring TCM codes for fading channels
M. Ahmadian-Attari, P.G. Farrell
Lecture Notes in Computer Science 1025, 1995, pp. 158-168
On-line secret sharing
Christian Cachin
Lecture Notes in Computer Science 1025, 1995, pp. 190-198
A new algorithm for finding minimum-weight words in large linear codes
Anne Canteaut
Lecture Notes in Computer Science 1025, 1995, pp. 205-212
Constructions for variable-length error-correcting codes
Victor Buttigieg, Patrick G. Farrell
Lecture Notes in Computer Science 1025, 1995, pp. 282-291
On the isomorphism of graphs with few P_4s
Luitpold Babel, Stephan Olariu
Lecture Notes in Computer Science 1017, 1995, pp. 24-36
A uniform approach to graph rewriting: The pullback approach
Michel Bauderon
Lecture Notes in Computer Science 1017, 1995, pp. 101-115
Non-oblivious local search for graph and hypergraph coloring problems
Paola Alimonti
Lecture Notes in Computer Science 1017, 1995, pp. 167-180
On interval routing schemes and treewidth
Hans L. Bodlaender, Richard B. Tan, Dimitris M. Thilikos, Jan van Leeuwen
Lecture Notes in Computer Science 1017, 1995, pp. 181-196
Toward a general theory of unicast-based multicast communication
Barbara D. Birchler, Abdol-Hossein Esfahanian, Eric Torng
Lecture Notes in Computer Science 1017, 1995, pp. 237-251
NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems
Zhi-Zhong Chen, Xin He
Lecture Notes in Computer Science 1017, 1995, pp. 275-289
Modular decomposition of hypergraphs
P. Bonizzoni, G. Della Vedova
Lecture Notes in Computer Science 1017, 1995, pp. 303-317
Homogeneously orderable graphs and the Steiner tree problem
Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai
Lecture Notes in Computer Science 1017, 1995, pp. 381-395
Computing in linear time a chord from which a simple polygon is weakly internally visible
Binay K. Bhattacharya, Asish Mukhopadhyay
Lecture Notes in Computer Science 1004, 1995, pp. 22-31
Some geometric lower bounds
Hank Chien, William Steiger
Lecture Notes in Computer Science 1004, 1995, pp. 72-81

Seiten 1 2 3 4 5 6 7 8 9 10 11 12 >