Publications
Publications
Referenzen
73.
Dima Grigoriev und Marek Karpinski
Computability of the additive complexity of algebraic circuits with root extracting
Band 157
Seite 91--99.
1996
72.
Leszek Gasieniec, Marek Karpinski, Wojciech Plandowski und Wojciech Rytter
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract)
SWAT Band 1097 aus Lecture Notes in Comput. Sci.
Seite 392--403.
Herausgeber: Springer, Berlin
1996
71.
Marek Karpinski und Rutger Verbeek
On randomized versus deterministic computation
Band 154
Seite 23--39.
1996
70.
Farid Ablayev und Marek Karpinski
On the power of randomized branching programs
Automata, languages and programming (Paderborn, 1996) Band 1099 aus Lecture Notes in Comput. Sci.
Seite 348--356.
Herausgeber: Springer, Berlin,
1996
69.
Leszek G\casieniec, Marek Karpinski, Wojciech Plandowski und Wojciech Rytter
Randomized efficient algorithms for compressed strings: the finger-print approach (extended abstract)
Combinatorial pattern matching (Laguna Beach, CA, 1996) Band 1075 aus Lecture Notes in Comput. Sci.
Seite 39--49.
Herausgeber: Springer, Berlin,
1996
68.
Dima Grigoriev, Marek Karpinski und Andrew M. Odlyzko
Short proofs for nondivisibility of sparse polynomials under the extended Riemann hypothesis
Band 28
Seite 297--301.
1996
67.
Dima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide und Roman Smolensky
A lower bound for randomized algebraic decision trees
Proceedings of the Twenty-eighth Annual ACM Symposium on the Theory of Computing (Philadelphia, PA, 1996) , Seite 612--619.
Herausgeber: ACM, New York,
1996
66.
Marek Karpinski, Lawrence L. Larmore und Wojciech Rytter
Sequential and parallel subquadratic work algorithms for constructing approximately optimal binary search trees
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Atlanta, GA, 1996) , Seite 36--41.
Herausgeber: ACM, New York,
1996
65.
Marek Karpinski und Alexander Zelikovsky
1.757 and 1.267 - Approximation Algorithms for the Network and Rectilinear Steiner Tree Problems
Electronic Colloquium on Computational Complexity (ECCC), 2(3)
1995
64.
Hans Kleine Büning, Marek Karpinski und Andreas Flögel
Resolution for quantified Boolean formulas
Inform. and Comput., 117(1):12--18
1995
63.
Marek Karpinski und Angus Macintyre
Bounding VC-dimension for neural networks: progress and prospects
Computational learning theory (Barcelona, 1995) Band 904 aus Lecture Notes in Comput. Sci.
Seite 337--341.
Herausgeber: Springer, Berlin,
1995
62.
Dima Grigoriev, Marek Karpinski und Nicolai Vorobjov
Improved lower bound on testing membership to a polyhedron by algebraic decision trees
36th Annual Symposium on Foundations of Computer Science (Milwaukee, WI, 1995)
Seite 258--265.
Herausgeber: IEEE Comput. Soc. Press, Los Alamitos, CA,
1995
Seite:  
Previous | Publications, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19 | Next
Export als:
BibTeX, XML