Search results for "branching"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
117	E. Allen Emerson, Joseph Y. Halpern	"Sometimes" and "Not Never" Revisited: On Branching Versus Linear Time.	POPL	1983	DBLP DOI BibTeX RDF
90	Rob J. van Glabbeek, W. P. Weijland	Branching Time and Abstraction in Bisimulation Semantics.	J. ACM	1996	DBLP DOI BibTeX RDF	process algebra semantic equivalence, concurrency, abstraction, bisimulation, action refinement, branching time
82	Joey Hwang, David G. Mitchell	2-Way vs. d-Way Branching for CSP.	CP	2005	DBLP DOI BibTeX RDF
80	Masaki Nakanishi, Kiyoharu Hamaguchi, Toshinobu Kashiwabara	Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction.	COCOON	2000	DBLP DOI BibTeX RDF
77	Andrew Gilpin, Tuomas Sandholm	Information-theoretic approaches to branching in search.	AAMAS	2006	DBLP DOI BibTeX RDF	branching heuristics, entropic branching, search, mixed-integer programming
76	Beate Bollig, Martin Sauerhoff, Ingo Wegener	On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs.	CCC	2001	DBLP DOI BibTeX RDF	Computational complexity, lower bounds, approximations, binary decision diagrams, branching programs
76	Detlef Sieling	A separation of syntactic and nonsyntactic (1, +k)-branching programs.	Comput. Complex.	2000	DBLP DOI BibTeX RDF	nonsyntactic, lower bound, Branching program, syntactic
75	Nuel Belnap	Norms in Branching Space-Times.	DEON	2008	DBLP DOI BibTeX RDF
74	E. Allen Emerson, Jai Srinivasan	Branching time temporal logic.	REX Workshop	1988	DBLP DOI BibTeX RDF	Modal and Temporal Logic: Branching time temporal logic, linear time temporal logic, model checking - Logics of Programs: Reasoning about concurrent programs, specification of and reasoning about fairness - Software Engineering: Specification techniques, automated verification techniques - Computational Complexity, Automata Theory: Finite-state automata on infinite objects, program verification, satisfiability, decidability, expressiveness, decision procedures, dynamic logics, tree automata, axiomatics, program specification, mechanical synthesis
69	Tapio Elomaa, Matti Kääriäinen	The Difficulty of Reduced Error Pruning of Leveled Branching Programs.	Ann. Math. Artif. Intell.	2004	DBLP DOI BibTeX RDF	reduced error pruning, approximability, NP-completeness, concept learning, branching programs
69	Paul Beame, Michael E. Saks, Jayram S. Thathachar	Time-Space Tradeoffs for Branching Programs.	FOCS	1998	DBLP DOI BibTeX RDF	lower bounds, branching programs, time-space tradeoffs
68	Petr Savický, Detlef Sieling	A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism.	MFCS	2000	DBLP DOI BibTeX RDF
64	Esteban Arcaute, Adam Kirsch, Ravi Kumar 0001, David Liben-Nowell, Sergei Vassilvitskii	On threshold behavior in query incentive networks.	EC	2007	DBLP DOI BibTeX RDF	query incentive networks, threshold phenomena, branching processes
63	Alberto Del Bimbo, Luigi Rella, Enrico Vicario	Visual Specification of Branching Time Temporal Logic.	VL	1995	DBLP DOI BibTeX RDF	branching time temporal logic, ordering relationships, visual shell, recursive syntax, mathematical notation, recursive visualization rules, generative approach, generic textual formula visualisation, 3D virtual space, branching time formulae, complex formulae, formal specification, parallel processing, parallelism, temporal logic, specification languages, visual languages, visual language, data visualisation, graphic representation, nesting, descriptive language, visual specification, time-varying systems, time-varying systems, execution sequencing
61	Anna Gál, Michal Koucký 0001, Pierre McKenzie	Incremental Branching Programs.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF
61	Anna Gál, Michal Koucký 0001, Pierre McKenzie	Incremental Branching Programs.	CSR	2006	DBLP DOI BibTeX RDF
56	Anbulagan	Extending Unit Propagation Look-Ahead of DPLL Procedure.	PRICAI	2004	DBLP DOI BibTeX RDF
56	Paul Beame, Erik Vee	Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems.	CCC	2002	DBLP DOI BibTeX RDF
55	Dusan Ristanovic, Nebojsa T. Milosevic, Herbert F. Jelinek, Ivan B. Stefanovic	Mathematical modelling of neuronal dendritic branching patterns in two dimensions: application to retinal ganglion cells in the cat and rat.	Biol. Cybern.	2009	DBLP DOI BibTeX RDF	Branching points, Sholl’s analysis, Terminal tips, Logistic model, Retina
55	Matti Järvisalo, Tommi A. Junttila	Limitations of restricted branching in clause learning.	Constraints An Int. J.	2009	DBLP DOI BibTeX RDF	Branching heuristics, Clause learning, Backdoor sets, Proof complexity, Propositional satisfiability, DPLL, Problem structure
55	Mark O. Riedl, Robert Michael Young	From Linear Story Generation to Branching Story Graphs.	IEEE Computer Graphics and Applications	2006	DBLP DOI BibTeX RDF	automated story generation, branching stories, story graphs, narrative mediation, narrative planning, computer games, interactive storytelling, narrative intelligence
55	Martin Sauerhoff	On the size of randomized OBDDs and read-once branching programs for k-stable functions.	Comput. Complex.	2001	DBLP DOI BibTeX RDF	read-once branching program, zero error, lower bounds, randomness, communication complexity, OBDD
55	Nimrod Bayer, Yaakov Kogan	Branching/queueing networks: Their introduction and near-decomposability asymptotics.	Queueing Syst. Theory Appl.	1997	DBLP DOI BibTeX RDF	nearly complete decomposability, closed queueing networks, branching processes
54	James Ostrowski, Jeff T. Linderoth, Fabrizio Rossi, Stefano Smriglio	Orbital Branching.	IPCO	2007	DBLP DOI BibTeX RDF
54	Kenzo Kurihara, Nobuyuki Nishiuchi, Manabu Nagai, Kazuaki Masuda	Branching Probabilities Planning of Stochastic Network for Project Duration Planning.	ETFA	2006	DBLP DOI BibTeX RDF
54	Martin Sauerhoff	Lower Bounds for Randomized Read-k-Times Branching Programs (Extended Abstract).	STACS	1998	DBLP DOI BibTeX RDF
54	Yen-Jen Oyang	Exploiting multi-way branching to boost superscalar processor performance.	ACM SIGPLAN Notices	1991	DBLP DOI BibTeX RDF
54	Christoph Meinel	Restricted Branching Programs and Their Computational Power.	MFCS	1990	DBLP DOI BibTeX RDF
53	Philipp Woelfel	On the Complexity of Integer Multiplication in Branching Programs with Multiple Tests and in Read-Once Branching Programs with Limited Nondeterminism.	CCC	2002	DBLP DOI BibTeX RDF	Lower Bounds, BDDs, Nondeterminism, Branching Programs, Integer Multiplication
53	Edmund M. Clarke, I. A. Draghicescu	Expressibility results for linear-time and branching-time logics.	REX Workshop	1988	DBLP DOI BibTeX RDF	linear-time logic, temporal logic, fairness, computation tree logics, branching-time logic
48	Vladimir V. Rybakov	Branching Time Logics BTLU, SN, N-1(Z)a with Operations Until and Since Based on Bundles of Integer Numbers, Logical Consecutions, Deciding Algorithms.	Theory Comput. Syst.	2008	DBLP DOI BibTeX RDF	Logical consecutions, Admissible consecutions, Algorithms, Temporal logic, Decidability, Inference rules, Linear temporal logic, Branching time logic
48	Sagar Chaki, Edmund M. Clarke, Orna Grumberg, Joël Ouaknine, Natasha Sharygina, Tayssir Touili, Helmut Veith	State/Event Software Verification for Branching-Time Specifications.	IFM	2005	DBLP DOI BibTeX RDF	Concurrent Software Model Checking, State/Event-based Verification, Branching-time Temporal Logic, Automated Abstraction Refinement
48	Martin Sauerhoff	Randomized Branching Programs.	SAGA	2001	DBLP DOI BibTeX RDF	Randomized branching program, read-k-times, linear-length, lower bounds, randomness, nondeterminism, OBDD
48	Beate Bollig, Philipp Woelfel	A read-once branching program lower bound of Omega(2n/4) for integer multiplication using universal.	STOC	2001	DBLP DOI BibTeX RDF	read-once branching programs, computational complexity, lower bounds, integer multiplication
47	James Ostrowski, Jeff T. Linderoth, Fabrizio Rossi, Stefano Smriglio	Constraint Orbital Branching.	IPCO	2008	DBLP DOI BibTeX RDF
47	Samy Abbes, Albert Benveniste	Branching Cells as Local States for Event Structures and Nets: Probabilistic Applications.	FoSSaCS	2005	DBLP DOI BibTeX RDF
47	Bian Runqiang, Yi-Ping Phoebe Chen, Kevin Burrage, Jim Hanan, Peter Room, John Belward	Derivation of L-system Models from Measurements of Biological Branching Structures Using Genetic Algorithms.	IEA/AIE	2002	DBLP DOI BibTeX RDF
47	Beate Bollig	Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication.	MFCS	2000	DBLP DOI BibTeX RDF
47	Martin Sauerhoff	On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions.	STACS	1999	DBLP DOI BibTeX RDF
47	Michaela Huhn, Peter Niebert	Towards Automata for Branching Time and Partial Order.	CONCUR	1996	DBLP DOI BibTeX RDF
47	Philippe Schnoebelen, Sophie Pinchinat	On the Weak Adequacy of Branching-Time Remporal Logic.	ESOP	1990	DBLP DOI BibTeX RDF
47	Ingo Wegener	On the Complexity of Branching Programs and Decision Trees for Clique Functions.	TAPSOFT, Vol.1	1987	DBLP DOI BibTeX RDF
44	David Meyers, Shelley Skinner, Kenneth R. Sloan	Surfaces from Contours.	ACM Trans. Graph.	1992	DBLP DOI BibTeX RDF	branching problem, branching surfaces, meshes, surface reconstruction, minimum spanning tree, tiling, surface fitting, correspondence problem
43	Antonio Badia, Stijn Vansummeren	Non-linear prefixes in query languages.	PODS	2007	DBLP DOI BibTeX RDF	non-linear prefixes, branching, generalized quantifiers, cumulation
43	Christian Maihöfer	Bandwidth Analysis and Simulation of Reliable Multicast Transport Protocols.	Telecommun. Syst.	2003	DBLP DOI BibTeX RDF	bandwidth analysis, branching factor, scope overlapping, reliable multicast
42	Ilan Newman	Testing of Functions that have small width Branching Programs.	FOCS	2000	DBLP DOI BibTeX RDF	small width branching programs, combinatorial property testing, read-once branching programs, computational complexity, probability, probability, Boolean functions, Boolean functions, randomized algorithm, directed graphs, regular languages, randomised algorithms, decision problems, query complexity
42	Ingo Wegener	The Size of Reduced OBDD's and Optimal Read-Once Branching Programs for Almost All Boolean Functions.	IEEE Trans. Computers	1994	DBLP DOI BibTeX RDF	optimal read-once branching programs, minimal read-once branching program size, reduction rules, size complexity, computational complexity, Boolean functions, Boolean functions, directed graphs, programming theory, ordered binary-decision diagrams, variable ordering
42	Rakesh K. Sinha, Jayram S. Thathachar	Efficient Oblivious Branching Programs for Threshold Functions	FOCS	1994	DBLP DOI BibTeX RDF	oblivious branching programs, rectifier-switching network, upper bound, branching programs, threshold functions, threshold function
42	Anbulagan, John Thornton 0001, Abdul Sattar 0001	Dynamic Variable Filtering for Hard Random 3-SAT Problems.	Australian Conference on Artificial Intelligence	2003	DBLP DOI BibTeX RDF	Search, Constraints, Problem Solving
41	Kailash Jha	Reconstruction of Branching Surface and Its Smoothness by Reversible Catmull-Clark Subdivision.	ICCS (2)	2009	DBLP DOI BibTeX RDF	branching surface, incompatible curves, reconstruction, Catmull-Clark subdivision
41	Kristoffer Arnsfelt Hansen	Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size.	CCC	2008	DBLP DOI BibTeX RDF	Constant Width, Circuits, Planarity, Branching Programs
41	Yannis Argyropoulos, Kostas Stergiou 0001	A Study of SAT-Based Branching Heuristics for the CSP.	SETN	2008	DBLP DOI BibTeX RDF	Branching Heuristics, CSP, SAT
41	Farid M. Ablayev	The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach.	SAGA	2005	DBLP DOI BibTeX RDF	quantum computations, Branching programs, communication computations
41	Bernard Berthomieu, François Vernadat 0001	State Class Constructions for Branching Analysis of Time Petri Nets.	TACAS	2003	DBLP DOI BibTeX RDF	state classes, branching time temporal properties, real-time systems modeling and verification, model-checking, bisimulation, Time Petri nets
41	Alexander Bolotov, Clare Dixon	Resolution for Branching Time Temporal Logics: Applying the Temporal Resolution Rule.	TIME	2000	DBLP DOI BibTeX RDF	loop detection algorithm, temporal logics, resolution, automated deduction, branching-time
41	Alexander Bolotov, Michael Fisher 0001	A Resolution Method For CTL Branching-Time Temporal Logic.	TIME	1997	DBLP DOI BibTeX RDF	resolution method, CTL branching-time temporal logic, clausal resolution method, extended CTL, fairness operators, step resolution, temporal resolution rule, linear-time temporal resolution, temporal logic, completeness, normal form, linear temporal logic, computation tree logic, CTL*
41	Rocco De Nicola, Frits W. Vaandrager	Three Logics for Branching Bisimulation.	J. ACM	1995	DBLP DOI BibTeX RDF	Hennessy-Milner logic, backward modalities, branching bisimulation equivalence, doubly labeled transition systems, stuttering equivalence, until operations, semantics, concurrency, reactive systems, labeled transition systems, Kripke structures, CTL*
40	Fedor V. Fomin, Serge Gaspers, Saket Saurabh 0001, Alexey A. Stepanov	On Two Techniques of Combining Branching and Treewidth.	Algorithmica	2009	DBLP DOI BibTeX RDF	Exact exponential time algorithms, #3-Coloring, #Minimum dominating set, Minimum maximal matching, k-Weighted vertex cover, NP hard problems, Treewidth, Parameterized algorithms
40	Tobias Achterberg, Timo Berthold	Hybrid Branching.	CPAIOR	2009	DBLP DOI BibTeX RDF
40	Ján Manuch, Murray Patterson, Arvind Gupta	On the Generalised Character Compatibility Problem for Non-branching Character Trees.	COCOON	2009	DBLP DOI BibTeX RDF
40	Patrick Peschlow, Peter Martini, Jason Liu 0001	Interval Branching.	PADS	2008	DBLP DOI BibTeX RDF
40	Gregory Z. Gutin, Igor Razgon, Eun Jung Kim 0002	Minimum Leaf Out-Branching Problems.	AAIM	2008	DBLP DOI BibTeX RDF
40	Sumit Nain, Moshe Y. Vardi	Branching vs. Linear Time: Semantical Perspective.	ATVA	2007	DBLP DOI BibTeX RDF
40	Orna Kupferman, Moshe Y. Vardi	Memoryful Branching-Time Logic.	LICS	2006	DBLP DOI BibTeX RDF
40	Elizaveta A. Okol'nishnikova	On Some Bounds on the Size of Branching Programs (A Survey).	SAGA	2005	DBLP DOI BibTeX RDF
40	Marco Ragni, Stefan Wölfl 0001	Branching Allen.	Spatial Cognition	2004	DBLP DOI BibTeX RDF
40	Panagiotis Manolios	A Compositional Theory of Refinement for Branching Time.	CHARME	2003	DBLP DOI BibTeX RDF
40	Yonatan Fridman, Stephen M. Pizer, Stephen R. Aylward, Elizabeth Bullitt	Segmenting 3D Branching Tubular Structures Using Cores.	MICCAI (2)	2003	DBLP DOI BibTeX RDF
40	Raghav Kaushik, Philip Bohannon, Jeffrey F. Naughton, Henry F. Korth	Covering indexes for branching path queries.	SIGMOD Conference	2002	DBLP DOI BibTeX RDF	XML
40	Farid M. Ablayev	Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs.	ICALP	1997	DBLP DOI BibTeX RDF
40	Chuchang Liu, Mehmet A. Orgun	BCTL: A Branching Clock Temporal Logic.	TIME	1997	DBLP DOI BibTeX RDF
40	Farid M. Ablayev, Marek Karpinski	On the Power of Randomized Branching Programs.	ICALP	1996	DBLP DOI BibTeX RDF
40	Didier Caucal	Branching Bisimulation for Context-free Processes.	FSTTCS	1992	DBLP DOI BibTeX RDF
36	Paul Beame, Michael E. Saks, Xiaodong Sun, Erik Vee	Time-space trade-off lower bounds for randomized computation of decision problems.	J. ACM	2003	DBLP DOI BibTeX RDF	element distinctness, Branching programs, quadratic forms, random-access machines
36	David K. Probst, Hon Fung Li	Using Partial-Order Semantics to Avoid the State Explosion Problem in Asynchronous Systems.	CAV	1990	DBLP DOI BibTeX RDF	delay-insensitive system, branching point, recurrence structure, behavior machine, behavior state, model checking, state explosion, partial-order semantics
35	Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh 0001	Better Algorithms and Bounds for Directed Maximum Leaf Problems.	FSTTCS	2007	DBLP DOI BibTeX RDF
35	Jorge J. G. Leandro, Roberto M. Cesar, Luciano da Fontoura Costa	Determining the branchings of 3D structures from respective 2D projections.	SIBGRAPI	2006	DBLP DOI BibTeX RDF
35	Hector Geffner	Search and Inference in AI Planning.	CP	2005	DBLP DOI BibTeX RDF
35	Boris Goldengorin, Gerard Sierksma, Marcel Turkensteen	Tolerance Based Algorithms for the ATSP.	WG	2004	DBLP DOI BibTeX RDF
35	Paul Beame, Erik Vee	Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems.	STOC	2002	DBLP DOI BibTeX RDF
35	Byeong Min, Gwan Choi	Verification Simulation Acceleration Using Code-Perturbation.	J. Electron. Test.	2000	DBLP DOI BibTeX RDF	code-perturbation, simulation, verification, coverage, fault
35	Rocco De Nicola, Ugo Montanari, Frits W. Vaandrager	Back and Forth Bisimulations.	CONCUR	1990	DBLP DOI BibTeX RDF
34	Farn Wang	Symbolic Branching Bisimulation-Checking of Dense-Time Systems in an Environment.	HSCC	2009	DBLP DOI BibTeX RDF	algorithms, model-checking, experiment, timed automata, TCTL, branching bisimulation
34	Maurice J. Jansen	Lower Bounds for Syntactically Multilinear Algebraic Branching Programs.	MFCS	2008	DBLP DOI BibTeX RDF	multilinear polynomials, algebraic branching programs, Computational complexity, lower bounds, arithmetical circuits
34	Alberto Zanardo	Quantification over Sets of Possible Worlds in Branching-Time Semantics.	Stud Logica	2006	DBLP DOI BibTeX RDF	temporal logics, branching time
34	Nikolaos C. Gabrielides, Alexandros I. Ginnis, Panagiotis D. Kaklis	Constructing smooth branching surfaces from cross sections.	Symposium on Solid and Physical Modeling	2006	DBLP DOI BibTeX RDF	G1 surfaces, branching surfaces, design, reconstruction, skinning, trimming, hole filling, cross sections, shape preserving interpolation
34	Michela Sabbadin, Alberto Zanardo	Topological Aspects of Branching-Time Semantics.	Stud Logica	2003	DBLP DOI BibTeX RDF	Semantics, Topology, Branching-Time
34	Ron van der Meyden, Ka-Shu Wong	Complete Axiomatizations for Reasoning about Knowledge and Branching Time.	Stud Logica	2003	DBLP DOI BibTeX RDF	perfect recall, multi-agent systems, temporal logic, modal logic, epistemic logic, synchrony, logic of knowledge, branching time
34	Andrew J. Mason	Elastic Constraint Branching, the Wedelin/Carmen Lagrangian Heuristic and Integer Programming for Personnel Scheduling.	Ann. Oper. Res.	2001	DBLP DOI BibTeX RDF	Lagrangian, Wedelin, constraint branching, integer programming, rostering, personnel scheduling
34	Miklós Ajtai	A Non-linear Time Lower Bound for Boolean Branching Programs.	FOCS	1999	DBLP DOI BibTeX RDF	Hankel matrix, lower bound, branching program
34	Pranav Ashar, Sharad Malik	Fast functional simulation using branching programs.	ICCAD	1995	DBLP DOI BibTeX RDF	compiled code simulation, cycle-based functional simulation, fast functional simulation, functional delay-independent logic simulation, levelized compiled-code, switch level functional simulation, synchronous digital systems, Boolean functions, system design, logic design, logic CAD, decision theory, circuit analysis computing, benchmark circuits, branching programs
34	Jacques Resing	Polling systems and multitype branching processes.	Queueing Syst. Theory Appl.	1993	DBLP DOI BibTeX RDF	ergodicity conditions, immigration, Polling systems, branching processes, queue length distribution
34	S. A. Grishechkin	Multiclass batch arrival retrial queues analyzed as branching processes with immigration.	Queueing Syst. Theory Appl.	1992	DBLP DOI BibTeX RDF	branching processes with immigration, queues, heavy traffic, overloaded, Retrial queues
34	Wolfgang Thomas	Computation tree logic and regular omega-languages.	REX Workshop	1988	DBLP DOI BibTeX RDF	Büchi automata, Rabin tree automata, noncounting property, group-free monoids, computation tree logic, Branching time logic
33	Jack Edmonds 0001	Branching Systems.	IWOCA	2009	DBLP DOI BibTeX RDF
33	Bo Zhang, Wei Wang 0011, Xiaoling Wang, Aoying Zhou	AB-Index: An Efficient Adaptive Index for Branching XML Queries.	DASFAA	2007	DBLP DOI BibTeX RDF
33	Matti Järvisalo, Tommi A. Junttila	Limitations of Restricted Branching in Clause Learning.	CP	2007	DBLP DOI BibTeX RDF
33	Véronique Cortier, Ralf Küsters, Bogdan Warinschi	A Cryptographic Model for Branching Time Security Properties - The Case of Contract Signing Protocols.	ESORICS	2007	DBLP DOI BibTeX RDF
33	Yung-Pin Cheng, Hong-Yi Wang, Yu-Ru Cheng	On-the-Fly Branching Bisimulation Minimization for Compositional Analysis.	CIAA	2006	DBLP DOI BibTeX RDF
33	Patrick Peschlow, Peter Martini	Towards an Efficient Branching Mechanism for Simultaneous Events in Distributed Simulation.	PADS	2006	DBLP DOI BibTeX RDF