dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Marek Karpinski (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


160Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter: On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. J. Comput. Syst. Sci. 65(2): 332-350 (2002)
113no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarek Karpinski, Wojciech Rytter: On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. Parallel Processing Letters 8(3): 387-397 (1998)
110Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarek Karpinski, Wojciech Rytter: Alphabet-Independent Optimal Parallel Search for Three-Dimensional Patterns. Theor. Comput. Sci. 205(1-2): 243-260 (1998)
108Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPiotr Berman, Marek Karpinski, Lawrence L. Larmore, Wojciech Plandowski, Wojciech Rytter: On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts. CPM 1997: 40-51
91no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarek Karpinski, Wojciech Rytter, Ayumi Shinohara: An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions. Nord. J. Comput. 4(2): 172-186 (1997)
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarek Karpinski, Lawrence L. Larmore, Wojciech Rytter: Correctness of Constructing Optimal Alphabetic Trees Revisited. Theor. Comput. Sci. 180(1-2): 309-324 (1997)
89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter: Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract). CPM 1996: 39-49
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarek Karpinski, Lawrence L. Larmore, Wojciech Rytter: Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees. SODA 1996: 36-41
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLeszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter: Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract). SWAT 1996: 392-403
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarek Karpinski, Wojciech Rytter, Ayumi Shinohara: Pattern-Matching for Strings with Short Descriptions. CPM 1995: 205-214
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarek Karpinski, Wojciech Rytter, Ayumi Shinohara: Pattern-Matching for Strings with Short Descriptions Electronic Colloquium on Computational Complexity (ECCC) 2(22): (1995)
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarek Karpinski, Wojciech Rytter: An Alphabet-Independent Optimal Parallel Search for Three Dimensional Pattern. CPM 1994: 125-135
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarek Karpinski, Wojciech Rytter: On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. MFCS 1994: 453-461

Selection of 13 from 280 records - Marek Karpinski has 122 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page