@unpublished{MargariaHinchey2013, author = {Margaria, Tiziana and Hinchey, Mike}, title = {Simplicity in IT - the power of less}, series = {Computer : innovative technology for computer professionals}, volume = {46}, journal = {Computer : innovative technology for computer professionals}, number = {11}, publisher = {Inst. of Electr. and Electronics Engineers}, address = {Los Alamitos}, issn = {0018-9162}, doi = {10.1109/MC.2013.397}, pages = {23 -- 25}, year = {2013}, abstract = {Simplicity is a mindset, a way of looking at solutions, an extremely wide-ranging philosophical stance on the world, and thus a deeply rooted cultural paradigm. The culture of "less" can be profoundly disruptive, cutting out existing "standard" elements from products and business models, thereby revolutionizing entire markets.}, language = {en} } @unpublished{LuckeSteinmetz2014, author = {Lucke, Ulrike and Steinmetz, Ralf}, title = {Special issue on "Pervasive Education"}, series = {Pervasive and mobile computing}, volume = {14}, journal = {Pervasive and mobile computing}, publisher = {Elsevier}, address = {Amsterdam}, issn = {1574-1192}, doi = {10.1016/j.pmcj.2014.08.001}, pages = {1 -- 2}, year = {2014}, language = {en} } @unpublished{KroeningMargariaWoodcock2011, author = {Kr{\"o}ning, Daniel and Margaria, Tiziana and Woodcock, Jim}, title = {Untitled}, series = {Formal aspects of computing : the international journal of formal methods}, volume = {23}, journal = {Formal aspects of computing : the international journal of formal methods}, number = {5}, publisher = {Springer}, address = {New York}, issn = {0934-5043}, doi = {10.1007/s00165-011-0201-8}, pages = {585 -- 588}, year = {2011}, language = {en} } @unpublished{RosamondBardohlDiehletal.2011, author = {Rosamond, Frances and Bardohl, Roswitha and Diehl, Stephan and Geisler, Uwe and Bolduan, Gordon and Lessmoellmann, Annette and Schwill, Andreas and Stege, Ulrike}, title = {Virtual extension reaching out to the media become a computer science ambassador}, series = {Communications of the ACM / Association for Computing Machinery}, volume = {54}, journal = {Communications of the ACM / Association for Computing Machinery}, number = {3}, publisher = {Association for Computing Machinery}, address = {New York}, issn = {0001-0782}, doi = {10.1145/1897852.1897880}, pages = {113 -- 116}, year = {2011}, language = {en} } @unpublished{Arnold2009, author = {Arnold, Holger}, title = {A linearized DPLL calculus with clause learning (2nd, revised version)}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-29080}, year = {2009}, abstract = {Many formal descriptions of DPLL-based SAT algorithms either do not include all essential proof techniques applied by modern SAT solvers or are bound to particular heuristics or data structures. This makes it difficult to analyze proof-theoretic properties or the search complexity of these algorithms. In this paper we try to improve this situation by developing a nondeterministic proof calculus that models the functioning of SAT algorithms based on the DPLL calculus with clause learning. This calculus is independent of implementation details yet precise enough to enable a formal analysis of realistic DPLL-based SAT algorithms.}, language = {en} }