default search action
Computer Science Today, 1995
- Jan van Leeuwen:
Computer Science Today: Recent Trends and Developments. Lecture Notes in Computer Science 1000, Springer 1995, ISBN 3-540-60105-8
The New Computing
- Gilles Brassard:
A Quantum Jump in Computer Science. 1-14 - Luc Steels, Mario Tokoro:
Artificial Life and Real World Computing. 15-28 - Hava T. Siegelmann:
Recurrent Neural Networks. 29-45 - William F. McColl:
Scalable Computing. 46-61
Parallel and Distributed Systems
- Burkhard Monien, Ralf Diekmann, Rainer Feldmann, Ralf Klasing, Reinhard Lüling, Knut Menzel, Thomas Römke, Ulf-Peter Schroeder:
Efficient Use of Parallel & Distributed Systems: From Theory to Practice. 62-77 - Lawrence Snyder:
Experimental Validation of Models of Parallel Computation. 78-100 - Jirí Wiedermann:
Quo Vadetis, Parallel Machine Models? 101-114
Algorithm Design
- Zhaojun Bai, David Day, James Demmel, Jack J. Dongarra, Ming Gu, Axel Ruhe, Henk A. van der Vorst:
Templates for Linear Algebra Problems. 115-140 - Thomas Beth, Andreas Klappenecker, Torsten Minkwitz, Armin Nückel:
The ART behind IDEAS. 141-158 - Leonard M. Adleman:
Algorithmic Number Theory and Its Relationship to Computational Complexity. 159-171 - Shin-Ichi Nakano, Xiao Zhou, Takao Nishizeki:
Edge-Coloring Algorithms. 172-183 - Sridhar Hannenhalli, Pavel A. Pevzner:
Towards a Computational Theory of Genome Rearrangements. 184-202 - Maurice Herlihy, Sergio Rajsbaum:
Algebraic Topology and Distributed Computing: A Primer. 203-217
Optimization and Search
- Anuchit Anuchitanukul, Zohar Manna, Tomás E. Uribe:
Differential BDDs. 218-233 - Pankaj K. Agarwal, Micha Sharir:
Algorithmic Techniques for Geometric Optimization. 234-253 - Jürg Nievergelt, Ralph Gasser, Fabian Mäser, Christoph Wirth:
All the Needles in a Haystack: Can Exhaustive Search Overcome Combinatorial Chaos? 254-274 - Nicholas J. Radcliffe, Patrick D. Surry:
Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective. 275-291
Software Technology
- Manfred Broy:
Mathematical System Models as a Basis of Software Engineering. 292-306 - Mary Shaw, David Garlan:
Formulations and Formalisms in Software Architecture. 307-323 - Gert Smolka:
The Oz Programming Model. 324-343 - Derick Wood:
Standard Generalized Markup Language: Mathematical and Philosophical Issues. 344-365
Programming Theory
- David Gries, Fred B. Schneider:
Avoiding the Undefined by Underspecification. 366-373 - David Harel:
Towards a theory of Recursive Structures. 374-391 - Vaughan R. Pratt:
Chu Spaces and Their Interpretation as Concurrent Objects. 392-405 - Maurice Bruynooghe, Michael Codish, Anne Mulkers:
Abstracting Unification: A Key Step in the Design of Logic Program Analyses. 406-425
Verification and Reasoning
- Ross J. Anderson, Roger M. Needham:
Programming Satan's Computer. 426-440 - Wolfgang Reisig:
Petri Net Models of Distributed Algorithms. 441-454 - Edmund M. Clarke, Somesh Jha:
Symmetry and Induction in Model Checking. 455-470 - Moshe Y. Vardi:
Alternating Automata and Program Verification. 471-485 - Erik Sandewall:
Reasoning about Actions and Change with Ramification. 486-504
Intelligent Systems
- Jan-Olof Eklundh:
Trends in Active Vision. 505-517 - Ming Li, Paul M. B. Vitányi:
Computational Machine Learning in Theory and Praxis. 518-535 - Ronald R. Yager:
Fuzzy Sets as a Tool for Modeling. 536-548 - C. J. van Rijsbergen:
Information Retrieval and Information Reasoning. 549-559 - Gottfried Vossen:
Database Transaction Models. 560-574
Multimedia and Hypermedia
- Dick C. A. Bulterman, Lynda Hardman:
Multimedia Authoring Tools: State of the Art and Research Challenges. 575-591 - Thomas Käppner, Ralf Steinmetz:
Computational Models for Distributed Multimedia Applications. 592-607 - Hermann A. Maurer:
Hypermedia Systems as Internet Tools. 608-624
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.