What are those deterministic algorithms for k-SAT that are not derandomization of random algorithms like PPSZ and Schöning's local search?
If I may interpret your question as a reference request: Donald Knuth recently finished the part of TAOCP that deals with satisfiability: 

Donald E. Knuth, The Art of Computer Programming, Volume 4 Fascicle 6, Satisfiability (2015), xiii+310pp. ISBN 978-0-13-439760-3. 

Although I did not work through it yet (no pun intended), it is well known that Don Knuth usually puts a clear emphasis on the structure of the different algorithmic approaches, and he gives a very detailed account on the history of ideas. My bet is that you'll find the answer to your question in the fascicle. (Maybe someone else who is more knowledgeable about SAT can give a less indirect answer )