Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND YEAR=1995

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

Feasibly categorical models
Douglas Cenzer, Jeffrey B. Remmel
Lecture Notes in Computer Science 960, 1995, pp. 300-312
An efficient orthogonal grid drawing algorithm for cubic graphs
Tiziana Calamoneri, Rossella Petreschi
Lecture Notes in Computer Science 959, 1995, pp. 31-40
Constrained independence system and triangulations of planar point sets
Siu-Wing Cheng, Yin-Feng Xu
Lecture Notes in Computer Science 959, 1995, pp. 41-50
Testing containment of object-oriented conjunctive queries is \Pi_2^p-hard
Edward P.F. Chan, Ron van der Meyden
Lecture Notes in Computer Science 959, 1995, pp. 81-90
Algorithmic graph embeddings
Jianer Chen
Lecture Notes in Computer Science 959, 1995, pp. 151-160
Analysis of quorum-based protocols for distributed (k+1)-exclusion
Divyakant Agrawal, Ömer Eğecioğlu, Amr El-Abbadi
Lecture Notes in Computer Science 959, 1995, pp. 161-170
Toeplitz words, generalized periodicity and periodically iterated morphisms
Julien Cassaigne, Juhani Karhumäki
Lecture Notes in Computer Science 959, 1995, pp. 244-253
A construction for enumerating k-coloured Motzkin paths
Elena Barcucci, Alberto Del-Lungo, Elisa Pergola, Renzo Pinzani
Lecture Notes in Computer Science 959, 1995, pp. 254-263
On log-time alternating Turing machines of alternating depth k
Liming Cai, Jianer Chen
Lecture Notes in Computer Science 959, 1995, pp. 282-291
An optimal algorithm for proper learning of unions of two rectangles with queries
Zhixiang Chen
Lecture Notes in Computer Science 959, 1995, pp. 334-343
Disjunctions of negated counting functions are efficiently learnable with equivalence queries
Zhixiang Chen
Lecture Notes in Computer Science 959, 1995, pp. 344-349
Edge-face total chromatic number of outerplanar graphs with \Delta(g)=6
C.F. Chang, J.X. Chang, X.C. Lu, Peter C.B. Lam, J.F. Wang
Lecture Notes in Computer Science 959, 1995, pp. 396-399
Rankable distributions do not provide harder instances than uniform distributions
Jay Belanger, Jie Wang
Lecture Notes in Computer Science 959, 1995, pp. 410-419
Searching rigid data structures
Svante Carlsson, Jingsen Chen
Lecture Notes in Computer Science 959, 1995, pp. 446-451
A broadcasting algorithm on the arrangement graph
Leqiang Bai, Peter M. Yamakawa, Hiroyuki Ebara, Hideo Nakano
Lecture Notes in Computer Science 959, 1995, pp. 462-471
Uni-directional alternating group graphs
Shyh-Chain Chern, Tai-Ching Tuan, Jung-Sing Jwo
Lecture Notes in Computer Science 959, 1995, pp. 490-495
Minimum dominating sets of intervals on lines
Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks
Lecture Notes in Computer Science 959, 1995, pp. 520-529
Two-dimensional pattern matching on a dynamic library of texts
Y. Choi, T.W. Lam
Lecture Notes in Computer Science 959, 1995, pp. 530-538
MNP: A class of NP optimization problems
Qi Cheng, Hong Zhu
Lecture Notes in Computer Science 959, 1995, pp. 559-565
Semidefinite programming and its applications to NP problems
Roman Bac̑ík, Sanjeev Mahajan
Lecture Notes in Computer Science 959, 1995, pp. 566-575
Single-vehicle scheduling problem on a straight line with time window constraints
Chi-lok Chan, Gilbert H. Young
Lecture Notes in Computer Science 959, 1995, pp. 617-626
Planning a proof of the intermediate value theorem
Myles Chippendale
Lecture Notes in Computer Science 958, 1995, pp. 48-63
Datalog and TwoGroups and C++
Greg Butler
Lecture Notes in Computer Science 958, 1995, pp. 80-92
A proof environment for arithmetic with the omega rule
Siami Baker, Alan Smaill
Lecture Notes in Computer Science 958, 1995, pp. 115-130
The ideal structure of Gröbner base computations
Stéphane Collart, Daniel Mall
Lecture Notes in Computer Science 958, 1995, pp. 156-166

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