Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND YEAR=2003
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Deterministic finite automata with recursive calls and DPDAs
Jean H. Gallier
,
Salvatore La Torre
,
Supratik Mukhopadhyay
Information Processing Letters
87
(4), 2003, pp. 187-193
A spectral lower bound for the treewidth of a graph and its consequences
L. Sunil Chandran
,
C.R. Subramanian
Information Processing Letters
87
(4), 2003, pp. 195-200
Shift-or string matching with super-alphabets
Kimmo Fredriksson
Information Processing Letters
87
(4), 2003, pp. 201-204
A type system for the push-enter model
Kwanghoon Choi
,
Taisook Han
Information Processing Letters
87
(4), 2003, pp. 205-211
Complexity of min-max subsequence problems
Wil Michiels
,
Jan Korst
Information Processing Letters
87
(4), 2003, pp. 213-217
A note on the terminal Steiner tree problem
Bernhard Fuchs
Information Processing Letters
87
(4), 2003, pp. 219-220
Personalized cache management for mobile computing environments
Ho-Sook Kim
,
Hwan-Seung Yong
Information Processing Letters
87
(4), 2003, pp. 221-228
An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution
Philip M. Long
Information Processing Letters
87
(5), 2003, pp. 229-234
Disjunctive partial deduction of a right-to-left string-matching algorithm
Manuel Hernández
,
David A. Rosenblueth
Information Processing Letters
87
(5), 2003, pp. 235-241
Distributed algorithm to detect strong conjunctive predicates
Punit Chandra
,
Ajay D. Kshemkalyani
Information Processing Letters
87
(5), 2003, pp. 243-249
Linear time self-stabilizing colorings
Stephen T. Hedetniemi
,
David P. Jacobs
,
Pradip K. Srimani
Information Processing Letters
87
(5), 2003, pp. 251-255
Efficient preprocessing of XML queries using structured signatures
Yon Dohn Chung
,
Jong Wook Kim
,
Myoung Ho Kim
Information Processing Letters
87
(5), 2003, pp. 257-264
Reachability and confluence are undecidable for flat term rewriting systems
Florent Jacquemard
Information Processing Letters
87
(5), 2003, pp. 265-270
On minimizing the maximum congestion for weighted hypergraph embedding in a cycle
SingLing Lee
,
Hann-Jang Ho
Information Processing Letters
87
(5), 2003, pp. 271-275
Differential and linear cryptanalysis for 2-round SPNs
Kilsoo Chun
,
Seungjoo Kim
,
Sangjin Lee
,
Soo Hak Sung
,
Seonhee Yoon
Information Processing Letters
87
(5), 2003, pp. 277-282
A note on commutative multivariate rational series
B. Litow
Information Processing Letters
87
(6), 2003, pp. 283-285
Alternating paths through disjoint line segments
Michael Hoffmann
,
Csaba D. Tóth
Information Processing Letters
87
(6), 2003, pp. 287-294
A combinatorial characterization of treelike resolution space
Juan Luis Esteban
,
Jacobo Torán
Information Processing Letters
87
(6), 2003, pp. 295-300
An approximative solution to the Zookeeper's problem
Håkan Jonsson
Information Processing Letters
87
(6), 2003, pp. 301-307
Optimal state-space lumping in Markov chains
Salem Derisavi
,
Holger Hermanns
,
William H. Sanders
Information Processing Letters
87
(6), 2003, pp. 309-315
Sorting a sequence of strong kings in a tournament
Ting-Yem Ho
,
Jou-Ming Chang
Information Processing Letters
87
(6), 2003, pp. 317-320
A note on monotone complexity and the rank of matrices
Anna Gál
,
Pavel Pudlák
Information Processing Letters
87
(6), 2003, pp. 321-326
On structural properties of eta-expansions of identity
B. Intrigila
,
M. Nesi
Information Processing Letters
87
(6), 2003, pp. 327-333
An efficient stream authentication scheme using tree chaining
Yongsu Park
,
Tae-Sun Chung
,
Yookun Cho
Information Processing Letters
86
(1), 2003, pp. 1-8
Gales suffice for constructive dimension
John M. Hitchcock
Information Processing Letters
86
(1), 2003, pp. 9-12
Seiten
<
1
2
3
4
5
6
7
8
9
>