Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=959

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

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 public-key cryptosystem based on Church-Rosser string-rewriting systems
Vladimir A. Oleshchuc
Lecture Notes in Computer Science 959, 1995, pp. 264-269
Extending the Hong-Kung model to memory hierarchies
John E. Savage
Lecture Notes in Computer Science 959, 1995, pp. 270-281
On log-time alternating Turing machines of alternating depth k
Liming Cai, Jianer Chen
Lecture Notes in Computer Science 959, 1995, pp. 282-291
New bound for affine resolvable designs and its application to authentication codes
Kaoru Kurosawa, Sanpei Kageyama
Lecture Notes in Computer Science 959, 1995, pp. 292-302
Dense packings of 3k(k+1)+1 equal disks in a circle for k=1,2,3,4 and 5
B.D. Lubachevsky, R.L. Graham
Lecture Notes in Computer Science 959, 1995, pp. 303-312
Efficient parallel algorithms for some tree layout problems
J. Díaz, A. Gibbons, G. Pantziou, M. Serna, P. Spirakis, J. Toran
Lecture Notes in Computer Science 959, 1995, pp. 313-323
Conservative algorithms for parallel and sequential integer sorting
Yijie Han, Xiaojun Shen
Lecture Notes in Computer Science 959, 1995, pp. 324-333
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
Non-empty cross-3-intersection theorems of subsets
Shiquan Wu
Lecture Notes in Computer Science 959, 1995, pp. 350-356
Convexity of minimal total dominating functions in graphs
Bo Yu
Lecture Notes in Computer Science 959, 1995, pp. 357-365
Transformations for maximal planar graphs with minimum degree five
Jean Hardouin Duparc, Philippe Rolland
Lecture Notes in Computer Science 959, 1995, pp. 366-371
An asynchronous parallel method for linear systems
Zhaoyong You, Chuanglong Wang
Lecture Notes in Computer Science 959, 1995, pp. 372-378
On a kind of sequence of polynomials
Xiangde Zhang
Lecture Notes in Computer Science 959, 1995, pp. 379-383
Hamiltonian cycles in 2-generated Cayley digraphs of Abelian groups
Jixiang Meng
Lecture Notes in Computer Science 959, 1995, pp. 384-387
Pandiagonal magic squares
Cheng-Xu Xu, Zhun-Wei Lu
Lecture Notes in Computer Science 959, 1995, pp. 388-391
PFFM and quasi-Morishima matrices
Hua Wang, Zhao-yong You
Lecture Notes in Computer Science 959, 1995, pp. 392-395
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
Sets computable in polynomial time on average
Rainer Schuler, Tomoyuki Yamakami
Lecture Notes in Computer Science 959, 1995, pp. 400-409
Rankable distributions do not provide harder instances than uniform distributions
Jay Belanger, Jie Wang
Lecture Notes in Computer Science 959, 1995, pp. 410-419
Transformations that preserve malignness of universal distributions
Kojiro Kobayashi
Lecture Notes in Computer Science 959, 1995, pp. 420-429
Intersection suffices for Boolean hierarchy equivalence
Lane A. Hemaspaandra, Jörg Rothe
Lecture Notes in Computer Science 959, 1995, pp. 430-435
A \frac32 log _3-competitive algorithm for the counterfeit coin problem
Dean Kelley, Peng-Jun Wan, Qifan Yang
Lecture Notes in Computer Science 959, 1995, pp. 436-445

Seiten < 1 2 3 4 >