The following pages link to Christoph Meinel (Q202501):
Displaying 44 items.
- (Q3991212) (← links)
- Algebraic and topological properties of finite partially ordered sets (Q3994391) (← links)
- (Q4005192) (← links)
- Structure and importance of logspace-MOD class (Q4009813) (← links)
- Separating complexity classes related to certain input oblivious logarithmic space-bounded Turing machines (Q4020492) (← links)
- (Q4023845) (← links)
- (Q4035256) (← links)
- (Q4035684) (← links)
- (Q4219538) (← links)
- (Q4255560) (← links)
- On the Influence of the State Encoding on OBDD-Representations of Finite State Machines (Q4256140) (← links)
- (Q4268446) (← links)
- (Q4268481) (← links)
- (Q4281500) (← links)
- (Q4281560) (← links)
- (Q4281654) (← links)
- Separating complexity classes related to bounded alternating ?-branching programs (Q4327378) (← links)
- (Q4388806) (← links)
- (Q4390872) (← links)
- (Q4417676) (← links)
- (Q4417677) (← links)
- Efficient Boolean manipulation with OBDD's can be extended to FBDD's (Q4419787) (← links)
- (Q4431225) (← links)
- (Q4473391) (← links)
- (Q4542178) (← links)
- The “log rank” conjecture for modular communication complexity (Q4593965) (← links)
- (Q4673623) (← links)
- (Q4699317) (← links)
- Lower bounds for the majority communication complexity of various graph accessibility problems (Q4717056) (← links)
- (Q4858953) (← links)
- (Q4938158) (← links)
- A reducibility concept for problems defined in terms of ordered binary decision diagrams (Q5047173) (← links)
- Lower bounds for the modular communication complexity of various graph accessibility problems (Q5096349) (← links)
- Separating counting communication complexity classes (Q5096788) (← links)
- On the complexity of constructing optimal ordered binary decision diagrams (Q5096910) (← links)
- IPv6 Stateless Address Autoconfiguration: Balancing between Security, Privacy and Usability (Q5327314) (← links)
- Digital Communication (Q5406286) (← links)
- Digitale Kommunikation (Q5417060) (← links)
- (Q5479656) (← links)
- Lectures on computer science. Vol. 2: Object oriented programming and algorithms (Q5917775) (← links)
- Soft computing agents. New trends for designing autonomous systems (Q5942937) (← links)
- Local encoding transformations for optimizing OBDD-representations of finite state machines (Q5943270) (← links)
- The ''log rank'' conjecture for modular communication complexity (Q5957091) (← links)
- Mathematical foundations of computer science. Mathematical thinking and proof -- an introduction (Q6535722) (← links)
