default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarkus A. Hitz
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j5]Jianjun Yang, Bryson Payne, Markus A. Hitz, Yanping Zhang, Ping Guo, Le Li:
Fair Gain Based Dynamic Channel Allocation for Cognitive Radios in Wireless Mesh Networks. J. Comput. 9(10): 2335-2341 (2014)- [j4]Ju Shen, Jianjun Yang, Sami Taha-abusneineh, Bryson Payne
, Markus A. Hitz:
Structure Preserving Large Imagery Reconstruction. J. Cyber Secur. Mobil. 3(3): 263-288 (2014) - [c8]Bryson R. Payne, James F. Lay, Markus A. Hitz:
Automatic 3D object reconstruction from a single image. ACM Southeast Regional Conference 2014: 31:1-31:5 - [c7]Jianjun Yang, Zongming Fei, Bryson Payne, Le Li, Markus A. Hitz, Tongquan Wei:
Location aided energy balancing strategy in green cellular networks. ICCCN 2014: 1-6 - [i2]Jianjun Yang, Bryson Payne, Markus A. Hitz, Zongming Fei, Le Li, Tongquan Wei:
Location Aided Energy Balancing Strategy in Green Cellular Networks. CoRR abs/1406.5258 (2014) - [i1]Ju Shen, Jianjun Yang, Sami Taha-abusneineh, Bryson Payne, Markus A. Hitz:
Structure Preserving Large Imagery Reconstruction. CoRR abs/1409.3906 (2014)
2000 – 2009
- 2007
- [j3]Markus A. Hitz:
ECCAD 2007 poster abstracts. ACM Commun. Comput. Algebra 41(1-2): 12-24 (2007) - 2006
- [c6]Bryson R. Payne, Markus A. Hitz:
Implementation of residue number systems on GPUs. SIGGRAPH Research Posters 2006: 57 - 2005
- [c5]Markus A. Hitz, Farhan Mashraqi:
Cost-effective heterogeneous web clusters. ACM Southeast Regional Conference (1) 2005: 174-175 - [c4]Markus A. Hitz:
On computing nearest singular hankel matrices. ISSAC 2005: 171-176
1990 – 1999
- 1999
- [c3]Markus A. Hitz, Erich L. Kaltofen, Yagati N. Lakshman:
Efficient Algorithms for Computing the Nearest Polynomial with a Real Root and Related Problems. ISSAC 1999: 205-212 - 1998
- [c2]Markus A. Hitz, Erich L. Kaltofen:
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots. ISSAC 1998: 236-243 - 1997
- [e1]Hoon Hong, Erich L. Kaltofen, Markus A. Hitz:
Proceedings of the 2nd International Workshop on Parallel Symbolic Computation, PASCO 1997, July 20-22, 1997, Kihei, Hawaii, USA. ACM 1997, ISBN 0-89791-951-3 [contents] - 1995
- [j2]Angel Díaz, Markus A. Hitz, Erich L. Kaltofen, Austin Lobo, Thomas Valente:
Process Scheduling in DSC and the Large Sparse Linear Systems Challenge. J. Symb. Comput. 19(1-3): 269-282 (1995) - [j1]Markus A. Hitz, Erich L. Kaltofen:
Integer Division in Residue Number Systems. IEEE Trans. Computers 44(8): 983-989 (1995) - 1993
- [c1]Angel Díaz, Markus A. Hitz, Erich L. Kaltofen, Austin Lobo, Thomas Valente:
Process Scheduling in DSC and the Large Sparse Linear Systems Challenge. DISCO 1993: 66-80
Coauthor Index
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.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
