Luděk Kučera

Available identifiers

zbMath Open kucera.ludekWikidataQ95156048 ScholiaQ95156048MaRDI QIDQ287163

List of research outcomes

Publication	Date of Publication	Type
Coloring k-colorable graphs in constant expected parallel time	2024-01-05	Paper
Computing OR on a randomized fixed adversary CRCW PRAM	2016-05-26	Paper
https://portal.mardi4nfdi.de/entity/Q3576697	2010-07-30	Paper
Algorithms – ESA 2005	2006-06-27	Paper
https://portal.mardi4nfdi.de/entity/Q4471640	2004-07-30	Paper
https://portal.mardi4nfdi.de/entity/Q4895237	1997-01-22	Paper
Expected complexity of graph partitioning problems	1995-04-10	Paper
https://portal.mardi4nfdi.de/entity/Q4281533	1994-11-13	Paper
On learning monotone DNF formulae under uniform distributions	1994-05-05	Paper
https://portal.mardi4nfdi.de/entity/Q4694730	1993-06-29	Paper
https://portal.mardi4nfdi.de/entity/Q4692914	1993-06-05	Paper
The greedy coloring is a bad probabilistic algorithm	1992-06-28	Paper
On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph	1992-06-28	Paper
https://portal.mardi4nfdi.de/entity/Q3975003	1992-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q4711934	1992-06-25	Paper
https://portal.mardi4nfdi.de/entity/Q3359787	1990-01-01	Paper
Graphs with small chromatic numbers are easy to color	1989-01-01	Paper
Isomorphism Testing of Unary Algebras	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3820038	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4726290	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3749073	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4725763	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3339290	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3713825	1984-01-01	Paper
Erratum and addendum to: parallel computation and conflicts in memory access	1983-01-01	Paper
Parallel computation and conflicts in memory access	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4740067	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3932298	1981-01-01	Paper
Complexity of dimension three and some related edge-covering characteristics of graphs	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4173377	1977-01-01	Paper
On universal concrete categories	1975-01-01	Paper
Non-algebraic concrete categories	1973-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4081429	1972-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4107604	1972-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5183685	1972-01-01	Paper
Every finite graph is a full subgraph of a rigid graph	1971-01-01	Paper
Every category is a factorization of a concrete one	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5642703	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5642704	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5597103	1965-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Luděk Kučera