default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZbigniew J. Czech
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c29]Amit Dua, Pavel Krömer, Zbigniew J. Czech, Tomasz Jastrzab
:
Genetic Algorithm with Heuristic Mutation for Wireless Sensor Network Optimization. INCoS 2023: 177-189- 2022
- [j11]Tomasz Jastrzab, Zbigniew J. Czech, Wojciech Wieczorek:
An adaptive parallel algorithm for finite language decomposition. Appl. Intell. 52(3): 3029-3050 (2022) - [c28]Amit Dua, Pavel Krömer, Zbigniew J. Czech, Tomasz Jastrzab:
A Bi-objective Genetic Algorithm for Wireless Sensor Network Optimization. CISIS 2022: 147-159 - [c27]Amit Dua, Tomasz Jastrzab, Zbigniew J. Czech, Pavel Krömer:
A Randomized Algorithm for Wireless Sensor Network Lifetime Optimization. Q2SWinet 2022: 87-93 - 2021
- [j10]Tomasz Jastrzab, Zbigniew J. Czech, Wojciech Wieczorek:
Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference. Fundam. Informaticae 178(3): 203-227 (2021) - 2020
- [c26]Tomasz Jastrzab, Zbigniew J. Czech, Wojciech Wieczorek:
Generating Minimal Nondeterministic Finite Automata Using a Parallel Algorithm. ISPDC 2020: 37-43
2010 – 2019
- 2017
- [b1]Zbigniew J. Czech:
Introduction to Parallel Computing. Cambridge University Press 2017, ISBN 9781316795835 - 2015
- [c25]Tomasz Jastrzab, Zbigniew J. Czech, Wojciech Wieczorek:
A Parallel Algorithm for Decomposition of Finite Languages. PARCO 2015: 401-410 - [c24]Tomasz Jastrzab, Zbigniew J. Czech, Wojciech Wieczorek:
Parallel Induction of Nondeterministic Finite Automata. PPAM (1) 2015: 248-257 - 2014
- [i1]Jakub Nalepa, Zbigniew J. Czech:
A Parallel Memetic Algorithm to Solve the Vehicle Routing Problem with Time Windows. CoRR abs/1402.6942 (2014) - 2013
- [c23]Miroslaw Blocho, Zbigniew J. Czech:
A Parallel Memetic Algorithm for the Vehicle Routing Problem with Time Windows. 3PGCIC 2013: 144-151 - [c22]Jakub Nalepa, Zbigniew J. Czech:
New Selection Schemes in a Memetic Algorithm for the Vehicle Routing Problem with Time Windows. ICANNGA 2013: 396-405 - [c21]Jakub Nalepa, Miroslaw Blocho, Zbigniew J. Czech:
Co-operation Schemes for the Parallel Memetic Algorithm. PPAM (1) 2013: 191-201 - 2012
- [c20]Miroslaw Blocho, Zbigniew J. Czech:
A Parallel EAX-based Algorithm for Minimizing the Number of Routes in the Vehicle Routing Problem with Time Windows. HPCC-ICESS 2012: 1239-1246 - 2011
- [c19]Miroslaw Blocho, Zbigniew J. Czech:
A Parallel Algorithm for Minimizing the Number of Routes in the Vehicle Routing Problem with Time Windows. PPAM (1) 2011: 255-265
2000 – 2009
- 2009
- [c18]Zbigniew J. Czech, Wojciech Mikanik, Rafal Skinderowicz:
Implementing a Parallel Simulated Annealing Algorithm. PPAM (1) 2009: 146-155 - 2008
- [c17]Zbigniew J. Czech:
Statistical measures of a fitness landscape for the vehicle routing problem. IPDPS 2008: 1-8 - 2007
- [c16]Agnieszka Debudaj-Grabysz, Zbigniew J. Czech:
Theoretical and Practical Issues of Parallel Simulated Annealing. PPAM 2007: 189-198 - 2006
- [c15]Zbigniew J. Czech:
Speeding Up Sequential Simulated Annealing by Parallelization. PARELEC 2006: 349-356 - [c14]Zbigniew J. Czech, Bozena Wieczorek:
Solving Bicriterion Optimization Problems by Parallel Simulated Annealing. PDP 2006: 7-14 - 2005
- [c13]Zbigniew J. Czech, Bozena Wieczorek:
Frequency of Co-operation of Parallel Simulated Annealing Processes. PPAM 2005: 43-50 - 2004
- [c12]Agnieszka Debudaj-Grabysz, Zbigniew J. Czech:
A Concurrent Implementation of Simulated Annealing and its Application to the VRPTW Optimization Problem. DAPSYS 2004: 201-209 - 2003
- [c11]Mariusz Boryczka, Zbigniew J. Czech, Wojciech Wieczorek:
Ant Colony Programming for Approximation Problems. GECCO 2003: 142-143 - [c10]Piotr Czarnas, Zbigniew J. Czech, Przemyslaw Gocyla:
Parallel Simulated Annealing for Bicriterion Optimization Problems. PPAM 2003: 233-240 - 2002
- [c9]Mariusz Boryczka, Zbigniew J. Czech:
Solving Approximation Problems by Ant Colony Programming. GECCO Late Breaking Papers 2002: 39-46 - [c8]Mariusz Boryczka, Zbigniew J. Czech:
Solving Approximation Problems By Ant Colony Programming. GECCO 2002: 133 - [c7]Wojciech Wieczorek, Zbigniew J. Czech:
Selection Schemes in Evolutionary Algorithms. Intelligent Information Systems 2002: 185-194 - [c6]Zbigniew J. Czech, Piotr Czarnas:
Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows. PDP 2002: 376- - 2001
- [c5]Zbigniew J. Czech:
Parallel Simulated Annealing for the Delivery Problem. PDP 2001: 219-226 - [c4]Zbigniew J. Czech:
Three Parallel Algorithms for Simulated Annealing. PPAM 2001: 210-217 - 2000
- [c3]Zbigniew J. Czech:
Parallel simulated annealing for the set-partitioning problem. PDP 2000: 343-350
1990 – 1999
- 1998
- [j9]Zbigniew J. Czech:
Quasi-Perfect Hashing. Comput. J. 41(6): 416-421 (1998) - [j8]Zbigniew J. Czech, Wojciech Mikanik:
Randomized PRAM Simulation. Fundam. Informaticae 36(4): 317-336 (1998) - 1997
- [j7]Zbigniew J. Czech, George Havas, Bohdan S. Majewski:
Perfect Hashing. Theor. Comput. Sci. 182(1-2): 1-143 (1997) - 1996
- [j6]Bohdan S. Majewski, Nicholas C. Wormald, George Havas, Zbigniew J. Czech:
A Family of Perfect Hashing Methods. Comput. J. 39(6): 547-554 (1996) - [c2]Zbigniew J. Czech, Wojciech Mikanik:
Randomized PRAM Simulation Using T9000 Transputers. HPCN Europe 1996: 736-743 - 1993
- [j5]Zbigniew J. Czech, Bohdan S. Majewski:
A Linear Time Algorithm for Finding Minimal Perfect Hash Functions. Comput. J. 36(6): 579-587 (1993) - [j4]Zbigniew J. Czech, Marek Konopka, Bohdan S. Majewski:
Parallel Algorithms for Finding a Suboptimal Fundamental-Cycle Set in a Graph. Parallel Comput. 19(9): 961-971 (1993) - [c1]George Havas, Bohdan S. Majewski, Nicholas C. Wormald, Zbigniew J. Czech:
Graphs, Hypergraphs and Hashing. WG 1993: 153-165 - 1992
- [j3]Zbigniew J. Czech, George Havas, Bohdan S. Majewski:
An Optimal Algorithm for Generating Minimal Perfect Hash Functions. Inf. Process. Lett. 43(5): 257-264 (1992)
1980 – 1989
- 1988
- [j2]Zbigniew J. Czech:
Efficient Implementation of Detection of Undefined Variables. Comput. J. 31(6): 545-549 (1988) - 1984
- [j1]Zbigniew J. Czech:
A region analysis algorithm for the live variables problem. Computing 33(3-4): 193-210 (1984)
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-08-05 21:20 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:
