Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=2607

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

Logic as a query language: From frege to XML
Victor Vianu
Lecture Notes in Computer Science 2607, 2003, pp. 1-12
How does computer science change molecular biology?
Alain Viari
Lecture Notes in Computer Science 2607, 2003, pp. 13-13
Improved compact visibility representation of planar graph via Schnyder's realizer
Ching-Chi Lin, Hsueh-I. Lu, I.-Fan Sun
Lecture Notes in Computer Science 2607, 2003, pp. 14-25
Rectangle visibility graphs: Characterization, construction, and compaction
Ileana Streinu, Sue Whitesides
Lecture Notes in Computer Science 2607, 2003, pp. 26-37
Approximating geometric bottleneck shortest paths
Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel Smid, Norbert Zeh
Lecture Notes in Computer Science 2607, 2003, pp. 38-49
Optimization in arrangements
Stefan Langerman, William Steiger
Lecture Notes in Computer Science 2607, 2003, pp. 50-61
Complete classifications for the communication complexity of regular languages
Pascal Tesson, Denis Thérien
Lecture Notes in Computer Science 2607, 2003, pp. 62-73
The commutation with codes and ternary sets of words
Juhani Karhumäki, Michel Latteux, Ion Petre
Lecture Notes in Computer Science 2607, 2003, pp. 74-84
On the confluence of linear shallow term rewrite systems
Guillem Godoy, Ashish Tiwari, Rakesh Verma
Lecture Notes in Computer Science 2607, 2003, pp. 85-96
Wadge degrees of \omega-languages of deterministic Turing machines
Victor Selivanov
Lecture Notes in Computer Science 2607, 2003, pp. 97-108
Faster deterministic broadcasting in ad hoc radio networks
Dariusz R. Kowalski, Andrzej Pelc
Lecture Notes in Computer Science 2607, 2003, pp. 109-120
Private computations in networks: Topology versus randomness
Andreas Jakoby, Maciej Liśkiewicz, Rüdiger Reischuk
Lecture Notes in Computer Science 2607, 2003, pp. 121-132
On shortest-path all-optical networks without wavelength conversion requirements
Thomas Erlebach, Stamatis Stefanakos
Lecture Notes in Computer Science 2607, 2003, pp. 133-144
Lattice reduction by random sampling and birthday methods
Claus Peter Schnorr
Lecture Notes in Computer Science 2607, 2003, pp. 145-156
On the ultimate complexity of factorials
Qi Cheng
Lecture Notes in Computer Science 2607, 2003, pp. 157-166
On the effective Jordan decomposability
Xizhong Zheng, Robert Rettinger, Burchard von Braunmühl
Lecture Notes in Computer Science 2607, 2003, pp. 167-178
Fast algorithms for extended regular expression matching and searching
Lucian Ilie, Baozhen Shan, Sheng Yu
Lecture Notes in Computer Science 2607, 2003, pp. 179-190
Algorithms for transposition invariant string matching
Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen
Lecture Notes in Computer Science 2607, 2003, pp. 191-202
On the complexity of finding a local maximum of functions on discrete planar subsets
Anton Mityagin
Lecture Notes in Computer Science 2607, 2003, pp. 203-211
Some results on derandomization
Harry Buhrman, Lance Fortnow, A. Pavan
Lecture Notes in Computer Science 2607, 2003, pp. 212-222
On the representation of Boolean predicates of the Diffie-Hellman function
Eike Kiltz
Lecture Notes in Computer Science 2607, 2003, pp. 223-233
Quantum circuits with unbounded fan-out
Peter Hyer, Robert S̑palek
Lecture Notes in Computer Science 2607, 2003, pp. 234-246
Analysis of the harmonic algorithm for three servers
Marek Chrobak, Sgall Jȓí
Lecture Notes in Computer Science 2607, 2003, pp. 247-259
Non-clairvoyant scheduling for minimizing mean slowdown
N. Bansal, K. Dhamdhere, J. Könemann, A. Sinha
Lecture Notes in Computer Science 2607, 2003, pp. 260-270
Space efficient hash tables with worst case constant access time
Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul Spirakis
Lecture Notes in Computer Science 2607, 2003, pp. 271-282

Seiten 1 2 3 >