Martin-Luther-Universität Halle-Wittenberg
Department of Mathematics and Computer Science

06-07

Staiger, L.: The Kolmogorov complexity of infinite strings , Reports on Computer Science

05-11

Staiger, L.: Hausdorff Measure and Lukasiewicz Languages , Reports on Computer Science

05-07

C. Dong; P. Molitor: What graphs can be efficiently represented by BDDs? , Reports on Computer Science

04-23

Cristian S. Calude; Ludwig Staiger; Karl Svozil: Randomness Relative to Cantor Expansions , Reports on Computer Science

04-15

Helmut Jürgensen; Ludwig Staiger; Hideki Yamasaki: Finite Automata Encoding Geometric Figures , Reports on Computer Science

04-14

Calude, C.S.; Staiger, L.: Generalisations of Disjunctive Sequence , Reports on Computer Science

04-09

Blaar, H.; Karnstedt, M.; Lange, T.; Winter, R.: Possibilities to solve the clique problem by thread parallelism using task pools , Reports on Computer Science

03-04

Goldengorin, B.; Sierksma, G.: Equality of Upper and Lower Tolerances in Combinatorial Optimization , Reports on Optimization and Stochastics and Computer Science

02-16

Mazala, R.; Staiger, L.; Winter, R.: 12. Theorietag , Reports on Computer Science

02-15

Staiger, L.: How Large is the Set of Disjunctive Sequences ? , Reports on Computer Science

02-06

Blaar, H.; Legeler, M.; Rauber, T.: Efficiency of Thread-parallel Java Programs from Scientific Computing , Preprint on Computer Science

01-15

Staiger, L.: Topologies for Disjunctive \omega-words , Reports on Computer Science

01-12

Winter, Renate: Kryptoalgorithmen unter Ausnutzung der Komplexität des Clique-Problems , Reports on Computer Science

00-18

Fernau, H.; Stiebe, R.: Valences in Parallel Systems , Reports on Computer Science

00-11

Fernau, H.; Reinhardt, K.; Staiger, L.: Decidability of Code Properties , Reports on Computer Science

00-04

T. Moriya: Closure under Composition and Syntactic Monoids of some Codes , Reports on Computer Science

00-01

Fissgus,U.: Scheduling Using Genetic Algorithms , Reports on Computer Science

99-32

Wefel, S.; Molitor, P.: Prove that a faulty multiplier is faulty !? , Reports on Computer Science

99-29

Freund, R.; Staiger, L.: Acceptance of \omega-Languages by Communicating Deterministic Turing Machines , Reports on Computer Science

99-23

Forth, R.; Molitor, P.: An efficient heuristic for state encoding minimizing the BDD representations of the transition relations of finite state machines , Reports on Computer Science

99-17

Yamasaki, H.: Logical Characterization of Petri Net \omega-Languages , Reports on Computer Science

99-16

Fernau, H.; Staiger, L.: Iterated Function Systems and Control Languages , Reports on Computer Science

99-15

Staiger, L: On the Power of Reading the Whole Infinite Input Tape , Reports on Computer Science

99-14

Staiger, L.: The Kolmogorov Complexity of Liouville Numbers , Reports on Computer Science

99-13

Staiger, L.: How Much Can You Win When Your Adversary is Handicapped? , Reports on Computer Science

99-11

Matuszewski, C.; Schoenfeld, R.; Molitor, P.: Using sifting for k-layer straightline crossing minimization , Reports on Computer Science

99-09

Pohl, T.; Grecksch, W.; Blaar, H.: A Parallel Modified Lagrangian Method for an Optimal Control Problem of a Linear Disributed Stochastic System , Reports on Optimization and Stochastics and Computer Science

98-36

Fernau, H.; Stiebe, R.: Regulation by Valences , Reports on Computer Science

98-34

Fissgus,U.; Rauber,Th.; Rünger,G.: A Framework for Generating Task Parallel Programs , Reports on Computer Science

98-30

Staiger, L.: The Hausdorff Measure of Regular \omega-languages is Computable , Reports on Computer Science

98-24

Heinrich-Litan,L.; Fissgus,U.; Sutter,St.; Molitor,P.; Rauber,Th.: Modeling the Communication Behavior of Distributed Memory Maschines by Genetic Programming , Reports on Computer Science

98-11

Pohl, Th.; Grecksch, W.; Blaar, H.: A Parallel Application of a Quasigradient Method in Stochastic Control Theory , Reports on Optimization and Stochastics and Computer Science

98-06

Staiger, L.: Rich \omega-Words and Monadic Second-Order Arithmetic , Reports on Computer Science

97-49

Podehl, A; Rauber, T.; Rünger, G.: A Shared-Memory Implementation of the Hierarchical Radiosity Method , Reports on Computer Science

97-38

Zickner, H.; Blaar, H.; Bäsken, M.: Eine Bibliothek mit parallelen Algorithmen und Datenstrukturen zur Lösung geometrischer Probleme , Reports on Computer Science

97-23

Molitor, P.: Abschlußbericht des DFG-Forschungsprojektes: Logische Synthese und Optimierung kleiner Schaltungen , Reports on Computer Science

97-10

Braesel, Th.; Froetschl, B.; Rojas, R.: Rotation and translation invariant pattern recognition - The effect of discretization , Reports on Computer Science

97-09

Staiger, L.: \omega- languages , Reports on Computer Science

97-07

Keim, M.; Martin, M.; Becker, B.; Drechsler, R.; Molitor, P.: Polynomial Formal Verification of Multipliers , Reports on Computer Science

96-43

Molitor, P.; Näher, S.; Rojas, R.; Staiger, L.: Beiträge zur Informatik , Reports on Computer Science

96-40

Scholl, Chr.; Melchoir, St.; Hotz, G.; Molitor, P.: Minimizing ROBDD Sizes of Incompletely Specified Boolean Functions by Exploiting Strong Symmetrie , Reports on Computer Science

96-25

Asveren, T.; Molitor, P.: New Crossover Methods for Sequencing Problems , Reports on Computer Science

96-15

Peters, I.; Molitor, P.; Weber, M.: On OTC-Routing with Vertical Floating Pins , Reports on Computer Science

96-08

Litan, L.; Molitor, P.; Möller, D.: Least Upper Bounds on the Sizes of Symmetric Variable Order based Binary Decision Diagrams , Reports on Computer Science

95-15

Pohl, T.; Blaar, H.; Grecksch, W.: Parallele Lösung eines stetigen deterministischen Steuerproblems , Reports on Computer Science

95-13

Scholl, C.; Molitor, P.: Communication Based FPGA Synthesis for Multi­Output Boolean Functions , Reports on Computer Science

95-10

Mehlhorn, K.; Näher, S.: LEDA A Platform for Combinatorial and Geometric Computing , Reports on Computer Science

95-09

Mohnke, J.; Molitor, P.; Malik, Sh.: Limits of Using Signatures for Permutation Independent Boolean Comparison , Reports on Computer Science

95-08

Pfister, M.; Rojas, R.: Hybrid Learning Algorithms for Neural Networks , Reports on Computer Science

95-07

Head, T.; Weber, A.: Deciding Multiset Decipherability , Reports on Computer Science

95-06

Peters, I.: Priority Driven Channel Pin Assignment , Reports on Computer Science

95-04

Becker, B.; Drechsler, R.; Molitor, P.: On the Generation of Area-Time Optimal Testable Adders , Reports on Computer Science

95-01

Molitor, P.: Recent Developments in Wiring and via Minimization , Reports on Computer Science

email: fi-adm, [-> Math-Net Projekt in Halle (1.01.1997-31.03.1999)]
01-Aug-2007. Page generated by rep-listen.create (RLC, 01.03.01/MG/CEL/LB) .