Combinatorics - PDFSEARCH.IO - Document Search Engine

Combinatorics
Results: 2993

#	Item
931	O P - S F N E T - Volume 21, Number 3 – May 15, 2014 Editors: Diego Dominici Martin Muldoon Add to Reading List Source URL: staff.fnwi.uva.nl Language: English - Date: 2014-05-19 16:49:21 Combinatorics Q-analogs Wilson polynomials Gegenbauer polynomials Orthogonal polynomials Special functions Mathematical analysis
932	Validating LR(1) Parsers Jacques-Henri Jourdan1,2 , Fran¸cois Pottier2 , and Xavier Leroy2 1 2 ´ Add to Reading List Source URL: gallium.inria.fr Language: English - Date: 2012-01-06 07:45:45 Syntax Linguistics Compiler construction Combinatorics on words LR parser Lookahead Compiler-compiler SLR grammar String Formal languages Combinatorics Parsing
933	O P - S F N E T - Volume 19, Number 1 – January 15, 2012 Editors: Diego Dominici Martin Muldoon Add to Reading List Source URL: staff.fnwi.uva.nl Language: English - Date: 2012-01-17 17:56:32 Mathematical analysis Combinatorics Askey scheme Patras Special functions Orthogonal polynomials Q-analogs
934	Institut für Mess- und Regelungstechnik Lecture Announcement “Graph rigidity theory for formation control” by Add to Reading List Source URL: www.mrt.kit.edu Language: English - Date: 2015-04-29 07:45:51 Combinatorics Theoretical computer science Mathematics Graph theory Graph
935	Trust-based recommendation systems: an axiomatic approach Reid Andersen∗ Abraham Flaxman∗ Christian Borgs∗ Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2008-01-13 21:45:10 Combinatorics Flow network Operations research Connectivity Directed acyclic graph Minimum cut Axiom Network theory Networks Graph theory Network flow Mathematics
936	A novel approach to propagating distrust Christian Borgs1 , Jennifer Chayes1 , Adam Tauman Kalai1 , Azarakhsh Malekian2 , and Moshe Tennenholtz3 1 2 Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2010-10-31 20:18:18 Network flow Flow network Operations research Graph Bellman–Ford algorithm Euler tour technique Graph theory Mathematics Combinatorics
937	CS109A Notes for LectureSubstrings In ML notation, x is a substring of y if y = u^x^v for some strings u and v. Similar notion for lists, i.e., y = u@x@v. Add to Reading List Source URL: infolab.stanford.edu Language: English - Date: 2008-09-19 00:58:15 Combinatorics Formal languages Longest common subsequence problem String Substring Subsequence Diff Shortest common supersequence Longest common substring problem Mathematics Dynamic programming Theoretical computer science
938	The Alpha Beta Waltz ©1988 by Howard L. Kaplan Permanently, irrevocably, indelibly, and unerasably dedicated to one who cannot be named, because it really happened to her G Add to Reading List Source URL: www.thrinberry-frog.com Language: English - Date: 2008-03-18 16:34:25 Factorial Number theory Mathematics Combinatorics Integer sequences
939	O P - S F N E T - Volume 22, Number 1 – January 15, 2015 Editors: Diego Dominici Martin Muldoon Add to Reading List Source URL: staff.fnwi.uva.nl Language: English - Date: 2015-01-18 18:27:11 Combinatorics Q-analogs Macdonald polynomials Askey scheme Wilson polynomials George Gasper Classical orthogonal polynomials Hahn polynomials Special functions Orthogonal polynomials Mathematical analysis
940	Near-linear time simulation of linear extensions of a height-2 poset with bounded interaction Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2014-06-08 17:33:12 Combinatorics Permutation Partially ordered set Structure Mathematics Order theory Abstract algebra