The following pages link to Juraj Hromkovič (Q208754):
Displayed 50 items.
- Some hierarchies for the communication complexity measures of cooperating grammar systems (Q1325838) (← links)
- Deterministic versus nondeterministic space in terms of synchronized alternating machines (Q1334670) (← links)
- Optimal algorithms for dissemination of information in generalized communication modes (Q1339882) (← links)
- Note on optimal gossiping in some weak-connected graphs (Q1342244) (← links)
- A comparison of two lower-bound methods for communication complexity (Q1350995) (← links)
- Optimal algorithms for broadcast and gossip in the edge-disjoint modes (Q1357008) (← links)
- The power of nondeterminism and randomness for oblivious branching programs (Q1405793) (← links)
- Theoretical computer science. Introduction to automata, computability, complexity, algorithmics, randomization, communication, and cryptography. (Q1415059) (← links)
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. (Q1608333) (← links)
- What one has to know when attacking \(\mathsf {P}\) vs. \(\mathsf {NP}\) (extended abstract) (Q1679951) (← links)
- On the power of randomized multicounter machines (Q1763706) (← links)
- Algorithmics for hard problems. (Q1773216) (← links)
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance. (Q1773296) (← links)
- Design and analysis of randomized algorithms. Introduction to design paradigms. (Q1777964) (← links)
- Trace theory and VLSI design (Q1821550) (← links)
- A tight amortized bound for path reversal (Q1822942) (← links)
- A leaf-time hierarchy of two-dimensional alternating turing machines (Q1822969) (← links)
- One way multihead deterministic finite automata (Q1836312) (← links)
- On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata (Q1854456) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- On multi-partition communication complexity (Q1886038) (← links)
- On embeddings in cycles (Q1892891) (← links)
- On the advice complexity of the online dominating set problem (Q1998864) (← links)
- What one has to know when attacking \(\mathsf{P}\) vs.\(\mathsf{NP}\) (Q2009642) (← links)
- Probability theory 2. From standard deviation to statistical inference (Q2189834) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata (Q2277854) (← links)
- Stochastics. Discrete probability and combinatorics (Q2361645) (← links)
- Comparing the size of NFAs with and without \(\epsilon\)-transitions (Q2373739) (← links)
- The parameterized approximability of TSP with deadlines (Q2464332) (← links)
- Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs (Q2508334) (← links)
- Relativized counting classes: Relations among thresholds, parity, and mods (Q2638771) (← links)
- Applications of matrix methods to the theory of lower bounds in computational complexity (Q2638784) (← links)
- (Q2701740) (← links)
- (Q2754144) (← links)
- (Q2757288) (← links)
- (Q2762506) (← links)
- On the Power of Laconic Advice in Communication Complexity (Q2794355) (← links)
- Online Graph Coloring with Advice and Randomized Adversary (Q2794362) (← links)
- The Complexity of Paging Against a Probabilistic Adversary (Q2794365) (← links)
- Advice Complexity of the Online Search Problem (Q2819505) (← links)
- Online Coloring of Bipartite Graphs with and without Advice (Q2914354) (← links)
- Einführung in die Kryptologie (Q2932640) (← links)
- On the Power of Advice and Randomization for the Disjoint Path Allocation Problem (Q2938097) (← links)
- A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey (Q2944895) (← links)
- Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
- Knowing All Optimal Solutions Does Not Help for TSP Reoptimization (Q3009332) (← links)
- (Q3060334) (← links)
- (Q3075859) (← links)
- (Q3079180) (← links)