_id,doi,title
10906,10.1007/978-3-642-28756-5_46,HSF(C): A software verifier based on Horn clauses
11795,10.1007/978-3-642-31585-5_1,On multiple keyword sponsored search auctions with budgets
5745,10.1007/978-3-642-33386-6_10,Improved Single Pass Algorithms for Resolution Proof Reduction
10907,10.1007/978-3-642-20844-7_22,Spatio-temporal extraction of articulated models in a graph pyramid
10908,10.1007/978-3-642-17511-4_7,ABC: Algebraic Bound Computation for loops
5940,10.1007/978-3-642-13675-7_1,Instance Deadlock: A Mystery behind Frozen Programs
11800,10.1007/978-3-540-27836-8_2,"The past, present, and future of web search engines"
11801,10.1007/978-3-540-30140-0_2,Algorithmic aspects of web search engines
11802,10.1007/3-540-45253-2_1,Web information retrieval - an algorithmic perspective
11803,10.1007/3-540-63165-8_214,Maintaining minimum spanning trees in dynamic graphs
4612,10.1007/BFb0020931,Hybrid Systems III: Verification and Control
11804,10.1007/3-540-61422-2_117,Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning
11910,10.1007/3-540-61440-0_136,Improved sampling with applications to dynamic graph algorithms
11805,10.1007/3-540-60313-1_142,Certificates and fast algorithms for biconnectivity in fully-dynamic graphs
11806,10.1007/3-540-60084-1_81,Approximating minimum cuts under insertions