Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1450

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

When can an equational simple graph be generated by hyperedge replacement?
Klaus Barthelmann
Lecture Notes in Computer Science 1450, 1998, pp. 543-552
Spatial and temporal refinement of typed graph transformation systems
Martin Gross̈e-Rhode, Francesco Parisi-Presicce, Marta Simeoni
Lecture Notes in Computer Science 1450, 1998, pp. 553-561
Approximating maximum independent sets in uniform hypergraphs
Thomas Hofmeister, Hanno Lefmann
Lecture Notes in Computer Science 1450, 1998, pp. 562-570
Representing hyper-graphs by regular languages
Salvatore La Torre, Margherita Napoli
Lecture Notes in Computer Science 1450, 1998, pp. 571-579
Improved time and space hierarchies of one-tape off-line TMs
Kazuo Iwama, Chuzo Iwamoto
Lecture Notes in Computer Science 1450, 1998, pp. 580-588
Tarskian set constraints are in NEXPTIME
Pawel Mielniczuk, Leszek Pacholski
Lecture Notes in Computer Science 1450, 1998, pp. 589-596
\forall\exists^*-equational theory of context unification is \Pi^0_1-hard
Sergei Vorobyov
Lecture Notes in Computer Science 1450, 1998, pp. 597-606
Speeding-up nondeterministic single-tape off-line computations by one alternation
Jiȓí Wiedermann
Lecture Notes in Computer Science 1450, 1998, pp. 607-615
Facial circuits of planar graphs and context-free languages
Bruno Courcelle, Denis Lapoire
Lecture Notes in Computer Science 1450, 1998, pp. 616-624
Optimizing OBDDs is still intractable for monotone functions
Kazuo Iwama, Mitsushi Nozoe, Shuzo Yajima
Lecture Notes in Computer Science 1450, 1998, pp. 625-635
Blockwise variable orderings for shared BDDs
Harry Preuss̈, Anand Srivastav
Lecture Notes in Computer Science 1450, 1998, pp. 636-644
On the composition problem for OBDDs with multiple variable orders
Anna Slobodová
Lecture Notes in Computer Science 1450, 1998, pp. 645-655
Equations in transfinite strings
Christian Choffrut, Sandor Horvath
Lecture Notes in Computer Science 1450, 1998, pp. 656-664
Minimal forbidden words and factor automata
M. Crochemore, F. Mignosi, A. Restivo
Lecture Notes in Computer Science 1450, 1998, pp. 665-673
On defect effect of bi-infinite words
Juhani Karhumäki, Ján Man̆uch, Wojciech Plandowski
Lecture Notes in Computer Science 1450, 1998, pp. 674-682
On repetition-free binary words of minimal density
Roman Kolpakov, Gregory Kucherov, Yuri Tarannikov
Lecture Notes in Computer Science 1450, 1998, pp. 683-692
Embedding of hypercubes into grids
S.L. Bezrukov, J.D. Chavez, L.H. Harper, M. Röttger, U.-P. Schroeder
Lecture Notes in Computer Science 1450, 1998, pp. 693-701
Tree decompositions of small diameter
Hans L. Bodlaender, Torben Hagerup
Lecture Notes in Computer Science 1450, 1998, pp. 702-712
Degree-preserving forests
Hajo Broersma, Andreas Huck, Ton Kloks, Otto Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra
Lecture Notes in Computer Science 1450, 1998, pp. 713-721
A parallelization of Dijkstra's shortest path algorithm
A. Crauser, K. Mehlhorn, U. Meyer, P. Sanders
Lecture Notes in Computer Science 1450, 1998, pp. 722-731
Comparison between the complexity of a function and the complexity of its graphs
Bruno Durand, Sylvain Porrot
Lecture Notes in Computer Science 1450, 1998, pp. 732-739
IFS and control languages
Henning Fernau, Ludwig Staiger
Lecture Notes in Computer Science 1450, 1998, pp. 740-750
One quantifier will do in existential monadic second-order logic over pictures
Oliver Matz
Lecture Notes in Computer Science 1450, 1998, pp. 751-759
On some recognizable picture-languages
Klaus Reinhardt
Lecture Notes in Computer Science 1450, 1998, pp. 760-770
On the complexity of wavelength converters
Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano
Lecture Notes in Computer Science 1450, 1998, pp. 771-779

Seiten < 1 2 3 4 >