Result 1 to 20 of 90 total
Fault-tolerant search algorithms. (to appear). (English)
Monographs in Theoretical Computer Science. An EATCS Series. Berlin: Springer (ISBN 978-3-642-17326-4/hbk). x, 190~p. EUR~79.95/net; SFR~115.00; \sterling~72.00 (2013).
1
On approximate jumbled pattern matching in strings. (English)
Theory Comput. Syst. 50, No. 1, 35-51 (2012).
2
The binary identification problem for weighted trees. (English)
Theor. Comput. Sci. 459, 100-112 (2012).
3
A linear algorithm for string reconstruction in the reverse complement equivalence model. (English)
J. Discrete Algorithms 14, 37-54 (2012).
4
Algorithms for jumbled pattern matching in strings. (English)
Int. J. Found. Comput. Sci. 23, No. 2, 357-374 (2012).
5
The multi-interval Ulam-Rényi game. (English)
Kranakis, Evangelos (ed.) et al., Fun with algorithms. 6th international conference, FUN 2012, Venice, Italy, June 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-30346-3/pbk). Lecture Notes in Computer Science 7288, 69-80 (2012).
6
Near linear time construction of an approximate index for all maximum consecutive sub-sums of a sequence. (English)
Kärkkäinen, Juha (ed.) et al., Combinatorial pattern matching. 23rd annual symposium, CPM 2012, Helsinki, Finland, July 3‒5, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31264-9/pbk). Lecture Notes in Computer Science 7354, 149-158 (2012).
7
Graphs of separability at most 2. (English)
Discrete Appl. Math. 160, No. 6, 685-696 (2012).
8
On the complexity of searching in trees and partially ordered structures. (English)
Theor. Comput. Sci. 412, No. 50, 6879-6896 (2011).
9
Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs. (English)
Owe, Olaf (ed.) et al., Fundamentals of computation theory. 18th international symposium, FCT 2011, Oslo, Norway, August 22‒25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22952-7/pbk). Lecture Notes in Computer Science 6914, 288-297 (2011).
10
Binary identification problems for weighted trees. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 255-266 (2011).
11
Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case. (English)
Discrete Appl. Math. 159, No. 11, 1070-1078 (2011).
12
On the competitive ratio of evaluating priced functions. (English)
J. ACM 58, No. 3, 9 (2011).
13
Efficient reconstruction of RC-equivalent strings. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26‒28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 349-362 (2011).
14
Graphs of separability at most two: Structural characterizations and their consequences. (English)
Iliopoulos, Costas S. (ed.) et al., Combinatorial algorithms. 21st international workshop, IWOCA 2010, London, UK, July 26‒28, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-19221-0/pbk). Lecture Notes in Computer Science 6460, 291-302 (2011).
15
Algorithms for jumbled pattern matching in strings. (English)
Comput. Res. Repos. 2011, Article No. 1102.1746 (2011).
16
Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs (English)
FCT, 288-297 (2011).
17
Binary identification problems for weighted trees (English)
WADS, 255-266 (2011).
18
On greedy algorithms for decision trees. (English)
Cheong, Otfried (ed.) et al., Algorithms and computation. 21st international symposium, ISAAC 2010, Jeju, Korea, December 15‒17, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-17513-8/pbk). Lecture Notes in Computer Science 6507, 206-217 (2010).
19
On the complexity of searching in trees: Average-case minimization. (English)
Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6‒10, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-14164-5/pbk). Lecture Notes in Computer Science 6198, 527-539 (2010).
20
Result 1 to 20 of 90 total
Start
Contact
Print
General Help
