 | 2009 |
|---|
| 243 |       | Marek Karpinski,
Yakov Nekrich:
Space Efficient Multi-dimensional Range Reporting.
COCOON 2009: 215-224 |
| 242 | | Travis Gagie,
Marek Karpinski,
Yakov Nekrich:
Low-Memory Adaptive Prefix Coding.
DCC 2009: 13-22 |
| 241 | | Marek Karpinski,
Warren Schudy:
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems.
STOC 2009: 313-322 |
| 240 | | Piotr Berman,
Bhaskar DasGupta,
Marek Karpinski:
Approximating Transitive Reductions for Directed Networks.
WADS 2009: 74-85 |
| 239 | | Piotr Berman,
Marek Karpinski,
Alexander Zelikovsky:
1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2.
WADS 2009: 86-97 |
| 238 | | Marek Karpinski,
Yakov Nekrich:
A Fast Algorithm for Adaptive Prefix Coding.
Algorithmica 55(1): 29-41 (2009) |
| 237 | | Piotr Berman,
Marek Karpinski,
Andrzej Lingas:
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications
CoRR abs/0904.2310: (2009) |
| 236 | | Gábor Ivanyos,
Marek Karpinski,
Nitin Saxena:
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
CoRR abs/0907.0774: (2009) |
| 2008 |
|---|
| 235 |  | Marek Karpinski,
Yakov Nekrich:
Searching for Frequent Colors in Rectangles.
CCCG 2008 |
| 234 | | Gábor Ivanyos,
Marek Karpinski,
Nitin Saxena:
Schemes for Deterministic Polynomial Factoring
CoRR abs/0804.1974: (2008) |
| 233 | | Marek Karpinski,
Yakov Nekrich:
Searching for Frequent Colors in Rectangles
CoRR abs/0805.1348: (2008) |
| 232 | | Leslie Ann Goldberg,
Mark Jerrum,
Marek Karpinski:
The Mixing Time of Glauber Dynamics for Colouring Regular Trees
CoRR abs/0806.0921: (2008) |
| 231 | | Marek Karpinski,
Yakov Nekrich:
Space-Efficient Multi-Dimensional Range Reporting
CoRR abs/0806.4361: (2008) |
| 230 | | Piotr Berman,
Bhaskar DasGupta,
Marek Karpinski:
Approximating Transitivity in Directed Networks
CoRR abs/0809.0188: (2008) |
| 229 | | Piotr Berman,
Marek Karpinski,
Alexander Zelikovsky:
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two
CoRR abs/0810.1851: (2008) |
| 228 | | Gábor Ivanyos,
Marek Karpinski,
Lajos Rónyai,
Nitin Saxena:
Trading GRH for algebra: algorithms for factoring polynomials and related structures
CoRR abs/0811.3165: (2008) |
| 227 | | Marek Karpinski,
Warren Schudy:
Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems
CoRR abs/0811.3244: (2008) |
| 226 | | Travis Gagie,
Marek Karpinski,
Yakov Nekrich:
Low-Memory Adaptive Prefix Coding
CoRR abs/0811.3602: (2008) |
| 225 | | Piotr Berman,
Marek Karpinski,
Alexander Zelikovsky:
A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two
CoRR abs/0812.2137: (2008) |
| 224 | | Gábor Ivanyos,
Marek Karpinski,
Nitin Saxena:
Schemes for Deterministic Polynomial Factoring.
Electronic Colloquium on Computational Complexity (ECCC) 15(043): (2008) |
| 223 | | Piotr Berman,
Marek Karpinski,
Alexander Zelikovsky:
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two.
Electronic Colloquium on Computational Complexity (ECCC) 15(094): (2008) |
| 222 | | Gábor Ivanyos,
Marek Karpinski,
Lajos Rónyai,
Nitin Saxena:
Trading GRH for algebra: algorithms for factoring polynomials and related structures.
Electronic Colloquium on Computational Complexity (ECCC) 15(099): (2008) |
| 221 | | Marek Karpinski,
Warren Schudy:
Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems.
Electronic Colloquium on Computational Complexity (ECCC) 15(101): (2008) |
| 220 | | Magnus Bordewich,
Martin E. Dyer,
Marek Karpinski:
Path coupling using stopping times and counting independent sets and colorings in hypergraphs.
Random Struct. Algorithms 32(3): 375-399 (2008) |
| 2007 |
|---|
| 219 | | Piotr Berman,
Marek Karpinski,
Alexander D. Scott:
Computational complexity of some restricted instances of 3-SAT.
Discrete Applied Mathematics 155(5): 649-653 (2007) |
| 218 | | Piotr Berman,
Bhaskar DasGupta,
Marek Karpinski:
Approximating Transitive Reductions for Directed Networks.
Electronic Colloquium on Computational Complexity (ECCC) 14(119): (2007) |
| 217 | | Annette Ebbers-Baumann,
Ansgar Grüne,
Rolf Klein,
Marek Karpinski,
Christian Knauer,
Andrzej Lingas:
Embedding Point Sets into Plane Graphs of Small Dilation.
Int. J. Comput. Geometry Appl. 17(3): 201-230 (2007) |
| 216 | | Piotr Berman,
Marek Karpinski,
Yakov Nekrich:
Approximating Huffman codes in parallel.
J. Discrete Algorithms 5(3): 479-490 (2007) |
| 215 | | Piotr Berman,
Marek Karpinski,
Yakov Nekrich:
Optimal trade-off for Merkle tree traversal.
Theor. Comput. Sci. 372(1): 26-36 (2007) |
| 2006 |
|---|
| 214 | | Magnus Bordewich,
Martin E. Dyer,
Marek Karpinski:
Stopping Times, Metrics and Approximate Counting.
ICALP (1) 2006: 108-119 |
| 213 | | Piotr Berman,
Marek Karpinski:
8/7-approximation algorithm for (1, 2)-TSP.
SODA 2006: 641-648 |
| 212 | | Wenceslas Fernandez de la Vega,
Marek Karpinski:
Approximation Complexity of Nondense Instances of MAX-CUT.
Electronic Colloquium on Computational Complexity (ECCC) 13(101): (2006) |
| 211 | | Wenceslas Fernandez de la Vega,
Marek Karpinski:
On the Sample Complexity of MAX-CUT.
Electronic Colloquium on Computational Complexity (ECCC) 13(104): (2006) |
| 210 | | Wenceslas Fernandez de la Vega,
Ravi Kannan,
Marek Karpinski:
Approximation of Global MAX-CSP Problems.
Electronic Colloquium on Computational Complexity (ECCC) 13(124): (2006) |
| 209 | | Wenceslas Fernandez de la Vega,
Marek Karpinski:
Trading Tensors for Cloning: Constant Time Approximation Schemes for Metric MAX-CSP.
Electronic Colloquium on Computational Complexity (ECCC) 13(155): (2006) |
| 208 | | Lars Engebretsen,
Marek Karpinski:
TSP with bounded metrics.
J. Comput. Syst. Sci. 72(4): 509-546 (2006) |
| 207 | | Marek Karpinski,
Yakov Nekrich:
Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes.
Parallel Processing Letters 16(1): 81-92 (2006) |
| 2005 |
|---|
| 206 | | Marek Karpinski,
Yakov Nekrich:
Algorithms for Construction of Optimal and Almost-Optimal Length-Restricted Codes.
DCC 2005: 464 |
| 205 | | Marek Karpinski,
Yakov Nekrich:
Predecessor Queries in Constant Time?.
ESA 2005: 238-248 |
| 204 | | Magnus Bordewich,
Martin E. Dyer,
Marek Karpinski:
Path Coupling Using Stopping Times.
FCT 2005: 19-31 |
| 203 | | Marek Karpinski,
Yakov Nekrich:
Optimal trade-off for merkle tree traversal.
ICETE 2005: 275-282 |
| 202 | | Annette Ebbers-Baumann,
Ansgar Grüne,
Marek Karpinski,
Rolf Klein,
Christian Knauer,
Andrzej Lingas:
Embedding Point Sets into Plane Graphs of Small Dilation.
ISAAC 2005: 5-16 |
| 201 | | Cristina Bazgan,
Marek Karpinski:
On the Complexity of Global Constraint Satisfaction.
ISAAC 2005: 624-633 |
| 200 | | Wenceslas Fernandez de la Vega,
Marek Karpinski,
Ravi Kannan,
Santosh Vempala:
Tensor decomposition and approximation schemes for constraint satisfaction problems.
STOC 2005: 747-754 |
| 199 | | Marek Karpinski,
Ion I. Mandoiu,
Alexander Olshevsky,
Alexander Zelikovsky:
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem.
Algorithmica 42(2): 109-120 (2005) |
| 198 | | Magnus Bordewich,
Martin E. Dyer,
Marek Karpinski:
Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs
Electronic Colloquium on Computational Complexity (ECCC)(002): (2005) |
| 197 | | Piotr Berman,
Marek Karpinski:
8/7-Approximation Algorithm for (1,2)-TSP
Electronic Colloquium on Computational Complexity (ECCC)(069): (2005) |
| 196 | | Magnus Bordewich,
Martin E. Dyer,
Marek Karpinski:
Metric Construction, Stopping Times and Path Coupling.
Electronic Colloquium on Computational Complexity (ECCC)(151): (2005) |
| 195 | | Farid M. Ablayev,
Aida Gainutdinova,
Marek Karpinski,
Cristopher Moore,
Chris Pollett:
On the computational power of probabilistic and quantum branching program.
Inf. Comput. 203(2): 145-162 (2005) |
| 194 | | Klaus Jansen,
Marek Karpinski,
Andrzej Lingas,
Eike Seidel:
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs.
SIAM J. Comput. 35(1): 110-119 (2005) |
| 2004 |
|---|
| 193 | | Wenceslas Fernandez de la Vega,
Marek Karpinski,
Claire Kenyon:
Approximation schemes for Metric Bisection and partitioning.
SODA 2004: 506-515 |
| 192 | | Piotr Berman,
Marek Karpinski,
Yakov Nekrich:
Optimal Trade-Off for Merkle Tree Traversal
Electronic Colloquium on Computational Complexity (ECCC)(049): (2004) |
| 191 | | Piotr Berman,
Marek Karpinski,
Alexander D. Scott:
Computational Complexity of Some Restricted Instances of 3SAT
Electronic Colloquium on Computational Complexity (ECCC)(111): (2004) |
| 190 | | Marek Karpinski,
Yakov Nekrich:
A Note on Traversing Skew Merkle Trees
Electronic Colloquium on Computational Complexity (ECCC)(118): (2004) |
| 189 | | Marek Karpinski,
Miroslaw Kowaluk,
Andrzej Lingas:
Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs.
Fundam. Inform. 62(3-4): 369-375 (2004) |
| 188 | | Marek Karpinski,
Lawrence L. Larmore,
Yakov Nekrich:
Work-Efficient Algorithms For The Construction Of Length-Limited Huffman Codes.
Parallel Processing Letters 14(1): 99-105 (2004) |
| 2003 |
|---|
| 187 | | Wenceslas Fernandez de la Vega,
Marek Karpinski,
Claire Kenyon,
Yuval Rabani:
Approximation schemes for clustering problems.
STOC 2003: 50-58 |
| 186 | | Marek Karpinski,
Ion I. Mandoiu,
Alexander Olshevsky,
Alexander Zelikovsky:
Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem.
WADS 2003: 401-411 |
| 185 | | Piotr Berman,
Marek Karpinski:
Improved Approximation Lower Bounds on Small Occurrence Optimization
Electronic Colloquium on Computational Complexity (ECCC) 10(008): (2003) |
| 184 | | Piotr Berman,
Marek Karpinski,
Alex D. Scott:
Approximation Hardness and Satisfiability of Bounded Occurrence Instances of SAT
Electronic Colloquium on Computational Complexity (ECCC) 10(022): (2003) |
| 183 | | Piotr Berman,
Marek Karpinski,
Alex D. Scott:
Approximation Hardness of Short Symmetric Instances of MAX-3SAT
Electronic Colloquium on Computational Complexity (ECCC)(049): (2003) |
| 182 | | Piotr Berman,
Marek Karpinski:
Approximability of Hypergraph Minimum Bisection
Electronic Colloquium on Computational Complexity (ECCC)(056): (2003) |
| 181 | | Farid M. Ablayev,
Marek Karpinski:
A lower bound for integer multiplication on randomized ordered read-once branching programs.
Inf. Comput. 186(1): 78-89 (2003) |
| 180 | | Noga Alon,
Wenceslas Fernandez de la Vega,
Ravi Kannan,
Marek Karpinski:
Random sampling and approximation of MAX-CSPs.
J. Comput. Syst. Sci. 67(2): 212-243 (2003) |
| 179 | | Cristina Bazgan,
Wenceslas Fernandez de la Vega,
Marek Karpinski:
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction.
Random Struct. Algorithms 23(1): 73-91 (2003) |
| 2002 |
|---|
| 178 | | Piotr Berman,
Sridhar Hannenhalli,
Marek Karpinski:
1.375-Approximation Algorithm for Sorting by Reversals.
ESA 2002: 200-210 |
| 177 | | Piotr Berman,
Marek Karpinski:
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION.
ICALP 2002: 623-632 |
| 176 | | Piotr Berman,
Marek Karpinski,
Yakov Nekrich:
Approximating Huffman Codes in Parallel.
ICALP 2002: 845-855 |
| 175 | | Marek Karpinski:
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge.
MFCS 2002: 59-67 |
| 174 | | Piotr Berman,
Marek Karpinski:
Approximating minimum unsatisfiability of linear equations.
SODA 2002: 514-516 |
| 173 | | Béla Csaba,
Marek Karpinski,
Piotr Krysta:
Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems.
SODA 2002: 74-83 |
| 172 | | Noga Alon,
Wenceslas Fernandez de la Vega,
Ravi Kannan,
Marek Karpinski:
Random sampling and approximation of MAX-CSP problems.
STOC 2002: 232-239 |
| 171 | | Cristina Bazgan,
Wenceslas Fernandez de la Vega,
Marek Karpinski:
Approximability of Dense Instances of NEAREST CODEWORD Problem.
SWAT 2002: 298-307 |
| 170 | | Piotr Berman,
Marek Karpinski,
Yakov Nekrich:
Approximating Huffman Codes in Parallel
Electronic Colloquium on Computational Complexity (ECCC)(018): (2002) |
| 169 | | Wenceslas Fernandez de la Vega,
Marek Karpinski,
Claire Kenyon,
Yuval Rabani:
Polynomial Time Approximation Schemes for Metric Min-Sum Clustering
Electronic Colloquium on Computational Complexity (ECCC)(025): (2002) |
| 168 | | Marek Karpinski,
Yakov Nekrich:
Parallel Construction of Minimum Redundancy Length-Limited Codes
Electronic Colloquium on Computational Complexity (ECCC)(029): (2002) |
| 167 | | Wenceslas Fernandez de la Vega,
Marek Karpinski,
Claire Kenyon:
A Polynomial Time Approximation Scheme for Metric MIN-BISECTION
Electronic Colloquium on Computational Complexity (ECCC)(041): (2002) |
| 166 | | Wenceslas Fernandez de la Vega,
Marek Karpinski:
A Polynomial Time Approximation Scheme for Subdense MAX-CUT
Electronic Colloquium on Computational Complexity (ECCC)(044): (2002) |
| 165 | | Marek Karpinski:
On Approximability of Minimum Bisection Problem
Electronic Colloquium on Computational Complexity (ECCC)(046): (2002) |
| 164 | | Wenceslas Fernandez de la Vega,
Marek Karpinski:
9/8-Approximation Algorithm for Random MAX-3SAT
Electronic Colloquium on Computational Complexity (ECCC)(070): (2002) |
| 163 | | Rusins Freivalds,
Marek Karpinski,
Carl H. Smith,
Rolf Wiehagen:
Learning by the Process of Elimination.
Inf. Comput. 176(1): 37-50 (2002) |
| 162 | | Susanne Albers,
Marek Karpinski:
Randomized splay trees: Theoretical and experimental results.
Inf. Process. Lett. 81(4): 213-221 (2002) |
| 161 | | Uriel Feige,
Marek Karpinski,
Michael Langberg:
Improved approximation of Max-Cut on graphs of bounded degree.
J. Algorithms 43(2): 201-219 (2002) |
| 160 | | Piotr 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) |
| 2001 |
|---|
| 159 | | Marek Karpinski:
Approximating Bounded Degree Instances of NP-Hard Problems.
FCT 2001: 24-34 |
| 158 | | Farid M. Ablayev,
Aida Gainutdinova,
Marek Karpinski:
On Computational Power of Quantum Branching Programs.
FCT 2001: 59-70 |
| 157 | | Lars Engebretsen,
Marek Karpinski:
Approximation Hardness of TSP with Bounded Metrics.
ICALP 2001: 201-212 |
| 156 | | Klaus Jansen,
Marek Karpinski,
Andrzej Lingas,
Eike Seidel:
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs.
STACS 2001: 365-375 |
| 155 | | Marek Karpinski:
Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems.
Algorithmica 30(3): 386-397 (2001) |
| 154 | | Piotr Berman,
Marek Karpinski:
Improved Approximations for General Minimum Cost Scheduling
Electronic Colloquium on Computational Complexity (ECCC)(097): (2001) |
| 153 | | Noga Alon,
Wenceslas Fernandez de la Vega,
Ravi Kannan,
Marek Karpinski:
Random Sampling and Approximation of MAX-CSP Problems
Electronic Colloquium on Computational Complexity (ECCC)(100): (2001) |
| 152 | | Piotr Berman,
Marek Karpinski:
Approximating Minimum Unsatisfiability of Linear Equations
Electronic Colloquium on Computational Complexity (ECCC) 8(25): (2001) |
| 151 | | Piotr Berman,
Marek Karpinski:
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
Electronic Colloquium on Computational Complexity (ECCC) 8(26): (2001) |
| 150 | | Cristina Bazgan,
Wenceslas Fernandez de la Vega,
Marek Karpinski:
Polynomial Time Approximation Schemes for Dense Instances of Minimum Constraint Satisfaction
Electronic Colloquium on Computational Complexity (ECCC) 8(34): (2001) |
| 149 | | Marek Karpinski:
Approximating Bounded Degree Instances of NP-Hard Problems
Electronic Colloquium on Computational Complexity (ECCC) 8(42): (2001) |
| 148 | | Piotr Berman,
Sridhar Hannenhalli,
Marek Karpinski:
1.375-Approximation Algorithm for Sorting by Reversals
Electronic Colloquium on Computational Complexity (ECCC) 8(47): (2001) |
| 147 | | Piotr Berman,
Marek Karpinski:
Efficient Amplifiers and Bounded Degree Optimization
Electronic Colloquium on Computational Complexity (ECCC) 8(53): (2001) |
| 146 | | Uriel Feige,
Marek Karpinski,
Michael Langberg:
A note on approximating Max-Bisection on regular graphs.
Inf. Process. Lett. 79(4): 181-188 (2001) |
| 145 | | Farid M. Ablayev,
Marek Karpinski,
Rustam Mubarakzjanov:
On BPP versus NPcoNP for ordered read-once branching programs.
Theor. Comput. Sci. 264(1): 127-137 (2001) |
| 2000 |
|---|
| 144 | | Piotr Berman,
Moses Charikar,
Marek Karpinski:
On-Line Load Balancing for Related Machines
Electronic Colloquium on Computational Complexity (ECCC) 7(1): (2000) |
| 143 | | Uriel Feige,
Marek Karpinski,
Michael Langberg:
Improved Approximation of MAX-CUT on Graphs of Bounded Degree
Electronic Colloquium on Computational Complexity (ECCC) 7(21): (2000) |
| 142 | | Uriel Feige,
Marek Karpinski,
Michael Langberg:
A Note on Approximating MAX-BISECTION on Regular Graphs
Electronic Colloquium on Computational Complexity (ECCC) 7(43): (2000) |
| 141 | | Marek Karpinski,
Miroslaw Kowaluk,
Andrzej Lingas:
Approximation Algorithms for MAX-BISECTION on Low Degree Reg ular Graphs and Planar Graphs
Electronic Colloquium on Computational Complexity (ECCC) 7(51): (2000) |
| 140 | | Klaus Jansen,
Marek Karpinski,
Andrzej Lingas:
A Polynomial Time Approximation Scheme for MAX-BISECTION on Planar Graphs
Electronic Colloquium on Computational Complexity (ECCC) 7(64): (2000) |
| 139 | | Lars Engebretsen,
Marek Karpinski:
Approximation Hardness of TSP with Bounded Metrics
Electronic Colloquium on Computational Complexity (ECCC) 7(89): (2000) |
| 138 | | Cristina Bazgan,
Wenceslas Fernandez de la Vega,
Marek Karpinski:
Approximability of Dense Instances of NEAREST CODEWORD Problem
Electronic Colloquium on Computational Complexity (ECCC) 7(91): (2000) |
| 137 | | Piotr Berman,
Moses Charikar,
Marek Karpinski:
On-Line Load Balancing for Related Machines.
J. Algorithms 35(1): 108-121 (2000) |
| 136 | | Wenceslas Fernandez de la Vega,
Marek Karpinski:
Polynomial time approximation of dense weighted instances of MAX-CUT.
Random Struct. Algorithms 16(4): 314-332 (2000) |
| 135 | | Marek Karpinski,
Alfred J. van der Poorten,
Igor Shparlinski:
Zero testing of p-adic and modular polynomials.
Theor. Comput. Sci. 233(1-2): 309-317 (2000) |
| 1999 |
|---|
| 134 | | Marek Karpinski,
Igor Shparlinski:
On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials.
AAECC 1999: 492-497 |
| 133 | | Marek Karpinski:
Randomized Complexity of Linear Arrangements and Polyhedra.
FCT 1999: 1-12 |
| 132 | | Piotr Berman,
Marek Karpinski:
On Some Tighter Inapproximability Results (Extended Abstract).
ICALP 1999: 200-209 |
| 131 | | Andris Ambainis,
Richard F. Bonner,
Rusins Freivalds,
Marats Golovkins,
Marek Karpinski:
Quantum Finite Multitape Automata.
SOFSEM 1999: 340-348 |
| 130 | | Sergei Evdokimov,
Marek Karpinski,
Ilia N. Ponomarenko:
Compact cellular algebras and permutation groups.
Discrete Mathematics 197-198: 247-267 (1999) |
| 129 | | Marek Karpinski:
Randomized Complexity of Linear Arrangements and Polyhedra
Electronic Colloquium on Computational Complexity (ECCC) 6(20): (1999) |
| 128 | | Marek Karpinski,
Igor Shparlinski:
On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials
Electronic Colloquium on Computational Complexity (ECCC) 6(27): (1999) |
| 127 | | Marek Karpinski,
Rustam Mubarakzjanov:
A Note on Las Vegas OBDDs
Electronic Colloquium on Computational Complexity (ECCC) 6(9): (1999) |
| 126 | | Wenceslas Fernandez de la Vega,
Marek Karpinski:
On the Approximation Hardness of Dense TSP and Other Path Problems.
Inf. Process. Lett. 70(2): 53-55 (1999) |
| 125 | | Sanjeev Arora,
David R. Karger,
Marek Karpinski:
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems.
J. Comput. Syst. Sci. 58(1): 193-210 (1999) |
| 1998 |
|---|
| 124 | | Dima Grigoriev,
Marek Karpinski:
An Exponential Lower Bound for Depth 3 Arithmetic Circuits.
STOC 1998: 577-582 |
| 123 | | Dima Grigoriev,
Marek Karpinski,
Andrew Chi-Chih Yao:
An exponential lower bound on the size of algebraic decision trees for Max.
Computational Complexity 7(3): 193-203 (1998) |
| 122 | | Elias Dahlhaus,
Marek Karpinski:
Matching and Multidimensional Matching in Chordal and Strongly Chordal Graphs.
Discrete Applied Mathematics 84(1-3): 79-91 (1998) |
| 121 | | Farid M. Ablayev,
Marek Karpinski:
A Lower Bound for Integer Multiplication on Randomized Read-Once Branching Programs
Electronic Colloquium on Computational Complexity (ECCC) 5(11): (1998) |
| 120 | | Gunter Blache,
Marek Karpinski,
Juergen Wirtgen:
On Approximation Intractability of the Bandwidth Problem
Electronic Colloquium on Computational Complexity (ECCC) 5(14): (1998) |
| 119 | | Wenceslas Fernandez de la Vega,
Marek Karpinski:
On Approximation Hardness of Dense TSP and other Path Problems
Electronic Colloquium on Computational Complexity (ECCC) 5(24): (1998) |
| 118 | | Piotr Berman,
Marek Karpinski:
On Some Tighter Inapproximability Results
Electronic Colloquium on Computational Complexity (ECCC) 5(29): (1998) |
| 117 | | Marek Karpinski:
On the Computational Power of Randomized Branching Programs
Electronic Colloquium on Computational Complexity (ECCC) 5(38): (1998) |
| 116 | | Farid M. Ablayev,
Marek Karpinski:
On the Power of Randomized Ordered Branching Programs
Electronic Colloquium on Computational Complexity (ECCC) 5(4): (1998) |
| 115 | | Wenceslas Fernandez de la Vega,
Marek Karpinski:
Polynomial Time Approximation of Dense Weighted Instances of MAX-CUT
Electronic Colloquium on Computational Complexity (ECCC) 5(64): (1998) |
| 114 | | Piotr Berman,
Marek Karpinski:
On Some Tighter Inapproximability Results, Further Improvements
Electronic Colloquium on Computational Complexity (ECCC) 5(65): (1998) |
| 113 | | Marek Karpinski,
Wojciech Rytter:
On a Sublinear Time Parallel Construction of Optimal Binary Search Trees.
Parallel Processing Letters 8(3): 387-397 (1998) |
| 112 | | Mikael Goldmann,
Marek Karpinski:
Simulating Threshold Circuits by Majority Circuits.
SIAM J. Comput. 27(1): 230-246 (1998) |
| 111 | | Dima Grigoriev,
Marek Karpinski:
Computing the Additive Complexity of Algebraic Circuits with Root Extracting.
SIAM J. Comput. 27(3): 694-701 (1998) |
| 110 | | Marek Karpinski,
Wojciech Rytter:
Alphabet-Independent Optimal Parallel Search for Three-Dimensional Patterns.
Theor. Comput. Sci. 205(1-2): 243-260 (1998) |
| 1997 |
|---|
| 109 | | Andris Ambainis,
Kalvis Apsitis,
Cristian Calude,
Rusins Freivalds,
Marek Karpinski,
Tomas Larfeldt,
Iveta Sala,
Juris Smotrovs:
Effects of Kolmogorov Complexity Present in Inductive Inference as Well.
ALT 1997: 244-259 |
| 108 | | Piotr 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 |
| 107 | | Alexander L. Chistov,
Gábor Ivanyos,
Marek Karpinski:
Polynomial Time Algorithms for Modules over Finite Dimensional Algebras.
ISSAC 1997: 68-74 |
| 106 | | Marek Karpinski:
Polynominal Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems.
RANDOM 1997: 1-14 |
| 105 | | Andris Ambainis,
Rusins Freivalds,
Marek Karpinski:
Weak and Strong Recognition by 2-way Randomized Automata.
RANDOM 1997: 175-185 |
| 104 | | Dima Grigoriev,
Marek Karpinski:
Randomized Omega(n2) Lower Bound for Knapsack.
STOC 1997: 76-85 |
| 103 | | Marek Karpinski,
Angus Macintyre:
Approximating the Volume of General Pfaffian Bodies.
Structures in Logic and Computer Science 1997: 162-173 |
| 102 | | Piotr Berman,
Moses Charikar,
Marek Karpinski:
On-line Load Balancing for Related Machines.
WADS 1997: 116-125 |
| 101 | | Joachim von zur Gathen,
Marek Karpinski,
Igor Shparlinski:
Counting Curves and Their Projections.
Computational Complexity 6(1): 64-99 (1997) |
| 100 | | Dima Grigoriev,
Marek Karpinski,
Friedhelm Meyer auf der Heide,
Roman Smolensky:
A Lower Bound for Randomized Algebraic Decision Trees.
Computational Complexity 6(4): 357-375 (1997) |
| 99 | | Dima Grigoriev,
Marek Karpinski,
Roman Smolensky:
Randomization and the Computational Power of Analytic and Algebraic Decision Trees.
Computational Complexity 6(4): 376-388 (1997) |
| 98 | | Dima Grigoriev,
Marek Karpinski,
Nicolai Vorobjov:
Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision and Computation Trees.
Discrete & Computational Geometry 17(2): 191-215 (1997) |
| 97 | | Marek Karpinski,
Juergen Wirtgen,
Alexander Zelikovsky:
An Approximation Algorithm for the Bandwidth Problem on Dense Graphs
Electronic Colloquium on Computational Complexity (ECCC) 4(17): (1997) |
| 96 | | Marek Karpinski:
Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems
Electronic Colloquium on Computational Complexity (ECCC) 4(24): (1997) |
| 95 | | Marek Karpinski,
Alexander Zelikovsky:
Approximating Dense Cases of Covering Problems
Electronic Colloquium on Computational Complexity (ECCC) 4(4): (1997) |
| 94 | | Marek Karpinski,
Juergen Wirtgen:
On Approximation Hardness of the Bandwidth Problem
Electronic Colloquium on Computational Complexity (ECCC) 4(41): (1997) |
| 93 | | Marek Karpinski,
Alexander Zelikovsky:
New Approximation Algorithms for the Steiner Tree Problems.
J. Comb. Optim. 1(1): 47-65 (1997) |
| 92 | | Marek Karpinski,
Angus Macintyre:
Polynomial Bounds for VC Dimension of Sigmoidal and General Pfaffian Neural Networks.
J. Comput. Syst. Sci. 54(1): 169-176 (1997) |
| 91 | | Marek Karpinski,
Wojciech Rytter,
Ayumi Shinohara:
An Efficient Pattern-Matching Algorithm for Strings with Short Descriptions.
Nord. J. Comput. 4(2): 172-186 (1997) |
| 90 | | Marek Karpinski,
Lawrence L. Larmore,
Wojciech Rytter:
Correctness of Constructing Optimal Alphabetic Trees Revisited.
Theor. Comput. Sci. 180(1-2): 309-324 (1997) |
| 1996 |
|---|
| 89 | | Leszek Gasieniec,
Marek Karpinski,
Wojciech Plandowski,
Wojciech Rytter:
Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract).
CPM 1996: 39-49 |
| 88 | | Farid M. Ablayev,
Marek Karpinski:
On the Power of Randomized Branching Programs.
ICALP 1996: 348-356 |
| 87 | | Marek Karpinski,
Lawrence L. Larmore,
Wojciech Rytter:
Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees.
SODA 1996: 36-41 |
| 86 | | Dima Grigoriev,
Marek Karpinski,
Friedhelm Meyer auf der Heide,
Roman Smolensky:
A Lower Bound for Randomized Algebraic Decision Trees.
STOC 1996: 612-619 |
| 85 | | Leszek Gasieniec,
Marek Karpinski,
Wojciech Plandowski,
Wojciech Rytter:
Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract).
SWAT 1996: 392-403 |
| 84 | | Dima Grigoriev,
Marek Karpinski:
Randomized Omega(n2) Lower Bound for Knapsack
Electronic Colloquium on Computational Complexity (ECCC) 3(58): (1996) |
| 83 | | Dima Grigoriev,
Marek Karpinski,
Andrew M. Odlyzko:
Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann.
Fundam. Inform. 28(3-4): 297-301 (1996) |
| 82 | | Marek Karpinski,
Rutger Verbeek:
On Randomized versus Deterministic Computation.
Theor. Comput. Sci. 154(1): 23-39 (1996) |
| 81 | | Dima Grigoriev,
Marek Karpinski:
Computability of the Additive Complexity of Algebraic Circuits with Root Extracting.
Theor. Comput. Sci. 157(1): 91-99 (1996) |
| 80 | | Marek Karpinski,
Igor Shparlinski:
On Some Approximation Problems Concerning Sparse Polynomials over Finite Fields.
Theor. Comput. Sci. 157(2): 259-266 (1996) |
| 1995 |
|---|
| 79 | | Marek Karpinski,
Wojciech Rytter,
Ayumi Shinohara:
Pattern-Matching for Strings with Short Descriptions.
CPM 1995: 205-214 |
| 78 | | Marek Karpinski,
Angus Macintyre:
Bounding VC-dimension of neural networks: Progress and prospects.
EuroCOLT 1995: 337-341 |
| 77 | | Dima Grigoriev,
Marek Karpinski,
Nicolai Vorobjov:
Improved Lower Bound on Testing Membership to a Polyhedron by Algebraic Decision Trees.
FOCS 1995: 258-265 |
| 76 | | Rusins Freivalds,
Marek Karpinski:
Lower Time Bounds for Randomized Computation.
ICALP 1995: 183-195 |
| 75 | | Marek Karpinski,
Angus Macintyre:
Polynomial bounds for VC dimension of sigmoidal neural networks.
STOC 1995: 200-208 |
| 74 | | Sanjeev Arora,
David R. Karger,
Marek Karpinski:
Polynomial time approximation schemes for dense instances of NP-hard problems.
STOC 1995: 284-293 |
| 73 | | Felipe Cucker,
Marek Karpinski,
Pascal Koiran,
Thomas Lickteig,
Kai Werther:
On real Turing machines that toss coins.
STOC 1995: 335-342 |
| 72 | | Marek Karpinski,
Rutger Verbeek:
On Randomized Versus Deterministic Computation
Electronic Colloquium on Computational Complexity (ECCC) 2(21): (1995) |
| 71 | | Marek Karpinski,
Wojciech Rytter,
Ayumi Shinohara:
Pattern-Matching for Strings with Short Descriptions
Electronic Colloquium on Computational Complexity (ECCC) 2(22): (1995) |
| 70 | | Marek Karpinski,
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) |
| 69 | | Marek Karpinski,
Alexander Zelikovsky:
New Approximation Algorithms for the Steiner Tree Problems
Electronic Colloquium on Computational Complexity (ECCC) 2(30): (1995) |
| 68 | | Farid M. Ablayev,
Marek Karpinski:
On the Power of Randomized Branching Programs
Electronic Colloquium on Computational Complexity (ECCC) 2(54): (1995) |
| 67 | | Marek Karpinski,
Angus Macintyre:
VC Dimension of Sigmoidal and General Pfaffian Networks
Electronic Colloquium on Computational Complexity (ECCC) 2(55): (1995) |
| 66 | | Dima Grigoriev,
Marek Karpinski,
Andrew Chi-Chih Yao:
An Exponential Lower Bound on the Size of Algebraic Decision Trees for MAX
Electronic Colloquium on Computational Complexity (ECCC) 2(57): (1995) |
| 65 | | Dima Grigoriev,
Marek Karpinski,
Friedhelm Meyer auf der Heide,
Roman Smolensky:
A Lower Bound for Randomized Algebraic Decision Trees
Electronic Colloquium on Computational Complexity (ECCC) 2(63): (1995) |
| 64 | | Hans Kleine Büning,
Marek Karpinski,
Andreas Flögel:
Resolution for Quantified Boolean Formulas
Inf. Comput. 117(1): 12-18 (1995) |
| 1994 |
|---|
| 63 | | Rusins Freivalds,
Dace Gobleja,
Marek Karpinski,
Carl H. Smith:
Co-learnability and FIN-identifiability of Enumerable Classes of Total Recursive Functions.
AII/ALT 1994: 100-105 |
| 62 | | Rusins Freivalds,
Marek Karpinski,
Carl H. Smith:
Co-Learning of Total Recursive Functions.
COLT 1994: 190-197 |
| 61 | | Marek Karpinski,
Wojciech Rytter:
An Alphabet-Independent Optimal Parallel Search for Three Dimensional Pattern.
CPM 1994: 125-135 |
| 60 | | Piotr Berman,
Ulrich Fößmeier,
Marek Karpinski,
Michael Kaufmann,
Alexander Zelikovsky:
Approaching the 5/4-Approximation for Rectilinear Steiner Trees.
ESA 1994: 60-71 |
| 59 | | Rusins Freivalds,
Marek Karpinski:
Lower Space Bounds for Randomized Computation.
ICALP 1994: 580-592 |
| 58 | | Marek Karpinski,
Wojciech Rytter:
On a Sublinear Time Parallel Construction of Optimal Binary Search Trees.
MFCS 1994: 453-461 |
| 57 | | Dima Grigoriev,
Marek Karpinski,
Nicolai Vorobjov:
Lower bounds on testing membership to a polyhedron by algebraic decision trees.
STOC 1994: 635-644 |
| 56 | | Nader H. Bshouty,
Thomas R. Hancock,
Lisa Hellerstein,
Marek Karpinski:
An Algorithm to Learn Read-Once Threshold Formulas, and Transformations Between Learning Models.
Computational Complexity 4: 37-61 (1994) |
| 55 | | Marek Karpinski,
Angus Macintyre:
Polynomial Bounds for VC Dimension of Sigmoidal Neural Networks
Electronic Colloquium on Computational Complexity (ECCC) 1(24): (1994) |
| 54 | | Dima Grigoriev,
Marek Karpinski,
Michael F. Singer:
Computational Complexity of Sparse Rational Interpolation.
SIAM J. Comput. 23(1): 1-11 (1994) |
| 53 | | Elias Dahlhaus,
Marek Karpinski:
An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph.
Theor. Comput. Sci. 134(2): 493-528 (1994) |
| 1993 |
|---|
| 52 | | Dima Grigoriev,
Marek Karpinski:
A Zero-Test and an Interpolation Algorithm for the Shifted Sparse Polynominals.
AAECC 1993: 162-169 |
| 51 | | Marek Karpinski,
Rutger Verbeek:
On Randomized Versus Deterministic Computation.
ICALP 1993: 227-240 |
| 50 | | Mikael Goldmann,
Marek Karpinski:
Simulating threshold circuits by majority circuits.
STOC 1993: 551-560 |
| 49 | | Joachim von zur Gathen,
Marek Karpinski,
Igor Shparlinski:
Counting curves and their projections.
STOC 1993: 805-812 |
| 48 | | Dana Angluin,
Lisa Hellerstein,
Marek Karpinski:
Learning Read-Once Formulas with Queries.
J. ACM 40(1): 185-210 (1993) |
| 47 | | Marek Karpinski,
Michael Luby:
Approximating the Number of Zeroes of a GF[2] Polynomial.
J. Algorithms 14(2): 280-287 (1993) |
| 46 | | Elias Dahlhaus,
Péter Hajnal,
Marek Karpinski:
On the Parallel Complexity of Hamiltonian Cycle and Matching Problem on Dense Graphs.
J. Algorithms 15(3): 367-384 (1993) |
| 45 | | Peter Bürgisser,
Marek Karpinski,
Thomas Lickteig:
On Randomized Semi-algebraic Test Complexity.
J. Complexity 9(2): 231-251 (1993) |
| 44 | | Marek Karpinski,
Thorsten Werther:
VC Dimension and Uniform Learnability of Sparse Polynomials and Rational Functions.
SIAM J. Comput. 22(6): 1276-1285 (1993) |
| 1992 |
|---|
| 43 | | Dima Grigoriev,
Marek Karpinski,
Andrew M. Odlyzko:
Existence of Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis.
ISSAC 1992: 117-122 |
| 42 | | Elias Dahlhaus,
Marek Karpinski,
Pierre Kelsen:
An Efficient Parallel Algorithm for Computing a Maximal Independent Set in a Hypergraph of Dimension 3.
Inf. Process. Lett. 42(6): 309-313 (1992) |
| 41 | | Elias Dahlhaus,
Marek Karpinski:
Perfect Matching for Regular Graphs is AC°-Hard for the General Matching Problem.
J. Comput. Syst. Sci. 44(1): 94-102 (1992) |
| 1991 |
|---|
| 40 | | Marek Karpinski:
Approximation Algorithms for Counting Problems in Finite Fields.
FCT 1991: 45-46 |
| 39 | | Dima Grigoriev,
Marek Karpinski:
An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q]
FOCS 1991: 662-669 |
| 38 | | Dima Grigoriev,
Marek Karpinski:
Algorithms for Sparse Rational Interpolation.
ISSAC 1991: 7-13 |
| 37 | | Marek Karpinski,
Michael Luby:
Approximating the Number of Zeroes of a GF[2] Polynomial.
SODA 1991: 300-303 |
| 36 | | Peter Bürgisser,
Marek Karpinski,
Thomas Lickteig:
Some Computational Problems in Linear Algebra as Hard as Matrix Multiplication.
Computational Complexity 1: 131-155 (1991) |
| 35 | | Michael Clausen,
Andreas W. M. Dress,
Johannes Grabmeier,
Marek Karpinski:
On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials Over Finite Fields.
Theor. Comput. Sci. 84(2): 151-164 (1991) |
| 1990 |
|---|
| 34 | | Andreas Flögel,
Marek Karpinski,
Hans Kleine Büning:
Subclasses of Quantified Boolean Formulas.
CSL 1990: 145-155 |
| 33 | | Dima Grigoriev,
Marek Karpinski,
Michael F. Singer:
Interpolation of Sparse Rational Functions Without Knowing Bounds on Exponents
FOCS 1990: 840-846 |
| 32 | | Marek Karpinski,
Friedhelm Meyer auf der Heide:
On the Complexity of Genuinely Polynomial Computation.
MFCS 1990: 362-368 |
| 31 | | Elias Dahlhaus,
Marek Karpinski,
Mark B. Novick:
Fast Parallel Algorithms for the Clique Separator Decomposition.
SODA 1990: 244-251 |
| 30 | | Dima Grigoriev,
Marek Karpinski,
Michael F. Singer:
Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation over Finite Fields.
SIAM J. Comput. 19(6): 1059-1063 (1990) |
| 1989 |
|---|
| 29 | | Lisa Hellerstein,
Marek Karpinski:
Learning Read-Once Formulas Using Membership Queries.
COLT 1989: 146-161 |
| 28 | | Elias Dahlhaus,
Marek Karpinski:
An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph (Extended Abstract)
FOCS 1989: 454-459 |
| 27 | | Andrzej Lingas,
Marek Karpinski:
Subtree Isomorphism is NC Reducible to Bipartite Perfect Matching.
Inf. Process. Lett. 30(1): 27-32 (1989) |
| 1988 |
|---|
| 26 | | Marek Karpinski:
Boolean Complexity of Algebraic Interpolation Problems.
CSL 1988: 138-147 |
| 25 | | Elias Dahlhaus,
Péter Hajnal,
Marek Karpinski:
Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs
FOCS 1988: 186-193 |
| 24 | | Marek Karpinski,
Zbigniew W. Ras:
Learning Machine for Probabilistically Describable Concepts.
ISMIS 1988: 353-362 |
| 23 | | Elias Dahlhaus,
Marek Karpinski:
A Fast Parallel Algorithm for Computing all Maximal Cliques in a Graph and the Related Problems (Extended Abstract).
SWAT 1988: 139-144 |
| 22 | | Elias Dahlhaus,
Marek Karpinski:
Parallel Construction of Perfect Matchings and Hamiltonian Cycles on Dense Graphs.
Theor. Comput. Sci. 61: 121-136 (1988) |
| 1987 |
|---|
| 21 | | Marek Karpinski,
Hans Kleine Büning,
Peter H. Schmitt:
On the Computational Complexity of Quantified Horn Clauses.
CSL 1987: 129-137 |
| 20 | | Marek Karpinski,
Rutger Verbeek:
Randomness, Provability, and the Seperation of Monte Carlo Time and Space.
Computation Theory and Logic 1987: 189-207 |
| 19 | | Dima Grigoriev,
Marek Karpinski:
The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents Is in NC (Extended Abstract)
FOCS 1987: 166-172 |
| 18 | | Marek Karpinski,
Rutger Verbeek:
On the Monte Carlo Space Constructible Functions and Seperation Results for Probabilistic Complexity Classes
Inf. Comput. 75(2): 178-189 (1987) |
| 1986 |
|---|
| 17 | | Marek Karpinski,
Rutger Verbeek:
On the Power of Two-Way Random Generators and the Impossibility of Deterministic Poly-Space Simulation
Information and Control 71(1/2): 131-142 (1986) |
| 1985 |
|---|
| 16 | | Marek Karpinski,
Jan van Leeuwen:
Preface
Information and Control 64(1-3): 1 (1985) |
| 15 | | Marek Karpinski,
Rutger Verbeek:
There Is No Polynomial Deterministic Space Simulation of Probabilistic Space with a Two-Way Random-Tape Generator
Information and Control 67(1-3): 158-162 (1985) |
| 1983 |
|---|
| 14 | | Marek Karpinski:
Fundamentals of Computation Theory, Proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21-27, 1983
Springer 1983 |
| 1982 |
|---|
| 13 | | Marek Karpinski:
Decidability of "Skolem Matrix Emptiness Problem" Entails Constructability of Exact Regular Expression.
Theor. Comput. Sci. 17: 99-102 (1982) |
| 1980 |
|---|
| 12 | | Marek Karpinski:
On global word definability and constructively definable sets in Nn.
CLAAP 1980: 225-227 |
| 1979 |
|---|
| 11 | | Ryszard Danecki,
Marek Karpinski:
Decidability Results on Plane Automata Searching Mazes.
FCT 1979: 84-91 |
| 1977 |
|---|
| 10 | | Marek Karpinski:
Fundamentals of Computation Theory, Proceedings of the 1977 International FCT-Conference, Poznan-Kórnik, Poland, September 19-23, 1977
Springer 1977 |
| 9 | | Marek Karpinski:
The Equivalences Problems for Binary EOL-Systems are Decidable.
FCT 1977: 423-434 |
| 1976 |
|---|
| 8 | | Marek Karpinski:
Multiplicity Functions on Omega-Automata.
MFCS 1976: 596-601 |
| 7 | | Marek Karpinski:
Valued Probabilistic Tree Functions.
Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys. 24: 927-930 (1976) |
| 1975 |
|---|
| 6 | | Marek Karpinski:
Decision Algorithms for Havel's Branching Automata.
MFCS 1975: 273-279 |
| 1974 |
|---|
| 5 | | Marek Karpinski:
Stretching by Probabilistic Tree Automata and Santos Grammars.
MFCS 1974: 249-255 |
| 4 | | Marek Karpinski:
Probablistic Climbing and Sinking Languages.
Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys. 22: 1057-1062 (1974) |
| 3 | | Marek Karpinski:
Free Structure Tree Automata IV.
Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys. 22: 87-91 (1974) |
| 1973 |
|---|
| 2 | | Marek Karpinski:
Free Structure Tree Automata, II: Nondeterminstic and Deterministic Regularity.
Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys. 21(5): 447-450 (1973) |
| 1 | | Marek Karpinski:
Free Structure Tree Automata, III: Normalized Climbing Automata.
Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom. Phys. 21(6): 567-572 (1973) |
