Stem determinist$ (all stems)

413 papers:

CASE-2015-BaeM #markov #modelling #multi #random

Markovian modeling of multiclass deterministic flow lines with random arrivals: The case of a single-channel (SYB, JRM), pp. 649–654.

CASE-2015-HeLG #graph #optimisation

Cycle time optimization of deterministic timed weighted marked graphs (ZH, ZL, AG), pp. 274–279.

DATE-2015-PoplavkoSBBB #execution #modelling #multi #realtime

Models for deterministic execution of real-time multiprocessor applications (PP, DS, PB, SB, MB), pp. 1665–1670.

TACAS-2015-KiniV #automaton #ltl #probability

Limit Deterministic and Probabilistic Automata for LTL ∖ GU (DK, MV), pp. 628–642.

ICSME-2015-PoluriR #concurrent #detection

Deterministic dynamic race detection across program versions (SVP, MKR), pp. 181–190.

STOC-2015-KawarabayashiT #graph

Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time (KiK, MT), pp. 665–674.

CIAA-J-2013-KutribMMPW15 #automaton #decidability #finite #queue

Deterministic input-driven queue automata: Finite turns, decidability, and closure properties (MK, AM, CM, BP, MW), pp. 58–71.

CIAA-J-2013-Maletti15 #automaton

Hyper-optimization for deterministic tree automata (AM), pp. 72–87.

CIAA-2015-BorsottiBCM #ambiguity #automaton #parsing #regular expression

From Ambiguous Regular Expressions to Deterministic Parsing Automata (AB, LB, SCR, AM), pp. 35–48.

CIAA-2015-CaronMM #on the

On the Hierarchy of Block Deterministic Languages (PC, LM, CM), pp. 63–75.

CIAA-2015-GruberHJ #automaton #finite #nondeterminism

More on Deterministic and Nondeterministic Finite Cover Automata — Extended Abstract (HG, MH, SJ), pp. 114–126.

CIAA-2015-HeamJ #automaton #generative #morphism #on the #random

On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism (PCH, JLJ), pp. 140–152.

CIAA-2015-HeamJ15a #automaton #generative #random #realtime

Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata (PCH, JLJ), pp. 153–164.

DLT-2015-HolzerJK #automaton #finite

Minimal Reversible Deterministic Finite Automata (MH, SJ, MK), pp. 276–287.

DLT-2015-OttoK #automaton #order

Deterministic Ordered Restarting Automata that Compute Functions (FO, KK), pp. 401–412.

ICALP-v1-2015-BeigiEG #distributed

Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources (SB, OE, AG), pp. 143–154.

ICALP-v1-2015-LokshtanovMPS #linear

Deterministic Truncation of Linear Matroids (DL, PM, FP, SS), pp. 922–934.

LATA-2015-EremondiIM #bound

Insertion Operations on Deterministic Reversal-Bounded Counter Machines (JE, OHI, IM), pp. 200–211.

ICML-2015-HuangGS #analysis #component #independence

Deterministic Independent Component Analysis (RH, AG, CS), pp. 2521–2530.

ICML-2015-ShajarisalesJSB #linear

Telling cause from effect in deterministic linear dynamical systems (NS, DJ, BS, MB), pp. 285–294.

ICML-2015-WangWS #analysis #clustering

A Deterministic Analysis of Noisy Sparse Subspace Clustering for Dimensionality-reduced Data (YW, YXW, AS), pp. 1422–1431.

KDD-2015-Papagiannopoulou #learning #multi

Discovering and Exploiting Deterministic Label Relationships in Multi-Label Learning (CP, GT, IT), pp. 915–924.

ICSE-v2-2015-ParkHKLC #case study #nondeterminism #testing

Systematic Testing of Reactive Software with Non-Deterministic Events: A Case Study on LG Electric Oven (YP, SH, MK, DL, JC), pp. 29–38.

SAT-2015-BovaCMS #compilation #on the

On Compiling CNFs into Structured Deterministic DNNFs (SB, FC, SM, FS), pp. 199–214.

CASE-2014-HeLG #graph #optimisation

Marking optimization of deterministic timed weighted marked graphs (ZH, ZL, AG), pp. 413–418.

DAC-2014-ZhangWWCLS

Deterministic Crash Recovery for NAND Flash Based Storage Systems (CZ, YW, TW, RC, DL, ZS), p. 6.

DATE-2014-ChenCT #performance #simulation

An activity-sensitive contention delay model for highly efficient deterministic full-system simulations (SYC, CHC, RST), pp. 1–6.

VLDB-2014-RenTA #database #evaluation

An Evaluation of the Advantages and Disadvantages of Deterministic Database Systems (KR, AT, DJA), pp. 821–832.

ESOP-2014-AguadoMHF #concurrent #programming

Grounding Synchronous Deterministic Concurrency in Sequential Programming (JA, MM, RvH, IF), pp. 229–248.

FoSSaCS-2014-EsparzaD #concurrent #on the

On Negotiation as Concurrency Primitive II: Deterministic Cyclic Negotiations (JE, JD), pp. 258–273.

PLDI-2014-KuperTTN #parallel

Taming the parallel effect zoo: extensible deterministic parallelism with LVish (LK, AT, STH, RRN), p. 2.

STOC-2014-DeS #approximate #performance #polynomial

Efficient deterministic approximate counting for low-degree polynomial threshold functions (AD, RAS), pp. 832–841.

STOC-2014-Goodrich #algorithm #sorting

Zig-zag sort: a simple deterministic data-oblivious sorting algorithm running in O(n log n) time (MTG), pp. 684–693.

AFL-2014-Loding #automaton #infinity #problem #word

Decision Problems for Deterministic Pushdown Automata on Infinite Words (CL), pp. 55–73.

AFL-2014-MalettiQ #automaton

Hyper-Minimization for Deterministic Weighted Tree Automata (AM, DQ), pp. 314–326.

CIAA-2014-BieglerM #automaton #finite #on the #word

On Comparing Deterministic Finite Automata and the Shuffle of Words (FB, IM), pp. 98–109.

DLT-2014-FeliceN #algorithm #automaton #complexity #on the

On the Average Complexity of Brzozowski’s Algorithm for Deterministic Automata with a Small Number of Final States (SDF, CN), pp. 25–36.

DLT-2014-GloannecO

Knight Tiles: Particles and Collisions in the Realm of 4-Way Deterministic Tilings (BLG, NO), pp. 227–238.

DLT-2014-KutribMW #automaton #set

Deterministic Set Automata (MK, AM, MW), pp. 303–314.

DLT-2014-Sinya #automaton #finite #graph

Graph Spectral Properties of Deterministic Finite Automata — (Short Paper) (RS), pp. 76–83.

ICALP-v1-2014-AfshaniCT #ram

Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM (PA, TMC, KT), pp. 77–88.

LATA-2014-CaronFM

(k, l)-Unambiguity and Quasi-Deterministic Structures: An Alternative for the Determinization (PC, MF, LM), pp. 260–272.

DUXU-TMT-2014-FilippiB #analysis #aspect-oriented #functional #human-computer #interactive #nondeterminism

In-Depth Analysis of Non-deterministic Aspects of Human-Machine Interaction and Update of Dedicated Functional Mock-Ups (SF, DB), pp. 185–196.

HCI-TMT-2014-SteigerLMKK #layout

Deterministic Local Layouts through High-Dimensional Layout Stitching (MS, HLT, TM, AK, JK), pp. 643–651.

ICML-c1-2014-SilverLHDWR #algorithm #policy

Deterministic Policy Gradient Algorithms (DS, GL, NH, TD, DW, MAR), pp. 387–395.

ICML-c2-2014-CelikkayaS #markov #probability #process

Deterministic Anytime Inference for Stochastic Continuous-Time Markov Processes (EBC, CRS), pp. 1962–1970.

KDD-2014-PapailiopoulosKB

Provable deterministic leverage score sampling (DSP, ATK, CB), pp. 997–1006.

SIGIR-2014-JayasingheWSDC #nondeterminism #retrieval

Evaluating non-deterministic retrieval systems (GKJ, WW, MS, LSD, JSC), pp. 911–914.

QAPL-2014-MiculanP #aspect-oriented #nondeterminism #process

GSOS for non-deterministic processes with quantitative aspects (MM, MP), pp. 17–33.

POPL-2014-KuperTKN #parallel #programming

Freeze after writing: quasi-deterministic parallel programming with LVars (LK, AT, NRK, RRN), pp. 257–270.

FSE-2014-Gui00ND #agile #analysis #named #nondeterminism #reliability #tool support

RaPiD: a toolkit for reliability analysis of non-deterministic systems (LG, JS, YL, TKN, JSD), pp. 727–730.

ICSE-2014-JiangGXML #concurrent #java #named #source code

CARE: cache guided deterministic replay for concurrent Java programs (YJ, TG, CX, XM, JL), pp. 457–467.

ASPLOS-2014-NguyenLP #on-demand

Deterministic galois: on-demand, portable and parameterless (DN, AL, KP), pp. 499–512.

CGO-2014-WangPPLGN #debugging #named #slicing

DrDebug: Deterministic Replay based Cyclic Debugging with Dynamic Slicing (YW, HP, CP, GL, RG, IN), p. 98.

OSDI-2014-ChenMXHPSZ #detection

Detecting Covert Timing Channels with Time-Deterministic Replay (AC, WBM, HX, AH, LTXP, MS, WZ), pp. 541–554.

PPoPP-2014-LuZBW #multi #performance #thread

Efficient deterministic multithreading without global barriers (KL, XZ, TB, XW), pp. 287–300.

CAV-2014-EsparzaK #approach #automaton #composition #ltl

From LTL to Deterministic Automata: A Safraless Compositional Approach (JE, JK), pp. 192–208.

LICS-CSL-2014-CharatonikKM #decidability #logic #transitive

Decidability of weak logics with deterministic transitive closure (WC, EK, FM), p. 10.

ASE-2013-MeredithR #parametricity #performance #runtime #string #verification

Efficient parametric runtime verification with deterministic string rewriting (POM, GR), pp. 70–80.

CASE-2013-KimM #equilibrium #on the #random

On the equilibrium probabilities of deterministic flow lines with random arrivals (WsK, JRM), pp. 723–729.

DATE-2013-YuZHWLT #approach #manycore #set #simulation

A critical-section-level timing synchronization approach for deterministic multi-core instruction set simulations (FWY, BHZ, YHH, HIW, CRL, RST), pp. 643–648.

FoSSaCS-2013-CzerwinskiDLM #regular expression

Deciding Definability by Deterministic Regular Expressions (WC, CD, KL, WM), pp. 289–304.

SAS-2013-RaychevVY #automation #concurrent #synthesis

Automatic Synthesis of Deterministic Concurrency (VR, MTV, EY), pp. 283–303.

STOC-2013-BohmGJ #automaton #equivalence

Equivalence of deterministic one-counter automata is NL-complete (SB, SG, PJ), pp. 131–140.

STOC-2013-NeimanS #algorithm

Simple deterministic algorithms for fully dynamic maximal matching (ON, SS), pp. 745–754.

CIAA-J-2012-JezM13 #automaton

Hyper-Minimization for Deterministic Tree Automata (AJ, AM), pp. 815–830.

DLT-J-2012-LehtinenO13 #context-free grammar #morphism

Homomorphisms Preserving Deterministic Context-Free Languages (TL, AO), pp. 1049–1066.

CIAA-2013-Crespi-ReghizziP #parallel

Deterministic Counter Machines and Parallel Matching Computations (SCR, PSP), pp. 280–291.

CIAA-2013-Maletti #automaton

Hyper-optimization for Deterministic Tree Automata (AM), pp. 244–255.

DLT-2013-FeliceN #algorithm #automaton

Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata (SDF, CN), pp. 179–190.

DLT-2013-PrusaMO #automaton

New Results on Deterministic Sgraffito Automata (DP, FM, FO), pp. 409–419.

ICALP-v1-2013-BodlaenderCKN #algorithm #exponential #problem

Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (HLB, MC, SK, JN), pp. 196–207.

ICALP-v1-2013-FotakisT #game studies #on the #power of

On the Power of Deterministic Mechanisms for Facility Location Games (DF, CT), pp. 449–460.

ICALP-v2-2013-DieudonneP #approach #polynomial

Deterministic Polynomial Approach in the Plane (YD, AP), pp. 533–544.

ICALP-v2-2013-JurdzinskiKS #distributed #network

Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices (TJ, DRK, GS), pp. 632–644.

LATA-2013-FreivaldsZP #automaton #complexity #on the

On the Size Complexity of Deterministic Frequency Automata (RF, TZ, GRP), pp. 287–298.

ICML-c3-2013-DekelH

Better Rates for Any Adversarial Deterministic MDP (OD, EH), pp. 675–683.

KDD-2013-Liberty #matrix #sketching

Simple and deterministic matrix sketching (EL), pp. 581–588.

ASPLOS-2013-JooybarFODA #architecture #gpu #named

GPUDet: a deterministic GPU architecture (HJ, WWLF, MO, JD, TMA), pp. 1–12.

PPoPP-2013-ChenC #parallel #scalability

Scalable deterministic replay in a parallel full-system emulator (YC, HC), pp. 207–218.

SOSP-2013-CuiSLLBXYGB #named #reliability #runtime #thread

Parrot: a practical runtime for deterministic, stable, and reliable threads (HC, JS, YHL, HL, BB, XX, JY, GAG, REB), pp. 388–405.

CSL-2013-Kikuchi #nondeterminism #normalisation #proving #λ-calculus

Proving Strong Normalisation via Non-deterministic Translations into Klop’s Extended λ-Calculus (KK), pp. 395–414.

LICS-2013-FacchiniMS #automaton #problem

Rabin-Mostowski Index Problem: A Step beyond Deterministic Automata (AF, FM, MS), pp. 499–508.

CASE-2012-KimM #modelling #on the #probability #random #throughput

On the throughput of deterministic flow lines with random state dependent setups: Stochastic models and applications (WsK, JRM), pp. 650–655.

DAC-2012-ZolotovSHFVXLV #analysis #statistics

Timing analysis with nonseparable statistical and deterministic variations (VZ, DS, JGH, EAF, CV, JX, JL, NV), pp. 1061–1066.

PODS-2012-GrozMS #linear #regular expression

Deterministic regular expressions in linear time (BG, SM, SS), pp. 49–60.

TACAS-2012-BabiakKRS #automaton #ltl #performance

LTL to Büchi Automata Translation: Fast and More Deterministic (TB, MK, VR, JS), pp. 95–109.

TACAS-2012-LengalSV #automaton #library #named #nondeterminism #performance

VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata (OL, JS, TV), pp. 79–94.

CSMR-2012-Dovgalyuk #debugging #dynamic analysis #execution #multi

Deterministic Replay of System’s Execution with Multi-target QEMU Simulator for Dynamic Analysis and Reverse Debugging (PD), pp. 553–556.

PEPM-2012-JainZS #nondeterminism

Translating flowcharts to non-deterministic languages (SKJ, CZ, BS), pp. 155–162.

PLDI-2012-KawaguchiRBJ #parallel

Deterministic parallelism via liquid effects (MK, PMR, AB, RJ), pp. 45–54.

AFL-J-2011-IbarraS12 #bound #linear

Characterizations of Bounded semilinear Languages by One-Way and Two-Way Deterministic Machines (OHI, SS), pp. 1291–1306.

CIAA-2012-JezM #automaton

Hyper-minimization for Deterministic Tree Automata (AJ, AM), pp. 217–228.

CIAA-2012-KutribO #automaton #complexity #on the

On the Descriptional Complexity of the Window Size for Deterministic Restarting Automata (MK, FO), pp. 253–264.

DLT-2012-LavadoPS #automaton #context-free grammar #nondeterminism

Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata (GJL, GP, SS), pp. 284–295.

DLT-2012-LehtinenO #context-free grammar #morphism

Homomorphisms Preserving Deterministic Context-Free Languages (TL, AO), pp. 154–165.

ICALP-v2-2012-DieudonneP #network

Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports (YD, AP), pp. 500–512.

ICML-2012-FengXY #approach #robust

Robust PCA in High-dimension: A Deterministic Approach (JF, HX, SY), p. 237.

ICML-2012-FreitasSZ #bound #exponential #process

Exponential Regret Bounds for Gaussian Process Bandits with Deterministic Observations (NdF, AJS, MZ), p. 125.

ICSE-2012-ZhouXZ #bound #named #polynomial #search-based

Stride: Search-based deterministic replay in polynomial time via bounded linkage (JZ, XX, CZ), pp. 892–902.

HPCA-2012-DuanZAT #commit #execution #named

BulkCompactor: Optimized deterministic execution via Conflict-Aware commit of atomic blocks (YD, XZ, WA, JT), pp. 361–372.

HPCA-2012-SeguljaA #architecture #parallel #programming

Architectural support for synchronization-free deterministic parallel programming (CS, TSA), pp. 337–348.

PPoPP-2012-BlellochFGS #algorithm #parallel #performance

Internally deterministic parallel algorithms can be fast (GEB, JTF, PBG, JS), pp. 181–192.

PPoPP-2012-LeisersonSS #generative #parallel #thread

Deterministic parallel random-number generation for dynamic-multithreading platforms (CEL, TBS, JS), pp. 193–204.

PPoPP-2012-TzenakisPKPVN #analysis #dependence #named #parallel

BDDT: : block-level dynamic dependence analysis for deterministic task-based parallelism (GT, AP, JK, PP, HV, DSN), pp. 301–302.

CAV-2012-KretinskyE #automaton #ltl

Deterministic Automata for the (F, G)-Fragment of LTL (JK, JE), pp. 7–22.

ICLP-2012-Hanus #analysis #lazy evaluation #nondeterminism

Improving Lazy Non-Deterministic Computations by Demand Analysis (MH), pp. 130–143.

RTA-2012-GmeinerGS #on the #term rewriting

On Soundness Conditions for Unraveling Deterministic Conditional Rewrite Systems (KG, BG, FS), pp. 193–208.

DAC-2011-AadithyaVDR #impact analysis #named #predict #probability #random

MUSTARD: a coupled, stochastic/deterministic, discrete/continuous technique for predicting the impact of random telegraph noise on SRAMs and DRAMs (KVA, SV, AD, JSR), pp. 292–297.

FoSSaCS-2011-HalamishK #automaton

Minimizing Deterministic Lattice Automata (SH, OK), pp. 199–213.

TACAS-2011-BertrandJSK #automaton #nondeterminism #testing

Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata (NB, TJ, AS, MK), pp. 96–111.

STOC-2011-Karnin

Deterministic construction of a high dimensional lp section in l1n for any p<2 (ZSK), pp. 645–654.

DLT-J-2010-Giammarresi11 #subclass

Exploring inside Tiling Recognizable Picture Languages to Find Deterministic subclasses (DG), pp. 1519–1532.

AFL-2011-IbarraS #bound #linear

Characterizations of Bounded Semilinear Languages by One-Way and Two-way Deterministic Machines (OHI, SS), pp. 211–224.

AFL-2011-MalettiQ #automaton #finite

Hyper-minimisation of deterministic weighted finite automata over semifields (AM, DQ), pp. 285–299.

AFL-2011-NagyO

Deterministic Pushdown-CD-Systems of Stateless Deterministic R(1)-Automata (BN, FO), pp. 328–342.

CIAA-2011-CarninoF #automaton #generative #markov #random #using

Random Generation of Deterministic Acyclic Automata Using Markov Chains (VC, SDF), pp. 65–75.

CIAA-2011-LonatiP #2d #automaton #towards

Towards More Expressive 2D Deterministic Automata (VL, MP), pp. 225–237.

DLT-2011-KuncO #automaton #finite #using

Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups (MK, AO), pp. 324–336.

ICALP-v1-2011-AustrinK #distance #problem #reduction

A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (PA, SK), pp. 474–485.

LATA-2011-NagyO

Globally Deterministic CD-Systems of Stateless R(1)-Automata (BN, FO), pp. 390–401.

POPL-2011-BocchinoHHAAWS #nondeterminism #parallel

Safe nondeterminism in a deterministic-by-default parallel language (RLBJ, SH, NH, SVA, VSA, AW, TS), pp. 535–548.

POPL-2011-DoddsJP #composition #parallel #reasoning

Modular reasoning for deterministic parallelism (MD, SJ, MJP), pp. 259–270.

ASPLOS-2011-DeviettiNBCG #consistency #named

RCDC: a relaxed consistency deterministic computer (JD, JN, TB, LC, DG), pp. 67–78.

HPCA-2011-HowerDHW #named

Calvin: Deterministic or not? Free will to choose (DH, PD, MDH, DAW), pp. 333–334.

SOSP-2011-CuiWGGY #multi #performance #thread

Efficient deterministic multithreading through schedule relaxation (HC, JW, JG, HG, JY), pp. 337–351.

SOSP-2011-LiuCB #multi #named #performance #thread

Dthreads: efficient deterministic multithreading (TL, CC, EDB), pp. 327–336.

ICTSS-2011-PetrenkoY #adaptation #implementation #nondeterminism #testing

Adaptive Testing of Deterministic Implementations Specified by Nondeterministic FSMs (AP, NY), pp. 162–178.

RTA-2011-NishidaSS #term rewriting

Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity (NN, MS, TS), pp. 267–282.

CASE-2010-ParkM #evaluation #performance

Performance evaluation of deterministic flow lines: Redundant modules and application to semiconductor manufacturing equipment (KP, JRM), pp. 45–50.

DATE-2010-AndalamRG #multi #predict #thread #using

Deterministic, predictable and light-weight multithreading using PRET-C (SA, PSR, AG), pp. 1653–1656.

DATE-2010-SuCG #multi

A general method to make multi-clock system deterministic (MS, YC, XG), pp. 1480–1485.

PEPM-2010-RiescoR #nondeterminism #programming

Programming with singular and plural non-deterministic functions (AR, JRH), pp. 83–92.

STOC-2010-KarninMSV #bound #multi #testing

Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in (ZSK, PM, AS, IV), pp. 649–658.

STOC-2010-MicciancioV #algorithm #exponential #problem

A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations (DM, PV), pp. 351–358.

AFL-J-2008-KaminskiZ10 #automaton #nondeterminism

Finite-Memory Automata with Non-Deterministic Reassignment (MK, DZ), pp. 741–760.

DLT-J-2008-Ada10 #communication #complexity #nondeterminism #on the #regular expression

On the Non-Deterministic Communication Complexity of Regular Languages (AA), pp. 479–493.

DLT-J-2008-Glockler10 #automaton #taxonomy

A Taxonomy of Deterministic Forgetting Automata (JG), pp. 619–631.

CIAA-2010-HundeshagenOV #automaton

Transductions Computed by PC-Systems of Monotone Deterministic Restarting Automata (NH, FO, MV), pp. 163–172.

DLT-2010-FrieseSM #bottom-up #transducer

Minimization of Deterministic Bottom-Up Tree Transducers (SF, HS, SM), pp. 185–196.

DLT-2010-Schluter #automaton #lookahead #on the

On Lookahead Hierarchies for Monotone and Deterministic Restarting Automata with Auxiliary Symbols (Extended Abstract) (NS), pp. 440–441.

ICALP-v2-2010-GenestGMW #automaton

Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata (BG, HG, AM, IW), pp. 52–63.

LATA-2010-LetichevskySS #automaton #equivalence #finite #multi #problem #proving #using

The Equivalence Problem of Deterministic Multitape Finite Automata: A New Proof of Solvability Using a Multidimensional Tape (AAL, ASS, SKS), pp. 392–402.

LATA-2010-NagyO

CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages (BN, FO), pp. 463–474.

SIGAda-2010-RasC #runtime

A deterministic run-time environment for Ada-05 on the ATmega16 microcontroller (JR, AMKC), pp. 13–22.

ICPR-2010-WuW #estimation #evaluation #nondeterminism

A Comprehensive Evaluation on Non-deterministic Motion Estimation (CW, QW), pp. 2333–2336.

KDIR-2010-NakanoY #induction

Number Theory-based Induction of Deterministic Context-free L-system Grammar (RN, NY), pp. 194–199.

KR-2010-HajishirziA #probability #reasoning

Reasoning about Deterministic Actions with Probabilistic Prior and Application to Stochastic Filtering (HH, EA).

FSE-2010-HuangLZ #concurrent #java #lightweight #multi #named #source code

LEAP: lightweight deterministic multi-processor replay of concurrent java programs (JH, PL, CZ), pp. 207–216.

FSE-2010-HuangLZ10a #concurrent #java #lightweight #multi #named #source code

LEAP: lightweight deterministic multi-processor replay of concurrent java programs (JH, PL, CZ), pp. 385–386.

ICSE-2010-BurnimS #named #parallel #source code #specification #thread

DETERMIN: inferring likely deterministic specifications of multithreaded programs (JB, KS), pp. 415–424.

ASPLOS-2010-BerganADCG #compilation #execution #named #parallel #runtime #thread

CoreDet: a compiler and runtime system for deterministic multithreaded execution (TB, OA, JD, LC, DG), pp. 53–64.

CGO-2010-PatilPSLC #analysis #framework #named #parallel #source code

PinPlay: a framework for deterministic replay and reproducible analysis of parallel programs (HP, CP, MS, GL, JC), pp. 2–11.

OSDI-2010-AviramWHF #parallel #performance

Efficient System-Enforced Deterministic Parallelism (AA, SCW, SH, BF), pp. 193–206.

OSDI-2010-BerganHCG #process

Deterministic Process Groups in dOS (TB, NH, LC, SDG), pp. 177–191.

OSDI-2010-CuiWTY #multi #thread

Stable Deterministic Multithreading through Schedule Memoization (HC, JW, CcT, JY), pp. 207–221.

SAT-2010-Ehlers #automaton #satisfiability #using

Minimising Deterministic Büchi Automata Precisely Using SAT Solving (RE), pp. 326–332.

CASE-2009-AllenGT #logic #nondeterminism #verification

Closed-loop determinism for non-deterministic environments: Verification for IEC 61499 logic controllers (LVA, KMG, DMT), pp. 1–6.

DAC-2009-Li #equation #modelling #performance #scalability

Finding deterministic solution from underdetermined equation: large-scale performance modeling by least angle regression (XL0), pp. 364–369.

DATE-2009-GregertsenS #ada #multi #performance #runtime

An efficient and deterministic multi-tasking run-time environment for Ada and the Ravenscar profile on the Atmel AVR®32 UC3 microcontroller (KNG, AS), pp. 1572–1575.

FASE-2009-RajamaniJPR #mobile #network #nondeterminism #query

Inquiry and Introspection for Non-deterministic Queries in Mobile Networks (VR, CJ, JP, GCR), pp. 401–416.

PEPM-2009-Lopez-FraguasRS #flexibility #framework #nondeterminism #programming

A flexible framework for programming with non-deterministic functions (FJLF, JRH, JSH), pp. 91–100.

PLDI-2009-SchwerdfegerW #composition

Verifiable composition of deterministic grammars (AS, EVW), pp. 199–210.

STOC-2009-ChengW #distance #problem #reduction

A deterministic reduction for the gap minimum distance problem: [extended abstract] (QC, DW), pp. 33–38.

CIAA-J-2008-Pighizzini09 #automaton

Deterministic Pushdown Automata and Unary Languages (GP), pp. 629–645.

CIAA-2009-HeamNS #automaton #generative #random

Random Generation of Deterministic Tree (Walking) Automata (PCH, CN, SS), pp. 115–124.

CIAA-2009-HolubS #automaton #finite #implementation #on the #parallel

On Parallel Implementations of Deterministic Finite Automata (JH, SS), pp. 54–64.

CIAA-2009-HolzerM #algorithm #automaton

An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton (MH, AM), pp. 4–13.

LATA-2009-JiraskovaP #automaton #self #verification

Converting Self-verifying Automata into Deterministic Automata (GJ, GP), pp. 458–468.

LATA-2009-VerwerWW #automaton

One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit (SV, MdW, CW), pp. 740–751.

ICFP-2009-FischerKS #functional #lazy evaluation #nondeterminism #programming

Purely functional lazy non-deterministic programming (SF, OK, CcS), pp. 11–22.

MoDELS-2009-DawV #modelling #process #state machine #uml

Deterministic UML Models for Interconnected Activities and State Machines (ZD, MV), pp. 556–570.

MoDELS-2009-DawV #modelling #process #state machine #uml

Deterministic UML Models for Interconnected Activities and State Machines (ZD, MV), pp. 556–570.

OOPSLA-2009-BocchinoADAHKOSSV #java #parallel

A type and effect system for deterministic parallel Java (RLBJ, VSA, DD, SVA, SH, RK, JO, PS, HS, MV), pp. 97–116.

SAC-2009-ChoudhuriG #embedded #named #nondeterminism

FlashBox: a system for logging non-deterministic events in deployed embedded systems (SC, TG), pp. 1676–1682.

SAC-2009-VasudevanE #compilation #concurrent #manycore

Celling SHIM: compiling deterministic concurrency to a heterogeneous multicore (NV, SAE), pp. 1626–1631.

SLE-2009-SchwerdfegerW #composition #parsing

Verifiable Parse Table Composition for Deterministic Parsing (AS, EVW), pp. 184–203.

ASPLOS-2009-DeviettiLCO #memory management #multi #named

DMP: deterministic shared memory multiprocessing (JD, BL, LC, MO), pp. 85–96.

ASPLOS-2009-MontesinosHKT #interface #multi #named

Capo: a software-hardware interface for practical deterministic multiprocessor replay (PM, MH, STK, JT), pp. 73–84.

ASPLOS-2009-OlszewskiAA #multi #named #performance #thread

Kendo: efficient deterministic multithreading in software (MO, JA, SPA), pp. 97–108.

SOSP-2009-AltekarS #debugging #manycore #named

ODR: output-deterministic replay for multicore debugging (GA, IS), pp. 193–206.

MBT-2009-SchumannSH #graph #nondeterminism #testing #using

Computing Optimal Tests for Non-deterministic Systems Using DNNF Graphs (AS, MS, JH), pp. 87–99.

VMCAI-2009-MightM #abstract interpretation #nondeterminism

A PosterioriSoundness for Non-deterministic Abstract Interpretations (MM, PM), pp. 260–274.

DAC-2008-PiyachonL #automaton #design #finite #pattern matching #performance

Design of high performance pattern matching engine through compact deterministic finite automata (PP, YL), pp. 852–857.

DATE-2008-EdwardsVT #compilation #concurrent #memory management #message passing #multi #programming #thread

Programming Shared Memory Multiprocessors with Deterministic Message-Passing Concurrency: Compiling SHIM to Pthreads (SAE, NV, OT), pp. 1498–1503.

DATE-2008-MalaniMQW #adaptation #multi #nondeterminism #realtime #scalability #scheduling

Adaptive Scheduling and Voltage Scaling for Multiprocessor Real-time Applications with Non-deterministic Workload (PM, PM, QQ, QW), pp. 652–657.

STOC-2008-Thorup

Minimum k-way cuts via deterministic greedy tree packing (MT), pp. 159–166.

DLT-J-2007-JirasekJS08 #automaton #finite #nondeterminism

Deterministic blow-UPS of Minimal Nondeterministic Finite Automata over a Fixed Alphabet (JJ, GJ, AS), pp. 617–631.

AFL-2008-GeffertBS #automaton

Hyper-Minimizing Minimized Deterministic Automata (VG, AB, IS), pp. 9–30.

AFL-2008-KaminskiZ #automaton #nondeterminism

Extending finite-memory automata with non-deterministic reassignment (Extended abstract) (MK, DZ), pp. 195–207.

CIAA-2008-ChamparnaudDJ #automaton #geometry #regular expression #testing

Testing Whether a Binary and Prolongeable Regular Language LIs Geometrical or Not on the Minimal Deterministic Automaton of Pref(L) (JMC, JPD, HJ), pp. 68–77.

CIAA-2008-Pighizzini #automaton

Deterministic Pushdown Automata and Unary Languages (GP), pp. 232–241.

DLT-2008-Ada #communication #complexity #nondeterminism #on the #regular expression

On the Non-deterministic Communication Complexity of Regular Languages (AA), pp. 96–107.

DLT-2008-Glockler #automaton #taxonomy

A Taxonomy of Deterministic Forgetting Automata (JG), pp. 371–382.

DLT-2008-GruberH #automaton #finite #regular expression

Provably Shorter Regular Expressions from Deterministic Finite Automata (HG, MH), pp. 383–395.

ICALP-B-2008-ColcombetL #automaton #nondeterminism

The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata (TC, CL), pp. 398–409.

LATA-2008-BenschBHK #automaton #finite

Deterministic Input-Reversal and Input-Revolving Finite Automata (SB, HB, MH, MK), pp. 113–124.

LATA-2008-ChampavereGLN #automaton #performance

Efficient Inclusion Checking for Deterministic Tree Automata and DTDs (JC, RG, AL, JN), pp. 184–195.

LATA-2008-Maletti #automaton

Minimizing Deterministic Weighted Tree Automata (AM), pp. 357–372.

ICGT-2008-BaldanCEK #composition #nondeterminism #petri net #process

Open Petri Nets: Non-deterministic Processes and Compositionality (PB, AC, HE, BK), pp. 257–273.

ICLP-2008-CasasCH #implementation #independence #nondeterminism #strict

A High-Level Implementation of Non-deterministic, Unrestricted, Independent And-Parallelism (AC, MC, MVH), pp. 651–666.

RTA-2008-Schmidt-SchaussM #call-by #finite #nondeterminism #simulation #λ-calculus

A Finite Simulation Method in a Non-deterministic Call-by-Need λ-Calculus with Letrec, Constructors, and Case (MSS, EM), pp. 321–335.

VMCAI-2008-MorgensternS #automaton #ltl

From LTL to Symbolically Represented Deterministic Automata (AM, KS), pp. 279–293.

STOC-2007-BayatiGKNT #algorithm #approximate

Simple deterministic approximation algorithms for counting matchings (MB, DG, DAK, CN, PT), pp. 122–127.

CIAA-2007-CarrascoDF #automaton #implementation

An Implementation of Deterministic Tree Automata Minimization (RCC, JD, MLF), pp. 122–129.

CIAA-2007-KleinB #automaton #on the fly

On-the-Fly Stuttering in the Construction of Deterministic ω-Automata (JK, CB), pp. 51–61.

CIAA-2007-SalomaaYZ

Deterministic Caterpillar Expressions (KS, SY, JZ), pp. 97–108.

DLT-2007-JirasekJS #automaton #finite #nondeterminism

Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet (JJ, GJ, AS), pp. 254–265.

ICALP-2007-BeameDPW #communication #complexity #multi #nondeterminism

Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity (PB, MD, TP, PW), pp. 134–145.

ICALP-2007-MoranNS #independence #information management

Deterministic History-Independent Strategies for Storing Information on Write-Once Memories (TM, MN, GS), pp. 303–315.

LATA-2007-BorchertR

Deterministically and Sudoku-Deterministically Recognizable Picture Languages (BB, KR), pp. 175–186.

LATA-2007-HanW #regular expression

Generalizations of One-Deterministic Regular Languages (YSH, DW), pp. 273–284.

KDD-2007-KarrasMS #summary

Exploiting duality in summarization with deterministic guarantees (PK, DS, NM), pp. 380–389.

LICS-2007-MontanariP

A Contraction Method to Decide MSO Theories of Deterministic Trees (AM, GP), pp. 141–150.

MBT-2007-BorodayPG #model checking #nondeterminism #question #testing

Can a Model Checker Generate Tests for Non-Deterministic Systems? (SB, AP, RG), pp. 3–19.

PODS-2006-CormodeKMS #algorithm #data type

Space- and time-efficient deterministic algorithms for biased quantiles over data streams (GC, FK, SM, DS), pp. 263–272.

PODS-2006-GangulyM

Deterministic k-set structure (SG, AM), pp. 280–289.

PODS-2006-LeeT #performance

A simpler and more efficient deterministic scheme for finding frequent items over sliding windows (LKL, HFT), pp. 290–297.

STOC-2006-KampRVZ

Deterministic extractors for small-space sources (JK, AR, SPV, DZ), pp. 691–700.

CIAA-2006-PargaGR #algorithm #product line #regular expression

A Family of Algorithms for Non Deterministic Regular Languages Inference (MVdP, PG, JR), pp. 265–274.

ICALP-v1-2006-HariharanKM #algorithm #graph #performance

A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs (RH, TK, KM), pp. 250–261.

ICALP-v1-2006-LeeLT #independence

Deterministic Extractors for Independent-Symbol Sources (CJL, CJL, SCT), pp. 84–95.

ICALP-v2-2006-GenestM #automaton

Constructing Exponential-Size Deterministic Zielonka Automata (BG, AM), pp. 565–576.

ICALP-v2-2006-GimbertZ #game studies

Deterministic Priority Mean-Payoff Games as Limits of Discounted Games (HG, WZ), pp. 312–323.

ICALP-v2-2006-Murlak

The Wadge Hierarchy of Deterministic Tree Languages (FM), pp. 408–419.

ICFP-2006-DowseB #concurrent #modelling

Modelling deterministic concurrent I/O (MD, AB), pp. 148–159.

ICML-2006-SindhwaniKC #kernel

Deterministic annealing for semi-supervised kernel machines (VS, SSK, OC), pp. 841–848.

KR-2006-ZamanskyA #first-order #logic #nondeterminism #semantics

Non-Deterministic Semantics for First-Order Paraconsistent Logics (AZ, AA), pp. 431–439.

SAC-2006-DubeyJA #keyword #source code

A deterministic technique for extracting keyword based grammar rules from programs (AD, PJ, SKA), pp. 1631–1632.

SAC-2006-MuhammadMA #communication #scheduling

Contentions-conscious dynamic but deterministic scheduling of computational and communication tasks (MF, FM, MA), pp. 1487–1492.

FATES-RV-2006-ArmoniKTVZ #linear #monitoring

Deterministic Dynamic Monitors for Linear-Time Assertions (RA, DK, AT, MYV, YZ), pp. 163–177.

LICS-2006-Piterman #automaton #nondeterminism

From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata (NP), pp. 255–264.

TestCom-2006-Ipate #bound #finite #nondeterminism #sequence #state machine #testing

Bounded Sequence Testing from Non-deterministic Finite State Machines (FI), pp. 55–70.

TestCom-2006-RosiereJP #testing

LaTe, a Non-fully Deterministic Testing Language (EdR, CJ, BP), pp. 71–86.

DAC-2005-MuellerSGS #performance

Deterministic approaches to analog performance space exploration (PSE) (DM, GS, HEG, US), pp. 869–874.

CIAA-2005-AbdullaDKN #automaton #nondeterminism #scalability

Minimization of Non-deterministic Automata with Large Alphabets (PAA, JD, LK, MN), pp. 31–42.

CIAA-2005-CampeanuPS #algorithm #automaton #finite #incremental

An Incremental Algorithm for Constructing Minimal Deterministic Finite Cover Automata (CC, AP, JRS), pp. 90–103.

CIAA-2005-FujiyoshiK #automaton #linear #recognition

Deterministic Recognition of Trees Accepted by a Linear Pushdown Tree Automaton (AF, IK), pp. 129–140.

CIAA-2005-IbarraY #on the

On Deterministic Catalytic Systems (OHI, HCY), pp. 163–175.

CIAA-2005-KleinB #automaton #linear #logic

Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic (JK, CB), pp. 199–212.

DLT-2005-JurdzinskiMOP

Monotone Deterministic RL-Automata Don’t Need Auxiliary Symbols (TJ, FM, FO, MP), pp. 284–295.

ICALP-2005-RodittyTZ #approximate #distance

Deterministic Constructions of Approximate Distance Oracles and Spanners (LR, MT, UZ), pp. 261–272.

SAC-2005-BarrettEKMS #ad hoc #multi #network #probability #protocol

Probabilistic multi-path vs. deterministic single-path protocols for dynamic ad-hoc network scenarios (CLB, SE, LK, MVM, JPS), pp. 1166–1173.

CSL-2005-Murlak #on the

On Deciding Topological Classes of Deterministic Tree Languages (FM), pp. 428–441.

DAC-2004-WohlWP #architecture #scalability

Scalable selector architecture for x-tolerant deterministic BIST (PW, JAW, SP), pp. 934–939.

DAC-2004-ZhangDC #distributed #embedded #energy #fault tolerance #realtime

Energy-aware deterministic fault tolerance in distributed real-time embedded systems (YZ, RPD, KC), pp. 550–555.

PODS-2004-GarofalakisK #metric

Deterministic Wavelet Thresholding for Maximum-Error Metrics (MNG, AK), pp. 166–176.

VLDB-2004-SchmidtBL #data type #named #query

QStream: Deterministic Querying of Data Streams (SS, HB, WL), pp. 1365–1368.

STOC-2004-LeviRS #algorithm #problem

Primal-dual algorithms for deterministic inventory problems (RL, RR, DBS), pp. 353–362.

FLOPS-2004-GluckK #lr #parsing #source code

Derivation of Deterministic Inverse Programs Based on LR Parsing (RG, MK), pp. 291–306.

CIAA-2004-BordihnHK #context-free grammar #linear #problem

Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages (HB, MH, MK), pp. 68–79.

DLT-2004-JurdzinskiOMP04a #automaton #on the

On Left-Monotone Deterministic Restarting Automata (TJ, FO, FM, MP), pp. 249–260.

DLT-2004-Truthe

A Method for Deciding the Finiteness of Deterministic Tabled Picture Languages (BT), pp. 406–417.

ICALP-2004-GasieniecKPX #multi #network

Deterministic M2M Multicast in Radio Networks: (Extended Abstract) (LG, EK, AP, QX), pp. 670–682.

IFL-2004-DowseBE #concurrent #functional #reasoning

Reasoning About Deterministic Concurrent Functional I/O (MD, AB, MCJDvE), pp. 177–194.

ICPR-v2-2004-LiuLW #using

Free Form Shape Matching Using Deterministic Annealing and Softassign (YL, LL, YW), pp. 128–131.

ICPR-v4-2004-YuanL #dependence #nondeterminism

Fragile Watermarking Scheme Exploiting Non-Deterministic Block-Wise Dependency (YY, CTL), pp. 849–852.

POPL-2004-CaromelHS

Asynchronous and deterministic objects (DC, LH, BPS), pp. 123–134.

DAC-2003-WohlWPA #architecture #logic #performance

Efficient compression and application of deterministic patterns in a logic BIST architecture (PW, JAW, SP, MBA), pp. 566–569.

DATE-2003-SantosFTT #generative #quality

RTL Test Pattern Generation for High Quality Loosely Deterministic BIST (MBS, JMF, ICT, JPT), pp. 10994–10999.

STOC-2003-Gurvits #complexity #problem #quantum

Classical deterministic complexity of Edmonds’ Problem and quantum entanglement (LG), pp. 10–19.

DLT-2003-HolzerK #automaton #finite #monad #on the

On Deterministic Finite Automata and Syntactic Monoid Size, Continued (MH, BK), pp. 349–360.

CIKM-2003-Onizuka #automaton #xml #xpath

Light-weight xPath processing of XML stream with deterministic automata (MO), pp. 342–349.

LOPSTR-2003-YokoyamaHT #higher-order #program transformation

Deterministic Higher-Order Patterns for Program Transformation (TY, ZH, MT), pp. 128–142.

HPCA-2003-LiBCVR #reduction

Deterministic Clock Gating for Microprocessor Power Reduction (HL, SB, YC, TNV, KR), pp. 113–122.

ICLP-2003-LopesCS #on the

On Deterministic Computations in the Extended Andorra Model (RL, VSC, FMAS), pp. 407–421.

STOC-2002-Han #linear #sorting

Deterministic sorting in O(nlog log n) time and linear space (YH), pp. 602–608.

CIAA-2002-CampeanuP #automaton #finite #similarity

The Number of Similarity Relations and the Number of Minimal Deterministic Finite Cover Automata (CC, AP), pp. 67–76.

CIAA-2002-Daciuk #algorithm #automaton #comparison #finite #set #string

Comparison of Construction Algorithms for Minimal, Acyclic, Deterministic, Finite-State Automata from Sets of Strings (JD), pp. 255–261.

CIAA-2002-Melichar #parsing #string

Deterministic Parsing of Cyclic Strings (BM), pp. 301–306.

DLT-2002-HolzerK02a #automaton #finite #monad #on the

On Deterministic Finite Automata and Syntactic Monoid Size (MH, BK), pp. 258–269.

ICALP-2002-Dalmau #constraints #nondeterminism #problem

Constraint Satisfaction Problems in Non-deterministic Logarithmic Space (VD), pp. 414–425.

PADL-2002-GallagherP #abstract interpretation #analysis #automaton #finite #logic programming #nondeterminism #source code

Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-Based Analysis of Logic Programs (JPG, GP), pp. 243–261.

DATE-2001-PaschalisGKPZ #embedded #self

Deterministic software-based self-testing of embedded processor cores (AMP, DG, NK, MP, YZ), pp. 92–96.

CIAA-2001-MelicharS #automaton #finite #on the

On the Size of Deterministic Finite Automata (BM, JS), pp. 202–213.

DLT-2001-EngelfrietM #string #transducer

Hierarchies of String Languages Generated by Deterministic Tree Transducers (JE, SM), pp. 228–238.

LOPSTR-2001-PotikasRG #datalog #nondeterminism #source code

A Transformation Technique for Datalog Programs Based on Non-deterministic Constructs (PP, PR, MG), pp. 25–45.

CC-2001-Siebert #garbage collection

Constant-Time Root Scanning for Deterministic Garbage Collection (FS), pp. 304–318.

LICS-2001-AlurT #game studies #generative #ltl

Deterministic Generators and Games for LTL Fragments (RA, SLT), pp. 291–300.

TLCA-2001-Laird #nondeterminism

A Deconstruction of Non-deterministic Classical Cut Elimination (JL), pp. 268–282.

STOC-2000-GurvitsS #algorithm #approximate #polynomial

A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume (LG, AS), pp. 48–57.

ICALP-2000-ChlebusGOR

Deterministic Radio Broadcasting (BSC, LG, AÖ, JMR), pp. 717–728.

ICALP-2000-DantsinGHS #algorithm #satisfiability

Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search (ED, AG, EAH, US), pp. 236–247.

ICALP-2000-Urbanski #automaton #on the

On Deciding if Deterministic Rabin Language Is in Büchi Class (TFU), pp. 663–674.

ICML-2000-Veeser #approach #automaton #finite #learning

An Evolutionary Approach to Evidence-Based Learning of Deterministic Finite Automata (SV), pp. 1071–1078.

ICPR-v3-2000-ChoPP #image #segmentation #using

Segmentation of Color Image Using Deterministic Annealing EM (WHC, SYP, JP), pp. 3646–3649.

ICPR-v3-2000-LiapisST #algorithm #performance #segmentation #using

Color and/or Texture Segmentation Using Deterministic Relaxation and Fast Marching Algorithms (SL, ES, GT), pp. 3621–3624.

HPCA-2000-NeefsVB #latency #multi

A Technique for High Bandwidth and Deterministic Low Latency Load/Store Accesses to Multiple Cache Banks (HN, HV, KDB), pp. 313–324.

CL-2000-Liang #generative #logic programming #parsing #programming language

A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language (CL), pp. 1315–1329.

CSL-2000-Hemaspaandra #linear #satisfiability

Modal Satisfiability Is in Deterministic Linear Space (EH), pp. 332–342.

ESOP-1999-Norrish #c

Deterministic Expressions in C (MN), pp. 147–161.

FoSSaCS-1999-Maneth #metaprogramming #string #transducer

String Languages Generated by Total Deterministic Macro Tree Transducers (SM), pp. 258–272.

FLOPS-1999-Ohlebusch #on the #term rewriting

On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems (EO), pp. 179–193.

DLT-1999-JirickaK #automaton #finite #nondeterminism

Deterministic forgetting planar automata are more powerful than non-deterministic finite-state planar automata (PJ, JK), pp. 71–80.

WIA-1999-Trahtman #algorithm #automaton #finite #testing #verification

An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata (ANT), pp. 164–173.

WIA-1999-Watson #algorithm #automaton #finite #taxonomy

A Taxonomy of Algorithms for Constructing Minimal Acyclic Deterministic Finite Automata (BWW), pp. 174–182.

LICS-1999-MalacariaH #game studies #nondeterminism #program analysis #security

Non-Deterministic Games and Program Analysis: An Application to Security (PM, CH), pp. 443–452.

LICS-1999-Ruhl #transitive

Counting and Addition Cannot Express Deterministic Transitive Closure (MR), pp. 326–334.

FoSSaCS-1998-NiemannO #context-sensitive grammar

The Church-Rosser Languages Are the Deterministic Variants of the Growing Context-Sensitive Languages (GN, FO), pp. 243–257.

FoSSaCS-1998-PorrotDDV #random #sequence #transducer

Deterministic Rational Transducers and Random Sequences (SP, MD, BD, NKV), pp. 258–272.

STOC-1998-CharikarCGG #algorithm #approximate

Rounding via Trees: Deterministic Approximation Algorithms for Group Steiner Trees and k-Median (MC, CC, AG, SG), pp. 114–123.

STOC-1998-HolmLT #algorithm

Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge, and Biconnectivity (JH, KdL, MT), pp. 79–89.

STOC-1998-LinialSW #algorithm #approximate #matrix #polynomial #scalability

A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents (NL, AS, AW), pp. 644–652.

ICALP-1998-PelegR #approximate #communication

Deterministic Polylog Approximation for Minimum Communication Spanning Trees (DP, ER), pp. 670–681.

ICALP-1998-Wigderson #algorithm #probability #question

Do Probabilistic Algorithms Outperform Deterministic Ones? (AW), pp. 212–214.

ICFP-1998-KutznerS #call-by #nondeterminism #λ-calculus

A Non-Deterministic Call-by-Need λ Calculus (AK, MSS), pp. 324–335.

SAC-1998-Li98a #algorithm #distributed #online #random

Deterministic and randomized algorithms for distributed on-line task assignment and load balancing without load status information (KL), pp. 613–622.

CSL-1998-Sadowski #algorithm #on the #satisfiability

On an Optimal Deterministic Algorithm for SAT (ZS), pp. 179–187.

LICS-1998-EmersonN #infinity #model checking #nondeterminism #on the

On Model Checking for Non-Deterministic Infinite-State Systems (EAE, KSN), pp. 70–80.

EDTC-1997-DufazaZ #generative #on the #pseudo #sequence #testing

On the generation of pseudo-deterministic two-patterns test sequence with LFSRs (CD, YZ), pp. 69–76.

EDTC-1997-KagarisT #automaton #generative #sequence #testing

Cellular automata for generating deterministic test sequences (DK, ST), pp. 77–81.

DLT-1997-CaludeCK #automaton #simulation

Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract (CSC, EC, BK), pp. 519–537.

DLT-1997-Moshkov #complexity #nondeterminism #recognition #regular expression #word

Complexity of Deterministic and Nondeterministic Decision Trees for Regular Language Word Recognition (MM), pp. 343–349.

DLT-1997-NiessnerNO #liveness

Deterministic ω-regular liveness properties (FN, UN, PO), pp. 237–248.

DLT-1997-TokudaYW #re-engineering

Deterministic Reconstruction of Context-Free Derivations for a Sentence with Shuffled Terminal Symbols (TT, KY, YW), pp. 551–558.

ICALP-1997-Senizergues #automaton #decidability #equivalence #problem

The Equivalence Problem for Deterministic Pushdown Automata is Decidable (GS), pp. 671–681.

WIA-1997-Trahtman #automaton #estimation #finite #order #precise #testing

A Precise Estimation of the Order of Local Testability of a Deterministic Finite Automaton (ANT), pp. 198–212.

ALP-1997-Antoy #functional #logic #nondeterminism

Optimal Non-deterministic Functional Logic Computations (SA), pp. 16–30.

DAC-1996-KhatriNKMBS #automaton #nondeterminism

Engineering Change in a Non-Deterministic FSM Setting (SPK, AN, SCK, KLM, RKB, ALSV), pp. 451–456.

ESOP-1996-MaraninchiH #composition #nondeterminism #semantics

Compositional Semantics of Non-Deterministic Synchronous Languages (FM, NH), pp. 235–249.

PLDI-1996-RussinovichC #concurrent #memory management #nondeterminism

Replay For Concurrent Non-Deterministic Shared Memory Applications (MR, BC), pp. 258–266.

STOC-1996-ChaudhuriR #complexity #strict

Deterministic Restrictions in Circuit Complexity (SC, JR), pp. 30–36.

STOC-1996-NagamochiI #graph

Deterministic Õ(nm) Time Edge-Splitting in Undirected Graphs (HN, TI), pp. 64–73.

ICALP-1996-HerleyPP #backtracking #performance

Fast Deterministic Backtrack Search (KTH, AP, GP), pp. 598–609.

AFP-1996-SwierstraD96 #combinator #parsing

Deterministic, Error-Correcting Combinator Parsers (SDS, LD), pp. 184–207.

ICPR-1996-ParagiosT #algorithm #detection #using

Detection and location of moving objects using deterministic relaxation algorithms (NP, GT), pp. 201–205.

KDD-1996-HofmannB #clustering

Inferring Hierarchical Clustering Structures by Deterministic Annealing (TH, JMB), pp. 363–366.

ALP-1996-KhasidashviliG #normalisation #standard

Discrete Normalization and Standardization in Deterministic Residual Structures (ZK, JRWG), pp. 135–149.

DAC-1995-RudnickP #generative #search-based #testing

Combining Deterministic and Genetic Approaches for Sequential Circuit Test Generation (EMR, JHP), pp. 183–188.

ICALP-1995-PietracaprinaP #simulation

Improved Deterministic PRAM Simulation on the Mesh (AP, GP), pp. 372–383.

PLILP-1995-Achten #framework #functional #interactive #source code

A Functional Framework for Deterministically Interleaved Interactive Programs (PA), pp. 451–452.

POPL-1995-BrookesD #algorithm #parallel

Sequential Algorithms, Deterministic Parallelism, and Intensional Expressiveness (SDB, DD), pp. 13–24.

EDAC-1994-WatanabeB #automaton #nondeterminism #pseudo

State Minimization of Pseudo Non-Deterministic FSM’s (YW, RKB), pp. 184–191.

ICALP-1994-GyssensBG #performance

Expressiveness of Efficient Semi-Deterministic Choice Constructs (MG, JVdB, DVG), pp. 106–117.

SAC-1994-LeeL #concurrent #constraints #incremental #logic programming #named #nondeterminism #query #towards

IQ: towards incremental query processing in non-deterministic concurrent constraint logic programming (JHML, HfL), pp. 405–409.

SAC-1994-Wang #generative #migration #multi #scheduling

Generating a deterministic task migration path for multiprocessor scheduling (MfW), pp. 478–482.

STOC-1993-KarchmerW #nondeterminism

Characterizing non-deterministic circuit size (MK, AW), pp. 532–540.

STOC-1993-MatousekS #3d #algorithm #problem

A deterministic algorithm for the three-dimensional diameter problem (JM, OS), pp. 478–484.

STOC-1993-NisanZ #simulation

More deterministic simulation in logspace (NN, DZ), pp. 235–244.

STOC-1993-Schulman #communication #interactive

Deterministic coding for interactive communication (LJS), pp. 747–756.

DLT-1993-DammHLR #complexity

Deterministic OL Languages are of Very Low Complexity: DOL is in AC0 (CD, MH, KJL, PR), pp. 305–313.

DLT-1993-HromkovicRS #nondeterminism

Deterministic Versus Nondeterministic Space in Terms of Synchronized Alternating Machines (JH, BR, AS), pp. 314–325.

ICALP-1993-KarpinskiV #on the #random

On Randomized Versus Deterministic Computation (MK, RV), pp. 227–240.

ILPS-1993-PostGK #parsing

Deterministic Parsing of Languages with Dynamic Operators (KP, AVG, JK), pp. 456–472.

ISSTA-1993-AvritzerL #testing #using

Load Testing Software Using Deterministic State Testing (AA, BL), pp. 82–88.

IWPTS-1993-GhrigaF #adaptation #communication #nondeterminism #protocol #testing

Adaptive Testing of Non-Deterministic Communication Protocols (MG, PGF), pp. 347–362.

STOC-1992-AjtaiM #algorithm #linear #programming

A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimension (MA, NM), pp. 327–338.

ICALP-1992-Nishida

Quasi-Deterministic 0L Systems (TYN), pp. 65–76.

IWPTS-1992-GhedamsiDB #fault #finite #nondeterminism #state machine #testing

Diagnostic Tests for Single Transition Faults in Non-Deterministic Finite State Machines (AG, RD, GvB), pp. 105–116.

IWPTS-1992-Kloosterman #finite #nondeterminism #state machine

Test Derivation from Non-Deterministic Finite State Machines (HK), pp. 297–308.

IWPTS-1992-WittemanWB #behaviour #nondeterminism

Non-Deterministic and Default Behaviour (MFW, RCvW, SRB), pp. 275–288.

LICS-1992-GraedelM #logic #nondeterminism #transitive

Deterministic vs. Nondeterministic Transitive Closure Logic (EG, GLM), pp. 58–63.

PODS-1991-Garcia-MolinaS #nondeterminism #queue

Non-Deterministic Queue Operations (HGM, KS), pp. 53–62.

SIGMOD-1991-Sheng #database #deduction #nondeterminism

A Non-deterministic Deductive Database Language (YHS), pp. 188–197.

STOC-1991-BarnesR #algorithm #polynomial #sublinear #using

Deterministic Algorithms for Undirected s-t Connectivity Using Polynomial Time and Sublinear Space (Extended Abstract) (GB, WLR), pp. 43–53.

STOC-1991-LubyV #approximate #on the

On Deterministic Approximation of DNF (ML, BV), pp. 430–438.

IWPTS-1991-FujiwaraB #fault #nondeterminism #state machine #testing

Testing Non-Deterministic State Machines with Fault Coverage (SF, GvB), pp. 267–280.

PODS-1990-AbiteboulSV #nondeterminism

Non-Deterministic Languages to Express Deterministic Transformations (SA, ES, VV), pp. 218–229.

STOC-1990-CypherP #sorting

Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers (RC, CGP), pp. 193–203.

STOC-1990-Vishkin #pattern matching #performance

Deterministic Sampling-A New Technique for Fast Pattern Matching (UV), pp. 170–180.

POPL-1990-Gunter #correctness #nondeterminism #source code

Relating Total and Partial Correctness Interpretations of Non-Deterministic Programs (CAG), pp. 306–319.

POPL-1990-Mairson #exponential #ml

Deciding ML Typability is Complete for Deterministic Exponential Time (HGM), pp. 382–401.

DAC-1989-GloverM #approach #fault #testing

A Deterministic Approach to Adjacency Testing for Delay Faults (CTG, MRM), pp. 351–356.

STOC-1989-Upfal

An O(log N) Deterministic Packet Routing Scheme (Preliminary Version) (EU), pp. 241–250.

RTA-1989-Narain #lazy evaluation #nondeterminism #optimisation

Optimization by Non-Deterministic, Lazy Rewriting (SN), pp. 326–342.

VLDB-1988-MaindrevilleS #database #deduction #modelling #query

Modelling Non Deterministic Queries and Updates in Deductive Databases (CdM, ES), pp. 395–406.

STOC-1988-Ben-OrT #algorithm #multi

A Deterministic Algorithm for Sparse Multivariate Polynominal Interpolation (Extended Abstract) (MBO, PT), pp. 301–309.

STOC-1988-GurevichS #linear #nondeterminism #sublinear

Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space (YG, SS), pp. 281–289.

CSL-1988-Dahlhaus #nondeterminism #polynomial

Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time (ED), pp. 52–62.

JICSCP-1988-TrehanW88 #commit #logic #nondeterminism #parallel #parsing

A Parallel Chart Parser for the Committed Choice Non-Deterministic Logic Languages (RT, PFW), pp. 212–232.

SIGMOD-1987-AlyO #database #deduction #logic #modelling #nondeterminism #query

Non-deterministic Modelling of Logical Queries in Deductive Databases (HA, ZMÖ), pp. 60–72.

STOC-1987-AjtaiKS #simulation

Deterministic Simulation in LOGSPACE (MA, JK, ES), pp. 132–140.

ICALP-1987-LiY #complexity #parallel #probability #symmetry

The Probabilistic and Deterministic Parallel Complexity of Symmetric Functions (ML, YY), pp. 326–335.

CSL-1987-Ambos-SpiesFH #polynomial

Diagonalizing over Deterministic Polynomial Time (KAS, HF, HH), pp. 1–16.

ICLP-1987-Conery87 #execution #implementation #nondeterminism

Implementing Backward Execution in Non-Deterministic AND-Parallel Systems (JSC), pp. 633–653.

ICLP-1987-Ueda87 #source code

Making Exhaustive Search Programs Deterministic, Part II (KU), pp. 356–375.

LICS-1987-AlpernS #proving

Proving Boolean Combinations of Deterministic Properties (BA, FBS), pp. 131–137.

STOC-1986-AjtaiKSS #parallel

Deterministic Selection in O(log log N) Parallel Time (MA, JK, WLS, ES), pp. 188–195.

STOC-1986-ColeV #algorithm #design #metaprogramming #parallel

Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms (RC, UV), pp. 206–219.

ICALP-1986-DymondR #context-free grammar #memory management #parallel #recognition

Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract) (PWD, WLR), pp. 95–104.

ICLP-1986-Abramson86 #concurrent #logic

Sequential and Concurrent Deterministic Logic Grammars (HA), pp. 389–395.

ICLP-1986-Ueda86 #source code

Making Exhaustive Search Programs Deterministic (KU), pp. 270–282.

SLP-1986-Crammond86 #execution #nondeterminism

An Execution Model for Committed-Choice Non-Deterministic Languages (JAC), pp. 148–158.

ICALP-1985-Furer #algorithm #testing

Deterministic and Las Vegas Primality Testing Algorithms (MF), pp. 199–209.

STOC-1984-Maass #bound #nondeterminism #polynomial #turing machine

Quadratic Lower Bounds for Deterministic and Nondeterministic One-Tape Turing Machines (Extended Abstract) (WM), pp. 401–408.

STOC-1983-DymondT #parallel

Speedups of Deterministic Machines by Synchronous Parallel Machines (PWD, MT), pp. 336–343.

DAC-1982-EustaceM #approach #automaton #design #finite

A Deterministic finite automaton approach to design rule checking for VLSI (RAE, AM), pp. 712–717.

STOC-1982-Furer

The Tight Deterministic Time Hierarchy (MF), pp. 8–16.

DAC-1981-Wojtkowiak #design #functional #specification

Deterministic systems design from functional specifications (HW), pp. 98–104.

ICALP-1981-Ben-AriHP #finite #logic #modelling

Finite Models for Deterministic Propositional Dynamic Logic (MBA, JYH, AP), pp. 249–263.

ICALP-1981-Ukkonen #bound #on the #parsing

On Size Bounds for Deterministic Parsers (EU), pp. 218–228.

STOC-1980-Hong #complexity #on the #problem

On Some Deterministic Space Complexity Problems (JWH), pp. 310–317.

STOC-1980-Ukkonen #automaton #equivalence #realtime

A Decision Method for the Equivalence of some Non-Real-Time Deterministic Pushdown Automata (EU), pp. 29–38.

STOC-1979-Cook #polynomial

Deterministic CFL’s Are Accepted Simultaneously in Polynomial Time and Log Squared Space (SAC), pp. 338–345.

ICALP-1979-Chottin #strict #term rewriting

Strict Deterministic Languages and Controlled Rewriting Systems (LC), pp. 104–117.

ICALP-1978-Berman #complexity

Relationship Between Density and Deterministic Complexity of NP-Complete Languages (PB), pp. 63–71.

ICALP-1977-PazM #approximate #nondeterminism #optimisation #polynomial #problem

Non-Deterministic Polynomial Optimization Problems and Their Approximation (AP, SM), pp. 370–379.

STOC-1976-Sudborough #automaton #context-free grammar #multi #on the #power of

On Deterministic Context-Free Languages, Multihead Automata, and the Power of an Auxiliary Pushdown Store (IHS), pp. 141–148.

STOC-1974-CookS #polynomial #requirements

Storage Requirements for Deterministic Polynomial Time Recognizable Languages (SAC, RS), pp. 33–39.

STOC-1974-JonesL #polynomial #problem

Complete Problems for Deterministic Polynomial Time (NDJ, WTL), pp. 40–46.

STOC-1974-Valiant #automaton #decidability #equivalence

The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata (LGV), pp. 27–32.

ICALP-1974-Hayes #nondeterminism

Simple and Structural Redundancy in Non-Deterministic Computation (PJH), pp. 601–611.

ICALP-1974-Lang #nondeterminism #parsing #performance

Deterministic Techniques for Efficient Non-Deterministic Parsers (BL), pp. 255–269.

STOC-1973-Greibach #context-free grammar #polynomial

Jump PDA’s, Deterministic Context-Free Languages Principal AFDLs and Polynomial Time Recognition-Extended Abstract (SAG), pp. 20–28.

POPL-1973-AhoJU #ambiguity #parsing

Deterministic Parsing of Ambiguous Grammars (AVA, SCJ, JDU), pp. 1–21.

POPL-1973-GellerH #lr #parsing #strict

Strict Deterministic Versus LR(0) Parsing (MMG, MAH), pp. 22–32.

ICALP-1972-Bertoni #approximate #complexity #probability #problem

Complexity Problems Related to the Approximation of Probabilistic Languages and Events by Deterministic Machines (AB), pp. 507–516.

ICALP-1972-HarrisonH #on the #product line

On a Family of Deterministic Grammars (Extended Abstract) (MAH, IMH), pp. 413–441.

STOC-1971-Rajlich #finite #parallel #transducer

Absolutely Parallel Grammars and Two-Way Deterministic Finite-State Transducers (VR), pp. 132–137.

STOC-1971-Terrine #algorithm #bottom-up #context-free grammar #generative #parsing #set

An Algorithm Generating the Decision Table of a Deterministic Bottom Up Parser for a Subset of Context Free Grammars (GT), pp. 185–205.

STOC-1969-Chandler #product line

Abstract Families of Deterministic Languages (WJC), pp. 21–30.

STOC-1969-RosenkrantzS #top-down

Properties of Deterministic Top Down Grammars (DJR, RES), pp. 165–180.

STOC-1969-Savitch #nondeterminism #simulation #turing machine

Deterministic Simulation of Non-Deterministic Turing Machines (Detailed Abstract) (WJS), pp. 247–248.