Philip Bille

	2009
23		Philip Bille: Fast Searching in Packed Strings. CPM 2009: 116-126
22		Philip Bille, Mikkel Thorup: Faster Regular Expression Matching. ICALP (1) 2009: 171-182
21		Philip Bille: Fast Searching in Packed Strings CoRR abs/0907.3135: (2009)
20		Philip Bille, Inge Li Gørtz: Matching subsequences in trees. J. Discrete Algorithms 7(3): 306-314 (2009)
	2008
19		Philip Bille: Faster Approximate String Matching for Short Patterns CoRR abs/0811.3490: (2008)
18		Philip Bille, Martin Farach-Colton: Fast and compact regular expression matching. Theor. Comput. Sci. 409(3): 486-496 (2008)
	2007
17		Philip Bille, Rolf Fagerberg, Inge Li Gørtz: Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts. CPM 2007: 52-62
16		Philip Bille, Anna Pagh, Rasmus Pagh: Fast Evaluation of Union-Intersection Expressions. ISAAC 2007: 739-750
15		Philip Bille, Anna Pagh, Rasmus Pagh: Fast evaluation of union-intersection expressions CoRR abs/0708.3259: (2007)
14		Philip Bille: Pattern Matching in Trees and Strings CoRR abs/0708.4288: (2007)
	2006
13		Philip Bille, Inge Li Gørtz: Matching Subsequences in Trees. CIAC 2006: 248-259
12		Philip Bille: New Algorithms for Regular Expression Matching. ICALP (1) 2006: 643-654
11		Arjan Kuijper, Ole Fogh Olsen, Philip Bille, Peter J. Giblin: Matching 2D Shapes using their Symmetry Sets. ICPR (2) 2006: 179-182
10		Philip Bille: New Algorithms for Regular Expression Matching CoRR abs/cs/0606116: (2006)
9		Philip Bille, Inge Li Gørtz: The Tree Inclusion Problem: In Linear Space and Faster CoRR abs/cs/0608124: (2006)
8		Philip Bille, Rolf Fagerberg, Inge Li Gørtz: Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts CoRR abs/cs/0609085: (2006)
	2005
7		Philip Bille, Inge Li Gørtz: The Tree Inclusion Problem: In Optimal Space and Faster. ICALP 2005: 66-77
6		Philip Bille, Martin Farach-Colton: Fast and Compact Regular Expression Matching CoRR abs/cs/0509069: (2005)
5		Philip Bille, Inge Li Gørtz: Matching Subsequences in Trees CoRR abs/cs/0512061: (2005)
4		Stephen Alstrup, Philip Bille, Theis Rauhe: Labeling Schemes for Small Distances in Trees. SIAM J. Discrete Math. 19(2): 448-462 (2005)
3		Philip Bille: A survey on tree edit distance and related problems. Theor. Comput. Sci. 337(1-3): 217-239 (2005)
	2004
2		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 (2) 2004: 313-325
	2003
1		Stephen Alstrup, Philip Bille, Theis Rauhe: Labeling schemes for small distances in trees. SODA 2003: 689-698

Coauthor Index

1	Stephen Alstrup	[1] [4]
2	Rolf Fagerberg	[8] [17]
3	Martin Farach-Colton (Martin Farach)	[6] [18]
4	Peter J. Giblin	[2] [11]
5	Inge Li Gørtz	[5] [7] [8] [9] [13] [17] [20]
6	Arjan Kuijper	[2] [11]
7	Mads Nielsen	[2]
8	Ole Fogh Olsen	[2] [11]
9	Anna Pagh (Anna Östlin)	[15] [16]
10	Rasmus Pagh	[15] [16]
11	Theis Rauhe	[1] [4]
12	Mikkel Thorup	[22]

Colors in the list of coauthors