Author of the publication

Derandomization of Schuler's Algorithm for SAT

, and . Electronic Colloquium on Computational Complexity (ECCC), (2004)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Univ. -Prof. Dr. -Ing. Alexander Verl University of Stuttgart

Augmented Accuracy : A Human-Machine Integrated Adaptive Fabrication Workflow for Bamboo, , , , , , and . Towards a new, configurable architecture : Proceedings of the 39th eCAADe Conference, page 345-354. Novi Sad, University of Novi Sad, (2021)
Augmented Accuracy : A Human-Machine Integrated Adaptive Fabrication Workflow for Bamboo, , , , , , and . Towards a new, configurable architecture : Proceedings of the 39th eCAADe Conference, page 345-354. Novi Sad, University of Novi Sad, (2021)Konzept zur Integration eines kontinuierlichen Materialflussmodells in die Virtuelle Inbetriebnahme durch Signalgenerierung, and . Simulation in Produktion und Logistik 2021, 177, page 585-594. Göttingen, Cuvillier Verlag, (2021)

Alexander Verl

On the Dynamics and Emergency Stop Behavior of Cable-Driven Parallel Robots, , and . ROMANSY 21 - Robot Design, Dynamics and Control, volume 569 of CISM International Centre for Mechanical Sciences, page 431--438. Switzerland, Springer Verlag and Springer International Publishing, (2016)
 

Other publications of authors with the same name

A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length., and . JSAT, 1 (1): 49-60 (2006)Lifetact: utilizing smartwatches as tactile heartbeat displays in video games., , , , and . MUM, page 97-101. ACM, (2017)A Robust Dna Computation Model That Captures Pspace., and . Int. J. Found. Comput. Sci., 14 (5): 933- (2003)On quantum versions of record-breaking algorithms for SAT., , and . SIGACT News, 36 (4): 103-108 (2005)Algorithms for SAT based on search in Hamming balls, , and . Electronic Colloquium on Computational Complexity (ECCC), (2003)Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms, , and . Electronic Colloquium on Computational Complexity (ECCC), (2005)Reconstruction of Boolean Formulas in Conjunctive Normal Form., and . COCOON, volume 10976 of Lecture Notes in Computer Science, page 592-601. Springer, (2018)Solving Constraint Satisfaction Problems with DNA Computing., and . COCOON, volume 2387 of Lecture Notes in Computer Science, page 171-180. Springer, (2002)Derandomization of Schuler's Algorithm for SAT., and . SAT (Selected Papers, volume 3542 of Lecture Notes in Computer Science, page 80-88. Springer, (2004)An Improved Upper Bound for SAT., and . SAT, volume 3569 of Lecture Notes in Computer Science, page 400-407. Springer, (2005)