Algorithmic - PDFSEARCH.IO - Document Search Engine

Algorithmic
Results: 3166

#	Item
501	Linear time low tree-width partitions and algorithmic consequences Jaroslav Neˇsetˇril 1 1 Add to Reading List Source URL: iti.mff.cuni.cz Language: English - Date: 2016-02-04 05:53:37
502	Reliable Algorithmic Software Kurt Mehlhorn MPI f¨ur Informatik Saarbr¨ucken Germany Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2003-02-15 12:39:42
503	6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Lecture 3 — September 11, 2014 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2014-09-15 21:34:35
504	6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Lecture 9 — October 2, 2014 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2014-10-06 21:33:52
505	FPT algorithmic techniques Dániel Marx Budapest University of Technology and Economics, Hungary AGAPE’09 Spring School on Fixed Parameter and Exact Algorithms May 25-26, 2009, Lozari, Corsica (France) Add to Reading List Source URL: www.cs.bme.hu Language: English - Date: 2009-05-29 05:51:16
506	STANFORD TECHNOLOGY LAW REVIEW VOLUME 16, NUMBER 3 SPRING 2013 USING ALGORITHMIC ATTRIBUTION TECHNIQUES TO DETERMINE AUTHORSHIP IN UNSIGNED JUDICIAL OPINIONS Add to Reading List Source URL: alo.mit.edu Language: English - Date: 2015-07-10 13:53:50
507	1 1 Algorithmic, Geometric, and Combinatorial Problems in Computational Music Theory Add to Reading List Source URL: www-cgrl.cs.mcgill.ca Language: English - Date: 2003-08-16 18:38:43
508	6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Lecture 6 — September 18, 2014 Prof. Erik Demaine Add to Reading List Source URL: courses.csail.mit.edu Language: English - Date: 2014-09-29 11:16:43
509	Effective Strong Dimension in Algorithmic Information and Computational Complexity Krishna B. Athreya 1 Add to Reading List Source URL: www.cs.uwyo.edu Language: English - Date: 2006-12-19 13:22:42
510	An algorithm for two coloring of hypergraphs G´abor Heged˝ us Abstract Let r > 1 be a fix integer. Let H be an arbitrary r-uniform hypergraph. We give an algorithmic, elementary proof of the fact, that there exists a 2 Add to Reading List Source URL: iti.mff.cuni.cz Language: English - Date: 2016-02-04 05:53:37

UPDATE