Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision Both sides next revision
fischer:publications [2020-08-26 08:38]
Johannes Fischer [2020]
fischer:publications [2020-09-21 08:38]
Patrick Dinklage Remove iframes
Line 44: Line 44:
 <!-- ACM DL Article: Inducing Suffix and LCP Arrays in External Memory --> <!-- ACM DL Article: Inducing Suffix and LCP Arrays in External Memory -->
 <div class="​acmdlitem"​ id="​item2975593"><​img src="​http://​dl.acm.org/​images/​oa.gif"​ width="​25"​ height="​25"​ border="​0"​ alt="​ACM DL Author-ize service"​ style="​vertical-align:​middle"/><​a href="​http://​dl.acm.org/​authorize?​N30693"​ title="​Inducing Suffix and LCP Arrays in External Memory">​Inducing Suffix and LCP Arrays in External Memory</​a><​div style="​margin-left:​25px"><​a href="​http://​dl.acm.org/​author_page.cfm?​id=99658726780"​ >Timo Bingmann</​a>,​ <a href="​http://​dl.acm.org/​author_page.cfm?​id=81321491592"​ >​Johannes Fischer</​a>,​ <a href="​http://​dl.acm.org/​author_page.cfm?​id=81322502770"​ >Vitaly Osipov</​a><​br />​Journal of Experimental Algorithmics (JEA) - Special Issue SEA 2014, Regular Papers and Special Issue ALENEX 2013, 2016</​div></​div>​ <div class="​acmdlitem"​ id="​item2975593"><​img src="​http://​dl.acm.org/​images/​oa.gif"​ width="​25"​ height="​25"​ border="​0"​ alt="​ACM DL Author-ize service"​ style="​vertical-align:​middle"/><​a href="​http://​dl.acm.org/​authorize?​N30693"​ title="​Inducing Suffix and LCP Arrays in External Memory">​Inducing Suffix and LCP Arrays in External Memory</​a><​div style="​margin-left:​25px"><​a href="​http://​dl.acm.org/​author_page.cfm?​id=99658726780"​ >Timo Bingmann</​a>,​ <a href="​http://​dl.acm.org/​author_page.cfm?​id=81321491592"​ >​Johannes Fischer</​a>,​ <a href="​http://​dl.acm.org/​author_page.cfm?​id=81322502770"​ >Vitaly Osipov</​a><​br />​Journal of Experimental Algorithmics (JEA) - Special Issue SEA 2014, Regular Papers and Special Issue ALENEX 2013, 2016</​div></​div>​
-<!-- ACM DL Bibliometrics:​ Inducing Suffix and LCP Arrays in External Memory-->​ 
-<div class="​acmdlstat"​ id ="​stats2975593"><​iframe src="​http://​dl.acm.org/​authorizestats?​N30693"​ width="​100%"​ height="​30"​ scrolling="​no"​ frameborder="​0">​frames are not supported</​iframe></​div>​ 
     </​html>​     </​html>​
   * <​html>​   * <​html>​
 <!-- ACM DL Article: Sparse Text Indexing in Small Space --> <!-- ACM DL Article: Sparse Text Indexing in Small Space -->
 <div class="​acmdlitem"​ id="​item2836166"><​img src="​http://​dl.acm.org/​images/​oa.gif"​ width="​25"​ height="​25"​ border="​0"​ alt="​ACM DL Author-ize service"​ style="​vertical-align:​middle"/><​a href="​http://​dl.acm.org/​authorize?​N31933"​ title="​Sparse Text Indexing in Small Space">​Sparse Text Indexing in Small Space</​a><​div style="​margin-left:​25px"><​a href="​http://​dl.acm.org/​author_page.cfm?​id=81100628534"​ >Philip Bille</​a>,​ <a href="​http://​dl.acm.org/​author_page.cfm?​id=81321491592"​ >​Johannes Fischer</​a>,​ <a href="​http://​dl.acm.org/​author_page.cfm?​id=81100550736"​ >Inge Li G&#​248;​rtz</​a>,​ <a href="​http://​dl.acm.org/​author_page.cfm?​id=81336490330"​ >Tsvi Kopelowitz</​a>,​ <a href="​http://​dl.acm.org/​author_page.cfm?​id=81384606517"​ >​Benjamin Sach</​a>,​ <a href="​http://​dl.acm.org/​author_page.cfm?​id=81479660863"​ >Hjalte Wedel Vildh&#​248;​j</​a><​br />ACM Transactions on Algorithms (TALG),&​nbsp;​2016</​div></​div>​ <div class="​acmdlitem"​ id="​item2836166"><​img src="​http://​dl.acm.org/​images/​oa.gif"​ width="​25"​ height="​25"​ border="​0"​ alt="​ACM DL Author-ize service"​ style="​vertical-align:​middle"/><​a href="​http://​dl.acm.org/​authorize?​N31933"​ title="​Sparse Text Indexing in Small Space">​Sparse Text Indexing in Small Space</​a><​div style="​margin-left:​25px"><​a href="​http://​dl.acm.org/​author_page.cfm?​id=81100628534"​ >Philip Bille</​a>,​ <a href="​http://​dl.acm.org/​author_page.cfm?​id=81321491592"​ >​Johannes Fischer</​a>,​ <a href="​http://​dl.acm.org/​author_page.cfm?​id=81100550736"​ >Inge Li G&#​248;​rtz</​a>,​ <a href="​http://​dl.acm.org/​author_page.cfm?​id=81336490330"​ >Tsvi Kopelowitz</​a>,​ <a href="​http://​dl.acm.org/​author_page.cfm?​id=81384606517"​ >​Benjamin Sach</​a>,​ <a href="​http://​dl.acm.org/​author_page.cfm?​id=81479660863"​ >Hjalte Wedel Vildh&#​248;​j</​a><​br />ACM Transactions on Algorithms (TALG),&​nbsp;​2016</​div></​div>​
-<!-- ACM DL Bibliometrics:​ Sparse Text Indexing in Small Space--> 
-<div class="​acmdlstat"​ id ="​stats2836166"><​iframe src="​http://​dl.acm.org/​authorizestats?​N31933"​ width="​100%"​ height="​30"​ scrolling="​no"​ frameborder="​0">​frames are not supported</​iframe></​div>​ 
     </​html>​     </​html>​
   * **[[http://​dx.doi.org/​10.4230/​LIPIcs.CPM.2016.26|On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching]]** ([[https://​arxiv.org/​abs/​1606.02465|arXiv version]]) \\ //​**Johannes Fischer**, **Dominik Köppl**, **Florian Kurpicz**// \\ Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), LIPIcs 54, 2016, 26:1--26:11   * **[[http://​dx.doi.org/​10.4230/​LIPIcs.CPM.2016.26|On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching]]** ([[https://​arxiv.org/​abs/​1606.02465|arXiv version]]) \\ //​**Johannes Fischer**, **Dominik Köppl**, **Florian Kurpicz**// \\ Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), LIPIcs 54, 2016, 26:1--26:11
 
Last modified: 2023-08-05 09:13 by Johannes Fischer
DokuWikiRSS-Feed