The following pages link to Juraj Hromkovič (Q208754):
Displaying 50 items.
- (Q235165) (redirect page) (← links)
- Approximation algorithms for the TSP with sharpened triangle inequality (Q294819) (← links)
- (Q414454) (redirect page) (← links)
- Steiner tree reoptimization in graphs with sharpened triangle inequality (Q414457) (← links)
- On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776) (← links)
- Corrigendum to ``On the approximability and hardness of minimum topic connected overlay and its special instances'' (Q476920) (← links)
- (Q486979) (redirect page) (← links)
- Online coloring of bipartite graphs with and without advice (Q486981) (← links)
- Ambiguity and communication (Q537915) (← links)
- (Q587709) (redirect page) (← links)
- On the power of nondeterminism and Las Vegas randomization for two-dimensional finite automata (Q596324) (← links)
- A nonlinear lower bound on the practical combinational complexity (Q673076) (← links)
- Efficient constructions of test sets for regular and context-free languages (Q685373) (← links)
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542) (← links)
- On the advice complexity of the online \(L(2,1)\)-coloring problem on paths and cycles (Q744081) (← links)
- The string guessing problem as a method to prove lower bounds on the advice complexity (Q744093) (← links)
- (Q809595) (redirect page) (← links)
- Separation of deterministic, nondeterministic and alternating complexity classes (Q809596) (← links)
- Finite-automaton aperiodicity is PSPACE-complete (Q809608) (← links)
- A note on real-time one-way alternating multicounter machines (Q809610) (← links)
- On the power of synchronization in parallel computations (Q811118) (← links)
- Two-way non-uniform finite automata (Q832933) (← links)
- Reoptimization of Steiner trees: changing the terminal set (Q838156) (← links)
- On probabilistic pushdown automata (Q989292) (← links)
- On \(k\)-connectivity problems with sharpened triangle inequality (Q1002105) (← links)
- One-way simple multihead finite automata are not closed under concatenation (Q1056554) (← links)
- Fooling a two-way nondeterministic multihead automaton with reversal number restriction (Q1058864) (← links)
- Alternating multicounter machines with constant number of reversals (Q1067412) (← links)
- On the power of alternation in automata theory (Q1068537) (← links)
- Linear lower bounds on unbounded fan-in Boolean circuits (Q1068792) (← links)
- A logic-topological calculus for the construction of integrated circuits. I (Q1088971) (← links)
- Communication complexity hierarchy (Q1090456) (← links)
- Reversal-bounded nondeterministic multicounter machines and complementation (Q1094884) (← links)
- The derivation of systolic implementations of programs (Q1096393) (← links)
- A logic-topological calculus for the construction of integrated circuits. II. (Q1096590) (← links)
- The advantages of a new approach to defining the communication complexity for VLSI (Q1106661) (← links)
- Some subclasses of context-free languages in \(NC^ 1\) (Q1112610) (← links)
- The power of nondeterminism in polynomial-size bounded-width branching programs (Q1116338) (← links)
- Tradeoffs for language recognition on alternating machines (Q1117697) (← links)
- Communication complexity of multi-processor systems (Q1118403) (← links)
- Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits (Q1121671) (← links)
- Lower bounds for language recognition on two-dimensional alternating multihead machines (Q1124335) (← links)
- On an approximate computation of the height of the maximal upper zero of a monotone Boolean function (Q1177787) (← links)
- Multihead one-way finite automata (Q1183574) (← links)
- The complexity of the parity function in unbounded fan-in, unbounded depth circuits (Q1183575) (← links)
- Nonlinear lower bounds on the number of processors of circuits with sublinear separators (Q1183605) (← links)
- Synthesizing synchronous systems by static scheduling in space-time (Q1187649) (← links)
- Lower bounds on the area complexity of Boolean circuits (Q1193877) (← links)
- A note on realtime one-way synchronized alternating one-counter automata (Q1208731) (← links)
- Optimal algorithms for dissemination of information in some interconnection networks (Q1261287) (← links)
