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

Marek Karpinski Vis

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

*2009
243EEMarek Karpinski, Yakov Nekrich: Space Efficient Multi-dimensional Range Reporting. COCOON 2009: 215-224
242EETravis Gagie, Marek Karpinski, Yakov Nekrich: Low-Memory Adaptive Prefix Coding. DCC 2009: 13-22
241EEMarek Karpinski, Warren Schudy: Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems. STOC 2009: 313-322
240EEPiotr Berman, Bhaskar DasGupta, Marek Karpinski: Approximating Transitive Reductions for Directed Networks. WADS 2009: 74-85
239EEPiotr Berman, Marek Karpinski, Alexander Zelikovsky: 1.25-Approximation Algorithm for Steiner Tree Problem with Distances 1 and 2. WADS 2009: 86-97
238EEMarek Karpinski, Yakov Nekrich: A Fast Algorithm for Adaptive Prefix Coding. Algorithmica 55(1): 29-41 (2009)
237EEPiotr Berman, Marek Karpinski, Andrzej Lingas: Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems with Applications CoRR abs/0904.2310: (2009)
236EEGá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
234EEGábor Ivanyos, Marek Karpinski, Nitin Saxena: Schemes for Deterministic Polynomial Factoring CoRR abs/0804.1974: (2008)
233EEMarek Karpinski, Yakov Nekrich: Searching for Frequent Colors in Rectangles CoRR abs/0805.1348: (2008)
232EELeslie Ann Goldberg, Mark Jerrum, Marek Karpinski: The Mixing Time of Glauber Dynamics for Colouring Regular Trees CoRR abs/0806.0921: (2008)
231EEMarek Karpinski, Yakov Nekrich: Space-Efficient Multi-Dimensional Range Reporting CoRR abs/0806.4361: (2008)
230EEPiotr Berman, Bhaskar DasGupta, Marek Karpinski: Approximating Transitivity in Directed Networks CoRR abs/0809.0188: (2008)
229EEPiotr Berman, Marek Karpinski, Alexander Zelikovsky: 1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two CoRR abs/0810.1851: (2008)
228EEGá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)
227EEMarek Karpinski, Warren Schudy: Linear Time Approximation Schemes for the Gale-Berlekamp Game and Related Minimization Problems CoRR abs/0811.3244: (2008)
226EETravis Gagie, Marek Karpinski, Yakov Nekrich: Low-Memory Adaptive Prefix Coding CoRR abs/0811.3602: (2008)
225EEPiotr 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)
224EEGábor Ivanyos, Marek Karpinski, Nitin Saxena: Schemes for Deterministic Polynomial Factoring. Electronic Colloquium on Computational Complexity (ECCC) 15(043): (2008)
223EEPiotr 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)
222EEGá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)
221EEMarek 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)
220EEMagnus 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
219EEPiotr Berman, Marek Karpinski, Alexander D. Scott: Computational complexity of some restricted instances of 3-SAT. Discrete Applied Mathematics 155(5): 649-653 (2007)
218EEPiotr Berman, Bhaskar DasGupta, Marek Karpinski: Approximating Transitive Reductions for Directed Networks. Electronic Colloquium on Computational Complexity (ECCC) 14(119): (2007)
217EEAnnette 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)
216EEPiotr Berman, Marek Karpinski, Yakov Nekrich: Approximating Huffman codes in parallel. J. Discrete Algorithms 5(3): 479-490 (2007)
215EEPiotr Berman, Marek Karpinski, Yakov Nekrich: Optimal trade-off for Merkle tree traversal. Theor. Comput. Sci. 372(1): 26-36 (2007)
2006
214EEMagnus Bordewich, Martin E. Dyer, Marek Karpinski: Stopping Times, Metrics and Approximate Counting. ICALP (1) 2006: 108-119
213EEPiotr Berman, Marek Karpinski: 8/7-approximation algorithm for (1, 2)-TSP. SODA 2006: 641-648
212EEWenceslas Fernandez de la Vega, Marek Karpinski: Approximation Complexity of Nondense Instances of MAX-CUT. Electronic Colloquium on Computational Complexity (ECCC) 13(101): (2006)
211EEWenceslas Fernandez de la Vega, Marek Karpinski: On the Sample Complexity of MAX-CUT. Electronic Colloquium on Computational Complexity (ECCC) 13(104): (2006)
210EEWenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski: Approximation of Global MAX-CSP Problems. Electronic Colloquium on Computational Complexity (ECCC) 13(124): (2006)
209EEWenceslas 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)
208EELars Engebretsen, Marek Karpinski: TSP with bounded metrics. J. Comput. Syst. Sci. 72(4): 509-546 (2006)
207EEMarek Karpinski, Yakov Nekrich: Algorithms for Construction of Optimal and Almost-optimal Length-restricted Codes. Parallel Processing Letters 16(1): 81-92 (2006)
2005
206EEMarek Karpinski, Yakov Nekrich: Algorithms for Construction of Optimal and Almost-Optimal Length-Restricted Codes. DCC 2005: 464
205EEMarek Karpinski, Yakov Nekrich: Predecessor Queries in Constant Time?. ESA 2005: 238-248
204EEMagnus 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
202EEAnnette 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
201EECristina Bazgan, Marek Karpinski: On the Complexity of Global Constraint Satisfaction. ISAAC 2005: 624-633
200EEWenceslas Fernandez de la Vega, Marek Karpinski, Ravi Kannan, Santosh Vempala: Tensor decomposition and approximation schemes for constraint satisfaction problems. STOC 2005: 747-754
199EEMarek 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)
198EEMagnus 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)
197EEPiotr Berman, Marek Karpinski: 8/7-Approximation Algorithm for (1,2)-TSP Electronic Colloquium on Computational Complexity (ECCC)(069): (2005)
196EEMagnus Bordewich, Martin E. Dyer, Marek Karpinski: Metric Construction, Stopping Times and Path Coupling. Electronic Colloquium on Computational Complexity (ECCC)(151): (2005)
195EEFarid 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)
194EEKlaus 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
193EEWenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon: Approximation schemes for Metric Bisection and partitioning. SODA 2004: 506-515
192EEPiotr Berman, Marek Karpinski, Yakov Nekrich: Optimal Trade-Off for Merkle Tree Traversal Electronic Colloquium on Computational Complexity (ECCC)(049): (2004)
191EEPiotr Berman, Marek Karpinski, Alexander D. Scott: Computational Complexity of Some Restricted Instances of 3SAT Electronic Colloquium on Computational Complexity (ECCC)(111): (2004)
190EEMarek Karpinski, Yakov Nekrich: A Note on Traversing Skew Merkle Trees Electronic Colloquium on Computational Complexity (ECCC)(118): (2004)
189EEMarek Karpinski, Miroslaw Kowaluk, Andrzej Lingas: Approximation Algorithms for MAX-BISECTION on Low Degree Regular Graphs. Fundam. Inform. 62(3-4): 369-375 (2004)
188EEMarek 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
187EEWenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, Yuval Rabani: Approximation schemes for clustering problems. STOC 2003: 50-58
186EEMarek Karpinski, Ion I. Mandoiu, Alexander Olshevsky, Alexander Zelikovsky: Improved Approximation Algorithms for the Quality of Service Steiner Tree Problem. WADS 2003: 401-411
185EEPiotr Berman, Marek Karpinski: Improved Approximation Lower Bounds on Small Occurrence Optimization Electronic Colloquium on Computational Complexity (ECCC) 10(008): (2003)
184EEPiotr 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)
183EEPiotr Berman, Marek Karpinski, Alex D. Scott: Approximation Hardness of Short Symmetric Instances of MAX-3SAT Electronic Colloquium on Computational Complexity (ECCC)(049): (2003)
182EEPiotr Berman, Marek Karpinski: Approximability of Hypergraph Minimum Bisection Electronic Colloquium on Computational Complexity (ECCC)(056): (2003)
181EEFarid M. Ablayev, Marek Karpinski: A lower bound for integer multiplication on randomized ordered read-once branching programs. Inf. Comput. 186(1): 78-89 (2003)
180EENoga 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)
179EECristina 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
178EEPiotr Berman, Sridhar Hannenhalli, Marek Karpinski: 1.375-Approximation Algorithm for Sorting by Reversals. ESA 2002: 200-210
177EEPiotr Berman, Marek Karpinski: Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION. ICALP 2002: 623-632
176EEPiotr Berman, Marek Karpinski, Yakov Nekrich: Approximating Huffman Codes in Parallel. ICALP 2002: 845-855
175EEMarek Karpinski: Approximability of the Minimum Bisection Problem: An Algorithmic Challenge. MFCS 2002: 59-67
174EEPiotr Berman, Marek Karpinski: Approximating minimum unsatisfiability of linear equations. SODA 2002: 514-516
173EEBéla Csaba, Marek Karpinski, Piotr Krysta: Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems. SODA 2002: 74-83
172EENoga Alon, Wenceslas Fernandez de la Vega, Ravi Kannan, Marek Karpinski: Random sampling and approximation of MAX-CSP problems. STOC 2002: 232-239
171EECristina Bazgan, Wenceslas Fernandez de la Vega, Marek Karpinski: Approximability of Dense Instances of NEAREST CODEWORD Problem. SWAT 2002: 298-307
170EEPiotr Berman, Marek Karpinski, Yakov Nekrich: Approximating Huffman Codes in Parallel Electronic Colloquium on Computational Complexity (ECCC)(018): (2002)
169EEWenceslas 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)
168EEMarek Karpinski, Yakov Nekrich: Parallel Construction of Minimum Redundancy Length-Limited Codes Electronic Colloquium on Computational Complexity (ECCC)(029): (2002)
167EEWenceslas 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)
166EEWenceslas Fernandez de la Vega, Marek Karpinski: A Polynomial Time Approximation Scheme for Subdense MAX-CUT Electronic Colloquium on Computational Complexity (ECCC)(044): (2002)
165EEMarek Karpinski: On Approximability of Minimum Bisection Problem Electronic Colloquium on Computational Complexity (ECCC)(046): (2002)
164EEWenceslas Fernandez de la Vega, Marek Karpinski: 9/8-Approximation Algorithm for Random MAX-3SAT Electronic Colloquium on Computational Complexity (ECCC)(070): (2002)
163EERusins Freivalds, Marek Karpinski, Carl H. Smith, Rolf Wiehagen: Learning by the Process of Elimination. Inf. Comput. 176(1): 37-50 (2002)
162EESusanne Albers, Marek Karpinski: Randomized splay trees: Theoretical and experimental results. Inf. Process. Lett. 81(4): 213-221 (2002)
161EEUriel Feige, Marek Karpinski, Michael Langberg: Improved approximation of Max-Cut on graphs of bounded degree. J. Algorithms 43(2): 201-219 (2002)
160EEPiotr 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
159EEMarek Karpinski: Approximating Bounded Degree Instances of NP-Hard Problems. FCT 2001: 24-34
158EEFarid M. Ablayev, Aida Gainutdinova, Marek Karpinski: On Computational Power of Quantum Branching Programs. FCT 2001: 59-70
157EELars Engebretsen, Marek Karpinski: Approximation Hardness of TSP with Bounded Metrics. ICALP 2001: 201-212
156EEKlaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel: Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. STACS 2001: 365-375
155EEMarek Karpinski: Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems. Algorithmica 30(3): 386-397 (2001)
154EEPiotr Berman, Marek Karpinski: Improved Approximations for General Minimum Cost Scheduling Electronic Colloquium on Computational Complexity (ECCC)(097): (2001)
153EENoga 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)
152EEPiotr Berman, Marek Karpinski: Approximating Minimum Unsatisfiability of Linear Equations Electronic Colloquium on Computational Complexity (ECCC) 8(25): (2001)
151EEPiotr Berman, Marek Karpinski: Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION Electronic Colloquium on Computational Complexity (ECCC) 8(26): (2001)
150EECristina 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)
149EEMarek Karpinski: Approximating Bounded Degree Instances of NP-Hard Problems Electronic Colloquium on Computational Complexity (ECCC) 8(42): (2001)
148EEPiotr Berman, Sridhar Hannenhalli, Marek Karpinski: 1.375-Approximation Algorithm for Sorting by Reversals Electronic Colloquium on Computational Complexity (ECCC) 8(47): (2001)
147EEPiotr Berman, Marek Karpinski: Efficient Amplifiers and Bounded Degree Optimization Electronic Colloquium on Computational Complexity (ECCC) 8(53): (2001)
146EEUriel Feige, Marek Karpinski, Michael Langberg: A note on approximating Max-Bisection on regular graphs. Inf. Process. Lett. 79(4): 181-188 (2001)
145EEFarid 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
144EEPiotr Berman, Moses Charikar, Marek Karpinski: On-Line Load Balancing for Related Machines Electronic Colloquium on Computational Complexity (ECCC) 7(1): (2000)
143EEUriel Feige, Marek Karpinski, Michael Langberg: Improved Approximation of MAX-CUT on Graphs of Bounded Degree Electronic Colloquium on Computational Complexity (ECCC) 7(21): (2000)
142EEUriel Feige, Marek Karpinski, Michael Langberg: A Note on Approximating MAX-BISECTION on Regular Graphs Electronic Colloquium on Computational Complexity (ECCC) 7(43): (2000)
141EEMarek 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)
140EEKlaus 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)
139EELars Engebretsen, Marek Karpinski: Approximation Hardness of TSP with Bounded Metrics Electronic Colloquium on Computational Complexity (ECCC) 7(89): (2000)
138EECristina 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)
135EEMarek 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
134EEMarek Karpinski, Igor Shparlinski: On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials. AAECC 1999: 492-497
133EEMarek Karpinski: Randomized Complexity of Linear Arrangements and Polyhedra. FCT 1999: 1-12
132EEPiotr Berman, Marek Karpinski: On Some Tighter Inapproximability Results (Extended Abstract). ICALP 1999: 200-209
131EEAndris Ambainis, Richard F. Bonner, Rusins Freivalds, Marats Golovkins, Marek Karpinski: Quantum Finite Multitape Automata. SOFSEM 1999: 340-348
130EESergei Evdokimov, Marek Karpinski, Ilia N. Ponomarenko: Compact cellular algebras and permutation groups. Discrete Mathematics 197-198: 247-267 (1999)
129EEMarek Karpinski: Randomized Complexity of Linear Arrangements and Polyhedra Electronic Colloquium on Computational Complexity (ECCC) 6(20): (1999)
128EEMarek Karpinski, Igor Shparlinski: On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials Electronic Colloquium on Computational Complexity (ECCC) 6(27): (1999)
127EEMarek Karpinski, Rustam Mubarakzjanov: A Note on Las Vegas OBDDs Electronic Colloquium on Computational Complexity (ECCC) 6(9): (1999)
126EEWenceslas 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
124EEDima Grigoriev, Marek Karpinski: An Exponential Lower Bound for Depth 3 Arithmetic Circuits. STOC 1998: 577-582
123EEDima 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)
122EEElias Dahlhaus, Marek Karpinski: Matching and Multidimensional Matching in Chordal and Strongly Chordal Graphs. Discrete Applied Mathematics 84(1-3): 79-91 (1998)
121EEFarid 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)
120EEGunter Blache, Marek Karpinski, Juergen Wirtgen: On Approximation Intractability of the Bandwidth Problem Electronic Colloquium on Computational Complexity (ECCC) 5(14): (1998)
119EEWenceslas 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)
118EEPiotr Berman, Marek Karpinski: On Some Tighter Inapproximability Results Electronic Colloquium on Computational Complexity (ECCC) 5(29): (1998)
117EEMarek Karpinski: On the Computational Power of Randomized Branching Programs Electronic Colloquium on Computational Complexity (ECCC) 5(38): (1998)
116EEFarid M. Ablayev, Marek Karpinski: On the Power of Randomized Ordered Branching Programs Electronic Colloquium on Computational Complexity (ECCC) 5(4): (1998)
115EEWenceslas 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)
114EEPiotr 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)
110EEMarek 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
104EEDima 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)
98EEDima 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)
97EEMarek Karpinski, Juergen Wirtgen, Alexander Zelikovsky: An Approximation Algorithm for the Bandwidth Problem on Dense Graphs Electronic Colloquium on Computational Complexity (ECCC) 4(17): (1997)
96EEMarek Karpinski: Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems Electronic Colloquium on Computational Complexity (ECCC) 4(24): (1997)
95EEMarek Karpinski, Alexander Zelikovsky: Approximating Dense Cases of Covering Problems Electronic Colloquium on Computational Complexity (ECCC) 4(4): (1997)
94EEMarek 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)
90EEMarek 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
88EEFarid 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
86EEDima Grigoriev, Marek Karpinski, Friedhelm Meyer auf der Heide, Roman Smolensky: A Lower Bound for Randomized Algebraic Decision Trees. STOC 1996: 612-619
85EELeszek Gasieniec, Marek Karpinski, Wojciech Plandowski, Wojciech Rytter: Efficient Algorithms for Lempel-Zip Encoding (Extended Abstract). SWAT 1996: 392-403
84EEDima 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)
82EEMarek Karpinski, Rutger Verbeek: On Randomized versus Deterministic Computation. Theor. Comput. Sci. 154(1): 23-39 (1996)
81EEDima Grigoriev, Marek Karpinski: Computability of the Additive Complexity of Algebraic Circuits with Root Extracting. Theor. Comput. Sci. 157(1): 91-99 (1996)
80EEMarek 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
76EERusins Freivalds, Marek Karpinski: Lower Time Bounds for Randomized Computation. ICALP 1995: 183-195
75EEMarek Karpinski, Angus Macintyre: Polynomial bounds for VC dimension of sigmoidal neural networks. STOC 1995: 200-208
74EESanjeev Arora, David R. Karger, Marek Karpinski: Polynomial time approximation schemes for dense instances of NP-hard problems. STOC 1995: 284-293
73EEFelipe Cucker, Marek Karpinski, Pascal Koiran, Thomas Lickteig, Kai Werther: On real Turing machines that toss coins. STOC 1995: 335-342
72EEMarek Karpinski, Rutger Verbeek: On Randomized Versus Deterministic Computation Electronic Colloquium on Computational Complexity (ECCC) 2(21): (1995)
71EEMarek Karpinski, Wojciech Rytter, Ayumi Shinohara: Pattern-Matching for Strings with Short Descriptions Electronic Colloquium on Computational Complexity (ECCC) 2(22): (1995)
70EEMarek 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)
69EEMarek Karpinski, Alexander Zelikovsky: New Approximation Algorithms for the Steiner Tree Problems Electronic Colloquium on Computational Complexity (ECCC) 2(30): (1995)
68EEFarid M. Ablayev, Marek Karpinski: On the Power of Randomized Branching Programs Electronic Colloquium on Computational Complexity (ECCC) 2(54): (1995)
67EEMarek Karpinski, Angus Macintyre: VC Dimension of Sigmoidal and General Pfaffian Networks Electronic Colloquium on Computational Complexity (ECCC) 2(55): (1995)
66EEDima 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)
65EEDima 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
62EERusins 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
60EEPiotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky: Approaching the 5/4-Approximation for Rectilinear Steiner Trees. ESA 1994: 60-71
59EERusins Freivalds, Marek Karpinski: Lower Space Bounds for Randomized Computation. ICALP 1994: 580-592
58EEMarek Karpinski, Wojciech Rytter: On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. MFCS 1994: 453-461
57EEDima 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)
55EEMarek 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
52EEDima Grigoriev, Marek Karpinski: A Zero-Test and an Interpolation Algorithm for the Shifted Sparse Polynominals. AAECC 1993: 162-169
51EEMarek Karpinski, Rutger Verbeek: On Randomized Versus Deterministic Computation. ICALP 1993: 227-240
50EEMikael Goldmann, Marek Karpinski: Simulating threshold circuits by majority circuits. STOC 1993: 551-560
49EEJoachim von zur Gathen, Marek Karpinski, Igor Shparlinski: Counting curves and their projections. STOC 1993: 805-812
48EEDana 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)
45EEPeter 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
43EEDima 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
38EEDima 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
34EEAndreas 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
32EEMarek 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
29EELisa 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
26EEMarek 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
23EEElias 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
21EEMarek 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
8EEMarek 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
6EEMarek Karpinski: Decision Algorithms for Havel's Branching Automata. MFCS 1975: 273-279
1974
5EEMarek 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)

Coauthor Index

1Farid M. Ablayev [68] [88] [116] [121] [145] [158] [181] [195]
2Susanne Albers [162]
3Noga Alon [153] [172] [180]
4Andris Ambainis [105] [109] [131]
5Dana Angluin [48]
6Kalvis Apsitis [109]
7Sanjeev Arora [74] [125]
8Cristina Bazgan [138] [150] [171] [179] [201]
9Piotr Berman [60] [102] [108] [114] [118] [132] [137] [144] [147] [148] [151] [152] [154] [160] [170] [174] [176] [177] [178] [182] [183] [184] [185] [191] [192] [197] [213] [215] [216] [218] [219] [223] [225] [229] [230] [237] [239] [240]
10Gunter Blache [120]
11Richard F. Bonner [131]
12Magnus Bordewich [196] [198] [204] [214] [220]
13Nader H. Bshouty [56]
14Hans Kleine Büning [21] [34] [64]
15Peter Bürgisser [36] [45]
16Cristian S. Calude (Cristian Calude) [109]
17Moses Charikar [102] [137] [144]
18Alexander L. Chistov [107]
19Michael Clausen [35]
20Béla Csaba [173]
21Felipe Cucker [73]
22Elias Dahlhaus [22] [23] [25] [28] [31] [41] [42] [46] [53] [122]
23Ryszard Danecki [11]
24Bhaskar DasGupta [218] [230] [240]
25Andreas W. M. Dress [35]
26Martin E. Dyer [196] [198] [204] [214] [220]
27Annette Ebbers-Baumann [202] [217]
28Lars Engebretsen [139] [157] [208]
29Sergei Evdokimov [130]
30Uriel Feige [142] [143] [146] [161]
31Andreas Flögel [34] [64]
32Ulrich Fößmeier [60]
33Rusins Freivalds [59] [62] [63] [76] [105] [109] [131] [163]
34Travis Gagie [226] [242]
35Aida Gainutdinova [158] [195]
36Leszek Gasieniec [85] [89]
37Joachim von zur Gathen [49] [101]
38Dace Gobleja [63]
39Leslie Ann Goldberg [232]
40Mikael Goldmann [50] [112]
41Marats Golovkins [131]
42Johannes Grabmeier [35]
43Dima Grigoriev [19] [30] [33] [38] [39] [43] [52] [54] [57] [65] [66] [77] [81] [83] [84] [86] [98] [99] [100] [104] [111] [123] [124]
44Ansgar Grüne [202] [217]
45Péter Hajnal [25] [46]
46Thomas R. Hancock [56]
47Sridhar Hannenhalli [148] [178]
48Friedhelm Meyer auf der Heide [32] [65] [86] [100]
49Lisa Hellerstein [29] [48] [56]
50Gábor Ivanyos [107] [222] [224] [228] [234] [236]
51Klaus Jansen [140] [156] [194]
52Mark Jerrum [232]
53Ravi Kannan (Ravindran Kannan) [153] [172] [180] [200] [210]
54David R. Karger [74] [125]
55Michael Kaufmann [60]
56Pierre Kelsen [42]
57Rolf Klein [202] [217]
58Christian Knauer [202] [217]
59Pascal Koiran [73]
60Miroslaw Kowaluk [141] [189]
61Piotr Krysta [173]
62Michael Langberg [142] [143] [146] [161]
63Tomas Larfeldt [109]
64Lawrence L. Larmore [87] [90] [108] [160] [188]
65Jan van Leeuwen [16]
66Thomas Lickteig [36] [45] [73]
67Andrzej Lingas [27] [140] [141] [156] [189] [194] [202] [217] [237]
68Michael Luby [37] [47]
69Angus Macintyre [55] [67] [75] [78] [92] [103]
70Ion I. Mandoiu [186] [199]
71Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu) [167] [169] [187] [193]
72Cristopher Moore [195]
73Rustam Mubarakzjanov [127] [145]
74Yakov Nekrich [168] [170] [176] [188] [190] [192] [203] [205] [206] [207] [215] [216] [226] [231] [233] [235] [238] [242] [243]
75Mark B. Novick [31]
76Andrew M. Odlyzko [43] [83]
77Alexander Olshevsky [186] [199]
78Wojciech Plandowski [85] [89] [108] [160]
79Chris Pollett [195]
80Ilia N. Ponomarenko [130]
81Alfred J. van der Poorten [135]
82Yuval Rabani [169] [187]
83Zbigniew W. Ras [24]
84Lajos Rónyai [222] [228]
85Wojciech Rytter [58] [61] [71] [79] [85] [87] [89] [90] [91] [108] [110] [113] [160]
86Iveta Sala [109]
87Nitin Saxena [222] [224] [228] [234] [236]
88Peter H. Schmitt [21]
89Warren Schudy [221] [227] [241]
90Alex D. Scott (Alexander D. Scott) [183] [184] [191] [219]
91Eike Seidel [156] [194]
92Ayumi Shinohara [71] [79] [91]
93Igor Shparlinski [49] [80] [101] [128] [134] [135]
94Michael F. Singer [30] [33] [54]
95Carl H. Smith [62] [63] [163]
96Roman Smolensky [65] [86] [99] [100]
97Juris Smotrovs [109]
98Wenceslas Fernandez de la Vega [115] [119] [126] [136] [138] [150] [153] [164] [166] [167] [169] [171] [172] [179] [180] [187] [193] [200] [209] [210] [211] [212]
99Santosh Vempala [200]
100Rutger Verbeek [15] [17] [18] [20] [51] [72] [82]
101Nicolai Vorobjov [57] [77] [98]
102Kai Werther [73]
103Thorsten Werther [44]
104Rolf Wiehagen [163]
105Juergen Wirtgen [94] [97] [120]
106Andrew Chi-Chih Yao [66] [123]
107Alexander Zelikovsky [60] [69] [70] [93] [95] [97] [186] [199] [223] [225] [229] [239]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)