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
Hilfe
Suche: Author="Weimann, Oren"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Consequences of faster alignment of sequences
Amir Abboud
,
Virginia Vassilevska Williams
,
Oren Weimann
Lecture Notes in Computer Science
8572
, 2014, pp. 39-51
Towards optimal packed string matching
Oren Ben-Kiki
,
Philip Bille
,
Dany Breslauer
,
Leszek Ga̧sieniec
,
Roberto Grossi
,
Oren Weimann
Theoretical Computer Science
525
, 2014, pp. 111-129
Approximating the maximum consecutive subsums of a sequence
Ferdinando Cicalese
,
Eduardo Laber
,
Oren Weimann
,
Raphael Yuster
Theoretical Computer Science
525
, 2014, pp. 130-137
On Cartesian trees and range minimum queries
Erik D. Demaine
,
Gad M. Landau
,
Oren Weimann
Algorithmica
68
(3), 2014, pp. 610-625
Improved submatrix maximum queries in Monge matrices
Paweƚ Gawrychowski
,
Shay Mozes
,
Oren Weimann
Lecture Notes in Computer Science
8572
, 2014, pp. 525-537
Tree compression with top trees
Philip Bille
,
Inge Li Grtz
,
Gad M. Landau
,
Oren Weimann
Lecture Notes in Computer Science
7965
, 2013, pp. 160-171
On approximating string selection problems with outliers
Christina Boucher
,
Gad M. Landau
,
Avivit Levy
,
David Pritchard
,
Oren Weimann
Theoretical Computer Science
498
, 2013, pp. 107-114
Improved bounds for online preemptive matching
Leah Epstein
,
Asaf Levin
,
Danny Segev
,
Oren Weimann
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 389-399
Binary jumbled pattern matching on trees and tree-like structures
Travis Gagie
,
Danny Hermelin
,
Gad M. Landau
,
Oren Weimann
Lecture Notes in Computer Science
8125
, 2013, pp. 517-528
Unified compression-based acceleration of edit-distance computation
Danny Hermelin
,
Gad M. Landau
,
Shir Landau
,
Oren Weimann
Algorithmica
65
(2), 2013, pp. 339-353
Approximating the diameter of planar graphs in near linear time
Oren Weimann
,
Raphael Yuster
Lecture Notes in Computer Science
7965
, 2013, pp. 828-839
On approximating string selection problems with outliers
Christina Boucher
,
Gad M. Landau
,
Avivit Levy
,
David Pritchard
,
Oren Weimann
Lecture Notes in Computer Science
7354
, 2012, pp. 427-438
Near linear time construction of an approximate index for all maximum consecutive sub-sums of a sequence
Ferdinando Cicalese
,
Eduardo Laber
,
Oren Weimann
,
Raphael Yuster
Lecture Notes in Computer Science
7354
, 2012, pp. 149-158
Optimal packed string matching
Oren Ben-Kiki
,
Philip Bille
,
Dany Breslauer
,
Leszek Ga̧sieniec
,
Roberto Grossi
,
Oren Weimann
Leibniz International Proceedings in Informatics (LIPIcs)
13
, 2011, pp. 423-432
The Stackelberg minimum spanning tree game
Jean Cardinal
,
Erik D. Demaine
,
Samuel Fiorini
,
Gwenaël Joret
,
Stefan Langerman
,
Ilan Newman
,
Oren Weimann
Algorithmica
59
(2), 2011, pp. 129-144
Distance oracles for vertex-labeled graphs
Danny Hermelin
,
Avivit Levy
,
Oren Weimann
,
Raphael Yuster
Lecture Notes in Computer Science
6756
, 2011, pp. 490-501
A note on exact distance labeling
Oren Weimann
,
David Peleg
Information Processing Letters
111
(14), 2011, pp. 671-673
Computing the girth of a planar graph in
O(n \log n)
time
Oren Weimann
,
Raphael Yuster
SIAM Journal on Discrete Mathematics
24
(2), 2010, pp. 609-616
Fast RNA structure alignment for crossing input structures
Rolf Backofen
,
Gad M. Landau
,
Mathias Möhl
,
Dekel Tsur
,
Oren Weimann
Lecture Notes in Computer Science
5577
, 2009, pp. 236-248
On Cartesian trees and range minimum queries
Erik D. Demaine
,
Gad M. Landau
,
Oren Weimann
Lecture Notes in Computer Science
5555
, 2009, pp. 341-353
A unified algorithm for accelerating edit-distance computation via text-compression
Danny Hermelin
,
Gad M. Landau
,
Shir Landau
,
Oren Weimann
Leibniz International Proceedings in Informatics (LIPIcs)
3
, 2009, pp. 529-540
Speeding up HMM decoding and training by exploiting sequence repetitions
Yury Lifshits
,
Shay Mozes
,
Oren Weimann
,
Michal Ziv-Ukelson
Algorithmica
54
(3), 2009, pp. 379-399
Fast algorithms for computing tree LCS
Shay Mozes
,
Dekel Tsur
,
Oren Weimann
,
Michal Ziv-Ukelson
Theoretical Computer Science
410
(43), 2009, pp. 4303-4314
Computing the girth of a planar graph in
O(n \log n)
time
Oren Weimann
,
Raphael Yuster
Lecture Notes in Computer Science
5555
, 2009, pp. 764-773
Fast algorithms for computing tree LCS
Shay Mozes
,
Dekel Tsur
,
Oren Weimann
,
Michal Ziv-Ukelson
Lecture Notes in Computer Science
5029
, 2008, pp. 230-243
Seiten 1
2
>