Our search has the following Google-type functionality:
If you use '+' at the start of a word, that word will be present in the search results.
eg. Harry +Potter
Search results will contain 'Potter'.
If you use '-' at the start of a word, that word will be absent in the search results.
eg. Harry -Potter
Search results will not contain 'Potter'.
If you use 'AND' between 2 words, then both those words will be present in the search results.
eg. Harry AND Potter
Search results will contain both 'Harry' and 'Potter'.
NOTE: AND will only work with single words not phrases.
If you use 'OR' between 2 single words, then either or both of those words will be present in the search results.
eg. 'Harry OR Potter'
Search results will contain just 'Harry', or just 'Potter', or both 'Harry' and 'Potter'.
NOTE: OR will only work with single words not phrases.
If you use 'NOT' before a word, that word will be absent in the search results. (This is the same as using the minus symbol).
eg. 'Harry NOT Potter'
Search results will not contain 'Potter'.
NOTE: NOT will only work with single words not phrases.
If you use double quotation marks around words, those words will be present in that order.
eg. "Harry Potter"
Search results will contain 'Harry Potter', but not 'Potter Harry'.
NOTE: "" cannot be combined with AND, OR & NOT searches.
If you use '*' in a word, it performs a wildcard search, as it signifies any number of characters. (Searches cannot start with a wildcard).
Search results will contain words starting with 'Pot' and ending in 'er', such as 'Potter'.
Edward M. Reingold is Professor of Computer Science at the Illinois Institute of Technology, where he also served as chair from 2000 to 2006. Prior to that, he was a faculty member in the Department of Computer Science at the University of Illinois, Urbana-Champaign for thirty years. His research interests are in theoretical computer science, especially the design and analysis of algorithms and data structures. A Fellow of the Association for Computing Machinery since 1996, Reingold has authored or coauthored more than seventy research papers and ten books; his papers on backtrack search, generation of combinations, weight-balanced binary trees, and drawing of trees and graphs are considered classics. Reingold has won awards for his undergraduate and graduate teaching, and is intensely interested in calendars and their computer implementation. He is the author of Calendrical Tabulations (with Nachum Dershowitz, Cambridge, 2002) and is the author and former maintainer of the calendar/diary part of GNU Emacs. Nachum Dershowitz is Professor of Computational Logic at Tel Aviv University. Beyond his expertise in calendars, he is a leading figure in software verification in general and termination of programs in particular, and is an international authority on equational inference and term rewriting. Other areas in which he has made major contributions include program semantics, analysis of historical manuscripts, and combinatorial enumeration. Dershowitz has authored or coauthored more than 100 research papers and several books and has held visiting positions at prominent institutions around the globe. He has won numerous awards for his research and teaching, including the Herbrand Award for Distinguished Contributions to Automated Reasoning (2011), and Test-of-Time awards for the Institute of Electrical and Electronics Engineers Symposium on Logic in Computer Science (2006), for the International Conference on Rewriting Techniques and Applications (2014), and for the International Conference on Automated Deduction (2015). He was elected to Academia Europaea in 2013.
'It retains all the features that made the first edition ... such a wonderful resource, while adding much new material ... If you are at all interested in time and calendars, this book must find a place on your desk.' Victor J. Katz, Mathematical Reviews 'It retains all the features that made the first edition ... such a wonderful resource, while adding much new material ... If you are at all interested in time and calendars, this book must find a place on your desk.' Victor J. Katz, Mathematical Reviews