SCEAS

The SCEAS System

Title:
Author:

Matthias Homeister: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Henrik Brosenne, Matthias Homeister, Stephan Waack
Graph-Driven Free Parity BDDs: Algorithms and Lower Bounds. [Citation Graph (0, 0)][DBLP]
MFCS, 2001, pp:212-223 [Conf]
Henrik Brosenne, Matthias Homeister, Stephan Waack
Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. [Citation Graph (0, 0)][DBLP]
MFCS, 2003, pp:290-299 [Conf]
Matthias Homeister
Lower Bounds for the Sum of Graph--driven Read--Once Parity Branching Programs [Citation Graph (0, 0)][DBLP]
Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:068, pp:- [Journal]
Henrik Brosenne, Matthias Homeister, Stephan Waack
Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2006, v:98, n:1, pp:6-10 [Journal]
Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack
On approximation by XOR-OBDDs. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2007, v:102, n:1, pp:17-21 [Journal]
Henrik Brosenne, Matthias Homeister, Stephan Waack
Characterizing the Complexity of Boolean Functions represented by Well-Structured Graph-Driven Parity-FBDDs. [Citation Graph (0, 0)][DBLP]
ITA, 2002, v:36, n:3, pp:229-247 [Journal]
Matthias Homeister
Lower bounds for restricted read-once parity branching programs. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2006, v:359, n:1-3, pp:1-14 [Journal]

Search in 0.001secs, Finished in 0.002secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP