default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTadej Tuma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j14]Iztok Fajfar
, Ziga Rojec, Árpád Bürmen, Matevz Kunaver, Tadej Tuma, Saso Tomazic, Janez Puhan:
Imperative Genetic Programming. Symmetry 16(9): 1146 (2024)
2010 – 2019
- 2018
- [j13]Iztok Fajfar, Tadej Tuma:
Creation of Numerical Constants in Robust Gene Expression Programming. Entropy 20(10): 756 (2018) - 2016
- [j12]Gasper Korinsek, Maja Derlink, Meta Virant-Doberlet, Tadej Tuma:
An autonomous system of detecting and attracting leafhopper males using species- and sex-specific substrate borne vibrational signals. Comput. Electron. Agric. 123: 29-39 (2016) - 2015
- [j11]Árpád Bürmen, Jernej Olensek, Tadej Tuma:
Mesh adaptive direct search with second directional derivative-based Hessian update. Comput. Optim. Appl. 62(3): 693-715 (2015) - 2011
- [j10]Jernej Olensek, Tadej Tuma, Janez Puhan, Árpád Bürmen:
A new asynchronous parallel global optimization method based on simulated annealing and differential evolution. Appl. Soft Comput. 11(1): 1481-1489 (2011) - [j9]Gregor Cijan, Tadej Tuma, Árpád Bürmen:
Direct search approach to integrated circuit sizing for high parametric yield. IET Circuits Devices Syst. 5(1): 37-45 (2011)
2000 – 2009
- 2009
- [j8]Gregor Cijan, Tadej Tuma, Árpád Bürmen:
A Direct Search Method for Worst Case Analysis and Yield Optimization of Integrated Circuits. J. Circuits Syst. Comput. 18(7): 1185-1204 (2009) - [j7]Jernej Olensek, Árpád Bürmen, Janez Puhan, Tadej Tuma:
DESA: a new hybrid global optimization method and its application to analog integrated circuit sizing. J. Glob. Optim. 44(1): 53-77 (2009) - [c3]Gregor Cijan, Tadej Tuma, Árpád Bürmen:
A direct search method for finding the worst performance measure in integrated circuit design. ECCTD 2009: 485-488 - 2008
- [j6]Árpád Bürmen, Tadej Tuma, Iztok Fajfar:
A Combined Simplex-trust-Region Method for Analog Circuit Optimization. J. Circuits Syst. Comput. 17(1): 123-140 (2008) - 2007
- [j5]Árpád Bürmen, Tadej Tuma:
Sprouting search - an algorithmic framework for asynchronous parallel unconstrained optimization. Optim. Methods Softw. 22(5): 755-776 (2007) - [c2]Árpád Bürmen, Iztok Fajfar, Tadej Tuma:
Combined simplex-trust-region optimization algorithm for automated IC design. ECCTD 2007: 543-546 - 2006
- [j4]Árpád Bürmen, Janez Puhan, Tadej Tuma:
Grid Restrained Nelder-Mead Algorithm. Comput. Optim. Appl. 34(3): 359-375 (2006) - 2003
- [c1]Árpád Bürmen, Janez Puhan, Tadej Tuma:
Defining Cost Functions for Robust IC Design and Optimization. DATE 2003: 20196-20201
1990 – 1999
- 1998
- [j3]Iztok Fajfar, Franc Bratkovic, Tadej Tuma, Janez Puhan:
A rigorous design method for binary cellular neural networks. Int. J. Circuit Theory Appl. 26(4): 365-373 (1998) - 1997
- [j2]Tadej Tuma:
Letter to the editor: some application notes on reduction operators. Int. J. Circuit Theory Appl. 25(2): 141-145 (1997) - 1994
- [j1]Tadej Tuma, Franc Bratkovic:
A general approach to circuit equations. Int. J. Circuit Theory Appl. 22(6): 431-445 (1994)
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-11-07 21:30 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:
