DMTCS - researchr conference series publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 81 from 81

2003

Listing Vertices of Simple Polyhedra Associated with Dual LI(2) SystemsSammani D. Abdullahi, Martin E. Dyer, Les G. Proll. dmtcs 2003: 89-96 [doi]

Automatic Forcing and Genericity: On the Diagonalization Strength of Finite AutomataKlaus Ambos-Spies, Edgar Busse. dmtcs 2003: 97-108 [doi]

On the Order Dual of a Riesz SpaceMarian Alexandru Baroni. dmtcs 2003: 109-117 [doi]

A Finite Complete Set of Equations Generating GraphsSymeon Bozapalidis, Antonios Kalampakas. dmtcs 2003: 118-128 [doi]

Discrete Mathematics and Theoretical Computer Science, 4th International Conference, DMTCS 2003, Dijon, France, July 7-12, 2003. ProceedingsCristian Calude, Michael J. Dinneen, Vincent Vajnovszki, editors, Volume 2731 of Lecture Notes in Computer Science, Springer, 2003.

Two Philosophical Applications of Algorithmic Information TheoryGregory J. Chaitin. dmtcs 2003: 1-10 [doi]

Regular Expressions with Timed DominoesCatalin Dima. dmtcs 2003: 141-154 [doi]

Covering and Secret Sharing with Linear CodesCunsheng Ding, Jin Yuan. dmtcs 2003: 11-25 [doi]

On Infinitary Rational Relations and Borel SetsOlivier Finkel. dmtcs 2003: 155-167 [doi]

Efficient Algorithms for Disjoint Matchings among Intervals and Related ProblemsFrédéric Gardi. dmtcs 2003: 168-180 [doi]

On Functions and RelationsAndré Große, Harald Hempel. dmtcs 2003: 181-192 [doi]

Combinatorial Problems Arising in SNP and Haplotype AnalysisBjarni V. Halldórsson, Vineet Bafna, Nathan Edwards, Ross Lippert, Shibu Yooseph, Sorin Istrail. dmtcs 2003: 26-47 [doi]

Paths Coloring Algorithms in Mesh NetworksMustapha Kchikech, Olivier Togni. dmtcs 2003: 193-202 [doi]

Finite State Strategies in One Player McNaughton GamesBakhadyr Khoussainov. dmtcs 2003: 203-214 [doi]

On Algebraic Expressions of Series-Parallel and Fibonacci GraphsMark Korenblit, Vadim E. Levit. dmtcs 2003: 215-224 [doi]

Boolean NP-Partitions and Projective ClosureSven Kosub. dmtcs 2003: 225-236 [doi]

On Unimodality of Independence Polynomials of Some Well-Covered TreesVadim E. Levit, Eugen Mandrescu. dmtcs 2003: 237-256 [doi]

ECO Method and the Exhaustive Generation of Convex PolyominoesAlberto Del Lungo, Andrea Frosini, Simone Rinaldi. dmtcs 2003: 129-140 [doi]

Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A SurveyMaurice Margenstern. dmtcs 2003: 48-72 [doi]

A Coloring Algorithm for Finding Connected Guards in Art GalleriesVal Pinciu. dmtcs 2003: 257-264 [doi]

An Analysis of Quantified Linear ProgramsK. Subramani. dmtcs 2003: 265-277 [doi]

An Efficient Branch-and-Bound Algorithm for Finding a Maximum CliqueEtsuji Tomita, Tomokazu Seki. dmtcs 2003: 278-289 [doi]

Generating Gray Codes in O(1) Worst-Case Time per WordTimothy Walsh. dmtcs 2003: 73-88 [doi]

On the Monotonic Computability of Semi-computable Real NumbersXizhong Zheng, George Barmpalias. dmtcs 2003: 290-300 [doi]

2001

Apartness as a Relation Between SubsetsPeter Schuster 0001, Luminita Vîta, Douglas S. Bridges. dmtcs 2001: 203-214 [doi]

Some Results for Some Conjectures in Addition ChainsHatem M. Bahig, Mohamed H. El-Zahar, Ken Nakamula. dmtcs 2001: 47-54 [doi]

A Highly Random NumberVerónica Becher, Sergio Daicz, Gregory J. Chaitin. dmtcs 2001: 55-68 [doi]

Dini's Theorem: A Constructive Case StudyDouglas S. Bridges. dmtcs 2001: 69-80 [doi]

Combinatorics, Computability and Logic, Proceedings of the Third International Conference on Combinatorics, Computability and Logic, DMTCS 20Ol, Constanta, RomaniaCristian S. Calude, Michael J. Dinneen, Silviu Sburlan, editors, Discrete mathematics and theoretical computer science, Springer, 2001. [doi]

Even Linear Simple Matrix Languages: Formal Language AspectsHenning Fernau. dmtcs 2001: 81-96 [doi]

Pseudo-BCK Algebras: An Extension of BCK AlgebrasGeorge Georgescu, Afrodita Iorgulescu. dmtcs 2001: 97-114 [doi]

Early Computer Science Adventures of a MathematicianFrank Harary. dmtcs 2001: 1-4 [doi]

P-Immune Sets with Holes Lack Self-Reducibility PropertiesLane A. Hemaspaandra, Harald Hempel. dmtcs 2001: 115-124 [doi]

Lex Ideals of Generalized MV-AlgebrasDaniel Hort, Jirí Rachunek. dmtcs 2001: 125-136 [doi]

Sequentially Continuity in Constructive MathematicsHajime Ishihara. dmtcs 2001: 5-12 [doi]

Armstrong Systems on Ordered SetsJouni Järvinen. dmtcs 2001: 137-149 [doi]

Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum MatchingsVadim E. Levit, Eugen Mandrescu. dmtcs 2001: 151-157 [doi]

Recursive Functions: An Archeological LookPiergiorgio Odifreddi. dmtcs 2001: 13-31 [doi]

On Relax-ability of Word-Order by D-grammarsMartin Plátek, Tomás Holan, Vladislav Kubon. dmtcs 2001: 159-173 [doi]

On the Structure of Linear Cellular AutomataAdriana Popovici, Dan Popovici. dmtcs 2001: 175-185 [doi]

Monotonically Computable Real NumbersRobert Rettinger, Xizhong Zheng, Romain Gengler, Burchard von Braunmühl. dmtcs 2001: 187-201 [doi]

How Large is the Set of Disjunctive Sequences?Ludwig Staiger. dmtcs 2001: 215-225 [doi]

The Number of Graphs and Digraphs with a Fixed Diameter and ConnectivityIoan Tomescu. dmtcs 2001: 33-46 [doi]

A Loopless Generation of Bitstrings without p Consecutive OnesVincent Vajnovszki. dmtcs 2001: 227-240 [doi]

Greedy Algorithms for the Lower and Upper Chromatic NumbersVitaly I. Voloshin. dmtcs 2001: 241-251 [doi]

1996

Recognizing Diameter Critical GraphsRichard P. Anstee, Lou Caccetta. dmtcs 1996: 105-112

Quantum Electronic Devices Based on Metal-Dielectric Transition in Low-Dimensional Quantum StructuresIoannis Antoniou, Boris Pavlov, Adil Yafsayov. dmtcs 1996: 90-104

The Hadwiger Number for the Product of Two CyclesDan Archdeacon, C. Paul Bonnington, John Pearson, Jozef Sirán. dmtcs 1996: 113-120

Proper Bounded Edge-ColoringsClaudia Bertram-Kretzberg, Hanno Lefmann, Vojtech Rödl, Beata Wysocka. dmtcs 1996: 121-130

Sharply Bounded Alternation within PStephen A. Bloch, Jonathan F. Buss, Judy Goldsmith. dmtcs 1996: 131-146

A Note on the Growth Rate of Planar GraphsNeal Brand, Margaret Morton. dmtcs 1996: 147-157

First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, DMTCS 1996, Auckland, New Zealand, December, 9-13, 1996Douglas S. Bridges, Cristian S. Calude, Jeremy Gibbons, Steve Reeves, Ian H. Witten, editors, Springer-Verlag, Singapore, 1996. [doi]

An Invitation to Algorithmic Information TheoryGregory J. Chaitin. dmtcs 1996: 1-23

Secret Sharing Schemes Based on Room SquaresGhulam Rasool Chaudhry, Jennifer Seberry. dmtcs 1996: 158-167

Discrete Isoperimetric InequalitiesFan Chung. dmtcs 1996: 24-24

Graph Classes between Parity and Distance-Hereditary GraphsSerafino Cicerone, Gabriele Di Stefano. dmtcs 1996: 168-181

N(n), v(n): Similarities and DifferencesCharles J. Colbourn, Jeffrey H. Dinitz. dmtcs 1996: 25-37

Sierpinski's Gasket, 2-Groups and Graph SymmetriesMarston D. E. Conder, Cameron G. Walker. dmtcs 1996: 182-186

The Parameterized Complexity of Relational Database Queries and an Improved Characterization of W[1]Rodney G. Downey, Michael R. Fellows, Udayan Taylor. dmtcs 1996: 194-213

A New Pumping Property of Context-Free LanguagePál Dömösi, Masami Ito, Masashi Katsura, Chrystopher L. Nehaniv. dmtcs 1996: 187-193

Forbidding, EnforcingAndrzej Ehrenfeucht, Grzegorz Rozenberg. dmtcs 1996: 37-37

On the Logical Definability of Some Maximum Leaves ProblemsGiulia Galbiati, Angelo Morzenti, Francesco Maffioli. dmtcs 1996: 214-225

The Functional Lambda Abstraction Algebras Form a VarietyRobert Goldblatt. dmtcs 1996: 226-243

A Formalization of Anytime Constraint SatisfactionHans W. Guesgen. dmtcs 1996: 244-252

The Generating Functions of Lambda TermsRyu Hasegawa. dmtcs 1996: 253-263

Constructive Programming: A Personal ViewSusumu Hayashi. dmtcs 1996: 38-51

Effectivity and Effective Continuity of Functions between Computable Metric SpacesPeter Hertling. dmtcs 1996: 264-275

On Shuffle Closure of Commutative Regular LanguagesBalázs Imreh, Masami Ito, Masashi Katsura. dmtcs 1996: 276-288

Combinatorial Properties of Sequences in Groups and SemiringsAndrei Kelarev. dmtcs 1996: 289-298

Categoricity and Scott FamiliesBakhadyr Khoussainov, Richard A. Shore. dmtcs 1996: 299-307

A Process Algebraic View of Linear LogicPadmanabhan Krishnan, Jane Hopkins. dmtcs 1996: 308-320

Set AutomataKlaus-Jörn Lange, Klaus Reinhardt. dmtcs 1996: 321-329

A Condition for a Normal Semicycle to Separate an Orientable 3-GraphCharles H. C. Little, Bruce van-Brunt. dmtcs 1996: 330-337

A New Proof Search Method for Linear LogicSatoshi Matsuoka. dmtcs 1996: 338-350

Computability Structures on Metric SpacesTakakazu Mori, Yoshiki Tsujii, Mariko Yasugi. dmtcs 1996: 351-362

Indiscreet Applications of Discrete MathematicsPiergiorgio Odifreddi. dmtcs 1996: 52-65

EDTOL Structural Equivalence is DecidableKai Salomaa, Sheng Yu. dmtcs 1996: 363-375

k-Regular MatroidsCharles Semple. dmtcs 1996: 376-386

Representations versus Numberings: On Two Computability NotionsDieter Spreen. dmtcs 1996: 387-401

The Role of Kripke Semantics in Reasoning of Knowledge and TimeMouw-Ching Tjiok. dmtcs 1996: 402-422

A Foundation for Computable AnalysisKlaus Weihrauch. dmtcs 1996: 66-89

Sign in or sign up to see more results.

runs on WebDSL