Peter Eliaš

Available identifiers

zbMath Open elias.peterWikidataQ102344394 ScholiaQ102344394MaRDI QIDQ682666

List of research outcomes

Publication	Date of Publication	Type
Heterogeneous formal context and its decomposition by heterogeneous fuzzy subsets	2023-10-31	Paper
Connecting concept lattices with bonds induced by external information	2023-09-22	Paper
Conditional probability on full Łukasiewicz tribes	2022-07-11	Paper
Divisible extension of probability	2021-01-21	Paper
A Galois connection related to restrictions of continuous real functions	2019-09-11	Paper
Factorization of observables	2018-02-05	Paper
On the Convergence of a Mapped by a Function	2015-06-08	Paper
Dirichlet sets, Erdős-Kunen-Mauldin theorem, and analytic subgroups of the reals	2011-06-09	Paper
Dirichlet sets and Erdos-Kunen-Mauldin theorem	2007-12-13	Paper
https://portal.mardi4nfdi.de/entity/Q3369021	2006-02-10	Paper
https://portal.mardi4nfdi.de/entity/Q4828465	2004-11-19	Paper
Covering for category and trigonometric thin sets	2003-07-28	Paper
A hierarchy of thin sets related to the boundedness of trigonometric series	2000-10-03	Paper
https://portal.mardi4nfdi.de/entity/Q4355832	1997-11-16	Paper
https://portal.mardi4nfdi.de/entity/Q4857230	1997-06-19	Paper
A classification of trigonometrical thin sets and their interrelations	1997-04-08	Paper
Error-correcting codes for list decoding	1991-01-01	Paper
Zero error capacity under list decoding	1989-01-01	Paper
Interval and recency rank source coding: Two on-line adaptive variable-length schemes	1987-01-01	Paper
Minimax optimal universal codeword sets	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4141093	1977-01-01	Paper
Complexity of acceptors for prefix codes (Corresp.)	1976-01-01	Paper
Universal codeword sets and representations of the integers	1975-01-01	Paper
Distinguishable codeword sets for shared memory	1975-01-01	Paper
The Complexity of Some Simple Retrieval Problems	1975-01-01	Paper
Minimum times and memories needed to compute the values of a function	1974-01-01	Paper
The Noisy Channel Coding Theorem for Erasure Channels	1974-01-01	Paper
Efficient Storage and Retrieval by Content and Address of Static Files	1974-01-01	Paper
A note on the \(\varepsilon\)-entropy of monotone functions in the Levy norm	1973-01-01	Paper
The Efficient Construction of an Unbiased Random Sequence	1972-01-01	Paper
Bounds on performance of optimum quantizers	1970-01-01	Paper
Bounds and Asymptotes for the Performance of Multivariate Quantizers	1970-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5626487	1970-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5584995	1968-01-01	Paper
Networks of Gaussian channels with applications to feedback systems	1967-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5736448	1963-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5722607	1962-01-01	Paper
URSI National Committee Report: Commission 6. Radio Waves and Circuits. Part 1. Information Theory and Coding	1960-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Peter Eliaš