default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 39 matches
- 2024
- Carl Kwan, Warren A. Hunt Jr.:
Formalizing the Cholesky Factorization Theorem. ITP 2024: 25:1-25:16 - 2022
- Rahul Sarkar:
An improvement to a result about graph isomorphism networks using the prime factorization theorem. CoRR abs/2205.01214 (2022) - 2021
- Tau Raphael Rasethuntsa, Imran Shafique Ansari:
Applications of Meijer's Factorization Theorems in Performance Analyses of All-Optical Multi-Hop FSO Systems. IEEE Trans. Wirel. Commun. 20(3): 2078-2091 (2021) - 2019
- Arvind Ayyer, Roger E. Behrend:
Factorization theorems for classical group characters, with applications to alternating sign matrices and plane partitions. J. Comb. Theory A 165: 78-105 (2019) - Raymond Mortini:
A Simpler Proof of Cohen's Factorization Theorem. Am. Math. Mon. 126(5): 459-463 (2019) - 2016
- Suman Kumar Tumuluri, T. Amaranath:
A factorization theorem for operators occurring in the Stokes, Brinkman and Oseen equations. Appl. Math. Comput. 276: 75-79 (2016) - Torsten Hoge, Gerhard Röhrle:
Addition-Deletion Theorems for factorizations of Orlik-Solomon algebras and nice arrangements. Eur. J. Comb. 55: 20-40 (2016) - 2015
- Behrooz Nasihatkon, Richard I. Hartley, Jochen Trumpf:
A Generalized Projective Reconstruction Theorem and Depth Constraints for Projective Factorization. Int. J. Comput. Vis. 115(2): 87-114 (2015) - 2014
- Marc Hellmuth, Manuel Noll, Lydia Ostermeier:
Strong products of hypergraphs: Unique prime factorization theorems and algorithms. Discret. Appl. Math. 171: 60-71 (2014) - Shota Murakami, Takeshi Yamazaki, Keita Yokoyama:
On the Ramseyan Factorization Theorem. CiE 2014: 324-332 - 2013
- Ouamporn Phuksuwan, Vichian Laohakosol:
Consequences of a Factorization Theorem for Generalized Exponential Polynomials with Infinitely Many Integer Zeros. Number Theory and Related Fields 2013: 245-252 - Marc Hellmuth, Manuel Noll, Lydia Ostermeier:
Strong Products of Hypergraphs: Unique Prime Factorization Theorems and Algorithms. CoRR abs/1305.1824 (2013) - 2012
- Sergey V. Avgustinovich, Juhani Karhumäki, Svetlana Puzynina:
On abelian versions of critical factorization theorem. RAIRO Theor. Informatics Appl. 46(1): 3-15 (2012) - Brian H. Fralix, Colin M. Gallagher:
A New Proof of the Wiener-Hopf Factorization via Basu's Theorem. J. Appl. Probab. 49(3): 876-882 (2012) - M. C. Câmara, Cristina Diogo, Yu. I. Karlovich, Ilya M. Spitkovsky:
Factorizations, Riemann-Hilbert problems and the corona theorem. J. Lond. Math. Soc. 86(3): 852-878 (2012) - Filippo Mignosi, Antonio Restivo:
Characteristic Sturmian words are extremal for the Critical Factorization Theorem. Theor. Comput. Sci. 454: 199-205 (2012) - David Conti, Nigel Boston:
The Factorization Theorem and new algebraic insights into the theory of linear trellises. Allerton Conference 2012: 144-151 - Beniamino Accattoli:
An Abstract Factorization Theorem for Explicit Substitutions. RTA 2012: 6-21 - 2011
- Peter Mihók, Gabriel Semanisin:
Unique factorization theorem for object-systems. Discuss. Math. Graph Theory 31(3): 559-575 (2011) - Tao Lu, Hong Lu:
On the Factorization Theorem of a Monotone Morphism in a Topos. NL-MUA 2011: 699-706 - 2009
- David Cariolaro, Anthony J. W. Hilton:
An application of Tutte's Theorem to 1-factorization of regular graphs of high degree. Discret. Math. 309(14): 4736-4745 (2009) - 2007
- Francine Blanchet-Sadri, Nathan D. Wetzler:
Partial words and the critical factorization theorem revisited. Theor. Comput. Sci. 385(1-3): 179-192 (2007) - Manfred Kufleitner:
A Proof of the Factorization Forest Theorem. CoRR abs/0710.5130 (2007) - 2006
- Peter Mihók, Gabriel Semanisin:
Unique Factorization Theorem and Formal Concept Analysis. CLA 2006: 232-239 - 2005
- Francine Blanchet-Sadri, S. Duncan:
Partial words and the critical factorization theorem. J. Comb. Theory A 109(2): 221-245 (2005) - Henry Crapo, William Schmitt:
A unique factorization theorem for matroids. J. Comb. Theory A 112(2): 222-249 (2005) - Chiara Epifanio, Filippo Mignosi:
A multidimensional critical factorization theorem. Theor. Comput. Sci. 346(2-3): 265-280 (2005) - 2004
- Hua Mao, Sanyang Liu:
Factorization theorem for strong maps. Discret. Math. 289(1-3): 187-192 (2004) - 2003
- Byoungseon Choi:
A fundamental theorem of algebra, spectral factorization, and stability of two-dimensional systems. IEEE Trans. Signal Process. 51(3): 853-863 (2003) - 2002
- Jesse Hughes, Bart Jacobs:
Factorization systems and fibrations: Toward a fibred Birkhoff variety theorem. CTCS 2002: 156-182
skipping 9 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-09-24 06:00 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint