Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND YEAR=1996

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

Circuit complexity before the dawn of the new millennium
Eric Allender
Lecture Notes in Computer Science 1180, 1996, pp. 1-18
A lambda calculus with letrecs and barriers
Arvind, Jan-Willem Maessen, Rishiyur S. Nikhil, Joseph Stoy
Lecture Notes in Computer Science 1180, 1996, pp. 19-36
On the complexity of approximating Euclidean Traveling Salesman tours and minimum spanning trees
Gautam Das, Sanjieev Kapoor, Michiel Smid
Lecture Notes in Computer Science 1180, 1996, pp. 64-75
A new competitive algorithm for agent searching in unknown streets
Pallab Dasgupta, P.P. Chakrabarti, S.C. DeSarkar
Lecture Notes in Computer Science 1180, 1996, pp. 147-155
Constraint retraction in FD
Philippe Codognet, Daniel Diaz, Francesca Rossi
Lecture Notes in Computer Science 1180, 1996, pp. 168-179
Pinpointing computation with modular queries in the Boolean hierarchy
Manindra Agrawal, Richard Beigel, Thomas Thierauf
Lecture Notes in Computer Science 1180, 1996, pp. 322-334
Applications of a numbering scheme for polygonal obstacles in the plane
Mikhail J. Atallah, Danny Z. Chen
Lecture Notes in Computer Science 1178, 1996, pp. 1-24
Incremental convex hull algorithms are not output sensitive
David Bremner
Lecture Notes in Computer Science 1178, 1996, pp. 26-35
Two-dimensional dynamic dictionary matching
Ying Choi, Tak Wah Lam
Lecture Notes in Computer Science 1178, 1996, pp. 85-94
Discovering unbounded unions of regular pattern languages from positive examples
Alvis Brāzma, Esko Ukkonen, Jaak Vilo
Lecture Notes in Computer Science 1178, 1996, pp. 95-104
Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs
Maw-Shang Chang
Lecture Notes in Computer Science 1178, 1996, pp. 146-155
StUSPACE(\log n) \subseteq DSPACE (\log^2 n/ \log\log n)
Eric Allender, Klaus-Jörn Lange
Lecture Notes in Computer Science 1178, 1996, pp. 193-202
Towards more precise parallel biconnectivity approximation
Ka Wong Chong, Tak Wah Lam
Lecture Notes in Computer Science 1178, 1996, pp. 223-232
The complexity of probabilistic versus deterministic finite automata
Andris Ambainis
Lecture Notes in Computer Science 1178, 1996, pp. 233-238
A study of the LMT-skeleton
Siu-Wing Cheng, Naoki Katoh, Manabu Sugai
Lecture Notes in Computer Science 1178, 1996, pp. 256-265
A 3D-hole closing algorithm
Zouina Aktouf, Gilles Bertrand, Laurent Perroton
Lecture Notes in Computer Science 1176, 1996, pp. 36-47
Multiresolution representation of shape in binary images
Gunilla Borgefors, Giuliana Ramella, Gabriella Sanniti di Baja
Lecture Notes in Computer Science 1176, 1996, pp. 51-58
Discrete elastica
Alfred M. Bruckstein, Robert J. Holt, Arun N. Netravali
Lecture Notes in Computer Science 1176, 1996, pp. 59-72
Determining the components of the complement of a digital (n-1)-manifold in Z^n
R. Ayala, E. Domínguez, A.R. Francés, A. Quintero
Lecture Notes in Computer Science 1176, 1996, pp. 163-176
Inter-pixel Euclidean paths for image analysis
Jean-Pierre Braquelaire, Luc Brun, Anne Vialard
Lecture Notes in Computer Science 1176, 1996, pp. 193-204
Hypergraph model of digital topology for grey level images
A. Bretto, S. Ubéda
Lecture Notes in Computer Science 1176, 1996, pp. 217-226
Supercover 3D polygons
Eric Andres, Claudio Sibata, Raj Acharya
Lecture Notes in Computer Science 1176, 1996, pp. 237-242
Complexity of discrete surfaces in the dividing-cubes algorithm
Fatima Boumghar, Serge Miguet, Jean-Marc Nicod
Lecture Notes in Computer Science 1176, 1996, pp. 269-280
Reconstruction convex polyominoes from horizontal and vertical projections II
Elena Barcucci, Alberto Del Lungo, Maurice Nivat, Renzo Pinzani
Lecture Notes in Computer Science 1176, 1996, pp. 295-306
The quasi-shear rotation
Eric Andres
Lecture Notes in Computer Science 1176, 1996, pp. 307-314

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