|
Color-coding
In computer science and graph theory, the term color-coding refers to an algorithmic technique which is useful in the discovery of network motifs. For example, it can be used to detect a simple path of length in a given graph. The traditional color-coding algorithm is probabilistic, but it can be derandomized without much overhead in the running time. Color-coding also applies to the detection of cycles of a given length, and more generally it applies to the subgraph isomorphism problem (an NP-complete problem), where it yields polynomial time algorithms when the subgraph pattern that it is trying to detect has bounded treewidth. The color-coding method was proposed and analyzed in 1994 by Noga Alon, Raphael Yuster, and Uri Zwick.Alon, N., Yuster, R., and Zwick, U. 1995. Color-coding. J. ACM 42, 4 (Jul. 1995), 844–856. DOI= http://doi.acm.org/10.1145/210332.210337 Results The following results can be obtained through the method of color-coding: * For every fixed cons ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Noga Alon
Noga Alon (; born 1956) is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers. Education and career Alon was born in 1956 in Haifa, where he graduated from the Hebrew Reali School in 1974. He graduated summa cum laude from the Technion – Israel Institute of Technology in 1979, earned a master's degree in mathematics in 1980 from Tel Aviv University, and received his Ph.D. in Mathematics at the Hebrew University of Jerusalem in 1983 with the dissertation ''Extremal Problems in Combinatorics'' supervised by Micha Perles. After postdoctoral research at the Massachusetts Institute of Technology he returned to Tel Aviv University as a senior lecturer in 1985, obtained a permanent position as an associate professor there in 1986, and was promoted to full professor in 1988. He was head of the School of Mathematical Science from 1999 to 2001, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Raphael Yuster
Raphael "Raphy" Yuster () is an Israeli mathematician specializing in combinatorics and graph theory. He is a professor of mathematics at the University of Haifa. He is a recipient of the Nerode Prize for his work on color-coding, and is also known for the Alon–Yuster conjecture relating the chromatic numbers of graphs to the number of disjoint copies of a smaller graph that can be found in a larger one, later proven by János Komlós, Gábor N. Sárközy, and Endre Szemerédi. Education and career Yuster was a student at Tel Aviv University, where he received a bachelor's degree in 1989, a master's degree in 1991, and a Ph.D. in 1995. His doctoral dissertation, ''Non Constructive Graph Theoretic Proofs and Their Algorithmic Aspects'', was supervised by Noga Alon. He has been a faculty member at the University of Haifa since 2004. Recognition With Noga Alon and Uri Zwick, Yuster was a recipient of the 2019 Nerode Prize, given for their work on color coding, an application ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Uri Zwick
Uri Zwick (Hebrew: אורי צוויק) is an Israeli computer scientist and mathematician known for his work on graph algorithms, in particular on distances in graphs and on the color-coding technique for subgraph isomorphism. With Howard Karloff, he is the namesake of the Karloff–Zwick algorithm for approximating the MAX-3SAT problem of Boolean satisfiability. He and his coauthors won the David P. Robbins Prize in 2011 for their work on the block-stacking problem. Zwick earned a bachelor's degree from the Technion – Israel Institute of Technology, and completed his doctorate at Tel Aviv University in 1989 under the supervision of Noga Alon Noga Alon (; born 1956) is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers. Education and career .... He is currently a professor of computer science at Tel Aviv University. References ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Science
Computer science is the study of computation, information, and automation. Computer science spans Theoretical computer science, theoretical disciplines (such as algorithms, theory of computation, and information theory) to Applied science, applied disciplines (including the design and implementation of Computer architecture, hardware and Software engineering, software). Algorithms and data structures are central to computer science. The theory of computation concerns abstract models of computation and general classes of computational problem, problems that can be solved using them. The fields of cryptography and computer security involve studying the means for secure communication and preventing security vulnerabilities. Computer graphics (computer science), Computer graphics and computational geometry address the generation of images. Programming language theory considers different ways to describe computational processes, and database theory concerns the management of re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Minor (graph Theory)
Minor may refer to: Common meanings * Minor (law), a person not under the age of certain legal activities. * Academic minor, a secondary field of study in undergraduate education Mathematics * Minor (graph theory), a relation of one graph to another * Minor (matroid theory), a relation of one matroid to another * Minor (linear algebra), the determinant of a square submatrix Music * Minor chord * Minor interval * Minor key * Minor scale People * Minor (given name), a masculine given name * Minor (surname), a surname Places in the United States * Minor, Alabama, a census-designated place * Minor, Virginia, an unincorporated community * Minor Creek (California) * Minor Creek (Missouri) * Minor Glacier, Wyoming Sports * Minor, a grade in Gaelic games; also, a person who qualifies to play in that grade * Minor league, a sports league not regarded as a premier league ** Minor League Baseball Minor League Baseball (MiLB) is a professional baseball organization ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Wnt Signaling Pathway
In cellular biology, the Wnt signaling pathways are a group of signal transduction pathways which begin with proteins that pass signals into a cell through cell surface receptors. The name Wnt, pronounced "wint", is a portmanteau created from the names Wingless and Int-1. Wnt signaling pathways use either nearby cell-cell communication (paracrine) or same-cell communication (autocrine). They are highly evolutionarily conserved in animals, which means they are similar across animal species from fruit flies to humans. Three Wnt signaling pathways have been characterized: the canonical Wnt pathway, the noncanonical planar cell polarity pathway, and the noncanonical Wnt/calcium pathway. All three pathways are activated by the binding of a Wnt-protein ligand to a Frizzled family receptor, which passes the biological signal to the Dishevelled protein inside the cell. The canonical Wnt pathway leads to regulation of gene transcription, and is thought to be negatively regulated in part ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
NC (complexity)
In computational complexity theory, the class NC (for "Nick's Class") is the set of decision problems decidable in polylogarithmic time on a parallel computer with a polynomial number of processors. In other words, a problem with input size ''n'' is in NC if there exist constants ''c'' and ''k'' such that it can be solved in time using parallel processors. Stephen Cook coined the name "Nick's class" after Nick Pippenger, who had done extensive research on circuits with polylogarithmic depth and polynomial size.Arora & Barak (2009) p.120 As in the case of circuit complexity theory, usually the class has an extra constraint that the circuit family must be ''uniform'' ( see below). Just as the class P can be thought of as the tractable problems ( Cobham's thesis), so NC can be thought of as the problems that can be efficiently solved on a parallel computer.Arora & Barak (2009) p.118 NC is a subset of P because polylogarithmic parallel computations can be simulated by polynomi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jeanette P
Jeanette, Jeannette or Jeanetta may refer to: * Jeanette (given name), a given name (including a list of people and fictional characters with the name) Places * Jeannette, Ontario, Canada * Jeannette Runciman Island, Ontario, Canada * Jeannette Island, Russia * Jeannette, Pennsylvania, U.S. * Jeannette Monument, United States Naval Academy Cemetery, Annapolis, Maryland, U.S. * Jeanette State Forest, Minnesota, U.S. People * Jeanette (Spanish singer) (born 1951), Spanish singer * Jeanette Biedermann, a German singer known mononymously by "Jeanette" * Buddy Jeannette (1917–1998), basketball player and coach * Daniel Jeannette (born 1961), director of animation and FX * Gertrude Jeannette (1914-2018), actress * Gunnar Jeannette (born 1982), racecar driver * Jeanette Jena (1896–1971), American art critic * Joe Jeanette (1879–1958), heavyweight boxer * Stanick Jeannette (born 1977), figure skater * Jeanette Aw (born 1979), Singaporean actress * Jeanne Brousse (1921– 2017), ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Aravind Srinivasan
Aravind (from ') is a common Indian given name, Indian masculine name meaning Nelumbo nucifera, lotus. The name is of Hindu origin. Its variants include Arvind, Aravinda, Aravindan, and Aurobindo (). Meaning ' means lotus in the Sanskrit language. In particular, the word may refer to the Nelumbo nucifera, lotus flower, on which the Hindu goddess of wealth and prosperity – Lakshmi – sits. It could also refer to the Sanskrit term ' (meaning the "lotus eyed one"), the 347th name used to describe the Hindu god Vishnu in the Vishnu Sahasranama. Notable people * Arvind Kejriwal, Indian politician and former bureaucrat * Arvind Khanna, Indian politician and businessman * Arvind Panagariya, Indian-American economist, professor of economics at Columbia University * Arvind Pandey, Indian politician * Arvind (computer scientist), Arvind Mithal, known simply as Arvind, Indian-American professor of Computer Science and Engineering at MIT * Arvind Parmar, British tennis player * Arvin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Leonard J
Leonard or ''Leo'' is a common English masculine given name and a surname. The given name and surname originate from the Old High German '' Leonhard'' containing the prefix ''levon'' ("lion") from the Greek Λέων ("lion") through the Latin '' Leo,'' and the suffix ''hardu'' ("brave" or "hardy"). The name has come to mean "lion strength", "lion-strong", or "lion-hearted". Leonard was the name of a Saint in the Middle Ages period, known as the patron saint of prisoners. Leonard is also an Irish origin surname, from the Gaelic ''O'Leannain'' also found as O'Leonard, but often was anglicised to just Leonard, consisting of the prefix ''O'' ("descendant of") and the suffix ''Leannan'' ("lover"). The oldest public records of the surname appear in 1272 in Huntingdonshire, England, and in 1479 in Ulm, Germany. Variations The name has variants in other languages: * Anard/Nardu/Lewnardu/Leunardu (Maltese) * Leen, Leendert, Lenard (Dutch) * Lehnertz, Lehnert (Luxembourgish) * Len ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Moni Naor
Moni Naor () is an Israeli computer scientist, currently a professor at the Weizmann Institute of Science. Naor received his Ph.D. in 1989 at the University of California, Berkeley. His advisor was Manuel Blum. He works in various fields of computer science, mainly the foundations of cryptography. He is notable for initiating research on public key systems secure against chosen ciphertext attack and creating non-malleable cryptography, visual cryptography (with Adi Shamir), and suggesting various methods for verifying that users of a computer system are human (leading to the notion of CAPTCHA). His research on Small-bias sample space, give a general framework for combining small k-wise independent spaces with small \epsilon-biased spaces to obtain \delta-almost k-wise independent spaces of small size. In 1994 he was the first, with Amos Fiat, to formally study the problem of practical broadcast encryption. Along with Benny Chor, Amos Fiat, and Benny Pinkas, he made a cont ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
