default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMustafa Atici
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c6]Lakshmi Narasimha Devulapalli Venkata, Mustafa Atici:
Application of Huffman data compression algorithm in hashing computation. ACM Southeast Regional Conference 2018: 49:1- 2017
- [j9]Ferhan M. Atici, Mustafa Atici, Michael Belcher, Dana Marshall:
A New Approach for Modeling with Discrete Fractional Equations. Fundam. Informaticae 151(1-4): 313-324 (2017) - 2016
- [c5]Mustafa Atici:
Efficient Algorithm to Construct Perfect Secret Sharing Scheme for a Given Access Structure. CISRC 2016: 2:1-2:7 - 2015
- [i2]Bryan A. Knowles, Mustafa Atici:
Proposed Approximate Dynamic Programming for Pathfinding under Visible Uncertainty. CoRR abs/1512.00519 (2015) - 2014
- [j8]Ferhan M. Atici, Mustafa Atici, Ngoc Nguyen:
Parameter estimations of sigmoidal models of cancer. BMC Bioinform. 15(S-10): P15 (2014) - [i1]Bryan Knowles, Mustafa Atici:
Fault-Tolerant, but Paradoxical Path-Finding in Physical and Conceptual Systems. CoRR abs/1406.2234 (2014) - 2013
- [c4]Mustafa Atici:
Vector space secret sharing and an efficient algorithm to construct a φ function. ACM Southeast Regional Conference 2013: 33:1-33:5 - 2012
- [c3]Mustafa Atici:
Secret Sharing Scheme: Vector Space Secret Sharing and F Function. ASONAM 2012: 914-918 - 2011
- [j7]Mustafa Atici, Claus Ernst:
On the Range of Possible Integrities of Graphs G(n, k). Graphs Comb. 27(4): 475-485 (2011) - [c2]Mustafa Atici:
Graph coloring: color sequences and algorithm for color sequence. ACM Southeast Regional Conference 2011: 150-154
2000 – 2009
- 2009
- [j6]Mustafa Atici, Robert Crawford, Claus Ernst:
The integrity of small cage graphs. Australas. J Comb. 43: 39-56 (2009) - 2007
- [j5]Mustafa Atici:
(t, k)-Geodetic Set of a Graph. Ars Comb. 82 (2007) - 2004
- [j4]Mustafa Atici, Robert Crawford, Claus Ernst:
New upper bounds for the integrity of cubic graphs. Int. J. Comput. Math. 81(11): 1341-1348 (2004) - 2003
- [j3]Mustafa Atici:
On The Edge Geodetic Number of a Graph. Int. J. Comput. Math. 80(7): 853-861 (2003) - 2002
- [j2]Mustafa Atici, Andrew Vince
:
Geodesics in Graphs, an Extremal Set Problem, and Perfect Hash Families. Graphs Comb. 18(3): 403-413 (2002) - [j1]Mustafa Atici:
Computational Complexity of Geodetic Set. Int. J. Comput. Math. 79(5): 587-591 (2002)
1990 – 1999
- 1996
- [c1]Mustafa Atici, Douglas R. Stinson:
Universal Hashing and Multiple Authentication. CRYPTO 1996: 16-30
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 2025-01-07 01:18 CET 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:
