Person:235683: Difference between revisions

From MaRDI portal
Person:235683
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Giora Slutzki to Giora Slutzki: Duplicate
 
(No difference)

Latest revision as of 16:43, 9 December 2023

Available identifiers

zbMath Open slutzki.gioraWikidataQ102200628 ScholiaQ102200628MaRDI QIDQ235683

List of research outcomes





PublicationDate of PublicationType
Using sparsification for parametric minimum spanning tree problems2022-12-09Paper
Parametric problems on graphs of bounded tree-width2022-12-09Paper
Optimal parametric search on graphs of bounded tree-width2022-12-09Paper
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs2022-08-16Paper
An algorithm for searching a polygonal region with a flashlight2017-09-29Paper
A Conceptual Framework for Secrecy-preserving Reasoning in Knowledge Bases2015-09-17Paper
Tree transducers, L systems and two-way machines (Extended Abstract)2014-03-14Paper
PS\textsc{pace} tableau algorithms for acyclic modalized \({\mathcal{ALC}}\)2013-07-05Paper
Package-Based Description Logics2009-06-09Paper
CLEARING A POLYGON WITH TWO 1-SEARCHERS2009-05-19Paper
Parametric multiple sequence alignment and phylogeny construction2007-04-26Paper
Scoring of web pages and tournaments-axiomatizations2006-08-18Paper
Ranking participants in generalized tournaments2005-08-17Paper
AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT2004-09-29Paper
https://portal.mardi4nfdi.de/entity/Q44303032003-10-20Paper
https://portal.mardi4nfdi.de/entity/Q44303142003-10-20Paper
A duality theory for bilattices2003-04-23Paper
COMPUTATIONAL COMPLEXITY OF GENERATORS AND NONGENERATORS IN ALGEBRA2003-02-09Paper
Bounds for parametric sequence comparison2002-06-24Paper
Computational complexity of some problems involving congruences on algebras2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27239412001-07-08Paper
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras2000-10-18Paper
COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE2000-01-20Paper
https://portal.mardi4nfdi.de/entity/Q42510481999-11-29Paper
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs1998-07-22Paper
Optimal Parametric Search on Graphs of Bounded Tree-Width1997-07-06Paper
https://portal.mardi4nfdi.de/entity/Q31299221997-05-28Paper
Deterministic top-down tree transducers with iterated look-ahead1997-02-28Paper
Multi-valued logic programming semantics An algebraic approach1997-02-28Paper
A scheme to construct distance-three codes using Latin squares, with applications to the \(n\)-cube1997-02-27Paper
A hierarchy of deterministic top-down tree transformations1996-06-27Paper
The complexity of optimizing finite-state transducers1996-01-28Paper
Independence numbers of product graphs1994-09-22Paper
Parametric Problems on Graphs of Bounded Tree-Width1994-05-05Paper
https://portal.mardi4nfdi.de/entity/Q42842651994-04-17Paper
A note on the equivalence of a set of egds to a set of FDs1994-04-05Paper
https://portal.mardi4nfdi.de/entity/Q52864791993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40329851993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40051791992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q33575411990-01-01Paper
Comparisons between some pumping conditions for context-free languages1989-01-01Paper
Solving parametric problems on trees1989-01-01Paper
The interchange or pump (di)lemmas for context-free languages1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37875031988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38200071988-01-01Paper
Ogden's lemma for nonterminal bounded languages1986-01-01Paper
Alternating tree automata1985-01-01Paper
Extended macro grammars and stack controlled machines1984-01-01Paper
Finite state relational programs1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36740661983-01-01Paper
Transductions of dags and trees1982-01-01Paper
Automatic Programming of Finite State Linear Programs1981-01-01Paper
Parallel and two-way automata on directed ordered acyclic graphs1981-01-01Paper
Tree transducers, L systems, and two-way machines1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38834681980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30498351979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38687911979-01-01Paper
Bounded nesting in macro grammars1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41396411977-01-01Paper
On the non-compactness of the class of program schemas1973-01-01Paper

Research outcomes over time

This page was built for person: Giora Slutzki