Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDInformation Processing Letters, Volume 100
Volume 100, Number 1, October 2006
- Yunlei Zhao:
A note on the Dwork-Naor timed deniable authentication. 1-7 - Ioannis Koutis:
Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope. 8-13 - Sebastian Deorowicz
:
Speeding up transposition-invariant string matching. 14-20 - Dongvu Tonien:
On a traitor tracing scheme from ACISP 2003. 21-22 - Arvind Narayanan, K. Srinathan, C. Pandu Rangan:
Perfectly Reliable Message Transmission. 23-28 - Eric Angel, Evripidis Bampis, Lélia Blin, Laurent Gourvès:
Fair cost-sharing methods for the minimum spanning tree game. 29-35 - Ted Krovetz, Phillip Rogaway:
Variationally universal hashing. 36-39
Volume 100, Number 2, October 2006
- Guy Wolfovitz:
The complexity of depth-3 circuits computing symmetric Boolean functions. 41-46 - Iztok Banic, Janez Zerovnik:
Fault-diameter of Cartesian graph bundles. 47-51 - Yosuke Kikuchi, Toru Araki:
Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs. 52-59 - Ernesto Jiménez, Sergio Arévalo, Antonio Fernández:
Implementing unreliable failure detectors with unknown membership. 60-63 - Peter Damaschke:
A remark on the subsequence problem for arc-annotated sequences with pairwise nested arcs. 64-68 - Khaled M. Elbassioni, Zvi Lotker, Raimund Seidel:
Upper bound on the number of vertices of polyhedra with 0, 1-constraint matrices. 69-71 - Martin Lange, Rafal Somla:
Propositional dynamic logic of context-free programs and fixpoint logic with chop. 72-75 - Pum-Mo Ryu, Key-Sun Choi:
Determining the specificity of terms using inside-outside information: a necessary condition of term hierarchy mining. 76-82 - Jyh-Shyan Lin, Jen-Chun Chang, Rong-Jaye Chen:
New simple constructions of distance-increasing mappings from binary vectors to permutations. 83-89
Volume 100, Number 3, November 2006
- Kimmo Fredriksson, Maxim Mozgovoy:
Efficient parameterized string matching. 91-96 - Alexandre Pinlou, Éric Sopena:
Oriented vertex and arc colorings of outerplanar graphs. 97-104 - Tatsuya Akutsu:
A relation between edit distance for ordered trees and edit distance for Euler strings. 105-109 - Xianchao Zhang, Weifa Liang, He Jiang:
Flow equivalent trees in undirected node-edge-capacitated planar graphs. 110-115 - André Gronemeier:
A note on the decoding complexity of error-correcting codes. 116-119 - Asish Mukhopadhyay, Samidh Chatterjee, Benjamin J. Lafreniere:
On the All-Farthest-Segments problem for a planar set of points. 120-123 - Artiom Alhazov:
P systems without multiplicities of symbol-objects. 124-129
Volume 100, Number 4, November 2006
- Jean-Luc Baril, Jean Marcel Pallo:
Efficient lower and upper bounds of the diagonal-flip distance between triangulations. 131-136 - Zeshan Peng, Hing-Fung Ting:
An O(nlogn)-time algorithm for the maximum constrained agreement subtree problem for binary trees. 137-144 - Andrew Teoh Beng Jin, Tee Connie, David Ngo Chek Ling:
Remarks on BioHash and its mathematical foundation. 145-150 - Yunfeng Tao:
Infinity problems and countability problems for omega-automata. 151-153 - Chor Ping Low:
An approximation algorithm for the load-balanced semi-matching problem in weighted bipartite graphs. 154-161 - Reuven Cohen, Liran Katzir, Danny Raz:
An efficient approximation for the Generalized Assignment Problem. 162-166 - Gang Wu, Jia-Huai You, Guohui Lin:
A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors. 167-171
Volume 100, Number 5, December 2006
- Enrique Alba, Gabriel Luque, Lourdes Araujo:
Natural language tagging with genetic algorithms. 173-182 - Xuehou Tan:
A 2-approximation algorithm for the zookeeper's problem. 183-187 - Calin D. Morosan:
On the number of broadcast schemes in networks. 188-193 - Jianbo Qian, Cao An Wang:
How much precision is needed to compare two sums of square roots of integers? 194-198 - Taisuke Izumi, Toshimitsu Masuzawa:
A weakly-adaptive condition-based consensus algorithm in asynchronous distributed systems. 199-205 - Joost Engelfriet, Sebastian Maneth:
The equivalence problem for deterministic MSO tree transducers is decidable. 206-212
Volume 100, Number 6, December 2006
- Akiyoshi Shioura, Takeshi Tokuyama:
Efficiently pricing European-Asian options - ultimate implementation and analysis of the AMO algorithm. 213-219 - Franz Aurenhammer, Robert L. Scot Drysdale, Hannes Krasser:
Farthest line segment Voronoi diagrams. 220-225 - Kimmo Fredriksson, Szymon Grabowski:
A general compression algorithm that supports fast searching. 226-232 - Hong Liu, Kenneth W. Regan:
Improved construction for universality of determinant and permanent. 233-237 - Alon Efrat, Sariel Har-Peled:
Guarding galleries and terrains. 238-245
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 20:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
