You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Death and Garden Narratives in Literature, Art and Film: Song of Death in Paradise explores the combination of two motifs, death and gardens, to show how the two subjects are intertwined and used in various media and cultural contexts. Using cultural, literary, film, and art history theories, the contributors analyze various death and garden sceneries in literary works by Arthur Machen, Agatha Christie, J.K. Rowling, as well as in superhero comics, films, and cultural and art contexts such as Ian Hamilton Finley's “Little Sparta,” the poetic verses from the Karoo Desert National Botanical Garden in South Africa, and the Australian wilderness.
Superevil: Villains in Silver Age Superhero Comics sheds light on the often-disregarded supervillains in the American superhero comic of the 1960s. From Loki to Killmonger – they all possess famous cinematic counterparts, yet it is their comic origin that this study examines. Not only did The Silver Age produce countless superheroes and supervillains who have conquered the screens in the last two decades, but it also created complex villains. Silver Age supervillains were, as the analyses in Superevil show, the main and only means to include political and societal criticism in a cultural product, which suffered from censorship and belittlement. Instead of focusing on the superheroes once more, Anke Marie Bock pioneers in putting the supervillain as such in the center of the attention. In addition to addressing the tendency to neglect villains in superhero-comic studies, revealing many important functions the supervillains fulfill, among them criticizing Cold War politics, racism, gender roles and the often unquestioned binary of good and evil on the examples of i.a. The Fantastic Four, Spider-Man and Black Panther comics.
Superheld*innen sind in der Krise: Gut und Böse, Richtig und Falsch sind nach starken sozialen und politischen Umbrüchen längst nicht mehr klar und eindeutig. Für das Genre ein eklatantes Problem. Religion und Glaube könnten hier Orientierung bieten, verlieren aber - so der gängige Vorwurf - ihrerseits immer stärker an Bedeutung in einer säkularen Welt. Die Beiträger*innen des Bandes bieten einen ersten Zugang zu diesem Phänomen und kommen zu dem erstaunlichen Befund, dass religiöse Motivik dagegen ungebrochene Hochkonjunktur in der superheroischen Popkultur feiert. Figuren, Themen, Ikonographie, Symbole: Das religiöse Spielfeld des Superheroismus ist mannigfaltig.
None
The two-volume set LNCS 6755 and LNCS 6756 constitutes the refereed proceedings of the 38th International Colloquium on Automata, Languages and Programming, ICALP 2011, held in Zürich, Switzerland, in July 2011. The 114 revised full papers (68 papers for track A, 29 for track B, and 17 for track C) presented together with 4 invited talks, 3 best student papers, and 3 best papers were carefully reviewed and selected from a total of 398 submissions. The papers are grouped in three major tracks on algorithms, complexity and games; on logic, semantics, automata, and theory of programming; as well as on foundations of networked computation: models, algorithms and information management.
This book constitutes the refereed conference proceedings of the 9th International Conference on Algorithms and Complexity, CIAC 2015, held in Paris, France, in May 2015. The 30 revised full papers presented were carefully reviewed and selected from 93 submissions and are presented together with 2 invited papers. The papers present original research in the theory and applications of algorithms and computational complexity.
This book constitutes the refereed proceedings of the 20th International Conference on Theory and Applications of Satisfiability Testing, SAT 2017, held in Melbourne, Australia, in August/September 2017. The 22 revised full papers, 5 short papers, and 3 tool papers were carefully reviewed and selected from 64 submissions. The papers are organized in the following topical sections: algorithms, complexity, and lower bounds; clause learning and symmetry handling; maximum satisfiability and minimal correction sets; parallel SAT solving; quantified Boolean formulas; satisfiability modulo theories; and SAT encodings.
For a long time computer scientists have distinguished between fast and slow algo rithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad). The running time of slow algorithms is usually exponential. This book is about bad algorithms. There are several reasons why we are interested in exponential time algorithms. Most of us believe that there are many natural problems which cannot be solved by polynomial time algorithms. The most famous and oldest family of hard problems is the family of NP...
The 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2008) took place in Van Mildert College at Durham University, UK, 30 June – 2 July 2008. The approximately 80 participants came from va- ous countries all over the world, among them Australia, Brazil, Canada, Chile, Czech Republic, France, Greece, Hungary,Israel, Italy, Japan, The Netherlands, Norway, Poland, Spain, Switzerland, UK and the USA. WG 2008 continued the series of 33 previous WG conferences. Since 1975, the WG conference has taken place 21 times in Germany, four times in The Netherlands, twice in Austria as well as once in Italy, Slovakia, Switzerland, the Czech Republic, France, Norway and now ...