WorldCat Identities

Karpiński, Marek 1948-

Overview
Works: 150 works in 326 publications in 2 languages and 2,267 library holdings
Genres: Conference papers and proceedings 
Roles: Author, Editor, Other, Creator, Collector
Classifications: QA267, 001.642
Publication Timeline
.
Most widely held works by Marek Karpiński
Foundations of computation theory : proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21-27, 1983 by Marek Karpiński( Book )

29 editions published between 1983 and 2007 in English and German and held by 522 WorldCat member libraries worldwide

Fundamentals of computation theory : proceedings of the 1977 International FCT-Conference, Poznán-Kórnik, Poland, September 19-23, 1977 by Marek Karpiński( Book )

10 editions published between 1977 and 1978 in English and held by 430 WorldCat member libraries worldwide

Topics in the theory of computation : selected papers of the International Conference on "Foundations of Computation Theory", FCT '83, Borgholm, Sweden, August 21-27, 1983 by M Karpinski( Book )

8 editions published between 1984 and 1985 in English and Undetermined and held by 414 WorldCat member libraries worldwide

This volume contains nine selected papers presented at the Borgholm conference. They were chosen on the basis of their immediate relevance to the most fundamental aspects of the theory of computation and the newest developments in this area. These papers, which have been extended and refereed, fall into eight categories: 1. Constructive Mathematics in Models of Computation and Programming; 2. Abstract Calculi and Denotational Semantics; 3. Theory of Machines, Computations and Languages; 4. Nondeterminism, Concurrency and Distributed Computing; 5. Abstract Algebras, Logics and Combinatorics in Computation Theory; 6. General Computability and Decidability; 7. Computational and Arithmetic Complexity; 8. Analysis of Algorithms and Feasible Computing
Fast parallel algorithms for graph matching problems by Marek Karpiński( Book )

8 editions published in 1998 in English and held by 234 WorldCat member libraries worldwide

The ultimate equivalence of iterated homomorphisms is recursively unsolvable by Marek Karpiński( Book )

6 editions published in 1980 in English and German and held by 32 WorldCat member libraries worldwide

Restricted principles of computing processes (PCP) and equations in free semigroups : informal workshop, May 27, 1980( Book )

4 editions published in 1981 in English and German and held by 31 WorldCat member libraries worldwide

Topics in the theory of computation selected papers of the International Conference on "Foundations of Computation Theory", FCT '83, Borgholm, Sweden, August 21-27, 1983 by International FCT-Conference( )

1 edition published in 1985 in English and held by 27 WorldCat member libraries worldwide

Inapproximability of dominating set in power law graphs by Mikael Gast( )

5 editions published between 2012 and 2015 in English and held by 15 WorldCat member libraries worldwide

Approximate counting of matchings in sparse hypergraphs by Marek Karpiński( )

3 editions published in 2012 in English and held by 12 WorldCat member libraries worldwide

Tight approximation bounds for vertex cover on dense k-partite hypergraphs by Marek Karpiński( )

2 editions published in 2011 in English and held by 12 WorldCat member libraries worldwide

Optimal cuts and partitions in tree metrics in polynomial time by Marek Karpiński( )

2 editions published in 2012 in English and held by 12 WorldCat member libraries worldwide

Approximate counting of matchings in sparse uniform hypergraphs by Marek Karpiński( )

2 editions published in 2012 in English and held by 12 WorldCat member libraries worldwide

Approximation schemes for the Betweenness problem in tournaments and related ranking problems by Marek Karpiński( )

2 editions published in 2011 in English and held by 12 WorldCat member libraries worldwide

Improved approximation lower bounds for vertex cover on power law graphs and some generalizations by Mikael Gast( )

2 editions published in 2012 in English and held by 12 WorldCat member libraries worldwide

On approximation lower bounds for TSP with bounded metrics by Marek Karpiński( )

2 editions published in 2012 in English and held by 12 WorldCat member libraries worldwide

Optimal cuts and bisections on the real line in polynomial time by Marek Karpiński( )

2 editions published in 2012 in English and held by 12 WorldCat member libraries worldwide

Improved lower bounds for the shortest superstring and related problems by Marek Karpiński( )

2 editions published in 2011 in English and held by 12 WorldCat member libraries worldwide

Improved inapproximability results for the shortest superstring and related problems by Marek Karpiński( )

2 editions published in 2012 in English and held by 12 WorldCat member libraries worldwide

Lower bounds on testing membership to a polyhedron by algebraic decision trees by Dima J Grigorʹev( Book )

6 editions published between 1993 and 1994 in English and German and held by 10 WorldCat member libraries worldwide

Abstract: "We describe a new method of proving lower bounds on the depth of algebraic decision trees and apply it to prove a lower bound [omega](log N) for testing membership to a convex polyhedron having N facets of all dimensions. This bound apparently does not follow from the methods developed by M. Ben-Or, A. Björner, L. Lovasz, A. Yao ([B 83], [BLY 92]) because the topological invariants used in these methods become trivial for the convex polyhedra."
Learning read-once formulas with queries by Dana Angluin( Book )

2 editions published in 1989 in German and English and held by 10 WorldCat member libraries worldwide

Abstract: "A read-once formula is a boolean formula in which each variable occurs at most once. Such formulas are also called [mu]-formulas or boolean trees. This paper treats the problem of exactly identifying an unknown read-once formula using specific kinds of queries. The main results are a polynomial time algorithm for exact identification of monotone read-once formulas using only membership queries, and a polynomial time algorithm for exact identification of general read-once formulas using equivalence and membership queries (a protocol based on the notion of a minimally adequate teacher [1]). Our results improve on Valiant's previous results for read-once formulas [18]. We also show that no polynomial time algorithm using only membership queries or only equivalence queries can exactly identify all read-once formulas."
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.70 (from 0.64 for Topics in ... to 0.94 for Inapproxim ...)

Foundations of computation theory : proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, August 21-27, 1983
Covers
Fundamentals of computation theory : proceedings of the 1977 International FCT-Conference, Poznán-Kórnik, Poland, September 19-23, 1977Fast parallel algorithms for graph matching problems
Alternative Names
Karpinski, M.

Karpinski, M. 1948-

Karpinski, Marek

Marek Karpinski matematico e informatico polacco

Marek Karpinski mathematician and computer scientist

Marek Karpiński polnischer Mathematiker und Informatiker

Marek Karpinski Pools wiskundige

Languages
English (93)

German (6)