BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × China
1 × France
1 × Greece
1 × Italy
1 × Latvia
1 × Portugal
1 × Spain
Collaborated with:
I.L.Gørtz M.Stöckel M.Thorup S.Vind J.Kristensen G.M.Landau O.Weimann A.Kuijper O.F.Olsen P.J.Giblin J.Fischer T.Kopelowitz B.Sach H.W.Vildhøj
Talks about:
tree (4) match (3) compress (2) regular (2) express (2) faster (2) space (2) fingerprint (1) construct (1) algorithm (1)

Person: Philip Bille

DBLP DBLP: Bille:Philip

Contributed to:

LATA 20152015
ICALP (1) 20132013
LATA 20122012
ICALP (1) 20092009
ICALP (1) 20062006
ICPR v2 20062006
ICALP 20052005

Wrote 9 papers:

LATA-2015-BilleGV #data type
Compressed Data Structures for Range Searching (PB, ILG, SV), pp. 577–586.
Sparse Suffix Tree Construction in Small Space (PB, JF, ILG, TK, BS, HWV), pp. 148–159.
Tree Compression with Top Trees (PB, ILG, GML, OW), pp. 160–171.
Longest Common Extensions via Fingerprinting (PB, ILG, JK), pp. 119–130.
LATA-2012-BilleS #dependence #performance #programming
Fast and Cache-Oblivious Dynamic Programming with Local Dependencies (PB, MS), pp. 131–142.
ICALP-v1-2009-BilleT #performance #regular expression
Faster Regular Expression Matching (PB, MT), pp. 171–182.
ICALP-v1-2006-Bille #algorithm #regular expression
New Algorithms for Regular Expression Matching (PB), pp. 643–654.
ICPR-v2-2006-KuijperOBG #2d #set #symmetry #using
Matching 2D Shapes using their Symmetry Sets (AK, OFO, PB, PJG), pp. 179–182.
ICALP-2005-BilleG #performance #problem
The Tree Inclusion Problem: In Optimal Space and Faster (PB, ILG), pp. 66–77.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.