Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND YEAR=1995

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

The topological structure of maximal lattice free convex bodies: The general case
I. Bárány, H.E. Scarf, D. Shallcross
Lecture Notes in Computer Science 920, 1995, pp. 244-251
Scheduling jobs of equal length: Complexity, facets and computational results
Yves Crama, Frits C.R. Spieksma
Lecture Notes in Computer Science 920, 1995, pp. 277-291
A Mickey-Mouse decomposition theorem
Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vus̑ković
Lecture Notes in Computer Science 920, 1995, pp. 321-328
A characterization of Seymour graphs
A.A. Ageev, A.V. Kostochka, Z. Szigeti
Lecture Notes in Computer Science 920, 1995, pp. 364-372
The Markov chain of colourings
J. Eric Bartels, Dominic J.A. Welsh
Lecture Notes in Computer Science 920, 1995, pp. 373-387
Combining and strengthening Gomory cuts
Sebastián Ceria, Gérard Cornuéjols, Milind Dawande
Lecture Notes in Computer Science 920, 1995, pp. 438-451
Visibility graphs of 2-spiral polygons
James Abello, Krishna Kumar
Lecture Notes in Computer Science 911, 1995, pp. 1-15
Random generation of colored trees
L. Alonso, R. Schott
Lecture Notes in Computer Science 911, 1995, pp. 16-35
Space filling curves and their use in the design of geometric data structures
Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer
Lecture Notes in Computer Science 911, 1995, pp. 36-48
Tight bounds for finding degrees from the adjacency matrix
R. Balasubramanian, Venkatesh Raman, G. Srinivasaraghavan
Lecture Notes in Computer Science 911, 1995, pp. 49-59
Lower bounds for modular counting by circuits with modular gates
David Mix Barrington, Howard Straubing
Lecture Notes in Computer Science 911, 1995, pp. 60-71
On the relation between BDDs and FDDs
Bernd Becker, Rolf Drechsler, Ralph Werchner
Lecture Notes in Computer Science 911, 1995, pp. 72-83
On dynamical properties of generalized toggle automata
F. Blanchard, Alejandro Maass
Lecture Notes in Computer Science 911, 1995, pp. 84-98
Free shuffle algebras in language varieties
Stephen L. Bloom, Zoltán Ésik
Lecture Notes in Computer Science 911, 1995, pp. 99-111
Lower bounds for the matrix chain ordering problem
Phillip G. Bradford, Venkatesh Choppella, Gregory J.E. Rawlins
Lecture Notes in Computer Science 911, 1995, pp. 112-130
Off-line electronic cash based on secret-key certificates
Stefan Brands
Lecture Notes in Computer Science 911, 1995, pp. 131-166
Recognizable sets of numbers in nonstandard bases
Véronique Bruyère, Georges Hansel
Lecture Notes in Computer Science 911, 1995, pp. 167-179
On weak growing context-sensitive grammars
Gerhard Buntrock, Gundula Niemann
Lecture Notes in Computer Science 911, 1995, pp. 180-194
Logic of Plotkin continuous domain
Benjamín R. Callejas Bedregal, Benedito Melo Acióly
Lecture Notes in Computer Science 911, 1995, pp. 195-206
(Probabilistic) recurrence relations revisited
Shiva Chaudhuri, Devdatt Dubhashi
Lecture Notes in Computer Science 911, 1995, pp. 207-219
Advanced component interface specification
Manfred Broy
Lecture Notes in Computer Science 907, 1995, pp. 369-392
Domino treewidth
Hans L. Bodlaender, Joost Engelfriet
Lecture Notes in Computer Science 903, 1995, pp. 1-13
The algorithmic use of hypertree structure and maximum neighbourhood orderings
Andreas Brandstädt, Victor D. Chepoi, Feodor F. Dragan
Lecture Notes in Computer Science 903, 1995, pp. 65-80
Cartesian products of graphs as spanning subgraphs of de Bruijn graphs
Thomas Andreae, Michael Nölle, Gerald Schreiber
Lecture Notes in Computer Science 903, 1995, pp. 140-150
Time-optimal tree computations on sparse meshes
D. Bhagavathi, V. Bokka, H. Gurla, S. Olariu, J.L. Schwing
Lecture Notes in Computer Science 903, 1995, pp. 193-205

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