Person:386048

Available identifiers

zbMath Open leiss.ernst-lMaRDI QIDQ386048

List of research outcomes

Publication	Date of Publication	Type
Is Complementation Evil?	2018-09-20	Paper
https://portal.mardi4nfdi.de/entity/Q4636255	2018-04-23	Paper
The worst parallel Hanoi graphs	2017-11-16	Paper
https://portal.mardi4nfdi.de/entity/Q2971221	2017-04-04	Paper
The worst Hanoi graphs	2014-01-10	Paper
On the role of complementation in implicit language equations and relations	2013-12-13	Paper
A Programmer's Companion to Algorithm Analysis	2006-10-04	Paper
Data dependent loop scheduling based on genetic algorithms for distributed and shared memory systems	2004-10-04	Paper
https://portal.mardi4nfdi.de/entity/Q4445611	2004-02-02	Paper
https://portal.mardi4nfdi.de/entity/Q4431226	2003-10-21	Paper
https://portal.mardi4nfdi.de/entity/Q2781848	2002-07-02	Paper
https://portal.mardi4nfdi.de/entity/Q2771931	2002-02-18	Paper
A Heuristic Scheduling of Independent Tasks with Bottleneck Resource Constraints	2000-07-09	Paper
https://portal.mardi4nfdi.de/entity/Q4256623	1999-07-28	Paper
Solving systems of explicit language relations	1998-06-30	Paper
Language equations over a one-letter alphabet with union, concatenation and star: A complete solution	1997-05-11	Paper
https://portal.mardi4nfdi.de/entity/Q5284094	1997-05-11	Paper
Implicit language equations: existence and uniqueness of solutions	1997-02-28	Paper
Unrestricted complementation in language equations over a one-letter alphabet	1994-09-25	Paper
An \(O(\log N)\) algorithm to solve linear recurrences on hypercubes	1994-05-03	Paper
https://portal.mardi4nfdi.de/entity/Q3996559	1993-01-23	Paper
Embedding complete binary trees into hypercubes	1992-06-26	Paper
The effect of statically and dynamically replicated components on system reliability	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3474614	1990-01-01	Paper
On the degree of dominator trees	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3821547	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4732416	1988-01-01	Paper
On testing for immutability of codes (Corresp.)	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3788037	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3792634	1987-01-01	Paper
The inaccessible set: A classification by query type of security risks in statistical databases	1986-01-01	Paper
Generalized language equations with multiple solutions	1986-01-01	Paper
On classes of tractable unrestricted regular expressions	1985-01-01	Paper
Succinct representation of regular languages by Boolean automata. II	1985-01-01	Paper
On solving star equations	1985-01-01	Paper
Division and sign detection algorithms for residue number systems	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3222868	1984-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3758856	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3767369	1983-01-01	Paper
The complexity of restricted regular expressions and the synthesis problem for finite automata	1981-01-01	Paper
On generalized language equations	1981-01-01	Paper
Succinct representation of regular languages by Boolean automata	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3953188	1981-01-01	Paper
On equations for regular languages, finite automata, and sequential networks	1980-01-01	Paper
A note on a signature system based on probabilistic logic	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3900998	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3911414	1980-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3856098	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3856114	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3856115	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3862480	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3863089	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3870328	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3887487	1979-01-01	Paper

Research outcomes over time

This page was built for person: Ernst L. Leiss