The following pages link to Luděk Kučera (Q287163):
Displayed 41 items.
- Computing OR on a randomized fixed adversary CRCW PRAM (Q287164) (← links)
- Graphs with small chromatic numbers are easy to color (Q1116349) (← links)
- Complexity of dimension three and some related edge-covering characteristics of graphs (Q1143791) (← links)
- Item:Q287163 (redirect page) (← links)
- Parallel computation and conflicts in memory access (Q1171382) (← links)
- On universal concrete categories (Q1229945) (← links)
- On learning monotone DNF formulae under uniform distributions (Q1322465) (← links)
- Expected complexity of graph partitioning problems (Q1346695) (← links)
- Erratum and addendum to: parallel computation and conflicts in memory access (Q1838292) (← links)
- Every finite graph is a full subgraph of a rigid graph (Q2550402) (← links)
- Every category is a factorization of a concrete one (Q2560304) (← links)
- Non-algebraic concrete categories (Q2562230) (← links)
- (Q3339290) (← links)
- (Q3359787) (← links)
- (Q3576697) (← links)
- (Q3713825) (← links)
- (Q3749073) (← links)
- Isomorphism Testing of Unary Algebras (Q3816973) (← links)
- (Q3820038) (← links)
- (Q3932298) (← links)
- (Q3975003) (← links)
- The greedy coloring is a bad probabilistic algorithm (Q3988828) (← links)
- On the expected performance of a parallel algorithm for finding maximal independent subsets of a random graph (Q3990223) (← links)
- (Q4081429) (← links)
- (Q4107604) (← links)
- (Q4173377) (← links)
- (Q4281533) (← links)
- (Q4471640) (← links)
- (Q4692914) (← links)
- (Q4694730) (← links)
- (Q4711934) (← links)
- (Q4725763) (← links)
- (Q4726290) (← links)
- (Q4740067) (← links)
- (Q4895237) (← links)
- (Q5183685) (← links)
- Algorithms – ESA 2005 (Q5475832) (← links)
- (Q5597103) (← links)
- (Q5642703) (← links)
- (Q5642704) (← links)
- Coloring k-colorable graphs in constant expected parallel time (Q6143974) (← links)