Proc. Int. Cong. of Math. – 2018 Rio de Janeiro, Vol–1260) LITTLE DISKS OPERADS AND FEYNMAN DIAGRAMS Thomas Willwacher - Checkers - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2018-07-25 13:17:42 Graph theory Mathematics Discrete mathematics Degree Graph Orientation Operad theory Euler characteristic Directed graph Two-graph Hanoi graph		Proc. Int. Cong. of Math. – 2018 Rio de Janeiro, Vol–1260) LITTLE DISKS OPERADS AND FEYNMAN DIAGRAMS Thomas Willwacher Add to Reading List Source URL: eta.impa.br Download Document from Source Website File Size: 322,39 KB Share Document on Facebook

	SHORTEST PATHS IN THE TOWER OF HANOI GRAPH AND FINITE AUTOMATA DAN ROMIK Abstract. We present efficient algorithms for constructing a shortest path between two configurations in the Tower of Hanoi graph, and for computin DocID: 1tF3N - View Document
	On Scenario Synchronization Duc-Hanh Dang1 , Anh-Hoang Truong1 , and Martin Gogolla2 1 University of Engineering and Technology, Vietnam National University of Hanoi, DocID: 1aG9k - View Document
	Exploiting Direct And Indirect Information For Friend Suggestion In ZingMe Kien Duy Nguyen School of Information and Communication Technology Hanoi University Of Science and Technology DocID: dq3N - View Document