| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Philip Bille, Inge Li Gørtz |
Fast Arc-Annotated Subsequence Matching in Linear Space.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille |
Faster Approximate String Matching for Short Patterns. |
Theory Comput. Syst. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Morten Stöckel |
Fast and Cache-Oblivious Dynamic Programming with Local Dependencies. |
LATA |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz, Jesper Kristensen |
Longest Common Extensions via Fingerprinting. |
LATA |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz |
The tree inclusion problem: In linear space and faster. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, Søren Vind |
String Indexing for Patterns with Wildcards |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, David Kofoed Wind |
String Matching with Variable Length Gaps |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz |
Substring Range Reporting |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Philip Bille |
Fast searching in packed strings. |
J. Discrete Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Gad M. Landau, Rajeev Raman, Kunihiko Sadakane, Srinivasa Rao Satti, Oren Weimann |
Random Access to grammar-Compressed Strings. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz |
Substring Range Reporting. |
CPM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oren Ben-Kiki, Philip Bille, Dany Breslauer, Leszek Gasieniec, Roberto Grossi, Oren Weimann |
Optimal Packed String Matching. |
FSTTCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Gad M. Landau, Oren Weimann |
Random Access to Grammar Compressed Strings |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Philip Bille, Mikkel Thorup |
Regular Expression Matching with Multi-Strings and Intervals. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz |
Fast Arc-Annotated Subsequence Matching in Linear Space. |
SOFSEM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz, Hjalte Wedel Vildhøj, David Kofoed Wind |
String Matching with Variable Length Gaps. |
SPIRE |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Rolf Fagerberg, Inge Li Gørtz |
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts. |
ACM Transactions on Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz |
Fast Arc-Annotated Subsequence Matching in Linear Space |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Philip Bille |
Fast Searching in Packed Strings |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz |
Matching subsequences in trees. |
J. Discrete Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Mikkel Thorup |
Faster Regular Expression Matching. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille |
Fast Searching in Packed Strings. |
CPM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Martin Farach-Colton |
Fast and compact regular expression matching. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille |
Faster Approximate String Matching for Short Patterns |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Philip Bille |
Pattern Matching in Trees and Strings |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Philip Bille, Anna Pagh, Rasmus Pagh |
Fast evaluation of union-intersection expressions |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Philip Bille, Rolf Fagerberg, Inge Li Gørtz |
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts. |
CPM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Anna Pagh, Rasmus Pagh |
Fast Evaluation of Union-Intersection Expressions. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Rolf Fagerberg, Inge Li Gørtz |
Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz |
The Tree Inclusion Problem: In Linear Space and Faster |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Philip Bille |
New Algorithms for Regular Expression Matching |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Philip Bille |
New Algorithms for Regular Expression Matching. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Arjan Kuijper, Ole Fogh Olsen, Philip Bille, Peter J. Giblin |
Matching 2D Shapes using their Symmetry Sets. |
ICPR |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz |
Matching Subsequences in Trees. |
CIAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille |
A survey on tree edit distance and related problems. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Martin Farach-Colton |
Fast and Compact Regular Expression Matching |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz |
Matching Subsequences in Trees |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Stephen Alstrup, Philip Bille, Theis Rauhe |
Labeling Schemes for Small Distances in Trees. |
SIAM J. Discrete Math. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz |
The Tree Inclusion Problem: In Optimal Space and Faster. |
ICALP |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Arjan Kuijper, Ole Fogh Olsen, Peter J. Giblin, Philip Bille, Mads Nielsen |
From a 2D Shape to a String Structure Using the Symmetry Set. |
ECCV |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephen Alstrup, Philip Bille, Theis Rauhe |
Labeling schemes for small distances in trees. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")