Skip to search formSkip to main contentSkip to account menu

Pavol Hell

Pavol Hell is a Canadian mathematician and computer scientist, born in Czechoslovakia. He is a professor of computing science at Simon Fraser… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
AlgorithmComputer scientistDavid G. KirkpatrickGraph homomorphism

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Selection of the Best Alternative of Heating System by Environmental Impact Assessment—Case Study
The Framework Directive 2009/28/EC on the promotion of the use of energy from renewable sources aims at developing the local and… 
2017
2017
Tribological Properties of WC-Co/NiCrBSi and Mo/NiCrBSi Plasma Spray Coatings under Boundary Lubrication Conditions
The tungsten carbide based WC-Co/NiCrBSi (50/50) and molybdenum based Mo/NiCrBSi (75/25) coatings were investigated under… 
2014
2014
On the subgraph epimorphism problem
Highly Cited
2013
Highly Cited
2013
One-Bit Compressed Sensing: Provable Support and Vector Recovery
In this paper, we study the problem of one-bit compressed sensing (1-bit CS), where the goal is to design a measurement matrix A… 
2011
2011
Characterization and recognition of P4-sparse graphs partitionable into k independent sets and l cliques
2010
2010
Neglected legume crops of Serbia: Faba bean (Vicia faba)
Faba bean is cultivated locally in Serbia with no available official data. The collection at Institute of Field and Vegetable… 
2006
2006
CHAOS-BASED TRUE RANDOM NUMBER GENERATOR EMBEDDED IN A MIXED-SIGNAL RECONFIGURABLE HARDWARE
The paper presents a chaos-based True Random Number Generator (TRNG) implemented in commercially available mixed-signal PSoC… 
2005
2005
Stress Response in Dairy Cows Related to Blood Glucose
MudroA P., J. Rehage, H. P. Sallmann, M. Holtershinken, H. Scholz: Stress Response in Dairy Cows Related to Blood Glucose. Acta… 
2004
2004
Computational complexity of compaction to irreflexive cycles
  • N. Vikas
  • Journal of computer and system sciences (Print)
  • 2004
  • Corpus ID: 44700939
Highly Cited
1999
Highly Cited
1999
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
This paper starts with the project of finding a large subclass of NP which exhibits a dichotomy. The approach is to find this… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)